Rate of convergence for the 'square root formula' in the internet transmission control protocol

Advances in Applied Probability

Volumn 38, Issue 4, 2006, Pages 1132-1154

  Ott, Teunis J ^a  

^a NONE   (United States)

Author keywords

Computer networking; Coupled stochastic processes; Rate of convergence; Square root law; Stationary distribution; Stochastic dominance; Stochastic process; Transport protocol

Indexed keywords

COMPUTER NETWORKS; CONVERGENCE OF NUMERICAL METHODS; NETWORK PROTOCOLS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

COMPUTER NETWORKING; CONVERGENCE RATE; COUPLED STOCHASTIC PROCESSES; SQUARE ROOT LAW; STOCHASTIC DOMINANCE;

INTERNET;

EID: 33846977774     PISSN: 00018678     EISSN: None     Source Type: Journal    
DOI: 10.1239/aap/1165414595     Document Type: Article

References (17)

1. Altman, E., Avrachenkov, K. and Barakat, C. (2005). A stochastic model of TCP/IP with stationary random losses. IEEE/ACM Trans. Networking 13, 356-369.
2. Altman, E., Avrachenkov, K., Barakat, C. and Nunez-Queija, R. (2001). State-dependent NVG/1 type queueing analysis for congestion control in data networks. In Proc. INFOCOM 2001 (Anchorage, AK, April 2001), Vol. 3, pp. 1350-1359.
3. Altman, E. et al. (2005). Analysis of MIMD congestion control algorithm for high speed networks. Comput. Networks 48, 972-989.
4. Dantzig, G. B. (1963). Linear Programming and Extensions. Princeton University Press.
5. Dumas, V., Guillemin, F. and Robert, P. (2002). A Markovian analysis of additive-increase, multiplicative-decrease algorithms. Adv. Appl. Prob. 34, 85-111.
6. Guillemin, F., Robert, P. and Zwart, B. (2004). AIMD algorithms and exponential functionals. Ann. Appl. Prob. 14, 90-117.
7. Kelly, T. (2003). Scalable TCP: improving performance in highspeed wide area networks. Comput. Commun. Rev. 33, 83-91.
8. Kelly, T. (2004). Engineering flow controls for the Internet. Doctoral Thesis, University of Cambridge. Available at http://www.deneholme.net/ tom/papers.
9. Lehmann, E. L. (1986). Testing Statistical Hypotheses, 2nd edn. John Wiley, New York.
10. Loève, M. (1963). Probability Theory, 3rd edn. Van Nostrand, Princeton, NJ.
11. Ott, T. J. (2005). Transport protocols in the TCP paradigm and their performance. Telecommun Systems 30, 351-385. Available at http://www.teunisott.com/Papers.
12. Ott, T. J. (2006). Rate of convergence for the 'square root formula', extended version. Unpublished manuscript. Available at http://www.teunisott.com/Papers.
13. Ott, T. J. and Swanson, J. (2006). Asymptotic behavior of a generalized TCP congestion avoidance algorithm. Submitted. Available at http://www.teunisott.com/Papers.
14. Ott, T. J. and Swanson, J. (2006). Stationarity of some processes in transport protocols. To appear in Performance Eval. Rev. Extended version available at http://www.teunisott.com/Papers.
15. Ott, T. J., Kemperman, J. H. B. and Mathis, M. (1996). The stationary behavior of ideal TCP congestion avoidance. Preprint. Available at http://www.teunisott.com/Papers.
16. Ott, T. J., Kemperman, J. H. B. and Mathis, M. (2004). The stationary behavior of ideal TCP congestion avoidance, revisited. Unpublished manuscript.
17. Ramakrishnan, K., Floyd, S. and Black, D. (2001). The addition of explicit congestion notification (ECN) to IP. Internet Engineering Task Force RFC 3168. Available at ftp://ftp.rfc-editor.org/in-notes/ rfc3168.txt.