An improved unilateral acceleration FAST TCP fairness based on history flows information

It is open problem for the FAST TCP to estimate the true propagation delay. Aiming at the open problem, according to application characteristic of unilateral accelerated FAST TCP system, a novel two layers algorithm of the transport layer is proposed. In down layer, the history information of the active FAST TCP flows, such as the start-up time and the running time of FAST TCP flows, are gathered. When a new FAST TCP flow arrives, 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 down layer FAST TCP algorithm estimate the accurate propagation delay based on the current round trip delay minus the queuing delay provided by the upper algorithm. Finally, the NS-2 simulation results validate the effectiveness of this improved two layers algorithm.

[1]  Andrés Suárez-González,et al.  Achieving fair network equilibria with delay-based congestion control algorithms , 2008, IEEE Communications Letters.

[2]  Lachlan L. H. Andrew,et al.  Improving the fairness of FAST TCP to new flows , 2006, IEEE Communications Letters.

[3]  Xu Su-lei Parameter γ tuning for stability of FAST TCP , 2010 .

[4]  Cheng Jin,et al.  FAST TCP: Motivation, Architecture, Algorithms, Performance , 2006, IEEE/ACM Transactions on Networking.

[5]  S.H. Low,et al.  Global Exponential Stability of FAST TCP , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[6]  Jin Soo Lee,et al.  Two Different Models of FAST TCP and Their Stable and Efficient Modification , 2007, NET-COOP.