Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-10T14:46:24.358Z Has data issue: false hasContentIssue false
  • English
  • Français

Sufficient conditions for stability of longest-queue-first scheduling: second-order properties using fluid limits

Part of: Special processes Stochastic processes Operations research and management science

Published online by Cambridge University Press:  01 July 2016

Antonis Dimakis  and
Jean Walrand
Antonis Dimakis*
Affiliation:
University of California, Berkeley
Jean Walrand*
Affiliation:
University of California, Berkeley
*
∗ Postal address: Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720, USA.
∗ Postal address: Department of Electrical Engineering and Computer Sciences, University of California, Berkeley, CA 94720, USA.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the ‘Save PDF’ action button.

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.

Keywords

Generalized switchlongest-queue-first schedulingMaxWeight schedulingthroughput optimalitystabilitylocal poolingfluid limitlocal fluid limitsecond-order condition

MSC classification

Primary: 60K25: Queueing theory
Secondary: 90B15: Network models, stochastic 60G17: Sample path properties
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 38 , Issue 2 , June 2006 , pp. 505 - 521
Copyright
Copyright © Applied Probability Trust 2006 

References

Andrews, M. et al. (2004). Scheduling in a queuing system with asynchronously varying service rates. Prob. Eng. Inf. Sci. 18, 191–217.Google Scholar
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.Google Scholar
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.Google Scholar
Durrett, R. (2004). Probability: Theory and Examples, 3rd edn. Duxbury, Belmont, CA.Google Scholar
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.Google Scholar
Malyshev, V. A. (1993). Networks and dynamical systems. Adv. Appl. Prob. 25, 140–175.Google Scholar
McKeown, N. (1995). Scheduling algorithms for input-queued cell switches. , University of California, Berkeley.Google Scholar
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. Suhov, Yu. M., American Mathematical Society, Providence, RI, pp. 185–202.Google Scholar
Stolyar, A. (2004). MaxWeight scheduling in a generalized switch: state space collapse and workload minimization in heavy traffic. Ann. Appl. Prob. 14, 1–53.Google Scholar
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.Google Scholar
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–1936.Google Scholar