The Annals of Mathematical Statistics

Imbedded Markov Chain Analysis of a Waiting-Line Process in Continuous Time

Donald P. Gaver, Jr.

Full-text: Open access


Bunches of individual customers approach a single servicing facility according to a stationary compound Poisson process. The resulting waiting line process is studied in continuous time by the method of the imbedded Markov chain, cf. Kendall [7], [8], and of renewal theory, cf. Blackwell [3], Feller [5], and Smith [9]. Busy period phenomena are discussed, cf. Theorem 1, in which the transform of the joint d.f. of busy period duration and the number of departures in that duration is expressed as the root $x_1(s, z)$ of a functional equation, a generalization of a result of Takacs [12]. In terms of $x_1(s, z)$ "zero-avoiding" transition probabilities are characterized. A simple model for "instantaneous defection" is analyzed. Using renewal theory, ergodic properties of waiting line lengths and waiting times are discussed for the "general" process, in which idle and busy periods recur.

Article information

Ann. Math. Statist., Volume 30, Number 3 (1959), 698-720.

First available in Project Euclid: 27 April 2007

Permanent link to this document

Digital Object Identifier

Mathematical Reviews number (MathSciNet)

Zentralblatt MATH identifier



Gaver, Donald P. Imbedded Markov Chain Analysis of a Waiting-Line Process in Continuous Time. Ann. Math. Statist. 30 (1959), no. 3, 698--720. doi:10.1214/aoms/1177706200.

Export citation