A two-moment approximation for the GI/G/c queue with finite capacity

INFORMS Journal on Computing

Volumn 17, Issue 1, 2005, Pages 75-81

  Choi, Dae W ^a   Kim, Nam K ^b   Chae, Kyung C ^a  

^a Korea Advanced Institute of Science and Technology (KAIST)   (South Korea)

^b Chonnam National University   (South Korea)

Author keywords

Approximations; Finite capacity; Loss probability; Multiple servers; Optimal buffer design; Queue length distribution; Queues

Indexed keywords

APPROXIMATION THEORY; FINITE AUTOMATA; PROBABILITY; SENSITIVITY ANALYSIS; SERVERS; TREES (MATHEMATICS);

FINITE CAPACITY; LOSS PROBABILITY; MULTIPLE SERVERS; OPTIMAL BUFFER DESIGN; QUEUE-LENGTH DISTRIBUTION;

QUEUEING NETWORKS;

EID: 14644428946     PISSN: 10919856     EISSN: 15265528     Source Type: Journal    
DOI: 10.1287/ijoc.1030.0058     Document Type: Article

References (14)

1. Berger, A., W. Whitt. 1992. Comparisons of multi-server queues with finite waiting rooms. Stochastic Models 8 719-732.
2. Franken, P., D. König, U. Arndt, V. Schmidt. 1982. Queues and Point Processes. John Wiley and Sons, New York.
3. Hokstad, P. 1975. The GI/M/m queue with finite waiting room. J. Appl. Probab. 12 779-792.
4. Kim, N. K., K. C. Chae. 2003. Transform-free analysis of the GI/G/1/K queue through the decomposed Little's formula. Comput. Oper. Res. 30 353-365.
5. Kimura, T. 1994. Approximations for multi-server queues: System interpolations. Queueing Systems 17 347-382.
6. Kimura, T. 1996a. A transform-free approximation for the finite capacity M/G/s queue. Oper. Res. 44 984-988.
7. Kimura, T. 1996b. Optimal buffer design of an M/G/s queue with finite capacity. Comm. Statist.-Stochastic Models 12 165-180.
8. Kimura, T. 2002. Diffusion approximations for queues with Markovian bases. Ann. Oper. Res. 113 27-40.
9. Kriman, V. 1995. Analysis of sensitivity of the GI/GI/m queue to buffer size: The score function method. Stochastic Models 11 171-194.
10. Miyazawa, M. 1986. Approximation of the queue-length distribution of an M/GI/s queue by the basic equations. J. Appl. Probab. 23 443-458.
11. Miyazawa, M., H. C. Tijms. 1993. Comparison of two approximations for the loss probability in finite-buffer queues. Probab. Engrg. Inform. Sci. 7 19-27.
12. Seelen, L. P., H. C. Tijms, M. H. Van Hoorn. 1985. Tables for Multi-Server Queues. Elsevier, North-Holland, Amsterdam, The Netherlands.
13. Tijms, H. C. 1994. Stochastic Models: An Algorithm Approach. Wiley, New York.
14. Wolff, R. W. 1989. Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.