Explicit Steady-State Solutions to Some Elementary Queueing Models.
Abstract
Several simple queueing models, which are commonly used as text book examples, have explicit steady-state solutions, which to date have escaped notice. These solutions are easily computable. In addition to their didactic interest, the results, presented here, are also useful in the analysis of more complex queueing models. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1980
- Accession Number
- ADA089842
Entities
People
- Marcel F. Neuts
Organizations
- University of Delaware