基于历史流量的单向FAST TCP公平性改进算法研究  

Research on the Improved Unilateral Acceleration FAST TCP Fairness Algorithm Based on Historic Flow Information

作　　者：陈常晖[1] 曾凌静[1] CHEN Changhui;ZENG Lingjing(Information Engineering Department ,Fujian Chuanzheng Communications College ,Fuzhou 350007,China)

机构地区：[1]福建船政交通职业学院信息工程系

出　　处：《软件工程》2019年第7期19-21,共3页Software Engineering

摘　　要：FASTTCP传输延时的估计是一个有待解决的问题.针对这些开放性问题,根据FASTTCP的单向加速应用特点,本文提出了一种新的传输层两层算法.一个活动的FASTTCP流的历史信息,如启动时间、运行时间等,在底层被记录下来.当新的FASTTCP流到达时,上层算法可以根据最早的FASTTCP流提供瓶颈链路的当前队列延时.传播延时的计算是以当前估测的最小往返延时与传播延时之差作为瓶颈链路的排队延时.最后,NS-2仿真结果验证了改进的两层算法的有效性.It is an open problem for the FAST TCP to estimate the true propagation delay.Aiming at these open problems,according to unilateral accelerated application characteristic of FAST TCP,a new two-layer algorithm is proposed. In the lower layer,the history information of the active FAST TCP flows,such as the startup time and the running time etc.,are recorded.When new FAST TCP flows arrive,the upper layer algorithm can provide the current queue delay of the bottleneck link based on the earliest FAST TCP flow.For the first time in the calculation propagation delay,the lower layer FAST TCP algorithm estimates the accurate propagation delay based on the current round trip delay minus the queuing delay provided through the upper algorithm.Finally,the NS-2 simulation results verify the effectiveness of this improved two-layer algorithm.

关 键 词：FASTTCP 传播延时 公平 历史流量信息 

分 类 号：TP339[自动化与计算机技术—计算机系统结构]