On scheduling for minimizing end-to-end buffer usage over multihop wireless networks

Authors:
V. J. Venkataramanan;Xiaojun Lin;Lei Ying;Sanjay Shakkottai
Affiliations:
School of ECE, Purdue University;School of ECE, Purdue University;Department of ECE, Iowa State University;Department of ECE, The University of Texas at Austin
Venue:
INFOCOM'10 Proceedings of the 29th conference on Information communications
Year:
2010

Citing 6
Cited 2

Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

Queueing Systems: Theory and Applications
Large Deviations of Queues Sharing a Randomly Time-Varying Server

Queueing Systems: Theory and Applications
Order optimal delay for opportunistic scheduling in multi-user wireless uplinks and downlinks

IEEE/ACM Transactions on Networking (TON)
Stability and Asymptotic Optimality of Generalized MaxWeight Policies

SIAM Journal on Control and Optimization
On wireless scheduling algorithms for minimizing the queue-overflow probability

IEEE/ACM Transactions on Networking (TON)
A Large Deviations Analysis of Scheduling in Wireless Networks

IEEE Transactions on Information Theory

On the queue-overflow probabilities of a class of distributed scheduling algorithms

Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay-guaranteed cross-layer scheduling in multihop wireless networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

While there has been much progress in designing backpressure based stabilizing algorithms for multihop wireless networks, end-to-end performance (e.g., end-to-end buffer usage) results have not been as forthcoming. In this paper, we study the end-to-end buffer usage (sum of buffer utilization along a flow path) over a network with general topology and with fixed, loopfree routes using a large-deviations approach. We first derive bounds on the best performance that any scheduling algorithm can achieve. Based on the intuition from the bounds, we propose a class of (backpressure-like) scheduling algorithms called αβ-algorithms. We show that the parameters α and β can be chosen such that the system under the αβ-algorithm performs arbitrarily closely to the best possible scheduler (formally the decay rate function for end-to-end buffer overflow is shown to be arbitrarily close to optimal in the large-buffer regime). We also develop variants which have the same asymptotic optimality property, and also provide good performance in the small-buffer regime. Our results are substantiated using both analysis and simulation.