Delay-Based Network Utility Maximization

It is well known that max-weight policies based on a queue backlog index can be used to stabilize stochastic networks, and that similar stability results hold if a delay index is used. Using Lyapunov optimization, we extend this analysis to design a utility maximizing algorithm that uses explicit delay information from the head-of-line packet at each user. The resulting policy is shown to ensure deterministic worst-case delay guarantees and to yield a throughput utility that differs from the optimally fair value by an amount that is inversely proportional to the delay guarantee. Our results hold for a general class of 1-hop networks, including packet switches and multiuser wireless systems with time-varying reliability .

[1]  Michael J. Neely,et al.  Cross-layer adaptive control for wireless mesh networks , 2007, Ad Hoc Networks.

[2]  Michael J. Neely.  Energy Optimal Control for Time-Varying Wireless Networks , 2006, IEEE Trans. Inf. Theory.

[3]  Eytan Modiano,et al.  Fairness and optimal stochastic control for heterogeneous networks , 2005, INFOCOM.

[4]  Xiaojun Lin,et al.  Joint rate control and scheduling in multihop wireless networks , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[5]  H. Kushner,et al.  Asymptotic Properties of Proportional-Fair Sharing Algorithms , 2002 .

[6]  Ness B. Shroff,et al.  Opportunistic power scheduling for dynamic multi-server wireless systems , 2006, IEEE Transactions on Wireless Communications.

[7]  R. Srikant,et al.  Fair resource allocation in wireless networks using queue-length-based scheduling and congestion control , 2007, TNET.

[8]  Nabil Kahale,et al.  Dynamic global packet routing in wireless networks , 1997, Proceedings of INFOCOM '97.

[9]  Michael J. Neely,et al.  Max weight learning algorithms with application to scheduling in unknown environments , 2009, 2009 Information Theory and Applications Workshop.

[10]  Alexander L. Stolyar,et al.  Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm , 2005, Queueing Syst. Theory Appl..

[11]  Michael J. Neely.  Delay-Based Network Utility Maximization , 2010, 2010 Proceedings IEEE INFOCOM.

[12]  Eytan Modiano,et al.  Optimal Control of Wireless Networks with Finite Buffers , 2010, 2010 Proceedings IEEE INFOCOM.

[13]  Lei Ying,et al.  On Combining Shortest-Path and Back-Pressure Routing Over Multihop Wireless Networks , 2009, IEEE INFOCOM 2009.

[14]  Michael J. Neely.  Super-Fast Delay Tradeoffs for Utility Optimal Fair Scheduling in Wireless Networks , 2006, IEEE J. Sel. Areas Commun..

[15]  Leandros Tassiulas,et al.  Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks , 1990, 29th IEEE Conference on Decision and Control.

[16]  Rajeev Agrawal,et al.  Optimality of Certain Channel Aware Scheduling Policies , 2002 .

[17]  Michael J. Neely,et al.  Opportunistic scheduling with worst case delay guarantees in single and multi-hop networks , 2011, 2011 Proceedings IEEE INFOCOM.

[18]  Sean P. Meyn,et al.  Stability of queueing networks and scheduling policies , 1993, Proceedings of 32nd IEEE Conference on Decision and Control.

[19]  Seung Jun Baek,et al.  Delay-Optimal Opportunistic Scheduling and Approximations: The Log Rule , 2009, INFOCOM 2009.

[20]  Eytan Modiano,et al.  Convexity in queues with general inputs , 2005, IEEE Transactions on Information Theory.

[21]  Frank Kelly,et al.  Charging and rate control for elastic traffic , 1997, Eur. Trans. Telecommun..

[22]  Philip A. Whiting,et al.  SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES , 2004, Probability in the Engineering and Informational Sciences.

[23]  Leandros Tassiulas,et al.  Resource Allocation and Cross-Layer Control in Wireless Networks , 2006, Found. Trends Netw..

[24]  Leandros Tassiulas,et al.  Dynamic server allocation to parallel queues with randomly varying connectivity , 1993, IEEE Trans. Inf. Theory.

[25]  Robert W. Heath,et al.  An online learning framework for link adaptation in wireless networks , 2009, 2009 Information Theory and Applications Workshop.

[26]  Michael J. Neely.  Optimal Backpressure Routing for Wireless Networks with Multi-Receiver Diversity , 2006 .

[27]  Marco Ajmone Marsan,et al.  Bounds on average delays and queue size averages and variances in input-queued cell-based switches , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[28]  Michael J. Neely,et al.  Dynamic power allocation and routing for satellite and wireless networks with time varying channels , 2003 .

[29]  Longbo Huang,et al.  Delay reduction via Lagrange multipliers in stochastic network optimization , 2011, IEEE Trans. Autom. Control..

[30]  Matthew Andrews,et al.  Providing quality of service over a shared wireless link , 2001, IEEE Commun. Mag..

[31]  Alexander L. Stolyar,et al.  Scheduling for multiple flows sharing a time-varying channel: the exponential rule , 2000 .

[32]  Michael J. Neely,et al.  Stochastic optimization for Markov modulated networks with application to delay constrained wireless scheduling , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[33]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[34]  Paolo Giaccone,et al.  Throughput Region of Finite-Buffered Networks , 2007, IEEE Transactions on Parallel and Distributed Systems.

[35]  Eytan Modiano,et al.  Dynamic power allocation and routing for time varying wireless networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[36]  G. Caire,et al.  Impact of multiple transmit antennas in a queued SDMA/TDMA downlink , 2005, IEEE 6th Workshop on Signal Processing Advances in Wireless Communications, 2005..

[37]  Jeffrey K. MacKie-Mason,et al.  Pricing Congestible Network Resources (Invited Paper) , 1995, IEEE J. Sel. Areas Commun..

[38]  Nick McKeown,et al.  A Starvation-free Algorithm For Achieving 100% Throughput in an Input- Queued Switch , 1999 .