Journal article

A generalized FAST TCP scheme

Cao Yuan, Liansheng Tan, Lachlan LH Andrew, Wei Zhang, Moshe Zukerman

COMPUTER COMMUNICATIONS | ELSEVIER SCIENCE BV | Published : 2008

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 c..

View full abstract

Grants

Awarded by Chinese Ministry of Education


Funding Acknowledgements

This research is partially supported by the Program NCET-050673, the key Project (No. 108166) from Chinese Ministry of Education and partially by the Australian Research Council (ARC).