Stationarity of some processes in transport protocols

ABSTRACT

This note establishes stationarity of a number of stochastic processes of interest in the study of Transport Protocols. For many of the processes studied in this note stationarity had been established before, but for one class the result is new. For that class, it was counterintuitive that stationarity was hard to prove. This note also explains why that class offered such stiff resistance.The stationarity is proven using Liapunov functions, without first proving tightness by proving boundedness of moments. After the 2006 MAMA workshop simple conditions for existence of such moments were obtained and were added to this note.

REFERENCES

• 1: Ott, T. J., Kemperman, J. H. B. and Mathis, M. (2004) The stationary behavior of ideal TCP congestion avoidance, revisited. Draft.
• 2: Ott, T. J., Kemperman, J. H. B., and Mathis, M. (1996) The stationary behavior of ideal TCP congestion avoidance. Available at www.teunisott.com/Papers.
• 3: Ott, T. J. (2005) Transport Protocols in the TCP Paradigm and their Performance. Telecommunication Systems30:4 pp 351--385, Springer 2005. Also available at www.teunisott.com/Papers.
• 4: Ott, T. J. (2006) Rate of convergence for the "Square Root Formula" in TCP. To appear in Adv. Appl. Prob. 38.4 (Dec 2006). Also available at www.teunisott.com/Papers.
• 5: Ott, T. J. (2006) Rate of convergence for the "Square Root Formula" in TCP, extended version. (Extended version of the paper above). www.teunisott.com/Papers.
• 6: Ott, T. J. and Swanson, J. (2006) Asymptotic Behavior of a Generalized TCP Congestion Avoidance Algorithm. (Submitted) Available at www.teunisott.com/Papers.
• 7: Ott, T. J. and Swanson, J. (2006) Stationarity of some processes in Transport Protocols, extended version. (An extended version of this paper). Available at www.teunisott.com/Papers.
• 8: Matthew Mathis , Jeffrey Semke , Jamshid Mahdavi, The macroscopic behavior of the TCP congestion avoidance algorithm, ACM SIGCOMM Computer Communication Review, v.27 n.3, p.67-82, July 1997 [doi>10.1145/263932.264023]
• 9: Meyn, S. P. and Tweedie, R. L. (1993) Markov Chains and Stochastic Stability Springer, 1993.
• 10: Tom Kelly, Scalable TCP: improving performance in highspeed wide area networks, ACM SIGCOMM Computer Communication Review, v.33 n.2, April 2003 [doi>10.1145/956981.956989]
• 11: Kelly, C. T. (2004) Engineering Flow Controls in the Internet. PhD thesis, Cambridge Univ, England. Available at http://www-lce.eng.cam.ac.uk/~ctk21/papers.