Optimal buffer design of an M/G/s queue with finite capacity

Communications in Statistics. Part C: Stochastic Models

Volumn 12, Issue 1, 1996, Pages 165-180

  Kimura, Toshikazu ^a  

^a HOKKAIDO UNIVERSITY   (Japan)

Author keywords

Approximations; Buffer design; Conditioning heuristic; Erlang loss formula, convex stochastic order; Loss probability; M G s queue; Small tail asymptotics

Indexed keywords

ASYMPTOTIC APPROXIMATION; LOSS SYSTEM; OPTIMAL APPROXIMATION; OPTIMAL DESIGN; QUEUEING SYSTEM; TAIL PROBABILITY;

RANDOM PROCESSES;

EID: 0030372045     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326349608807378     Document Type: Article

References (26)

1. Abate, J., G.L. Choudhury and W. Whitt, Asymptotics for steady-state tail probabilities in structured Markov queueing models, Stochastic Models 10 (1994) 99-143.
2. Abate, J., G.L. Choudhury and W. Whitt, Exponential approximations for tail probabilities in queues, I: waiting times, Operations Research, to appear.
3. Cooper, R.B., Introduction to Queueing Theory, 2nd ed. (North-Holland, New York, 1981).
4. de Kok, A.G. and H.C. Tijms, A two-moment approximation for a buffer design problem requiring a small rejection probability, Performance Evaluation 5 (1985) 77-84.
5. Heyman, D.P., Comments on a queueing inequality, Management Science 26 (1980) 956-959.
6. Heyman, D.P. and M.J. Sobel, Stochastic Models in Operations Research, Vol. I: Stochastic Processes and Operating Characteristics (McGraw-Hill, New York, 1982).
7. Hokstad, P., Approximations for the M/G/m queue, Operations Research 26 (1978) 510-523.
8. Kimura, T., A two-moment approximation for the mean waiting time in the GI/G/s queue, Management Science 32 (1986) 751-763.
9. Kimura, T., Refining Cosmetatos' approximation for the mean waiting time in the M/D/s queue, Journal of the Operational Research Society 42 (1991) 595-603.
10. Kimura, T., Equivalence relations in the approximations for the finite capacity M/G/s queue, Discussion Paper Series A, No. 15, Faculty of Economics, Hokkaido University, Sapporo, 1993.
11. Kimura, T., Approximations for multi-server queues: system interpolations, Queueing Systems 17 (1994) 347-382.
12. Kimura, T., A transform-free approximation for the finite capacity M/G/s queue, Operations Research, to appear.
13. Miyazawa, M., Approximation of the queue-length distribution of an M/GI/s queue by the basic equations, Journal of Applied Probability 23 (1986) 443-458.
14. Miyazawa, M. and J.G. Shanthikumar, Monotonicity of the loss probabilities of single server finite queues with respect to convex order of arrival or service processes, Probability in the Engineering and Information Sciences 5 (1991) 43-52.
15. Miyazawa, M. and H.C. Tijms, Comparison of two approximations for the loss probability in finite-buffer queues, Probability in the Engineering and Information Sciences 7 (1993) 19-27.
16. Neuts, M.F. and Y. Takahashi, Asymptotic behavior of the stationary distributions in the GI/PH/c queue with heterogeneous servers, Zeitschrift für Wahrscheinlichkeitstheorie und Verwandte Gebiete 57 (1981) 441-452.
17. Sakasegawa, H., M. Miyazawa and G. Yamazaki, Evaluating the over-flow probability using the infinite queue, Management Science 39 (1993) 1238-1245.
18. Seelen, L.P., H.C. Tijms and M.H. van Hoorn, Tables for Multi-Server Queues (North-Holland, Amsterdam, 1985).
19. Shaked M. and J.G. Shanthikumar, Stochastic Orders and Their Applications (Academic Press, New York, 1994).
20. Sobel, M.J., Simple inequalities for multiserver queues, Management Science 26 (1980) 951-956.
21. Takahashi, Y., Asymptotic exponentiality of the tail of the waiting-time distribution in a PH/PH/c queue, Advances in Applied Probability 13 (1981) 619-630.
22. Tijms, H.C. and M.H. van Hoorn, Computational methods for single-server and multi-server queues with Markovian input and general service times, in: Applied Probability - Computer Science, The Interface, R.L. Disney and T.J. Ott, eds., Vol. II, pp. 71-102 (Birkhäuser, Boston, 1982).
23. Tijms, H.C., Heuristics for finite-buffer queues, Probability in the Engineering and Information Sciences 6 (1992) 277-285.
24. Tijms, H.C., Stochastic Models: An Algorithmic Approach (Wiley, New York, 1994).
25. Whitt, W., Heavy-traffic approximations for service systems with blocking, AT&T Bell Laboratories Technical Journal 63 (1984) 689-708.
26. Whitt, W., Approximations for the GI/G/m queue, Production and Operations Management 2 (1993) 114-161.