Resource allocation and cross-layer control in wireless networks
Foundations and Trends® in Networking
IEEE/ACM Transactions on Networking (TON)
Fairness and optimal stochastic control for heterogeneous networks
IEEE/ACM Transactions on Networking (TON)
Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks
IEEE Transactions on Mobile Computing
Routing without routes: the backpressure collection protocol
Proceedings of the 9th ACM/IEEE International Conference on Information Processing in Sensor Networks
The optimality of two prices: maximizing revenue in a stochastic communication system
IEEE/ACM Transactions on Networking (TON)
Back-pressure routing and rate control for ICNs
Proceedings of the sixteenth annual international conference on Mobile computing and networking
Utility optimal scheduling in energy harvesting networks
MobiHoc '11 Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Optimal Energy and Delay Tradeoffs for Multiuser Wireless Downlinks
IEEE Transactions on Information Theory
Super-fast delay tradeoffs for utility optimal fair scheduling in wireless networks
IEEE Journal on Selected Areas in Communications
Back-pressure-based packet-by-packet adaptive routing in communication networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
There has been considerable work developing a stochastic network utility maximization framework using Backpressure algorithms, also known as MaxWeight. A key open problem has been the development of utility-optimal algorithms that are also delay-efficient. In this paper, we show that the Backpressure algorithm, when combined with the last-in-first-out (LIFO) queueing discipline (called LIFO-Backpressure), is able to achieve a utility that is within O(1/V) of the optimal value, for any scalar V ≥ 1, while maintaining an average delay of O([log(V)]2) for all but a tiny fraction of the network traffic. This result holds for a general class of problems with Markovian dynamics. Remarkably, the performance of LIFO-Backpressure can be achieved by simply changing the queueing discipline; it requires no other modifications of the original Backpressure algorithm. We validate the results through empirical measurements from a sensor network testbed, which show a good match between theory and practice. Because some packets may stay in the queues for a very long time under LIFO-Backpressure, we further develop the LIFOp-Backpressure algorithm, which generalizes LIFO-Backpressure by allowing interleaving between first-in-first-out (FIFO) and LIFO. We show that LIFOp-Backpressure also achieves the same O(1/V) close-to-optimal utility performance and guarantees an average delay of O([log(V)]2) for the packets that are served during the LIFO period.