Hostname: page-component-7c8c6479df-27gpq Total loading time: 0 Render date: 2024-03-29T04:39:36.832Z Has data issue: false hasContentIssue false

The stability of a queue with non-independent inter-arrival and service times

Published online by Cambridge University Press:  24 October 2008

R. M. Loynes
Affiliation:
Statistical LaboratoryCambridge

Introduction

Here we shall mention only the results referring to stability. The definitions of the various quantities Tn, Sn, SNn, and the basic hypotheses made concerning their structure will be found in §§ 2·1, 3·1 or 4·1. For convenience we shall introduce some further terminology in this section. The single-server queues {SNn, Tn} arising in connexion with queues in series will be called the component queues, and the queue {Sn, sTn} implicit in the discussion of many-server queues will be called the consolidated queue. We have already in § 2.33 called the single-server queue {Sn, Tn} critical if E(S0-T0) = 0. We shall now call it subcritical if E(S0 − To) > 0 and supercritical if E(S0 − T0) < 0. A system of queues in series is subcritical if each component queue is subcritical, critical if (at least) one component queue is critical and the rest are subcritical, and supercritical if (at least) one component queue is supercritical. A many-server queue will be described in these terms according to the character of its consolidated queue. Finally, a single-server queue {Sn, Tn} will be said to be of type M if it has the property considered in Corollary 1 to Theorem 5: the sequences {Sn} and {Tn} are independent of each other, and one is composed of mutually independent non-constant random variables.

Single-server queues:

(i) Subcritical: stable (Theorem 3).

(ii) Supercritical: unstable (Theorem 2).

(iii) Critical: stable, properly substable, or unstable (examples in §2·33, including one due to Lindley); unstable if type M (Theorem 5, Corollary 1).

Queues in series:

(i) Subcritical: stable (Theorem 7).

(ii) Supercritical: unstable (Theorem 7).

(iii) Critical: stable, properly substable, or unstable, if the component queues are substable (examples in § 3·2); unstable if any component queue is unstable (Theorem 7), and in particular if any critical component queue is of type M (Theorem 7, Corollary).

Many-server queues:

(i) Subcritical: stable or properly substable (Theorem 8, and example in § 4·3).

(ii) Supercritical: unstable (Theorem 8).

(iii) Critical: stable, properly substable, or unstable, if consolidated queue is substable (examples in § 4·3); unstable if consolidated queue unstable (Theorem 8), and in particular if this is of type M (Theorem 8, Corollary).

From Lemma 1 it follows that none of these queues can be properly substable if all the servers are initially unoccupied.

Type
Research Article
Copyright
Copyright © Cambridge Philosophical Society 1962

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.)

References

REFERENCES

(1)Birkhoff, G., Lattice theory (New York, 1948).Google Scholar
(2)Doob, J. L., Stochastic processes (New York, 1953).Google Scholar
(3)Kiefer, J., and Wolfowitz, J., Trans. American Math. Soc. 78 (1955), 1.CrossRefGoogle Scholar
(4)Lindley, D. V., Proc. Cambridge Philos. Soc. 48 (1952), 277.Google Scholar
(5)Loève, M., Probability theory (2nd ed.) (New York, 1960).Google Scholar
(6)Sacks, J., Ann. Math. Statist. 31 (1960), 579.CrossRefGoogle Scholar