期刊文献+

VCP协议最大最小公平带宽分配的实现与仿真

Improving VCP to Achieve Max-Min Fair Bandwidth Allocation
下载PDF
导出
摘要 变结构控制协议(VCP)是一种高带宽时延乘积网络环境下良好的拥塞控制机制。然而在多瓶颈网络拓扑中,由于VCP采用基于负载因子编码的反馈控制机制,长距离数据流的过载响应受传输路径上多个节点的控制,从而系统达不到最大最小公平。通过分析VCP的拥塞信息反馈方式,提出一种基于过载周期的反馈控制机制,使每个数据流的过载响应只受其瓶颈链路的控制,从而使系统达到最大最小公平。最后利用NS2仿真实验验证了基于过载周期的反馈控制机制的有效性。 Variable-structure congestion Control Protocol(VCP) is an effective congestion control mechanism for high Bandwidth-Delay Product(BDP) networks.In the multiple bottleneck network,however,the congestion signal of VCP is feedback based on encoded load factor;as a result,the overload responses of long flows are controlled by multiple routers in the transmit path,and failed to achieve max-min fairness.To address this problem,the congestion signal is feedback based on a new metric called overload period in each router,and the overload response of every flow is controlled by the router with minimum overload period.The proposed mechanism improves VCP to achieve max-min fair bandwidth allocation.Finally,the improved control mechanism is validated using NS2 simulations.
出处 《系统仿真学报》 CAS CSCD 北大核心 2010年第7期1716-1719,1723,共5页 Journal of System Simulation
关键词 高带宽时延网络 拥塞控制 变结构控制协议 多瓶颈网络 最大最小公平 high bandwidth delay product networks congestion control variable-structure congestion control protocol multiple bottleneck network max-min fairness
  • 相关文献

参考文献9

  • 1Katabi D, Handley M, Rohrs C. Congestion Control for High Bandwidth Delay Product Networks [C]// Proceeding of ACM SIGCOMM'02. New York, USA: ACM Press, 2002: 89-102.
  • 2Lestas M, Pitsillides A, Ioannou P, et al. Adaptive Congestion Protocol: A Congestion Control Protocol with Learning Capability [J]. Computer Networks (S1389-1286), 2007, 51(13): 3773-3798.
  • 3Dukkipati N, Kobayashi M, Zhang-Shen R, McKeown N. Processor Sharing Flows in the lnternet [C]// Proceeding of International Workshop on Quality of Service. Berlin, Germany: Springer-Verlag Berlin Heidelberg, 2005:271-285.
  • 4Misra V, Gong W, Towsley D. Fluid-based Analysis of a Network of AQM Routers Supporting TCP flows wit h an Application to RED [J] ACM Computer Communication Review (S0146-4833), 2000, 30(4): 151-160.
  • 5Xia Y, Subramanian L, Stoica I, Kalyanaraman S. One More Bit is Enough [C]/ Proceeding of ACM SIGCOMM'05. New York, USA: ACM Press, 2005: 37-48.
  • 6Zhang H, Dai G, Yao L, et al. Fast Convergence of VCP with Explicit Precise Feedback [C]// Proceeding of Frontier Algorithms Workshop 2008. Berlin, Germany: Springer-Verlag Berlin Heidelberg, 2008: 264-275.
  • 7Bertsekas D, Gallager R. Data Networks [M]. USA: Prentice Hall Inc., 1993.
  • 8McCanne S and Floyd S. The network simulator ns-2.30 [Z/OL]. (2006) [2009]. http://www.isi.edu/nsnam/ns.
  • 9Low SH, Andrew LLH, Wydrowski BP. Understanding XCP: Equilibrium and Fairness [C]// Proceeding of IEEE INFOCOM, Miami, FL, USA, 2005. USA: IEEE, 2005: 1025-1036.

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部