Mean field convergence of a model of multiple TCP connections through a buffer implementing RED

Annals of Applied Probability

Volumn 16, Issue 1, 2006, Pages 244-294

  Mcdonald, D R ^a   Reynier, J ^b,c  

^a UNIVERSITY OF OTTAWA   (Canada)

^b ECOLE NORMALE SUPÉRIEURE   (France)

^c Centre National de la Recherche Scientifique   (France)

Author keywords

Dynamical systems; Mean field; RED; TCP

Indexed keywords

EID: 33645665761     PISSN: 10505164     EISSN: 10505164     Source Type: Journal    
DOI: 10.1214/105051605000000700     Document Type: Article

References (19)

1. BRÉMAUD, P. (1981). Point Processes and Queues. Springer, Berlin.
2. BACCELLI, F., MCDONALD, D. R. and REYNIER, J. (2002). A mean-field model for multiple TCP connections through a buffer implementing RED. Performance Evaluation 11 77-97.
3. BAIN, A. (2003). Fluid limits for congestion control in networks, Ph.D. thesis, Univ. Cambridge.
4. BILLINGSLEY, P. (1995). Convergence of Probability Measures, 3rd ed. Wiley, New York. MR1700749
5. DAWSON, D. A. (1983). Critical dynamics and fluctuations for a mean-field model of cooperative behavior. J. Statist. Phys. 31 29-85. MR711469
6. DAWSON, D. A. (1993). Measure valued Markov processes. École d'Été de Probabilités de Saint-Flour XXI. Lecture Notes in Math. 1541 1-260. Springer, Berlin. MR1242575
7. DEB, S. and SRIKANT, R. (2004). Rate-based versus queue-based models of congestion control. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems 246-257.
8. DENG, X., YI, S., KESIDIS, G. and DAS, C. (2003). A control theoretic approach in designing adaptive AQM schemes. Globecom 2003 2947-2951.
9. DONNELLY, P. and KURTZ, T. (1999). Particle representations for measure-valued population models. Ann. Probab. 27 166-205. MR1681126
10. ETHIER, S. N. and KURTZ, T. G. (1986). Markov Processes; Characterization and Convergence. Wiley, New York. MR838085
11. FLOYD, S. (1999). The NewReno modification to TCP's fast recovery algorithm. RFC 2582.
12. FLOYD, S. and JACOBSON, V. (1993). Random early detection gateways for congestion avoidance. IEEE/ACM Trans. Networking 11 397-413.
13. FLOYD, S., MAHDAVI, J., MATHIS, M. and PODOLSKY, M. (2000). An extension to the selective acknowledgement (SACK) Option for TCP. RFC 2883, Proposed Standard, July 2000.
14. GROMOLL, H. C., PUHA, A. L. and WILLIAMS, R. J. (2002). The fluid limit of a heavily loaded processor sharing queue. Ann. Appl. Probab. 12 797-859. MR1925442
15. HOLLOT, C. V., MISRA, V., TOWSLEY, D. and GONG, W.-B. (2001). A control theoretic analysis of RED. In Proceedings of IEEE INFOCOM 2001 1510-1519.
16. KUUSELA, P., LASSILA, J., VIRTAMO, J. and KEY, P. (2001). Modeling RED with idealized TCP sources. In Proceedings of IFIP ATM and IP 2001 155-166.
17. RAINA, G. and WISCHIK, D. (2005). Buffer sizes for large multiplexers: TCP queueing theory and stability analysis. In Proceedings of NGI2005 79-82.
18. ROSOLEN, V., BONAVENTURE, O. and LEDUC, G. (1999). A RED discard strategy for ATM networks and its performance evaluation with TCP/IP traffic. Computer Communication Review 29 23-43.
19. SHAKKOTTAI, S. and SRIKANT, R. (2003). How good are deterministic fluid models of internet congestion control? INFOCOM 2002 497-505.