The Annals of Applied Probability
- Ann. Appl. Probab.
- Volume 2, Number 4 (1992), 987-1008.
Finiteness of Waiting-Time Moments in General Stationary Single-Server Queues
Conditions for the finiteness of waiting-time moments in queues with a renewal arrival process were established by Kiefer and Wolfowitz. This paper establishes analogous conditions, some necessary, and some sufficient, in single-server queues with a general stationary ergodic arrival process. The feature of the arrival process in contributing to delay is any tendency to form clumps (or, clusters) of arrivals. In the more familiar setting of a renewal arrival process, the regenerative nature of the process severely limits any such tendency. More generally, strong mixing conditions on the sequence of interarrival times are used to give a sufficient condition for the finiteness of waiting-time moments. The details are worked out for the two important examples where the arrivals are generated by a Cox process and where the sequence of interarrival times contains an embedded stationary regenerative phenomenon. The latter example sheds light on the recent work of Wolff and the range of examples and counterexamples used to elaborate the theoretical results presented.
Ann. Appl. Probab., Volume 2, Number 4 (1992), 987-1008.
First available in Project Euclid: 19 April 2007
Permanent link to this document
Digital Object Identifier
Mathematical Reviews number (MathSciNet)
Zentralblatt MATH identifier
Daley, D. J.; Rolski, T. Finiteness of Waiting-Time Moments in General Stationary Single-Server Queues. Ann. Appl. Probab. 2 (1992), no. 4, 987--1008. doi:10.1214/aoap/1177005585. https://projecteuclid.org/euclid.aoap/1177005585