Distributed Rate Allocation for Inelastic Flows

A common assumption behind most of the recent research on network rate allocation is that traffic flows are elastic, which means that their utility functions are concave and continuous and that there is no hard limit on the rate allocated to each flow. These critical assumptions lead to the tractability of the analytic models for rate allocation based on network utility maximization, but also limit the applicability of the resulting rate allocation protocols. This paper focuses on inelastic flows and removes these restrictive and often invalid assumptions. First, we consider nonconcave utility functions, which turn utility maximization into difficult, nonconvex optimization problems. We present conditions under which the standard price-based distributed algorithm can still converge to the globally optimal rate allocation despite nonconcavity of utility functions. In particular, continuity of price-based rate allocation at all the optimal prices is a sufficient condition for global convergence of rate allocation by the standard algorithm, and continuity at at least one optimal price is a necessary condition. We then show how to provision link capacity to guarantee convergence of the standard distributed algorithm. Second, we model real-time flow utilities as discontinuous functions. We show how link capacity can be provisioned to allow admission of all real-time flows, then propose a price-based admission control heuristics when such link capacity provisioning is impossible, and finally develop an optimal distributed algorithm to allocate rates between elastic and real-time flows.

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

[2]  Mung Chiang,et al.  Balancing transport and physical Layers in wireless multihop networks: jointly optimal congestion control and power control , 2005, IEEE Journal on Selected Areas in Communications.

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

[4]  Steven H. Low,et al.  A duality model of TCP and queue management algorithms , 2003, TNET.

[5]  Rayadurgam Srikant,et al.  The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications) , 2004 .

[6]  Laurent Massoulié,et al.  Bandwidth sharing and admission control for elastic traffic , 2000, Telecommun. Syst..

[7]  R. Srikant,et al.  On the Positive Recurrence of a Markov Chain Describing File Arrivals and Departures in a Congestion-Controlled Network , 2005 .

[8]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[9]  Daniel Pérez Palomar,et al.  Power Control By Geometric Programming , 2007, IEEE Transactions on Wireless Communications.

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

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

[12]  Richard J. La,et al.  Utility-based rate control in the Internet for elastic traffic , 2002, TNET.

[13]  Mung Chiang,et al.  Nonconcave network utility maximization through sum of squares method , 2005, IEEE Conference on Decision and Control.

[14]  R. Tyrrell Rockafellar,et al.  Lagrange Multipliers and Optimality , 1993, SIAM Rev..

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

[16]  Stephen P. Boyd,et al.  QoS and fairness constrained convex optimization of resource allocation for wireless cellular and ad hoc networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[17]  A. Ozdaglar,et al.  Min Common/Max Crossing Duality: A Simple Geometric Framework for Convex Optimization and Minimax Theory1 , 2003 .

[18]  Gustavo de Veciana,et al.  Stability and performance analysis of networks supporting elastic services , 2001, TNET.

[19]  Dimitri P. Bertsekas,et al.  Nonlinear Programming , 1997 .

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

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

[22]  Ness B. Shroff,et al.  On the stability region of congestion control , 2004 .

[23]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.