Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks

Authors:
M. J. Neely
Affiliations:
Dept. of Electr. Eng., Univ. of Southern California, Los Angeles, CA
Venue:
IEEE Journal on Selected Areas in Communications
Year:
2006

Citing 0
Cited 13

Fairness and optimal stochastic control for heterogeneous networks

IEEE/ACM Transactions on Networking (TON)
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks

IEEE/ACM Transactions on Networking (TON)
Towards optimal MAC without message passing in wireless networks

CFI '09 Proceedings of the 4th International Conference on Future Internet Technologies
Distributed opportunistic scheduling for ad hoc networks with random access: an optimal stopping approach

IEEE Transactions on Information Theory
Delay reduction via lagrange multipliers in stochastic network optimization

WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
On stability region and delay performance of linear-memory randomized scheduling for time-varying networks

IEEE/ACM Transactions on Networking (TON)
Routing without routes: the backpressure collection protocol

Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
Delay-based network utility maximization

INFOCOM'10 Proceedings of the 29th conference on Information communications
Utility optimal scheduling in processing networks

Performance Evaluation
A performance evaluation framework for packet scheduling algorithms in wireless system

Concurrency and Computation: Practice & Experience
Delay-based network utility maximization

IEEE/ACM Transactions on Networking (TON)
LIFO-backpressure achieves near-optimal utility-delay tradeoff

IEEE/ACM Transactions on Networking (TON)
Optimal scheduling and power allocation in cooperate-to-join cognitive radio networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.13

Visualization

Abstract

We consider the fundamental delay tradeoffs for utility optimal scheduling in a general network with time-varying channels. A network controller acts on randomly arriving data and makes flow control, routing, and resource allocation decisions to maximize a fairness metric based on a concave utility function of network throughput. A simple set of algorithms are constructed that yield total utility within O(1/V) of the utility-optimal operating point, for any control parameter V>0, with a corresponding end-to-end network delay that grows only logarithmically in V. This is the first algorithm to achieve such "super-fast" performance. Furthermore, we show that this is the best utility-delay tradeoff possible. This work demonstrates that the problem of maximizing throughput utility in a data network is fundamentally different than related problems of minimizing average power expenditure, as these latter problems cannot achieve such performance tradeoffs