Translator Disclaimer
February 2012 Randomized scheduling algorithm for queueing networks
Devavrat Shah, Jinwoo Shin
Ann. Appl. Probab. 22(1): 128-171 (February 2012). DOI: 10.1214/11-AAP763

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.

Citation

Download Citation

Devavrat Shah. Jinwoo Shin. "Randomized scheduling algorithm for queueing networks." Ann. Appl. Probab. 22 (1) 128 - 171, February 2012. https://doi.org/10.1214/11-AAP763

Information

Published: February 2012
First available in Project Euclid: 7 February 2012

zbMATH: 06026090
MathSciNet: MR2932544
Digital Object Identifier: 10.1214/11-AAP763

Subjects:
Primary: 60K20, 68M12
Secondary: 68M20

Rights: Copyright © 2012 Institute of Mathematical Statistics

JOURNAL ARTICLE
44 PAGES


SHARE
Vol.22 • No. 1 • February 2012
Back to Top