Achieving network stability and user fairness through admission control of TCP connections

This paper studies a network under TCP congestion control, in which the number of flows per user is explicitly taken into account. We present a control law for this variable that, in combination with congestion control, induces as equilibrium the maximization of social welfare measured at the level of users, rather than the level of TCP connections. We use fluid flow models to prove stability theorems on the dynamics of the overall system, combining the dynamics of flows with the dynamic rates and prices of congestion control. We then develop an admission control policy for discrete TCP flows, that emulates the continuous behavior, and is modeled as a Markov chain. We present simulation studies of the overall system, which exhibit its stability and the desired user-level fairness behavior.

[1]  Derong Liu.  The Mathematics of Internet Congestion Control , 2005, IEEE Transactions on Automatic Control.

[2]  Gustavo de Veciana,et al.  Stability and performance analysis of networks supporting services with rate control-could the Internet be unstable? , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[3]  Bob Briscoe,et al.  Flow rate fairness: dismantling a religion , 2007, CCRV.

[4]  Jean Walrand,et al.  Fair end-to-end window-based congestion control , 1998, TNET.

[5]  Alexandre Proutière,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[6]  Matthew Mathis,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997, CCRV.

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

[8]  Jun Luo,et al.  On the Performance of Primal/Dual Schemes for Congestion Control in Networks with Dynamic Flows , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[9]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2004, IEEE Transactions on Automatic Control.

[10]  Thomas Bonald,et al.  Statistical bandwidth sharing: a study of congestion at flow level , 2001, SIGCOMM.

[11]  Laurent Massoulié,et al.  Impact of fairness on Internet performance , 2001, SIGMETRICS '01.

[12]  Jean C. Walrand,et al.  Fair end-to-end window-based congestion control , 2000, TNET.

[13]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[14]  Ness B. Shroff,et al.  The impact of imperfect scheduling on cross-Layer congestion control in wireless networks , 2006, IEEE/ACM Transactions on Networking.

[15]  B ShroffNess,et al.  The impact of imperfect scheduling on cross-layer congestion control in wireless networks , 2006 .

[16]  Fernando Paganini,et al.  Internet congestion control , 2002 .

[17]  A. Robert Calderbank,et al.  Layering as Optimization Decomposition: A Mathematical Theory of Network Architectures , 2007, Proceedings of the IEEE.

[18]  SemkeJeffrey,et al.  The macroscopic behavior of the TCP congestion avoidance algorithm , 1997 .