Open Access
December 2014 Optimal queue-size scaling in switched networks
D. Shah, N. S. Walton, Y. Zhong
Ann. Appl. Probab. 24(6): 2207-2245 (December 2014). DOI: 10.1214/13-AAP970

Abstract

We consider a switched (queuing) network in which there are constraints on which queues may be served simultaneously; such networks have been used to effectively model input-queued switches and wireless networks. The scheduling policy for such a network specifies which queues to serve at any point in time, based on the current state or past history of the system. In the main result of this paper, we provide a new class of online scheduling policies that achieve optimal queue-size scaling for a class of switched networks including input-queued switches. In particular, it establishes the validity of a conjecture (documented in Shah, Tsitsiklis and Zhong [Queueing Syst. 68 (2011) 375–384]) about optimal queue-size scaling for input-queued switches.

Citation

Download Citation

D. Shah. N. S. Walton. Y. Zhong. "Optimal queue-size scaling in switched networks." Ann. Appl. Probab. 24 (6) 2207 - 2245, December 2014. https://doi.org/10.1214/13-AAP970

Information

Published: December 2014
First available in Project Euclid: 26 August 2014

zbMATH: 1307.60135
MathSciNet: MR3262502
Digital Object Identifier: 10.1214/13-AAP970

Subjects:
Primary: 60K25 , 60K30 , 90B36

Keywords: diffusion approximation , fluid models , heavy traffic , maximum weight scheduling , state space collapse , Switched network

Rights: Copyright © 2014 Institute of Mathematical Statistics

Vol.24 • No. 6 • December 2014
Back to Top