Sufficient conditions for stability of longest-queue-first scheduling:
second-order properties using fluid limits
Antonis Dimakis and Jean Walrand
Source: Adv. in Appl. Probab.
Volume 38, Number 2
(2006), 505-521.
Abstract
We consider the stability of the longest-queue-first scheduling policy (LQF), a
natural and low-complexity scheduling policy, for a generalized
switch model. Unlike that of common scheduling policies, the stability of LQF depends on the
variance of the arrival processes in addition to their average
intensities.
We identify new sufficient conditions for LQF to be throughput
optimal for independent, identically distributed arrival processes. Deterministic fluid analogs,
proved to be powerful in the analysis of stability in queueing
networks, do not adequately characterize the stability of LQF. We
combine properties of diffusion-scaled sample path functionals and
local fluid limits into a sharper characterization of stability.
Primary Subjects: 60K25
Secondary Subjects: 90B15, 60G17
Keywords: Generalized switch; longest-queue-first scheduling; MaxWeight scheduling; throughput optimality; stability; local pooling; fluid limit; local fluid limit; second-order condition
Full-text: Access denied (no subscription detected)
We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription.
Read more about accessing full-text
Links and Identifiers
Permanent link to this document: http://projecteuclid.org/euclid.aap/1151337082
Digital Object Identifier: doi:10.1239/aap/1151337082
Mathematical Reviews number (MathSciNet):
MR2264955
Zentralblatt MATH identifier:
1126.60074
References
Andrews, M. et al. (2004). Scheduling in a queuing system with asynchronously varying service rates. Prob. Eng. Inf. Sci. 18, 191--217.
Dai, J. G. (1995). On positive Harris recurrence of multiclass queueing networks: a unified approach via fluid limit models. Ann. Appl. Prob. 5, 49--77.
Dai, J. G. and Prabhakar, B. (2000). The throughput of data switches with and without speedup. In Proc. INFOCOM 2000, Vol. 2, IEEE, Piscataway, NJ, pp. 556--564.
Durrett, R. (2004). Probability: Theory and Examples, 3rd edn. Duxbury, Belmont, CA.
Kumar, S., Giaccone, P. and Leonardi, E. (2002). Rate stability of stable marriage scheduling algorithms in input-queued switches. In Proc. 40th Annual Allerton Conference on Computers, Communication, and Control, University of Illinois, Urbana-Champaign, IL. Available at http://www.stanford.edu/~skumar/preprints.htm.
Malyshev, V. A. (1993). Networks and dynamical systems. Adv. Appl. Prob. 25, 140--175.
McKeown, N. (1995). Scheduling algorithms for input-queued cell switches. Doctoral Thesis, University of California, Berkeley.
Shakkottai, S. and Stolyar, A. (2002). Scheduling for multiple flows sharing a time-varying channel: the exponential rule. In Analytic Methods in Applied Probability, ed. Yu. M. Suhov, American Mathematical Society, Providence, RI, pp. 185--202.
Stolyar, A. (2004). MaxWeight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Ann. Appl. Prob. 14, 1--53.
Stolyar, A. L. (1995). On the stability of multiclass queueing networks: a relaxed sufficient condition via limiting fluid processes. Markov Process. Relat. Fields 1, 491--512.
Tassiulas, L. and Ephremides, A. (1992). Stability properties of constrained queueing systems and scheduling policies for maximum throughput in multihop radio networks. IEEE Trans. Automatic Control 37, 1936--1948.
