Use of erlangian distributions for single-server queueing systems

Thoddi C. T. Kotiah · W. A. O’N. Waugh

13 citations0/0 files storedJournal of Applied Probability

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Queuing Theory Analysis Probability and Statistical Research Probability and Risk Models

Abstract

Summary The use of Erlangian distributions has been proposed for the approximation of more general types of distributions of interarrival and service times in single-server queueing systems. Any Erlangian approximation should have the same mean and variance as the distribution it approximates, but it is not obvious what effect the various possible approximants have on the behaviour of the system. A major difference between approximants is their degree of skewness and accordingly, numerical results for various approximants are obtained for (a) the mean time spent by a customer in a simple single-server system, and (b) the mean queue length in a system with bulk service. Skewness is shown to have little effect on these quantities.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

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

Citations in this library

Citation map →

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

References

1954On Queueing Processes with Bulk Service 1967QUEUES AND INVENTORIES 1966Queues and Inventories.1953On the distribution of queueing times 1964Some Recent Work and Further Problems in the Theory of Queues

Cited by

1976A modified erlang approach to approximating GI/G/1 queues 1976A modified erlang approach to approximating GI/G/1 queues

Explore the map →

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

Imported from OpenAlex (CC0) — nothing here is generated.