A Generalized FAST TCP Scheme
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...[Show more]
|Collections||ANU Research Publications|
|01_Yuan_A_Generalized_FAST_TCP_S_2008.pdf||786.95 kB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.