Asymptotic properties of first passage times for two tandem queues: Time to empty the system

Communications in Statistics. Part C: Stochastic Models

Volumn 12, Issue 4, 1996, Pages 633-672

  Knessl, Charles ^a   Tier, Charles ^a  

^a UNIVERSITY OF ILLINOIS AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039245129     PISSN: 08820287     EISSN: None     Source Type: Journal    
DOI: 10.1080/15326349608807404     Document Type: Article

References (10)

1. C. Knessl and C. Tier, Asymptotic properties of first passage times for Jackson networks I: buildup of large queue lengths, Comin. Statist-Stochastic Models, 11, 1995, 133-162.
2. M. Cottrell, J.C. Fort and G. Malgouyres, Large deviations and rare events in the study of stochastic algorithms, IEEE Trans. Auto. Control, 28, 1983, 907-920.
3. P. Tsoucas, Rare events in series of queues, J. Appl. Prob., 29, 1992, 168-175.
4. V. Anantharam, P. Heidelberger and P. Tsoucas, Analysis of rare events in continuous time Markov chains via time reversal and fluid approximation, IBM Research Report, RC 16280 (no. 71858).
5. C.M. Bender and S.A. Orszag, Advanced Mathematical Methods for Scientists and Engineers, McGraw-Hill, New York, 1978.
6. J. Kevorkian and J.D. Cole, Perturbation Methods in Applied Mathematics, New York, 1981.
7. J.P.C. Blanc, The relaxation time of two queueing systems in series, Comm. Statist-Stochastic Models, 1, 1985, 1-16.
8. C. Knessl and C. Tier, Approximations to the moments of the sojourn time in a tandem queue with overtaking, Comm. Statist-Stochastic Models, 6, 1990, 499-524.
9. L. Flatto, Two parallel queues created by arrivals with two demand II, SIAM J. Appl. Math., 45, 1985, 861-878.
10. J.A. Morrison, Diffusion approximation for head-of-the-line processor sharing on two parallel queues, SIAM J. Appl. Math., 53, 1993, 471-490.