TABLES AND CURVES OF THE ERLANG DISTRIBUTION FUNCTION FOR K=1 THROUGH K=25,
Abstract:
Experience has shown that many queueing situations, which are difficult or impossible to treat analytically, may be handled quite readily by simulation. An early consideration must be a choice of arrival and service distributions and the methods one uses for their simulation. This paper discusses the Erlang family of arrival and service time distributions which is highly useful in queueing applications. Included are tables and curves of the cumulative Erlang distribution function and directions for their use in the simulation of waiting line situations.
Security Markings
DOCUMENT & CONTEXTUAL SUMMARY
Distribution:
Approved For Public Release
RECORD
Collection: TR