The heavy-traffic bottleneck phenomenon under splitting and superposition

European Journal of Operational Research

Volumn 157, Issue 3, 2004, Pages 736-745

  Kim, Sunkyo ^a  

^a Ajou University   (South Korea)

Author keywords

Decomposition approximation; Innovations method; Queueing networks; Simulation; Variability function

Indexed keywords

APPROXIMATION THEORY; FUNCTIONS; INFORMATION ANALYSIS; MARKOV PROCESSES; MATHEMATICAL MODELS; PROCESS CONTROL; QUEUEING NETWORKS;

MARKOVIAN ROUTING; PARAMETRIC DECOMPOSITION; SERVER QUEUES; TRAFFIC EQUATIONS;

OPERATIONS RESEARCH;

EID: 2342647486     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(03)00299-6     Document Type: Article

References (18)

1. Albin S.L. Approximating a point process by a renewal process. II. Superposition arrival processes to queues. Operations Research. 32:1984;1133-1162.
2. Bitran G.R., Tirupati D. Multiproduct queueing networks with deterministic routing: Decomposition approach and the notion of interference. Management Science. 34:1988;75-100.
3. Fendick K.W., Saksena V.R., Whitt W. Dependence in packet queues. IEEE Transactions on Communications. 37:1989;1173-1183.
4. Fendick K.W., Saksena V.R., Whitt W. Investigating dependence in packet queues with the index of dispersion for work. IEEE Transactions on Communications. 39:1991;1231-1244.
5. Kraemer, W., Langenbach-Belz, M., 1976. Approximate formulae for the delay in the queueing system GI/G/1. Congressbook, Eighth International Teletraffic Congress, Melbourne, pp. 235.1-235.8.
6. Kuehn P. Approximate analysis of general queueing networks by decomposition. IEEE Transactions on Communications. 27:1979;113-126.
7. Muralidharan, R., O'Cinneide, C., Kim, S., 2002. Taking account of correlation between streams in queueing network approximations, submitted for publication.
8. Shanthikumar J.G., Buzacott J.A. Open queueing network models of dynamic job shops. International Journal of Production and Research. 19:1981;255-266.
9. Sriram K., Whitt W. Characterizing superposition arrival processes in packet multiplexers for voice and data. IEEE Journal on Selected Areas in Communications. SAC-4(6):1986;833-846.
10. Suresh S., Whitt W. Arranging queues in series: A simulation experiment. Management Science. 36:1990;1080-1091.
11. Suresh S., Whitt W. The heavy-traffic bottleneck phenomenon in open queueing networks. Operations Research Letters. 9:1990;355-362.
12. Whitt W. Approximating a point process by a renewal process. I. Two basic methods. Operations Research. 30:1982;124-147.
13. Whitt W. The queueing network analyzer. The Bell System Technical Journal. 62:1983;2779-2815.
14. Whitt W. Performance of the QNA. The Bell System Technical Journal. 62:1983;2816-2843.
15. Whitt W. Approximations for departure processes and queues in a series. Naval Research Logistics Quarterly. 31:1984;499-521.
16. Whitt W. Towards better multi-class parametric-decomposition approximations for open queueing networks. Annals of Operations Research. 48:1994;221-248.
17. Whitt W. Variability functions for parametric-decomposition approximations of queueing networks. Management Science. 41:1995;1704-1715.
18. Wolff R. Stochastic Modeling and the Theory of Queues. 1989;Prentice-Hall, Englewood Cliffs, NJ.