Bandwidth Allocation for a Revenue-Aware Network Utility Maximization

In this letter, we consider the Network Utility Maximization (NUM) problem in which a loss-related revenue indicator is set up by an operator as a constraint. We propose an algorithm which artificially modifies capacity constraints of a standard NUM algorithm. This results in a price-based mechanism that drives users into an operating point which maximizes total user utility for a given revenue indicator constraint.

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

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

[3]  Yin Zhang,et al.  On selfish routing in Internet-like environments , 2003, IEEE/ACM Transactions on Networking.

[4]  K. G. Ramakrishnan,et al.  ATM network design and optimization: a multirate loss network framework , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[5]  M. Zukerman,et al.  Efficiency-fairness tradeoff in telecommunications networks , 2005, IEEE Communications Letters.

[6]  Dimitri P. Bertsekas,et al.  Constrained Optimization and Lagrange Multiplier Methods , 1982 .

[7]  S. Zachary,et al.  Loss networks , 2009, 0903.0640.