CB-HSTCP:高速网络中的公平TCP算法  

CB-HSTCP:Fair TCP in High-speed Network

作　　者：苏凡军[1] 潘雪增[1] 蔡亮[1] 徐建[2] 

机构地区：[1]浙江大学计算机学院,浙江杭州310027 [2]杭州电子科技大学计算机学院,浙江杭州310027

出　　处：《电子学报》2005年第11期2084-2089,共6页Acta Electronica Sinica

基　　金：浙江省重点研究项目(No.2005C21002)

摘　　要：通过实验发现HSTCP存在严重的RTT(Round Trip Time)不公平性,另外发现拥塞时存在大量的包丢失.用模型对RTT不公平现象进行了分析,并分析了包丢失问题.提出了CB-HSTCP算法,包括CW机制和Block-pacing机制,用于改善公平性和降低包丢失率.为衡量算法性能,提出了一个相对公平性标准.通过分析并使用ns2进行模拟实验,证实该方案在保证HSTCP性能的基础上,解决了RTT不公平性问题、降低了包丢失率,同时具有良好的扩展性和TCP友好性.Through experiments, it is found that HSTCP has severe RTr unfairness, as well as many dropped packets in a congestion event. After analyzing the RTr unfairness in HSTCP with a model and the reason of packet loss,we propose CB-HSTCP that includes CW and Block-pacing algorithm to alleviate RTr unfairness and reduce the number of lost packets. To evaluate the performance of proposed algorithm, a relative fair criterion is proposed. Simulation results with ns2 show that our new proposal can solve the RTF unfair problem, reduce packets loss rate meanwhile keeping advantages of HSTCP such as good scalability and TCP friendliness.

关 键 词：高速网络 TCP HSTCP 拥塞控制 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]