A Two-Moment Approximation for the GI/G/c Queue with Finite Capacity

References

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