Optimal queue-size scaling in switched networks

  • Authors:
  • Devavrat Shah;Neil Walton;Yuan Zhong

  • Affiliations:
  • Massachusetts Institute of Technology, Cambridge, MA, USA;University of Amsterdam, Amsterdam, Netherlands;Massachusetts Institute of Technology, Cambridge, MA, USA

  • Venue:
  • Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

We consider a switched (queueing) 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 average queue-size scaling for a class of switched networks including input-queued switches. In particular, it establishes the validity of a conjecture about optimal queue-size scaling for input-queued switches.