1,650 research outputs found
Optimal queue-size scaling in switched networks
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.Comment: Published in at http://dx.doi.org/10.1214/13-AAP970 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
Switched networks with maximum weight policies: Fluid approximation and multiplicative state space collapse
We consider a queueing network in which there are constraints on which queues
may be served simultaneously; such networks may be used to model input-queued
switches and wireless networks. The scheduling policy for such a network
specifies which queues to serve at any point in time. We consider a family of
scheduling policies, related to the maximum-weight policy of Tassiulas and
Ephremides [IEEE Trans. Automat. Control 37 (1992) 1936--1948], for single-hop
and multihop networks. We specify a fluid model and show that fluid-scaled
performance processes can be approximated by fluid model solutions. We study
the behavior of fluid model solutions under critical load, and characterize
invariant states as those states which solve a certain network-wide
optimization problem. We use fluid model results to prove multiplicative state
space collapse. A notable feature of our results is that they do not assume
complete resource pooling.Comment: Published in at http://dx.doi.org/10.1214/11-AAP759 the Annals of
Applied Probability (http://www.imstat.org/aap/) by the Institute of
Mathematical Statistics (http://www.imstat.org
On Optimal Weighted-Delay Scheduling in Input-Queued Switches
Motivated by relatively few delay-optimal scheduling results, in comparison
to results on throughput optimality, we investigate an input-queued switch
scheduling problem in which the objective is to minimize a linear function of
the queue-length vector. Theoretical properties of variants of the well-known
MaxWeight scheduling algorithm are established within this context, which
includes showing that these algorithms exhibit optimal heavy-traffic
queue-length scaling. For the case of input-queued switches, we
derive an optimal scheduling policy and establish its theoretical properties,
demonstrating fundamental differences with the variants of MaxWeight
scheduling. Our theoretical results are expected to be of interest more broadly
than input-queued switches. Computational experiments demonstrate and quantify
the benefits of our optimal scheduling policy
- âŠ