On AIMD Congestion Control in Multiple Bottleneck Networks

We consider a linear algebraic model of the Additive-Increase Multiplicative-Decrease congestion control algorithm and present results on average fairness and convergence for multiple bottleneck networks. Results are presented for networks of both long-lived and short-lived flows.

[1]  Fabian R. Wirth,et al.  A positive systems model of TCP-like congestion control: asymptotic results , 2006, IEEE/ACM Transactions on Networking.

[2]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control , 2003 .

[3]  Robert Shorten,et al.  On the Dynamics of TCP's Higher Moments , 2007, IEEE Communications Letters.

[4]  F. Baccelli,et al.  Interaction of TCP flows as billiards , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Frank Kelly,et al.  Rate control for communication networks: shadow prices, proportional fairness and stability , 1998, J. Oper. Res. Soc..

[6]  Raj Jain,et al.  Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks , 1989, Comput. Networks.