Taking Account of Correlations Between Streams in Queueing Network Approximations

S.L. Albin, Approximating a point process by a renewal process, II: Superposition arrival processes to queues, Operations Research 32(5) (1984) 1133–1162.

G.R. Bitran and D. Tirupati, Multiproduct Queueing Networks with deterministic routing: Decomposition approaches and the notion of interference, Management Science 34(1) (1988) 75–100.

A.A. Borovkov, Limit theorems for Queueing Networks, Theory of Probability and its Applications 31 (1986) 413–427.

J.A. Buzacott and J.G. Shanthikumar, Stochastic Models of Manufacturing Systems (Prentice-Hall, Englewood Cliffs, 1993).

K.M. Chandy and C.H. Sauer, Approximate methods for analyzing Queueing Network models of computing systems, ACM Computing Surveys 10(3) (1978) 281–317.

E. Çinlar, Introduction to Stochastic Processes (Prentice-Hall, Englewood Cliffs, 1975).

J.G. Dai, On positive recurrence of multiclass Queueing Networks: A unified approach via fluid limit models, Annals of Applied Probability 5(1) (1995) 49–77.

J.G. Dai, V. Nguyen and M.I. Reiman, Sequential bottleneck decomposition: An approximation method for generalized Jackson Networks, Operations Research 42(1) (1994) 119–136.

K.W. Fendick, V.R. Saksena and W. Whitt, Dependence in packet queues, IEEE Transactions on Communications 37 (1989) 1173–1183.

K.W. Fendick, V.R. Saksena and W. Whitt, Investigating dependence in packet queues with the index of dispersion for work, IEEE Transactions on Communications 39 (1991) 1231–1244.

P. Glasserman, Gradient Estimation Via Perturbation Analysis (Kluwer Academic Publishers, Boston, 1991).

S.B. Gershwin, Manufacturing Systems Engineering (Prentice Hall, Englewood Cliffs, 1994).

J.M. Harrison and V. Nguyen, The QNET method for two-moment analysis of open Queueing Networks, Queueing Systems 6 (1990) 1–32.

W.J. Hopp and M.L. Spearman, Factory Physics (Irwin/McGraw-Hill, New York, 2001).

D.L. Iglehart and W. Whitt, Multiple channel queues in heavy Traffic I, Advances in Applied Probability 2 (1970) 150–177.

F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).

S. Kim, The heavy-traffic bottleneck phenomenon under splitting and superposition, European Journal of Operational Research 157(3) (2004) 736–745.

J.F.C. Kingman, The single-server queue in heavy traffic, Proc. Cambridge Phil. Soc. 57 (1961) 902–904.

J.G. Klincewicz and W. Whitt, On approximations for queues, II: Shape constraints, AT&T Bell Laboratories Technical Journal 63(1) (1984) 139–161.

W. Kraemer and M. Langenbach-Belz, Approximate formulae for the delay in the queueing system GI/G/1, Congressbook—The Eighth International Teletraffic Congress (Melbourne, 1976) 235–1–235–8.

P.J. Kuehn, Approximate analysis of general Queueing Networks by decomposition, IEEE Trans. Commun. COM-27(1) (1979) 113–126.

K.T. Marshall, Some inequalities in queueing, Operations Research 16(3) (1968) 651–665.

J. McKenna, D. Mitra and K.G. Ramakrishnan, A class of closed Markovian Queueing Networks: Integral representations, asymptotic expansions, and generalizations, Bell Systems Technical Journal 60(5) (1981) 599–641.

K.G. Ramakrishnan and D. Mitra, An overview of PANACEA, a software package for analyzing Markovian Queueing Networks, Bell Systems Technical Journal 61(10) (1982) 2849–2872.

M.I. Reiman, Open Queueing Networks in heavy traffic, Mathematics of Operations Research 9 (1984) 363–370.

M. Reiser and H. Kobayashi, Accuracy of the diffusion approximation for some queueing systems, IBM Journal of Research and Development 18 (1974) 110–124.

C.H. Sauer and K.M. Chandy, Computer Systems Performance Modeling (Prentice-Hall, Englewood Cliffs, 1981).

B.W. Schmeiser and V. Kachitvichyanukul, Correlation Induction without the Inverse Transformation, in: Proceedings of the Winter Simulation Conference, (1986) pp. 266–274.

M. Schwartz, Computer-Communications Network Design and Analysis (Prentice-Hall, Englewood Cliffs, 1977).

M. Segal and W. Whitt, A Queueing Network analyzer for manufacturing, in: Teletraffic Science for New Cost-Effective Systems, Networks and Services, ITC-12, ed. M. Bonatti (Elsevier Science, Amsterdam, 1989) pp. 1146–1152.

R. Serfozo, Introduction to Stochastic Networks (Springer-Verlag, New York, 1999).

J.G. Shanthikumar and J.A. Buzacott, Open Queueing Network models of dynamic job shops, International Journal of Production Research 19(3) (1981) 255–266.

J. Solberg, A mathematical model of computerized manufacturing systems, in: Proceedings 4-th International Conference on Production Research (Tokyo, 1977).

J. Solberg, CAN-Q user’s guide, Technical Report No. 9 (Revised), NSF Grant APR74 15256, School of Industrial Engineering, Purdue University (1980).

S. Suresh and W. Whitt, Arranging Queues in series: A simulation experiment, Management Science 36 (1990) 1080–1091.

S. Suresh and W. Whitt, The heavy-traffic bottleneck phenomenon in Open Queueing Networks, Operations Research Letters 9(6) (1990) 355–362.

W. Whitt, Approximating a point process by a renewal process, I: Two basic methods, Operations Research 30(1) (1982) 125–147.

W. Whitt, The Queueing Network analyzer, The Bell System Technical Journal 62(9) (1983) 2779–2815.

W. Whitt, Performance of the Queueing Network analyzer, The Bell System Technical Journal 62(9) (1983) 2817–2843.

W. Whitt, On approximations for queues, I: Extremal distributions, AT&T Bell Laboratories Technical Journal 63(1) (1984) 115–138.

W. Whitt, On approximations for queues, III: Mixtures of exponential distributions, AT&T Bell Laboratories Technical Journal 63(1) (1984) 163–175.

W. Whitt, Towards better multi-class parametric-decomposition approximations for Open Queueing Networks, Annals of Operations Research 48 (1994) 221–248.

. Whitt, Variability functions for parametric-decomposition approximations of Queueing Networks, Management Science 41(2) (1995) 1704–1715.