基于局域信息少数者博弈的拥塞控制算法

doi:10.3969/j.issn.1000-436x.2014.01.017

通信学报 ›› 2014, Vol. 35 ›› Issue (1): 148-155.doi: 10.3969/j.issn.1000-436x.2014.01.017

基于局域信息少数者博弈的拥塞控制算法

王祖喜,邓昭彰,李力

华中科技大学自动化学院多谱信息处理技术国家重点实验室，湖北武汉 430074

出版日期:2014-01-25 发布日期:2017-06-17
基金资助:
国家自然科学基金资助项目;湖北省自然科学基金资助项目;湖北省自然科学基金资助项目

Fair and efficient network congestion control algorithm based on minority game with local information

Zu-xi WANG,Zhao-zhang DENG,Li LI

National Key Laboratory of Science and Technology on Multispectral Information Processing,School of Automation,Huazhong University of Science ＆ Technology ,Wuhan 430074,China

Online:2014-01-25 Published:2017-06-17
Supported by:
The National Natural Science Foundation of China

摘要/Abstract

摘要：

针对目前已有的拥塞控制算法普遍存在资源利用率低下、RTT不公平和多瓶颈链路不公平等问题，分析了网络拥塞控制中的博弈现象，考虑网络局域信息在拥塞控制过程中的影响，建立了一种基于局域信息少数者博弈的拥塞控制模型，提出并实现了一种基于局域信息少数者博弈的拥塞控制算法。仿真实验表明，该算法在保证瓶颈链路资源利用率的同时，有效地解决了异构RTT流的不公平性问题，实现了多瓶颈链路下的最大最小公平性。

关键词: 拥塞控制, 局域信息, 少数者博弈

Abstract:

Low link utility,RTT unfairness and unfairness of Multi-Bottleneck network are the existing problems in the present network congestion control algorithms at large.Considering the local information of network,a congestion control model based on minority game (MG) with local information was proposed to solve these problems.Based on the model,a congestion control algorithm was designed.The result of simulation indicates that the proposed algorithm has good performance on link utilization and fairness of RTT flow in multi-bottleneck network.

Key words: congestion control, local information, minority game

王祖喜,邓昭彰,李力. 基于局域信息少数者博弈的拥塞控制算法[J]. 通信学报, 2014, 35(1): 148-155.

Zu-xi WANG,Zhao-zhang DENG,Li LI. Fair and efficient network congestion control algorithm based on minority game with local information[J]. Journal on Communications, 2014, 35(1): 148-155.

图/表 7

图1

图2

图3

图5

图4

图6

图7

参考文献 14

[1]	SUBRAMANI B , CHANDRA D E . A survey on congestion control[J]. Global Journal of Computer Science and Technology, 2010,9(5): 82-87.
[2]	LAKSHMAN T , MADHOW U . The performance of TCP/IP for networks with high bandwidth-delay products and random loss[J]. IEEE/ACM Transactions on Networking, 1997,5(3): 336-350.
[3]	武航星, 慕德俊, 龚贤武 . TCP的RTT不公平性问题模型分析与仿真[J]. 计算机仿真, 2008,25(9): 159-162. WU H X , MU D J , GONG X W . Analysis and simulation of RTT unfairness of TCP[J]. Computer Simulation, 2008,25(9): 159-162.
[4]	FLOYD S . High-speed TCP for large congestion windows[EB/OL]. .
[5]	KELLY T . Scalable TCP:improving performance in high-speed wide area networks[J]. ACM SIGCOMM Computer Communication Review, 2003,33(2): 83-91.
[6]	LEITH D , SHORTEN R . H-TCP protocol for high-speed long-distance networks[A]. Proceedings of the 2nd Workshop on Protocols for Fast Long Distance Networks[C]. Argonne IL,USA, 2004. 1-16.
[7]	JIN C , WEI D , LOW S . FAST TCP:motivation,architecture,algorithms,performance[J]. Proceedings of INFOCOM, 2004,4: 2490-2501.
[8]	ZHANG Y , KANG S R , LOGUINOV D . Delayed stability and performance of distributed congestion control[J]. ACM SIGCOMM, 2004,34(4): 307-318.
[9]	KATABI D , HANDLEY M , ROHRS C . Congestion control for high bandwidth-delay product networks[J]. ACM SIGCOMM, 2002,32(4): 89-102.
[10]	XIA Y , SUBRAMANIAN L , STOICA I ,et al. One more bit is enough[J]. Proceedings of ACM Transactions, 2005,16(6): 1281-1294.
[11]	CHALLET D , ZHANG Y C . Emergence of cooperation and organization in an evolutionary game[J]. Physica A:Statistical Mechanics and its Applications, 1997,246(3-4): 148-407
[12]	KUTSUNA H , TAGASHIRA S , FUJITA S . A fair and efficient congestion control scheme based on minority game[A]. Proc of the 14th IEEE International Conference on Networks[C]. 2006. 98-103.
[13]	KALINOWSKI T , SCHULTZ H J , BRISES M .Cooperation in the minority game with local information[J]. Physica A:Statistical Mechanics and its Applications, 2000,277(3-4): 502-508.
[14]	MISRA V , GONG W B , TOWSLEY D . A fluid-based analysis of a network of AQM routers supporting TCP flows with an application to RED[J]. Computer Communication Review, 2000,30: 151-160.

[1]	王竹,袁青云,郝凡凡,房梁,李凤华. 基于链路容量的多路径拥塞控制算法[J]. 通信学报, 2020, 41(5): 59-71.
[2]	谭国真,韩国栋,张福新,丁男,刘明剑. 基于网络效用最大化理论的分布式车联网拥塞控制策略[J]. 通信学报, 2019, 40(2): 82-91.
[3]	丁男,林滔,宋彩霞,谭国真. 面向车联网按需驱动的多宿主多链路TCP拥塞控制算法[J]. 通信学报, 2016, 37(7): 96-106.
[4]	刘明剑,谭国真,李帅兵,丁男,宋彩霞. 基于信道拥塞代价计算的车联网自适应消息发送速率控制方法[J]. 通信学报, 2016, 37(10): 108-116.
[5]	燕洪成,张庆君,孙勇. 空间延迟/中断容忍网络拥塞控制策略研究[J]. 通信学报, 2016, 37(1): 142-150.
[6]	夏奕,邓广宏. DTN分发网络中基于数据投递概率的拥塞控制机制[J]. 通信学报, 2015, 36(Z1): 22-39.
[7]	朱更明,王志强,李哲涛,李仁发. 信道公平分配的局部拥塞控制算法[J]. 通信学报, 2015, 36(4): 9-18.
[8]	刘彬,孙雅静,刘浩然,尹荣荣. 基于局域信息和能量因素的WSN关键点判定算法[J]. 通信学报, 2015, 36(10): 9-16.
[9]	田波,杨宜民,蔡述庭. 基于半马尔科夫决策过程的视频传输拥塞控制算法[J]. 通信学报, 2014, 35(8): 154-161.
[10]	田波，杨宜民，蔡述庭. 基于半马尔科夫决策过程的视频传输拥塞控制算法[J]. 通信学报, 2014, 35(8): 19-161.
[11]	孙健,李宏智,郭灵波,陈升来. VANET中一种安全消息拥塞控制机制[J]. 通信学报, 2014, 35(5): 134-140.
[12]	孙健，李宏智，郭灵波，陈升来. VANET中一种安全消息拥塞控制机制[J]. 通信学报, 2014, 35(5): 18-140.
[13]	王国栋1,2，任勇毛1，李俊1. TCP改进协议在高速长距离网络中的性能研究[J]. 通信学报, 2014, 35(4): 10-90.
[14]	王国栋,任勇毛,李俊. TCP改进协议在高速长距离网络中的性能研究[J]. 通信学报, 2014, 35(4): 81-90.
[15]	邓罡，龚正虎，王宏，陈琳，刘志宏. 现代数据中心网络资源管理技术分析与综述[J]. 通信学报, 2014, 35(2): 21-181.

基于局域信息少数者博弈的拥塞控制算法

Fair and efficient network congestion control algorithm based on minority game with local information

在线阅读

PDF下载

可视化

被引次数

摘要/Abstract

引用本文

使用本文

图/表 7

参考文献 14

相关文章 15

Metrics

推荐阅读 0