Approximation of the queue-length distribution of an M/GI/s queue by the basic equations
Author:
- Masakiyo MiyazawaMMMasakiyo Miyazawa
- 1 June 1986
- journal article
- Published by Cambridge University Press (CUP) in Journal of Applied Probability
- Vol. 23 (2) , 443-458
Abstract
We give a unified way of obtaining approximation formulas for the steady-state distribution of the queue length in the M/GI/s queue. The approximations of Hokstad (1978) and Case A of Tijms et al. (1981) are derived again. The main interest of this paper is in considering the theoretical meaning of the assumptions given in the literature. Having done this, we derive new approximation formulas. Our discussion is based on one version of the steady-state equations, called the basic equations in this paper. The basic equations are derived for M/GI/s/k with finite and infinite k. Similar approximations are possible for M/GI/s/k (k < +∞).Keywords
This publication has 14 references indexed in Scilit:
- Tables for M/G/c queuing systems with phase-type serviceEuropean Journal of Operational Research, 1984
- The derivation of invariance relations in complex queueing systems with stationary inputsAdvances in Applied Probability, 1983
- Diffusion Approximation for an M/G/m QueueOperations Research, 1983
- A Light-Traffic Theorem for Multi-Server QueuesMathematics of Operations Research, 1983
- Asymptotic exponentiality of the tail of the waiting-time distribution in a Ph/Ph/C queueAdvances in Applied Probability, 1981
- Approximations for the steady-state probabilities in the M/G/c queueAdvances in Applied Probability, 1981
- A formal approach to queueing processes in the steady state and their applicationsJournal of Applied Probability, 1979
- Approximations in finite-capacity multi-server queues by Poisson arrivalsJournal of Applied Probability, 1978
- Approximations for M/G/s queuesMathematische Operationsforschung und Statistik, 1976
- A relation between stationary queue and waiting time distributionsJournal of Applied Probability, 1971