Stationary tail probabilities in exponential server tandems with renewal arrivals

Queueing Systems

Volumn 22, Issue 3-4, 1996, Pages 203-247

  Ganesh, A ^a   Anantharam, V ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Large deviations; Rare events; Tandem queues

Indexed keywords

CONSTRAINED OPTIMIZATION; CONVEX OPTIMIZATION;

CONSTRAINED CONVEX OPTIMIZATIONS; EXPONENTIAL SERVERS; LARGE DEVIATIONS; QUEUE LENGTH DISTRIBUTION; RARE EVENTS; STATIONARY QUEUE LENGTH DISTRIBUTION; TAIL PROBABILITY; TANDEM QUEUE;

QUEUEING THEORY;

EID: 0030490667     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/BF01149173     Document Type: Article

References (23)

1. V. Anantharam, The optimal buffer allocation problem, IEEE Trans. Inform. Theory 35 (1989) 721-725.
2. V. Anantharam and A. Ganesh, Correctness within a constant of an optimal buffer allocation rule of thumb, IEEE Trans. Info. Theory 40 (1994) 871-882.
3. V. Anantharam, P. Heidelberger and P. Tsoucas, Analysis of rare events in continuous time Markov chains via time reversal and fluid approximations, IBM Research Report RC 16280 (1990).
4. S. Asmussen, Applied Probability and Queues (Wiley, 1987).
5. D. Bertsimas, I. Paschalidis and J. Tsitsiklis, On the large deviations behaviour of acyclic networks of G/G/1 queues, submitted to Ann. Appl. Prob.
6. R. Blahut, Principles and Practice of Information Theory (Addison-Wesley, 1987).
7. C.S. Chang, Stability, queue length and delay of deterministic and stochastic queueing networks, IEEE Trans. Autom.Control 39 (1994) 913-931.
8. C.S. Chang, Sample path large deviations and intree networks, IBM Research Report RC 19118 (1993).
9. C.S. Chang, P. Heidelberger, S. Juneja and P. Shahabuddin, Effective bandwidth and fast simulation of ATM intree networks, Perform. Eval. 20 (1994) 45-66.
10. G. de Veciana and J. Walrand, Effective bandwidths: call admission, traffic policing and filtering for ATM networks, to appear in Queueing Systems.
11. G. de Veciana and J. Walrand, Decoupling bandwidths for networks: a decomposition approach to resource management, Memorandum No. UCB/ERL M93/50, University of California, Berkeley (1993).
12. A. Dembo and O. Zeitouni, Large Deviations Techniques and Applications (Jones and Bartlett, 1993).
13. N. Duffield and N. O'Connell, Large deviations and overflow probabilities for the general single server queue, with applications, to appear in Proc. Camb. Phil. Soc.
14. M.R. Frater, T.M. Lennon and B.D.O. Anderson, Optimally efficient estimation of the statistics of rare events in queueing networks, IEEE Trans. Autom. Control 36 (1991) 1395-1405.
15. A. Ganesh, Stationary tail probabilities in exponential server tandems with renewal arrivals, Ph.D. Thesis, Cornell University (1995).
16. A. Ganesh and V. Anantharam, Stationary tail probabilities in exponential server tandems with renewal arrivals, in: Stochastic Networks, IMA Volumes in Mathematics and its Applications, Vol. 71, eds. F. P. Kelly and R. J. Williams (Springer, 1995).
17. P.W. Glynn and W. Whitt, Logarithmic asymptotics for steady-state tail probabilities in a single-server queue, to appear in J. Appl. Prob.
18. R.M. Loynes, The stability of queues with non-independent inter-arrival and service times, Proc. Camb. Phil. Soc. 58 (1962) 497-520.
19. J.E. Marsden, Elementary Classical Analysis, (W.H. Freeman, 1993).
20. A. Mogulskii, Large deviations for trajectories of multi-dimensional random walks, Theor. Prob. Appl. 21 (1976) 300-315.
21. N. O'Connell, Large deviations in queueing networks, DIAS Technical Report DIAS-APG-9413.
22. S. Parekh and J. Walrand, A quick simulation method for excessive backlogs in networks of queues, IEEE Trans. Autom. Control 34 (1989) 54-66.
23. P. Tsoucas, Rare events in series of queues, J. Appl. Prob. 29 (1992) 168-175.