基于TCPVegas与TCPReno的一种改进拥塞控制算法_秦楠.pdfVIP

CN 4 3- 1258/ T P 2007 29 11 ISSN 1007- 130X COM P U T ER EN GIN EERIN G SCIEN CE Vo l1 29 , N o1 11, 2007 : 1007- 130X ( 2007 11- 0014- 0 3 * T CP V eg as T CP Reno A n Im proved Congest ion Contro l A lgorit hm Based on T CP V eg as and T CP Reno , QIN Nan, ZHENG Ying-ping (, 200092) (Department of Control Science an Engineering, Tongji University, Shanghai 200092, China) : 因特网的快速发展带来了信息量的急剧膨胀, 网络拥塞已经成为制约因特网发展的瓶颈在众 T CP 拥塞 控制算法中, T CP Veg as 表现出比其他算法更为优越的性能, 然而自1995 年提出至今, 仍然没有取代T CP Reno 成为现今 最广泛使用的T CP 拥塞控制算法有研究表明, 这是由于V eg as 在与Reno 共存的网络环境下不能公平地竞争到带宽, 因 此不能实质性地提高网络性能本文在分析V egas 与 Reno 如何在网络路由中占用带宽的基础上, 提出一种在两者兼容 环境下的拥塞控制方法, 根据不同瓶颈缓冲区容量合理选择aB 等参数, 实现了在V egas 与Reno 共存环境下两者良好的 兼容性, 并通过仿真实验证明了该算法的有效性和正确性 Abstract: Since t he r apid develo pment of the Inter net bring s the quick ex pansion of infor mation , so netw o rk co ng est ion has beco me a bo ttleneck. Despite the super io rit y of T CP V eg as w hich w as pr oposed in 1995 ov er the other T CP co ng est ion co nt rol alg o rithm s, V eg as is still no t t he most w idely u sed one instead of T CP Reno. Research show s it is due to V eg as. in- capability of seizing bandw idth f airly in heter og eneo us netw o rk enviro nments, so the o vera ll perfo rmance can no t be im- pro ved essentially . In this paper , w e analy ze ho w V egas and Reno seize bandw idth and pr opose an impro ved cong estion co n- t rol algo rithm in the env ir onment w here Reno and V egas coex ist . By pro per ly selecting parameter s a and B based o n diff erent bo ttleneck buff er sizes, w e show t he go od