Search Swinburne Research Bank
Please use this identifier to cite or link to this item: http://hdl.handle.net/1959.3/44051
|Download PDF (Author's final draft) (Adobe Acrobat PDF, -1 bytes)|
- A generalized FAST TCP scheme
- Yuan, Cao; Tan, Liansheng; Andrew, Lachlan L. H.; Zhang, Wei; Zukerman, Moshe
- 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.
- Publication type
- Journal article
- Computer Communications, Vol. 31, no. 14 (Sep 2008), pp. 3242-3249
- Publication year
- Bottleneck link; Buffer requirements; Buffering requirements; Congestion control; Control theory; Fairness; FAST TCP; Feedback; Feedback delays; Fire fighting equipment; New algorithm; Proportional fairness; Scalability; Simulation results; Stability; Standards; Steady states; System stability; Transmission control protocol
- Publisher URL
- Copyright © 2008 Elsevier B.V. All rights reserved. Paper reproduced here in accordance with the copyright policy of the publisher.
- Additional information
- This research is partially supported by the Program NCET-05-0673, the key Project (No. 108166) from Chinese Ministry of Education and partially by the Australian Research Council (ARC).
- Full text
- Peer reviewed