Transient behavior of processes in the TCP paradigm

Probability in the Engineering and Informational Sciences

Volumn 22, Issue 3, 2008, Pages 431-471

  Ott, T J ^a   Kemperman, J H B ^a  

^a RUTGERS UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

RANDOM PROCESSES; STOCHASTIC SYSTEMS;

CONGESTION WINDOW; DROP PROBABILITY; MATHEMATICAL FOUNDATIONS; TRANSIENT BEHAVIOR; TRANSIENT DISTRIBUTION; TRANSPORT PROTOCOLS;

TRANSMISSION CONTROL PROTOCOL;

EID: 44349118066     PISSN: 02699648     EISSN: 14698951     Source Type: Journal    
DOI: 10.1017/S0269964808000259     Document Type: Article

References (43)

1. Abramowitz, M. & Stegun, I.A. (1970). Handbook of mathematical functions. Washington, DC: National Bureau of Standards.
2. Altman, E., Avrachenkov, K., & Barakat, C. (2000). A stochastic model of TCP/IP with stationary random loss. ACM SigComm Computer Communications Review 30(4): 231-242.
3. Altman, E., Avrachenkov, K., & Barakat, C. (2002). TCP network calculus: The case of large delay-bandwidth product. In Proceeding of IEEE Infocom 2002.
4. Altman, E., Avrachenkov, K., Barakat, C. Kherani, A.A., & Prabhu, B.J. (2004). Analysis of scalable TCP. Proceedings IEEE HSNMC 2004, pp. 51-62.
5. Altman, E., Avrachenkov, K., Barakat, C., & Nunez-Queija, R. (2001). TCP modeling in the presence of nonlinear window growth. In Proceedings of ITC-17.
6. Altman, E., Avrachenkov, K., Kherani, A.A., & Prabhu, B.J. (2005). Performance analysis and stochastic stability of congestion control protocols. In Proceedings of IEEE Infocom 2005.
7. Altman, E., Avrachenkov, K., & Prabhu, B. (2005). Fairness in MIMD congestion control algorithms. In Proceedings of IEEE Infocom 2005.
8. Altman, E., Barakat, C., & Ramos, V.M. (2004). Analysis of AIMD protocols over paths with variable delay. In Proceedings IEEE Infocom 2004.
9. Altman, E., Jimenez, T., & Kofman, D. (2004). DPS queues with stationary ergodic service times and the performance of TCP in overload. In Proceedings IEEE Infocom 2004.
10. Baccelli, F., Chaintreau, F., de Vleeschauwer, D., & McDonald, D. (2004). A mean-fields analysis of short lived interacting TCP flows. New York: ACM.
11. Baccelli, F., McDonald, D., & Reynier, J. (2002). A mean-field model for multiple TCP connections through a buffer implementing RED. Performance Evaluation 49: 77-97.
12. Baras, J., Misra, A., & Ott, T.J. (1999). The window distribution of of multiple TCPs with random loss queues. In Proceedings of Globecomm 1999.
13. Baras, J., Misra, A., & Ott, T.J. (2000). Generalized TCP congestion avoidance and its effect on bandwidth sharing and variability. In Proceedings of Globecomm 2000.
14. Baras, J., Misra, A., & Ott, T.J. (2000). Using drop-biasing to stabilize the occupancy of random drop queues with TCP traffic. In Proceedings of ICCS 2000.
15. Baras, J., Misra, A., & Ott, T.J. (2002). Predicting bottleneck bandwidth sharing by generalized TCP flows. Computer Networks 40(4): 557-576.
16. Bohacek, S. (2003). A stochastic model of TCP and fair video transmission. In Proceedings Infocom 2003.
17. Budhiraja, A., Hernandez-Campos F., Kulkarni, V.G., & Smith, F.D. (2004). Stochastic differential equation for TCP window size: Analysis and experimental validation. Probability in the Engineering and Information Sciences 18: 111-140.
18. Dumas, V., Guillemin, F., & Robert, Ph. (2002). A Markovian analysis of additive-increase, multiplicative decrease (AIMD) algorithms. Advances in Applied Probability 34(1): 85-111.
19. Floyd, S. (1994). TCP and explicit congestion notification. ACM Computer Communication Review 24(5): 10-23.
20. Floyd, S. (2006). Specifying alternate semantics for the explicit congestion notification (ECN) field. www.tools.ietf.org/html/rfc4774.
21. Gasper, G. & Rahman, M. (1990). Encyclopedia of mathematics and its applications. Cambridge: Cambridge University Press.
22. Guillemin, F, Robert, Ph, & Zwart, B. (2004). AIMD algorithms and exponential functionate. Annals of Applied Probability 14(1): 90-117.
23. Kelly, C.T. (2003). Improving performanceinhigh speedwide area networks.ACMSigCommComputer Communication Review 32(2): 83-91.
24. Kelly, C.T. (2004). Engineering flow controls in the Internet. Ph.D. thesis, Cambridge University, Cambridge.
25. Lakshman, T.V., & Madhow, U. (1997). The performanceofTCP/IP for networks with high bandwidth-delay products and random loss. Transactions on Networking 5(3): 336-350.
26. Löpker, A.H. & van Leeuwaarden, J.S.H. (2007). Transient moments of the window size in TCP. Available from www.win.tue.nl/∼leeuwaa/paper14. html.
27. Marquez, R., Altman, E., & Sole-Alvarez, S. (2004). Modeling TCP and high speed TCP: A nonlinear extension to AIMD mechanisms. Proceedings IEEE HSNMC 2004, pp. 132-143.
28. Mathis, M., Semke, J.Mahdavi, J., & Ott,T.J. (1997). The macroscopic behaviorofthe TCP congestion avoidance algorithm. Computer Communications Review 27(3): 67-82.
29. Misra, V., Gong, W.B., & Towsley, D. (1999). Stochastic differential equation modeling and analysis of TCP-windowsize behavior. In Proceedings of IFIP WG 7.3 Performance 1999.
30. Misra, A. & Ott, T.J. (1999). The window distribution of idealized TCP congestion avoidance with variable packet loss. In Proceedings of IEEE Infocom 1999, pp. 1564-1572.
31. Misra, A. & Ott, T.J. (2001). Effect of exponential averaging on the variability of a RED queue. In Proceedings of ICC 2001.
32. Misra, A. & Ott, T.J. (2001). Jointly coordinating ECN and TCP for rapid adaptation to varying bandwidth. In Proceedings of Milcom 2001.
33. Misra, A. & Ott, T.J. (2003). Performance sensitivity and fairness of ECN-aware "modified TCP." Journal of Performance Evaluation 53(3): 255-272.
34. Ott, T.J. (1999). ECN protocols and the TCP paradigm. Available from www.teunisott.com/Papers.
35. Ott, T.J. (2005). Transport protocols in the TCP paradigm and their performance. Telecommunication Systems 30(4): 351-385.
36. Ott, T.J. (2006). Rate of convergence for the "square root formula" in the Internet transmission control protocol. Advances in Applied Probability 38(4): 1132-1154.
37. Ott, T.J. (1999). On the Ornstein - Uhlenbeck process with delayed feedback. web.njit.edu/ott/Papers/ DelOu.ps.
38. Ott, T.J., Kemperman, J.H.B., & Mathis, M. (1996). The stationary behavior of idealized TCP congestion behavior. Available from www.teunisott.com/Papers
39. Ott, T.J. & Swanson, J. (2006). Stationarity of some processes in Transport Protocols. In IFIP WG 7.3 MAMA Workshop.
40. Ott, T.J. & Swanson, J. (2007). Asymptotic behavior of a generalized TCP congestion avoidance algorithm. Journal of Applited probability 44: 618-635.
41. Padhye, J., Firoiu, V., Towsley, D., & Kurose, J. (1998). Modeling TCP throughput: A simple model and its empirical validation. In Proceedings ACM SigComm 1998.
42. Padhye, J., Firoiu,V.,Towsley, D., & Kurose, J. (2000). Modeling of TCP RENO performance:A simple model and its empirical validation. IEEE/ACM Transactions on Networking 8(2): 133-445.
43. Ramakrishnan, K., Floyd, S., & Black, D. (2001). The addition of Explicit Congestion Notification (ECN) to IP. IETF RFC 3168, Sept. 2001.