EHSTCP：改进的高速TCP算法  

EHSTCP:Enhanced TCP in High-Speed Networks

作　　者：龙承念[1] 杨会龙[1] 李欣[1] 关新平[1] 

机构地区：[1]燕山大学电气工程学院网络控制与生物信息研究中心,上海交通大学电子信息与电气工程学院自动化系,河北秦皇岛066004,上海200240

出　　处：《计算机学报》2008年第3期440-449,共10页Chinese Journal of Computers

基　　金：国家杰出青年基金(60525303);国家自然科学基金(60404022);河北省自然科学基金(F2005000390,F2006000270)资助

摘　　要：TCP在高带宽时延积网络中不能获得良好的性能,主要表现为低的吞吐量和大的窗口震荡.HSTCP算法解决了传统TCP算法在高带宽时延积网络下的性能瓶颈,但HSTCP在拥塞点时会产生大量的数据包丢失,同时当队列管理为去尾算法时,存在着严重的RTT不公平性问题.针对HSTCP算法的性能缺陷,该文提出一种在拥塞避免阶段进行拥塞避免模式切换的改进算法,称为EHSTCP.基于拥塞窗口历史值的端到端可用带宽预测方法,利用拥塞窗口历史信息来判断拥塞避免切换点.同时引入RTT公平因子,消除了HSTCP的RTT不公平性问题.NS2仿真实验验证了算法的有效性.TCP doesn＇t perform well in high bandwidth-delay product networks, and its main limitations are low throughput and large oscillation of congestion window. HSTCP solves the primary limitations of regular TCP, but there exists large number of packet loss upon congestion epoch and serious RTT unfairness with drop-tail gateway. To overcome the above deficiency, this paper proposes an improved algorithm, called EHSTCP, which switches between two congestion avoidance modes in congestion avoidance phase. To locate the switch point, this paper presents a new prediction method for end-to-end available bandwidth using history congestion window dynamics. Simultaneously, it introduces the RTT fairness factor to eliminate the serious RTT unfairness in HSTCP. NS2 simulation results validate the effectiveness of the proposed scheme.

关 键 词：HSTCP 拥塞控制 TCP 包丢失 RTT不公平性 

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