23 November 2011 Fair and efficient network congestion control based on minority game
Author Affiliations +
Proceedings Volume 8006, MIPPR 2011: Remote Sensing Image Processing, Geographic Information Systems, and Other Applications; 80062R (2011) https://doi.org/10.1117/12.911896
Event: Seventh International Symposium on Multispectral Image Processing and Pattern Recognition (MIPPR2011), 2011, Guilin, China
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. Through the analogy of network congestion control with the "El Farol Bar" problem, we establish a congestion control model based on minority game(MG), and then present a novel network congestion control algorithm based on the model. The result of simulations indicates that the proposed algorithm can make the achievements of link utility closing to 100%, zero packet lose rate, and small of queue size. Besides, the RTT unfairness and the unfairness of Multi-Bottleneck network can be solved, to achieve the max-min fairness in Multi-Bottleneck network, while efficiently weaken the "ping-pong" oscillation caused by the overall synchronization.
© (2011) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Zuxi Wang, Wen Wang, Hanping Hu, Zhaozhang Deng, "Fair and efficient network congestion control based on minority game", Proc. SPIE 8006, MIPPR 2011: Remote Sensing Image Processing, Geographic Information Systems, and Other Applications, 80062R (23 November 2011); doi: 10.1117/12.911896; https://doi.org/10.1117/12.911896
PROCEEDINGS
7 PAGES


SHARE
Back to Top