Randomized Scheduling Algorithm for Queueing Networks
Name
Shah_Randomized scheduling.pdf
Size
398.88 KB
Format
Adobe PDF
Checksum (MD5)
fb9b34a18bed9abfad3db63bb874a7be
Author(s)
Shah, Devavrat
Shin, Jinwoo
Date Issued
2012
Journal
Annals of Applied Probability
Publisher
Institute of Mathematical Statistics
Citation
Shah, Devavrat, and Jinwoo Shin. “Randomized Scheduling Algorithm for Queueing Networks.” The Annals of Applied Probability 22.1 (2012): 128–171.
Version
Author's final manuscript
Abstract
There has recently been considerable interest in design of low-complexity, myopic, distributed and stable scheduling algorithms for constrained queueing network models that arise in the context of emerging communication networks. Here we consider two representative models. One, a queueing network model that captures randomly varying number of packets in the queues present at a collection of wireless nodes communicating through a shared medium. Two, a buffered circuit switched network model for an optical core of future internet to capture the randomness in calls or flows present in the network. The maximum weight scheduling algorithm proposed by Tassiulas and Ephremides [IEEE Trans. Automat. Control 37 (1992) 1936–1948], leads to a myopic and stable algorithm for the packet-level wireless network model. But computationally it is expensive (NP-hard) and centralized. It is not applicable to the buffered circuit switched network due to the requirement of nonpreemption of the calls in the service. As the main contribution of this paper, we present a stable scheduling algorithm for both of these models. The algorithm is myopic, distributed and performs few logical operations at each node per unit time.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1214/11-aap763
