Research indexJournal article
Queueing output processes
Daley
Advances in Applied Probability1 Jun 1976
Queueing output processes
Daley · Advances in Applied Probability · 1976 · Subscription
The full text is at the publisher
You can read the abstract here, or open it at the publisher.
Abstract
The paper reviews various aspects, mostly mathematical, concerning the output or departure process of a general queueing system G/G/s/N with general arrival process, mutually independent service times, s servers (1 ≦ s ≦ ∞), and waiting room of size N (0 ≦ N ≦ ∞), subject to the assumption of being in a stable stationary condition. Known explicit results for the distribution of the stationary inter-departure intervals { D n } for both infinite and finite-server systems are given, with some discussion on the use of reversibility in Markovian systems. Some detailed results for certain modified single-server M / G /1 systems are also available. Most of the known second-order properties of { D n } depend on knowing that the system has either Poisson arrivals or exponential service times. The related stationary point process for which { D n } is the stationary sequence of the corresponding Palm–Khinchin distribution is introduced and some of its second-order properties described. The final topic discussed concerns identifiability, and questions of characterizations of queueing systems in terms of the output process being a renewal process, or uncorrelated, or infinitely divisible.