Finite-buffer queues with workload-dependent service and arrival rates

Queueing Systems

Volumn 50, Issue 2-3, 2005, Pages 231-253

  Bekker, René ^a,b  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b CWI   (Netherlands)

Author keywords

Cycle maximum; Finite buffer; Impatience; Level crossings; Restricted accessibility; State dependent rates; Volterra integral equation; Workload

Indexed keywords

QUEUEING THEORY; RAILROAD CROSSINGS;

CYCLE MAXIMUM; FINITE BUFFER; IMPATIENCE; LEVEL CROSSING; RESTRICTED ACCESSIBILITY; STATE-DEPENDENT RATES; VOLTERRA INTEGRAL EQUATIONS; WORKLOAD;

INTEGRAL EQUATIONS;

EID: 23944501556     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-005-0730-z     Document Type: Article

References (34)

1. S. Asmussen and K. Sigman, Monotone stochastic recursions and their duals, Probability in the Engineering and Informational Sciences 10 (1996) 1-20.
2. S. Asmussen, Extreme value theory for queues via cycle maxima, Extremes 2 (1998) 137-168.
3. S. Asmussen, Applied Probability and Queues, 2nd ed. (Springer, New York, 2003).
4. R. Bekker, Finite-buffer queues with workload-dependent service and arrival rates, SPOR-Report 2004-01, Eindhoven University of Technology, 2004, Available at www.win.tue.nl/bs/spor/spor2004.html.
5. R. Bekker, S.C. Borst, O.J. Boxma and O. Kella, Queues with workload-dependent arrival and service rates, Queueing Systems 46 (2004) 537-556.
6. R. Bekker and A.P. Zwart, On an equivalence between loss rates and cycle maxima in queues and dams, To appear in Probability in the Engineering and Informational Sciences, 2005.
7. J.W.M. Bertrand and H.P.G. van Ooijen, Workload based order release and productivity: A missing link, Production Planning & Control 13 (2002) 665-678.
8. N.K. Boots and H.C. Tijms, A multiserver queueing system with impatient customers, Management Science 45 (1999) 444-448.
9. P.J. Brockwell, S.I. Resnick and R.L. Tweedie, Storage processes with general release rule and additive inputs, Advances in Applied Probability 14 (1982) 392-433.
10. S. Browne and K. Sigman, Work-modulated queues with applications to storage processes, Journal of Applied Probability 29 (1992) 699-712.
11. J.W. Cohen, Single-server queues with restricted accessibility, Journal of Engineering Mathematics 3 (1969) 265-284.
12. J.W. Cohen, On Regenerative Processes in Queueing Theory, Lecture Notes in Economics and Mathematical Systems (Springer-Verlag, Berlin, 1976) vol. 121.
13. J.W. Cohen, The Single Server Queue (North-Holland Publ. Cy., Amsterdam, 1982).
14. D.J. Daley, General customer impatience in the queue GI/G/1, Journal of Applied Probability 2 (1965) 186-205.
15. B.T. Doshi, Level-crossing analysis of queues, in: Queueing and Related Models, eds. U.N. Bhat and I.V. Basawa, Oxford Statistical Science Series (Oxford Univ. Press, New York, 1992) pp. 3-33.
16. A. Elwalid and D. Mitra, Analysis and design of rate-based congestion control of high-speed networks, I: stochastic fluid models, access regulation, Queueing Systems 9 (1991) 29-64.
17. A. Elwalid and D. Mitra, Statistical multiplexing with loss priorities in rate-based congestion control of high-speed networks, IEEE Transactions on Communications 42 (1994) 2989-3002.
18. D.P. Gaver, Jr. and R.G. Miller, Jr., Limiting distributions for some storage problems, in: Studies in Applied Probability and Management Science, eds. K.J. Arrow, S. Karlin and H. Scarf (Stanford University Press, Stanford, Calif, 1962) pp. 110-126.
19. B. Gavish and P. Schweitzer, The markovian queue with bounded waiting time, Management Science 23 (1977) 1349-1357.
20. J.M. Harrison and S.I. Resnick, The stationary distribution and first exit probabilities of a storage process with general release rule, Mathematics of Operations Research 1 (1976) 347-358.
21. G. Hooghiemstra, A path construction for the virtual waiting time of an M/G/1 queue, Statistica Neerlandica 41 (1987) 175-181.
22. D. Jagerman, Certain Volterra integral equations arising in queueing, Stochastic Models 1 (1985) 239-256.
23. H. Kaspi, O. Kella and D. Perry, Dam processes with state dependent batch sizes and intermittent production processes with state dependent rates, Queueing Systems 24 (1996) 37-57.
24. A.G. de Kok and H.C. Tijms, A queueing system with impatient customers, Journal of Applied Probability 22 (1985) 688-696.
25. P. Linz, Analytical, and Numerical Methods for Volterra Equations, SIAM Studies in Applied Mathematics (SIAM, Philadelphia, 1985) vol. 7.
26. J. Loris-Teghem, On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn times, Journal of Applied Probability 9 (1972) 642-649.
27. M. Mandjes, D. Mitra and W.R.W. Scheinhardt, A simple model of network access: Feedback adaptation of rates and admission control. Proceedings of Infocom 2002 (2002) pp. 3-12.
28. H.P.G. Van Ooijen and J.W.M. Bertrand, The effects of a simple arrival rate control policy on through-put and work-in-process in production systems with workload dependent processing rates, International Journal of Production Economics 85 (2003) 61-68.
29. D. Perry and S. Asmussen, Rejection rules in the M/G/1 queue, Queueing Systems 19 (1995) 105-130.
30. K. Ramanan and A. Weiss, Sharing bandwidth in ATM, in: Proceedings of the Allerton Conference, (1997) pp. 732-740.
31. L. Takács, Investigation of waiting rime problems by reduction to Markov processes, Acta Math. Acad. Sci. Hungar. 6 (1955) 101-129.
32. L. Takács, Application of Ballot theorems in the theory of queues, in: Proceedings of the Symposium on Congestion Theory, eds. W.L. Smith and W.E. Wilkinson (University of North Carolina Press, Chapel Hill, 1965) pp. 337-398.
33. A.P. Zwart, A fluid queue with a finite buffer and subexponential input, Advances in Applied Probability 32 (2000) 221-243.
34. A.P. Zwart, Loss rates in the M/G/1 queue with complete rejection, SPOR-Report 2003-27, Eindhoven University of Technology, 2003.