Oscillations of the Sending Window in Compound TCP
- 385 Downloads
One of the key ideas of Compound TCP is to quickly increase the sending window, until full link utilization is detected, and then to keep it constant for a certain period of time. The actual Compound TCP algorithm does not hold the window constant but, instead, it makes it oscillate around the desired value. Using an analytical model and ns-2 simulations we study these oscillations on a Linux implementation of Compound TCP, in the case of a single connection with no cross traffic. Even in this simple case we show how these oscillations can behave in different ways depending on the bandwidth delay product. We also show how it is important to take into account, in the analytical model, that some implementation subtleties may introduce non-negligible differences in the behavior of the protocol.
Unable to display preview. Download preview PDF.
- 1.Andrew, L.: Compound TCP Linux module (April 2008), http://netlab.caltech.edu/lachlan/ctcp/
- 2.Baiocchi, A., Castellani, A., Vacirca, F.: YeAH-TCP: Yet Another Highspeed TCP. In: Proc. 5th Int. Workshop on Protocols for FAST Long-Distance Networks (March 2007)Google Scholar
- 3.Li, Y.-T.: Evaluation of TCP congestion control algorithms on the Windows Vista platform. Technical Report SLAC-TN-06-005, Stanford Linear Accelerator Center (June 2005)Google Scholar
- 4.McCanne, S., Floyd, S., et al.: ns network simulator, http://www.isi.edu/nsnam/ns/
- 5.Tan, K., Song, J., Zhang, Q., Sridharan, M.: A compound tcp approach for high-speed and long distance networks. In: INFOCOM 2006. Proc. 25th IEEE Int. Conf. on Computer Communications (2006)Google Scholar