A Generalized FAST TCP scheme

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review

14 Scopus Citations
View graph of relations

Author(s)

Detail(s)

Original languageEnglish
Pages (from-to)3242-3249
Journal / PublicationComputer Communications
Volume31
Issue number14
Publication statusPublished - 5 Sept 2008
Externally publishedYes

Abstract

FAST TCP has been shown to be promising in terms of system stability, throughput and fairness. However, it requires buffering which increases linearly with the number of flows bottlenecked at a link. This paper proposes a new TCP algorithm that extends FAST TCP to achieve (α, n)-proportional fairness in steady state, yielding buffer requirements which grow only as the nth power of the number of flows. We call the new algorithm Generalized FAST TCP. We prove stability for the case of a single bottleneck link with homogeneous sources in the absence of feedback delay. Simulation results verify that the new scheme is stable in the presence of feedback delay, and that its buffering requirements can be made to scale significantly better than standard FAST TCP. © 2008 Elsevier B.V. All rights reserved.

Research Area(s)

  • Congestion control, Fairness, FAST TCP, Scalability, Stability

Citation Format(s)

A Generalized FAST TCP scheme. / Yuan, Cao; Tan, Liansheng; Andrew, Lachlan L.H. et al.
In: Computer Communications, Vol. 31, No. 14, 05.09.2008, p. 3242-3249.

Research output: Journal Publications and ReviewsRGC 21 - Publication in refereed journalpeer-review