Utility Max-Min Fair Congestion Control with Time-Varying Delays

We present a framework for designing delay- independent end-to-end congestion control algorithms, where each end-user may have a different utility function. We only require that utility functions are strictly increasing. In this framework, we design an algorithm that maximizes the minimum utility value in the network, that is, the resulting resource allocation is utility max-min fair. To achieve this, we first extend the congestion control algorithm EMKC proposed by Zhang et al. [1], which aims at max-min fair bandwidth allocation. Our extension (xMKC) allows for arbitrary rate allocations in the steady state. We investigate xMKC analytically and prove local asymptotic stability with heterogeneous time-varying feedback delays in multi-link networks and global asymptotic stability with homogeneous time-varying feedback delays in single-link networks. Then, we propose uMKC (Utility Max-Min Fair Kelly Control), which achieves utility max-min fairness in its steady state. Based on the analysis of xMKC, we establish stability results for uMKC in the presence of time-varying feedback delays. Finally, we evaluate the performance of uMKC using NS-2 simulations [2].

[1]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[2]  R. Srikant,et al.  Stable, scalable, fair congestion control and AQM schemes that achieve high utilization in the Internet , 2003, IEEE Trans. Autom. Control..

[3]  Tobias Harks,et al.  Priority pricing in utility fair networks , 2005, 13TH IEEE International Conference on Network Protocols (ICNP'05).

[4]  Van Jacobson,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

[5]  Raj Jain,et al.  A Quantitative Measure Of Fairness And Discrimination For Resource Allocation In Shared Computer Systems , 1998, ArXiv.

[6]  Leandros Tassiulas,et al.  A Simple Rate Control Algorithm for Maximizing Total User Utility. , 2001, INFOCOM 2001.

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

[8]  S. Shenker.  Fundamental Design Issues for the Future Internet , 1995 .

[9]  Mark Handley,et al.  Congestion control for high bandwidth-delay product networks , 2002, SIGCOMM '02.

[10]  Dipankar Raychaudhuri,et al.  Dynamic quality-of-service framework for video in broadband networks , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[11]  Laurent Massoulié,et al.  Stability of distributed congestion control with heterogeneous feedback delays , 2002, IEEE Trans. Autom. Control..

[12]  Sally Floyd,et al.  TCP Selective Acknowledgement Options , 1996 .

[13]  Shengyu Zhang,et al.  Distributed rate allocation for inelastic flows: optimization frameworks, optimality conditions, and optimal algorithms , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[14]  Dmitri Loguinov,et al.  JetMax: Scalable Max-Min Congestion Control for High-Speed Heterogeneous Networks , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

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

[16]  Sally Floyd,et al.  TCP Selective Acknowledgment Options , 1996, RFC.

[17]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[18]  Song Chong,et al.  A distributed utility max-min flow control algorithm , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[19]  Dmitri Loguinov,et al.  On Delay-Independent Diagonal Stability of Max-Min Congestion Control , 2009, IEEE Transactions on Automatic Control.

[20]  Scott Shenker,et al.  Best-effort versus reservations: a simple comparative analysis , 1998, SIGCOMM '98.

[21]  R. Srikant,et al.  End-to-end congestion control schemes: utility functions, random losses and ECN marks , 2003, TNET.

[22]  Seong-Ryong Kang,et al.  Delay-Independent Stability and Performance of Distributed Congestion Control , 2007, IEEE/ACM Transactions on Networking.

[23]  A. Bhaya,et al.  A delay-independent robust stability condition for linear discrete-time systems , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[24]  Ellen W. Zegura,et al.  Utility max-min: an application-oriented bandwidth allocation scheme , 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).

[25]  Larry L. Peterson,et al.  TCP Vegas: End to End Congestion Avoidance on a Global Internet , 1995, IEEE J. Sel. Areas Commun..

[26]  Sally Floyd,et al.  The NewReno Modification to TCP's Fast Recovery Algorithm , 2004, RFC.

[27]  Michael J. Karels,et al.  Congestion avoidance and control , 1988, SIGCOMM '88.

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

[29]  Tobias Harks,et al.  Utility Proportional Fair Bandwidth Allocation: An Optimization Oriented Approach , 2005, QoS-IP.

[30]  Song Chong,et al.  Utility Max-Min Flow Control Using Slope-Restricted Utility Functions , 2005, IEEE Transactions on Communications.

[31]  Dipankar Raychaudhuri,et al.  A dynamic quality of service framework for video in broadband networks , 1998 .

[32]  Ness B. Shroff,et al.  Non-convex optimization and rate control for multi-class services in the Internet , 2005, IEEE/ACM Transactions on Networking.

[33]  R. Srikant,et al.  A time-scale decomposition approach to adaptive explicit congestion notification (ECN) marking , 2002, IEEE Trans. Autom. Control..

[34]  Steven H. Low,et al.  Optimization flow control—I: basic algorithm and convergence , 1999, TNET.

[35]  Lachlan L. H. Andrew,et al.  MaxNet: a congestion control architecture for scalable networks , 2003, IEEE Communications Letters.

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

[37]  Kam Lee,et al.  Adaptive network support for mobile multimedia , 1995, MobiCom '95.

[38]  Ramesh Johari,et al.  End-to-end congestion control for the internet: delays and stability , 2001, TNET.

[39]  Dmitri Loguinov,et al.  Local and global stability of symmetric heterogeneously-delayed control systems , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[40]  R. Srikant,et al.  Analysis and design of an adaptive virtual queue (AVQ) algorithm for active queue management , 2001, SIGCOMM '01.

[41]  Leandros Tassiulas,et al.  Fair allocation of utilities in multirate multicast networks: a framework for unifying diverse fairness objectives , 2002, IEEE Trans. Autom. Control..

[42]  Glenn Vinnicombe,et al.  On the stability of end-to-end congestion control for the internet , 2001 .

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

[44]  R. Srikant,et al.  Global stability of congestion controllers for the Internet , 2003, IEEE Trans. Autom. Control..