Editing FAST TCP (section)

==Generalized FAST TCP==
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. The paper <ref>{{cite journal|last1=Yuan|first1=Cao|last2=Tan|first2=Liansheng|last3=Andrew|first3=Lachlan L.H.|last4=Zhang|first4=Wei|last5=Zukerman|first5=Moshe|title=A Generalized FAST TCP scheme|journal=Computer Communications|date=2008|volume=31|issue=14|pages=3242–3249|doi=10.1016/j.comcom.2008.05.028|hdl=1959.3/44051|hdl-access=free}}</ref>
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. The authors call
the new algorithm Generalized FAST TCP. They 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.