Heavy Traffic Analysis of Two Coupled Processors

Queueing Systems

Volumn 43, Issue 3, 2003, Pages 173-220

  Knessl, Charles ^a   Morrison, John A ^b  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

^b LUCENT TECHNOLOGIES   (United States)

Author keywords

Asymptotics; Diffusion approximation; Heavy traffic

Indexed keywords

ASYMPTOTICS; DIFFUSION APPROXIMATIONS; HEAVY TRAFFIC LIMIT; HEAVY TRAFFICS; INTEGRAL REPRESENTATION; NUMERICAL PROPERTIES; PARALLEL QUEUES; STEADY-STATE DENSITY;

QUEUEING THEORY;

EID: 0037233953     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/A:1022816410813     Document Type: Article

References (23)

1. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the symmetric shortest queue problem, Comm. Statist. Stochastic Models 6 (1990) 691-713.
2. I.J.B.F. Adan, J. Wessels and W.H.M. Zijm, Analysis of the asymmetric shortest queue problem, Queueing Systems 8 (1991) 1-58.
3. F. Baccelli and G. Fayolle, Analysis of models reducible to a class of diffusion processes in the positive quarter plane, SIAM J. Appl. Math. 47 (1987) 1367-1385.
4. J.W. Cohen and O.J. Boxma, Boundary Value Problems in Queueing System Analysis (North-Holland, Amsterdam, 1983).
5. G. Fayolle and R. Iasnogorodski, Two coupled processors: The reduction to a Riemann Hilbert problem, Z. Wahrsch. 47 (1979) 325-351.
6. L. Flatto, Two parallel queues created by arrivals with two demands II, SIAM J. Appl. Math. 45 (1985) 861-878.
7. L. Flatto and S. Hahn, Two parallel queues created by arrivals with two demands I, SIAM J. Appl. Math. 44 (1984) 1041-1054.
8. L. Flatto and H. McKean, Two queues in parallel, Comm. Pure Appl. Math. 30 (1977) 255-263.
9. G.J. Foschini, Equilibria for diffusion models for pairs of communicating computers-symmetric case, IEEE Trans. Inform. Theory 28 (1982) 273-284.
10. J.M. Harrison and M.I. Reiman, On the distribution of multi-dimensional reflected Brownian motion, SIAM J. Appl. Math. 41 (1981) 345-361.
11. F.I. Karpelevich and A.Y. Kreinin, Two-phase queueing system GI/G/1 → G′/1/∞ under heavy traffic conditions, Theory Probab. Appl. 26 (1981) 293-313.
12. C. Knessl, On the diffusion approximation to two parallel queues with processor sharing, IEEE Trans. Automat. Control 36 (1991) 1356-1367.
13. C. Knessl, On the diffusion approximation to a fork and join queueing model, SIAM J. Appl. Math. 51 (1991) 160-171.
14. C. Knessl, A diffusion model for two parallel queues with processor-sharing: transient behavior and asymptotics, J. Appl. Math. Stochastic Anal. 12 (1999) 311-338.
15. C. Knessl and C. Tier, Two tandem queues with general renewal input I: Diffusion approximation and integral representations, SIAM J. Appl. Math. 59 (1999) 1917-1959.
16. C. Knessl and C. Tier, Two tandem queues with general renewal input II: Asymptotic expansions for the diffusion model, SIAM J. Appl. Math. 59 (1999) 1960-1997.
17. A.G. Konheim, I. Meilijson and A. Melkman, Processor-sharing of two parallel lines, J. Appl. Probab. 18 (1981) 952-956.
18. V.A. Malyshev, An analytic method in the theory of two-dimensional positive random walks, Sibirskii Math. Zh. 13 (1972) 1314-1329.
19. J.A. Morrison, Diffusion approximation for head-of-the-line processor sharing for two parallel queues, SIAM J. Appl. Math. 53 (1993) 471-490.
20. G.F. Newell, Approximate Behavior of Tandem Queues (Springer, New York, 1979).
21. E. Skudrzyk, The Foundations of Acoustics (Springer, New York, 1971).
22. X. Tan and C. Knessl, A fork-join queueing model: Diffusion approximation, integral representations and asymptotics, Queueing Systems 22 (1996) 287-322.
23. Z. Zhang, Analytic results for waiting time and system size distributions in two parallel queueing systems, SIAM J. Appl. Math. 50 (1990) 1176-1193.