On an equivalence between loss rates and cycle maxima in queues and dams

Probability in the Engineering and Informational Sciences

Volumn 19, Issue 2, 2005, Pages 241-255

  Bekker, René ^a   Zwart, Bert ^b  

^a CWI   (Netherlands)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

PROBABILITY DISTRIBUTIONS;

ASYMPTOTIC RESULTS; FINITE BUFFER; INFINITE BUFFER; LOSS PROBABILITY; RELEASE RATE; SINGLE SERVER QUEUE; STATE-DEPENDENT; TAIL DISTRIBUTION;

QUEUEING THEORY;

EID: 17644421822     PISSN: 02699648     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0269964805050138     Document Type: Article

References (23)

1. Asmussen, S. (2003). Applied probability and queues, 2nd ed. New York: Springer-Verlag.
2. Asmussen, S. (1998). Extreme value theory for queues via cycle maxima. Extremes 2: 137-168.
3. Asmussen, S. (1998). Subexponential asymptotics for stochastic processes: Extremal behaviour, stationary distributions and first passage times. Annals of Applied Probability 8: 354-374.
4. Asmussen, S. & Kella, O. (1996). Rate modulation in dams and ruin problems. Journal of Applied Probability 33: 523-535.
5. Asmussen, S. & Perry, D. (1992). On cycle maxima, first passage problems and extreme value theory for queues. Stochastic Models 8: 421-458.
6. Asmussen, S. & Schock Petersen, S. (1988). Ruin probabilities expressed in terms of storage processes. Advances in Applied Probability 20: 913-916.
7. Asmussen, S. & Sigman, K. (1996). Monotone stochastic recursions and their duals. Probability in the Engineering and Informational Sciences 10: 1-20.
8. Bekker, R. (2004). Finite-buffer queues with workload-dependent service and arrival rates. SPOR Report 2004-01, Eindhoven University of Technology, The Netherlands.
9. Browne, S. & Sigman, K. (1992). Work-modulated queues with applications to storage processes. Journal of Applied Probability 29: 699-712.
10. Cohen, J.W. (1976). Regenerative processes in queueing theory. Berlin: Springer-Verlag.
11. Cohen, J.W. (1982). The single server queue. Amsterdam: North-Holland.
12. Dette, H., Fill, J.A., Pitman, J., & Studden, W.J. (1997). Wall and Siegmund duality relations for birth and death chains with reflecting barrier. Journal of Theoretical Probability 10: 349-374.
13. Embrechts, P., Klüppelberg, C., & Mikosch, T. (1997). Modelling extremal events. Berlin: Springer-Verlag.
14. Harrison, J.M. & Resnick, S.I. (1976). The stationary distribution and first exit probabilities of a storage process with general release rule. Mathematics of Operations Research 1: 347-358.
15. Hooghiemstra, G. (1987). A path construction for the virtual waiting time of an M/G/1 queue. Slatistica Neerlandica 41: 175-181.
16. Iglehart, D.G. (1972). Extreme values in the GI/G/1 queue. Annals of Mathematical Statistics 43: 627-635.
17. Lindley, D.V. (1959). Discussion of a paper by C.B. Winsten. Proceedings of the Cambridge Philosophical Society 48: 277-289.
18. Loynes, R.M. (1965). On a property of the random walks describing simple queues and dams. Journal of the Royal Statistical Society Series B 27: 125-129.
19. Perry, D. & Stadje, W. (2003). Duality of dams via mountain processes. Operations Research Letters 31: 451-458.
20. Siegmund, D. (1976). The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes. Annals of Probability 4: 914-924.
21. Takács, L. (1967). Combinatorial methods in the theory of stochastic processes. New York: Wiley.
22. Van Ommeren, J.C.W. & De Kok, A.C. (1987). Asymptotic results for buffer systems under heavy load. Probability in the Engineering and Informational Sciences 1: 327-348.
23. Zwart, A.P. (2000). A fluid queue with a finite buffer and subexponential input. Advances in Applied Probability 32: 221-243.