Heuristic TCP protocol gained from experimental evaluation of CUBIC, HSTCP, H-TCP, Africa, Compound TCP.

Algorithm Design Goals:

  • Network capacity should be exploited efficiently. This is the most obvious goal, which can be achieved by modifying the congestion window update rules; YeAH-TCP can exploit anyone of the increment rules of other proposals (e.g. STCP, H-TCP, etc.).
  • The stress induced to the network should be less or equal than that induced by Reno TCP.
  • TCP friendliness with Reno traffic. A "politically" acceptable algorithm should be able to compete fairly with Reno flows, avoiding starvation of competing flows, and simultaneously exploiting the link capacity.
  • The algorithm should be internally and RTT fair.
  • Performance should not be substantially impaired by non-congestion related (random) packet loss events; random packet loss cannot be ruled out even in case of high speed optical backbones. Reasonable values of this loss depend on the technological context, but we verify that even a loss rate in the order of 10^-7 can give rise to sensitive performance degradation.
  • Small link buffers should not prevent high performance. It is not feasible to design buffer size equal to the bandwidth-delay product in high BDP links as required by standard Reno congestion control. This goal can be achieved by adopting a decrease policy in case of packet loss similar to the Westwood algorithm.

YeAH-TCP has two different operating modes, "Fast" and "Slow", like Africa TCP. During the "Fast" mode, YeAH-TCP increments the congestion window according to an aggressive rule (e.g. STCP rule). The state is decided according to the estimated number of packets in the bottleneck queue (inferred from the measured RTTs).


  • YeAH-TCP: Yet Another Highspeed TCP, A. Baiocchi, A. Castellani, F. Vacirca, PFLDnet 2007, Feb. 2007 (PDF)

-- ChrisWelti - 26 Feb 2007

Edit | Attach | Watch | Print version | History: r4 < r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r4 - 2007-02-27 - ChrisWelti
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2004-2009 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.