首页> 外文会议>International symposium on multispectral image processing and pattern recognition;MIPPR 2011 >Fair and efficient network congestion control based on minority game
【24h】

Fair and efficient network congestion control based on minority game

机译:基于少数博弈的公平高效的网络拥塞控制

获取原文

摘要

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.
机译:低链路效用,RTT不公平和多Bottleneck网络的不公平是目前网络拥塞控制算法普遍存在的问题。通过将网络拥塞控制与“ El Farol Bar”问题进行类比,建立了基于少数博弈(MG)的拥塞控制模型,然后提出了一种基于该模型的新型网络拥塞控制算法。仿真结果表明,该算法可以使链路效用接近100%,丢包率为零,队列大小较小。此外,可以解决RTT不公平性和Multi-Bottleneck网络的不公平性,在Multi-Bottleneck网络中实现最大最小公平,同时有效减弱整体同步引起的“乒乓”振荡。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号