Hostname: page-component-78c5997874-m6dg7 Total loading time: 0 Render date: 2024-11-11T06:09:23.418Z Has data issue: false hasContentIssue false
  • English
  • Français

The probability of large queue lengths and waiting times in a heterogeneous multiserver queue II: Positive recurrence and logarithmic limits

Part of: Markov processes Special processes Limit theorems

Published online by Cambridge University Press:  01 July 2016

John S. Sadowsky
John S. Sadowsky*
Affiliation:
Arizona State University
*
* Postal address: Department of Electrical Engineering, Arizona State University, Tempe, AZ 85287–5706, USA.
Get access Rights & Permissions [Opens in a new window]

Abstract

We continue our investigation of the batch arrival-heterogeneous multiserver queue begun in Part I. In a general setting we prove the positive Harris recurrence of the system, and with no additional conditions we prove logarithmic tail limits for the stationary queue length and waiting time distributions.

Keywords

QUEUEING THEORYHARRIS RECURRENT MARKOV CHAINSFOSTER-LYAPUNOV THEORYMARKOV ADDITIVE PROCESSESRENEWAL THEORY

MSC classification

Primary: 60K25: Queueing theory
Secondary: 60F10: Large deviations 60J05: Discrete-time Markov processes on general state spaces 60K15: Markov renewal processes, semi-Markov processes 60K20: Applications of Markov renewal processes (reliability, queueing networks, etc.)
Type
General Applied Probability
Information
Advances in Applied Probability , Volume 27 , Issue 2 , June 1995 , pp. 567 - 583
Copyright
Copyright © Applied Probability Trust 1995 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Footnotes

Supported by the National Science Foundation (NCR-9003007).

References

Charlot, F., Ghidouche, M. and Hamami, M. (1978) Irréductibilité et récurrence au sens de Harris des «temps d'attente» des files GI/G/q. Z. Wahrscheinlichkeitsth. 43, 187–203.Google Scholar
Feller, W. (1971) An Introduction to Probability and its Applications, Vol. II. Wiley, New York.Google Scholar
Georgiadis, L. and Szpankowski, W. (1992) Stability of token passing rings. Queueing Systems 11, 7–33.CrossRefGoogle Scholar
Kiefer, J. and Wolfowitz, J. (1955) On the theory of queues with many servers. Trans. Amer. Math. Soc. 78, 1–18.Google Scholar
Loynes, R. M. (1962) The stability of a queue with non-independent inter-arrival and service times. Proc. Camb. Phil. Soc. 58, 497–520.CrossRefGoogle Scholar
Malyšhev, V. A. and Men'ŠIkov, M. V. (1982) Ergodicity continuity and analyticity of countable Markov chains. Trans. Moscow Math. 1, 1–48.Google Scholar
Meyn, S. and Dwon, D. (1993) Stability of generalized Jackson networks. Ann. Appl. Prob. Google Scholar
Meyn, S. P. and Tweedie, R. L. (1992) Stability of Markovian processes I: criterion for discrete time chains. Adv. Appl. Prob. 24, 542–574.Google Scholar
Meyn, S. P. and Tweedie, R. L. (1993a) Markov Chains and Stochastic Stability. Springer-Verlag, New York.CrossRefGoogle Scholar
Meyn, S. P. and Tweedie, R. L. (1993b) State-dependent criteria for convergence of Markov chains. Ann. Appl. Prob. Google Scholar
Nummelin, E. (1984) General Irreducible Markov Chains and Non-negative Operators. Cambridge University Press.Google Scholar
Szpankowski, W. (1994) Stability conditions for some distributed systems: Buffered random access systems. Adv. Appl. Prob. 26, 498–515.Google Scholar