Industrial Engineering and Management Systems

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

Proposal of Approximation Analysis Method for GI/G/1 Queueing System

  • Published : 2008.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

There have been some approximation analysis methods for a GI/G/1 queueing system. As one of them, an approximation technique for the steady-state probability in the GI/G/1 queueing system based on the iteration numerical calculation has been proposed. As another one, an approximation formula of the average queue length in the GI/G/1 queueing system by using the diffusion approximation or the heuristics extended diffusion approximation has been developed. In this article, an approximation technique in order to analyze the GI/G/1 queueing system is considered and then the formulae of both the steady-state probability and the average queue length in the GI/G/1 queueing system are proposed. Through some numerical examples by the proposed technique, the existing approximation methods, and the Monte Carlo simulation, the effectiveness of the proposed approximation technique is verified.

Keywords

References

  1. Heyman, D. P. (1975), A Diffusion Model Approximation for the GI/G/1 Queues in Heavy Traffic, The Bell System Technical Journal, 54, 637-1646.
  2. Kawamura, T. (1961), Equilibrium Behavior of Certain Queueing Systems and Numerical Tables, General Culture, Keio University, 8, 7-18.
  3. Kobayashi, H. (1974), Applications of the Diffusion Approximations to Queueing Networks, Part I: Equilibrium Queue Distribution, Journal of the Association for Computing Machinery, 21(2), 316-328. https://doi.org/10.1145/321812.321827
  4. Kramer, W. and Lagenbach-Belz, M. (1976), Approximate Formulae for the Delay in the Queueing System GI/G/1, Congressbook, The 8th International Teletraffic Congress, Melbourne, 1-235.
  5. Ott, T. J. (1987), On the Stationary Waiting-time Distribution in the GI/G/1 Queue, I: Transform Methods and Almost-phase-type Distribution, Advances in Applied Probability, 19, 240-265. https://doi.org/10.2307/1427382
  6. Seelen, L. P. (1986), An Algorithm for Ph / Ph / c Queues, European Journal of Operational Research, 23, 118-127. https://doi.org/10.1016/0377-2217(86)90222-5
  7. Shanthikumar, J. G. and Buzacott, J. A. (1980), On the Approximations to the Single Server Queue, International Journal of Production Research, 18(6), 761-773. https://doi.org/10.1080/00207548008919705
  8. Takahashi, Y. and Takami, Y. (1976), A Numerical Method for the Steady-state Probabilities of a GI /G / C Queueing System in a General Class, Journal of the Operations Research Society of Japan, 19(2), 147-157. https://doi.org/10.15807/jorsj.19.147
  9. Tijms, H. C. (1994), Stochastic Models: An Algorithmic Approach, John Wiley and Sons, New York.