Approximation techniques in the solution of queueing problems
- 1 June 1979
- journal article
- Published by Wiley in Naval Research Logistics Quarterly
- Vol. 26 (2) , 311-326
- https://doi.org/10.1002/nav.3800260211
Abstract
In the study of complex queueing systems, analysis techniques aimed al providing exact solutions become ineffective. Approximation techniques provide an attractive alternative in such cases. This paper gives an overview of different types of approximation techniques available in the literature and points out their relative merits. Also, the need for proper validation procedures of approximation techniques is emphasized.Keywords
This publication has 80 references indexed in Scilit:
- A Simple Approximation to the Average Queue Size in the Time-Dependent M/M/1 QueueJournal of the ACM, 1976
- Generalized state-dependent Erlangian queues: Speculations about calculating measures of effectivenessJournal of Applied Probability, 1975
- Heavy traffic theory for queues with several servers. IJournal of Applied Probability, 1974
- Diffusion limits for congestion modelsJournal of Applied Probability, 1973
- Busy Period Analysis of a Time-Sharing SystemJournal of the ACM, 1972
- Customer average and time average queue lengths and waiting timesJournal of Applied Probability, 1971
- On the Waiting Time in the Queuing System GI/G/1The Annals of Mathematical Statistics, 1970
- Use of erlangian distributions for single-server queueing systemsJournal of Applied Probability, 1969
- Queueing Analysis of the IBM 2314 Disk Storage FacilityJournal of the ACM, 1968
- Queues with time-dependent arrival rates I—the transition through saturationJournal of Applied Probability, 1968