Skip to main content Accessibility help
×
Home

ON AN EQUIVALENCE BETWEEN LOSS RATES AND CYCLE MAXIMA IN QUEUES AND DAMS

  • René Bekker (a1) and Bert Zwart (a1)

Abstract

We consider the loss probability of a customer in a single-server queue with finite buffer and partial rejection and show that it can be identified with the tail distribution of the cycle maximum of the associated infinite-buffer queue. This equivalence is shown to hold for the GI/G/1 queue and for dams with state-dependent release rates. To prove this equivalence, we use a duality for stochastically monotone recursions, developed by Asmussen and Sigman (1996). As an application, we obtain several exact and asymptotic results for the loss probability and extend Takács' formula for the cycle maximum in the M/G/1 queue to dams with variable release rate.

Copyright

References

Hide All

REFERENCES

Asmussen, S. (2003). Applied probability and queues, 2nd ed. New York: Springer-Verlag.
Asmussen, S. (1998). Extreme value theory for queues via cycle maxima. Extremes 2: 137168.
Asmussen, S. (1998). Subexponential asymptotics for stochastic processes: Extremal behaviour, stationary distributions and first passage times. Annals of Applied Probability 8: 354374.
Asmussen, S. & Kella, O. (1996). Rate modulation in dams and ruin problems. Journal of Applied Probability 33: 523535.
Asmussen, S. & Perry, D. (1992). On cycle maxima, first passage problems and extreme value theory for queues. Stochastic Models 8: 421458.
Asmussen, S. & Schock Petersen, S. (1988). Ruin probabilities expressed in terms of storage processes. Advances in Applied Probability 20: 913916.
Asmussen, S. & Sigman, K. (1996). Monotone stochastic recursions and their duals. Probability in the Engineering and Informational Sciences 10: 120.
Bekker, R. (2004). Finite-buffer queues with workload-dependent service and arrival rates. SPOR Report 2004-01, Eindhoven University of Technology, The Netherlands.
Browne, S. & Sigman, K. (1992). Work-modulated queues with applications to storage processes. Journal of Applied Probability 29: 699712.
Cohen, J.W. (1976). Regenerative processes in queueing theory. Berlin: Springer-Verlag.
Cohen, J.W. (1982). The single server queue. Amsterdam: North-Holland.
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: 349374.
Embrechts, P., Klüppelberg, C., & Mikosch, T. (1997). Modelling extremal events. Berlin: Springer-Verlag.
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: 347358.
Hooghiemstra, G. (1987). A path construction for the virtual waiting time of an M/G/1 queue. Statistica Neerlandica 41: 175181.
Iglehart, D.G. (1972). Extreme values in the GI/G/1 queue. Annals of Mathematical Statistics 43: 627635.
Lindley, D.V. (1959). Discussion of a paper by C.B. Winsten. Proceedings of the Cambridge Philosophical Society 48: 277289.
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: 125129.
Perry, D. & Stadje, W. (2003). Duality of dams via mountain processes. Operations Research Letters 31: 451458.
Siegmund, D. (1976). The equivalence of absorbing and reflecting barrier problems for stochastically monotone Markov processes. Annals of Probability 4: 914924.
Takács, L. (1967). Combinatorial methods in the theory of stochastic processes. New York: Wiley.
Van Ommeren, J.C.W. & De Kok, A.G. (1987). Asymptotic results for buffer systems under heavy load. Probability in the Engineering and Informational Sciences 1: 327348.
Zwart, A.P. (2000). A fluid queue with a finite buffer and subexponential input. Advances in Applied Probability 32: 221243.

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed