Modelling TCP congestion control dynamics in drop-tail environments

Automatica

Volumn 43, Issue 3, 2007, Pages 441-449

  Shorten, Robert ^a   King, Chris ^b   Wirth, Fabian ^c   Leith, Douglas ^a  

^a NATIONAL UNIVERSITY OF IRELAND   (Ireland)

^b NORTHEASTERN UNIVERSITY   (United States)

^c UNIVERSITY OF BREMEN   (Germany)

Author keywords

Network congestion control; TCP

Indexed keywords

ALGORITHMS; MATHEMATICAL MODELS; TELECOMMUNICATION NETWORKS; THEOREM PROVING;

ADDITIVE-INCREASE MULTIPLICATIVE-DECREASE (AIMD); BASIC THEOREMS; NETWORK CONGESTION CONTROL;

CONGESTION CONTROL (COMMUNICATION);

EID: 33846808805     PISSN: 00051098     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.automatica.2006.07.026     Document Type: Article

References (14)

1. Barnsley M., Demko S., Elton J., and Geronimo J. Invariant measures for Markov processes arising from iterated function systems with place dependent probabilities. Annales de l'Institut Henri Poincaire Probability and Statistics 24 (1988) 367-394
2. Baccelli, F., & Hong, D. (2002). AIMD, fairness and fractal scaling of TCP traffic. In Proceedings of IEEE INFOCOM 2002, June 2002. (pp. 229-238). New York, NY, USA.
3. Berman A., and Plemmons R. Nonnegative matrices in the mathematical sciences (1979), SIAM, Philadelphia, PA
4. Chiu D., and Jain R. Analysis of the increase/decrease algorithms for congestion avoidance in computer networks. Journal of Computer Networks 17 (1989) 1-14
5. Elton J. A multiplicative ergodic theorem for Lipschitz maps. Stochastic Processes Applications 231 2 (1990) 39-47
6. Hespanha, J. (2004). Stochastic hybrid systems: Application to communication networks. In R. Alur, & G.J. Pappas (Eds.), Hybrid systems, computation & control, Proceedings of HSCC 2004, Lecture notes in computer science, March 2004. (Vol. 2993, pp. 387-401). Heidelberg: Springer.
7. Isaac R. Markov processes and unique probability measures. Pacific Journal of Mathematics 12 (1962) 273-286
8. Leizarowitz, A., Stanojevic, R., & Shorten, R. (2006). Tools for the analysis and design of communication networks with Markovian dynamics. IEE Proceedings on control theory, in press.
9. Padhye J., Firoiu V., Towsley D.F., and Kurose J.F. Modeling TCP Reno performance: A simple model and its empirical validation. IEEE/ACM transactions on networking 8 2 (2000) 133-145
10. Shorten R.N., Leith D.J., Foy J., and Kilduff R. Analysis and design of AIMD congestion control algorithms in communication networks. Automatica 41 (2005) 725-730
11. Shorten R., Wirth F., and Leith D. A positive systems model of TCP-like congestion control: Asymptotic analysis. IEEE/ACM transactions on networking 14 (2006) 616-629
12. Srikant R. Internet congestion control, Control theory Vol. 14 (2004), Birkhäuser Boston Inc, Boston, MA
13. Stenflo O. Uniqueness of invariant measures for place dependent iterations of functions. IMA Journal of Applied Mathematics 132 (2002) 13-32
14. Wirth, F., Stanojevic, R., Shorten, R., & Leith, D. (2006). Stochastic equilibria of AIMD communication networks. SIAM Journal on Matrix Analysis and Applications, in press.