Data networks
Dynamic Global Packet Routing in Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Dynamic power allocation and routing for satellite and wireless networks with time varying channels
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
Throughput Region of Finite-Buffered Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal control of wireless networks with finite buffers
INFOCOM'10 Proceedings of the 29th conference on Information communications
Delay-based network utility maximization
INFOCOM'10 Proceedings of the 29th conference on Information communications
Stochastic Network Optimization with Application to Communication and Queueing Systems
Stochastic Network Optimization with Application to Communication and Queueing Systems
On combining shortest-path and back-pressure routing over multihop wireless networks
IEEE/ACM Transactions on Networking (TON)
Opportunistic power scheduling for dynamic multi-server wireless systems
IEEE Transactions on Wireless Communications
Communication over fading channels with delay constraints
IEEE Transactions on Information Theory
Convexity in queues with general inputs
IEEE Transactions on Information Theory
Energy optimal control for time-varying wireless networks
IEEE Transactions on Information Theory
Dynamic server allocation to parallel queues with randomly varying connectivity
IEEE Transactions on Information Theory
Providing quality of service over a shared wireless link
IEEE Communications Magazine
Dynamic power allocation and routing for time-varying wireless networks
IEEE Journal on Selected Areas in Communications
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
Pricing congestible network resources
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.