A Generalized FAST TCP scheme

Authors:
Cao Yuan;Liansheng Tan;Lachlan L. H. Andrew;Wei Zhang;Moshe Zukerman
Affiliations:
Department of Computer Science, Central China Normal University, Wuhan 430079, PR China;Department of Computer Science, Central China Normal University, Wuhan 430079, PR China and The Research School of Information Sciences and Engineering, The Australian National University, Canberr ...;Department of Computer Science, California Institute of Technology(Caltech), Pasadena, CA 91125, USA;Department of Computer Science, Central China Normal University, Wuhan 430079, PR China;ARC Special Research Center for Ultra-Broadband Information Networks (CUBIN), Department of Electrical and Electronic Engineering, The University of Melbourne, Grattan Street, Melbourne, Vic. 3010 ...
Venue:
Computer Communications
Year:
2008

Citing 7
Cited 1

Data networks

Data networks
Congestion avoidance and control

SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Fair end-to-end window-based congestion control

IEEE/ACM Transactions on Networking (TON)
Understanding TCP Vegas: a duality model

Journal of the ACM (JACM)
Bandwidth sharing: objectives and algorithms

IEEE/ACM Transactions on Networking (TON)
Counter-intuitive throughput behaviors in networks under end-to-end control

IEEE/ACM Transactions on Networking (TON)
FAST TCP: motivation, architecture, algorithms, performance

IEEE/ACM Transactions on Networking (TON)

CODE TCP: A competitive delay-based TCP

Computer Communications

Quantified Score

Hi-index	0.24

Visualization

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 (@a,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.