The Waiting Time Process for a Certain Correlated Queue

Abstract

A brief description is given of a problem that arose in a nonqueuing context but that can be interpreted in queuing terms. The result is the unusual single-server system in which the length of a customer's service is determined by the length of the interarrival interval separating himself and his predecessor. The main result is the distribution of waiting time, and its moments. It is shown numerically that this pattern of server behavior results in a drastic reduction of the mean and variance of the waiting time as compared with a conventional M/M/l system.

Cite this work

No public copy is stored for this record, so only the metadata is cited.

Stored only when both papers are in the corpus — 49 citations exist upstream.

Papers that cite the same references — the relational fallback while embeddings are still backfilling.