Utility Maximization for Communication Networks

In this paper, we study utility maximization problems for communication networks where each user (or class) can have multiple alternative paths through the network. This type of multi- path utility maximization problems appear naturally in several re- source allocation problems in communication networks, such as the multi-path flow control problem, the optimal quality-of-service (QoS) routing problem, and the optimal network pricing problem. We develop a distributed solution to this problem that is amenable to online implementation. We analyze the convergence of our al- gorithm in both continuous-time and discrete-time, and with and without measurement noise. These analyses provide us with guide- lines on how to choose the parameters of the algorithm to ensure efficient network control.

[1]  Anees Shaikh,et al.  Evaluating the impact of stale link state on quality-of-service routing , 2001, TNET.

[2]  Stephen J. Wright.  Primal-Dual Interior-Point Methods , 1997, Other Titles in Applied Mathematics.

[3]  Peter Key,et al.  Optimal Control and Trunk Reservation in Loss Networks , 1990 .

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

[5]  R. Srikant,et al.  Multi-Path TCP: A Joint Congestion Control and Routing Scheme to Exploit Path Diversity in the Internet , 2006, IEEE/ACM Transactions on Networking.

[6]  Jonathan Eckstein.  Splitting methods for monotone operators with applications to parallel optimization , 1989 .

[7]  Leandros Tassiulas,et al.  Optimization based rate control for multipath sessions , 2001 .

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

[9]  R. Srikant,et al.  A Mathematical Framework for Designing a Low-Loss, Low-Delay Internet , 2004 .

[10]  R. Srikant,et al.  An adaptive virtual queue (AVQ) algorithm for active queue management , 2004, IEEE/ACM Transactions on Networking.

[11]  Peter Steenkiste,et al.  On path selection for traffic with bandwidth guarantees , 1997, Proceedings 1997 International Conference on Network Protocols.

[12]  R. Rockafellar.  Monotone Operators and the Proximal Point Algorithm , 1976 .

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

[14]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[15]  Harold J. Kushner,et al.  Stochastic Approximation Algorithms and Applications , 1997, Applications of Mathematics.

[16]  Satish K. Tripathi,et al.  Quality of service based routing: a performance perspective , 1998, SIGCOMM '98.

[17]  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).

[18]  Marimuthu Palaniswami,et al.  Optimal flow control and routing in multi-path networks , 2003, Perform. Evaluation.