Queueing Theory With Reneging

Abstract

The literature on queueing with reneging is reviewed. Only random (Poisson) arrivals and unlimited capacity queues are considered, although some of the references also contain results for other arrival distributions or finite capacity queues. The paper focuses on the probability of service under steady state conditions; results for other metrics such as the expected waiting time may be found in the references. Analytic results, suitable for implementation in a spreadsheet model, are summarised. These formulae would be suitable for use in exploratory analysis, particularly in situations where queueing theory forms only a part of the model of a defence 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 — 10 citations exist upstream.

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