The M/G/1 queue with quasi-restricted accessibility

Stochastic Models

Volumn 25, Issue 1, 2009, Pages 151-196

  Boxma, Onno ^a   Perry, David ^b   Stadje, Wolfgang ^c   Zacks, Shelley ^d  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

^b UNIVERSITY OF HAIFA   (Israel)

^c UNIVERSITY OF OSNABRÜCK   (Germany)

^d BINGHAMTON UNIVERSITY   (United States)

Author keywords

Busy period; Cycle maximum; M G 1 queue; Restricted accessibility; Waiting time; Workload

Indexed keywords

CUSTOMER SATISFACTION; LAPLACE TRANSFORMS; QUEUEING THEORY; SALES;

BUSY PERIOD; CYCLE MAXIMUM; M/G/1 QUEUE; RESTRICTED ACCESSIBILITY; WAITING TIME; WORKLOAD;

DISTRIBUTION FUNCTIONS;

EID: 61549103693     PISSN: 15326349     EISSN: 15324214     Source Type: Journal    
DOI: 10.1080/15326340802648878     Document Type: Article

References (35)

1. Adan, I.; Boxma, O.J.; Perry, D. The G/M/l queue revisited. Mathematical Methods of Operations Research 2005, 58, 437-452.
2. Asmussen, S. Extreme value theory for queues via cycle maxima. Extremes 1998, 2, 137-168.
3. Asmussen, S. Ruin Probabilities-, World Scientific: Singapore, 2000.
4. Asmussen, S. Applied Probability and Queues, 2nd Ed.; Springer: New York, 2001.
5. Borovkov, K.; Burq, Z. Kendall's identity for the first crossing time revisited. Electronic Communications in Probability 2001, 6, 91-94.
6. Baccelli, E; Boyer, P.; Hebuterne, G. Single-server queues with impatient customers. Advances in Applied Probability 1984, 16, 887-905.
7. Bekker, R. Finite-buffer queues with workload-dependent service and arrival rates. Queueing Systems 2005, 50, 231-253.
8. Bekker, R.; Borst, S.C.; Boxma, O.J.; Kella, O. Queues with workload-dependent arrival and service rates. Queueing Systems 2004, 46, 537-556.
9. Cohen, J.W, Single server queue with restricted accessibility. Journal of Engineering Mathematics 1969, 3, 265-285.
10. Cohen, J.W, On Regenerative Processes in Queueing Theory, Springer: Berlin, 1976.
11. Cohen, J.W. The Single Server-Queue, 2nd Ed.; North-Holland: Amsterdam, 1982.
12. Daley DJ. Single server queueing system with uniformly limited queueing time. Journal of the Australian Mathematical Society 1964, 4, 489-505.
13. Elwalid, A.; Mitra, D. Statistical multiplexing with loss priorities in rate-based congestion control of high-speed networks. IEEE Transactions on Communications 1994, 42, 2989-3002.
14. Garnett, O.; Mandelbaum, A.; Reiman, M. Designing a call center with impatient customers. Manufacturing & Service Operations Management 2002, 4, 208-227.
15. Gavish, B.; Schweitzer, P.J. The Markovian queue with bounded waiting time. Management Science 1977, 23, 1349-1357.
16. Gnedenko, B.V.; Kovalenko, I.N. Introduction to Queueing Theory, 2nd Ed.; Birkhäuser: Basel, 1989.
17. Hooghiemstra, G. A path construction for the virtual waiting time of an M/G/1 queue. Statistica Neerlandica 1987, 41, 175-181.
18. Hokstad. P. A single server queue with constant service time and restricted accessibility. Management Science 1979, 25, 205-208.
19. Kella, O.; Whitt, W. Useful martingales for storage systems with Lévy input. Journal of Applied Probability 1992, 29, 396-403.
20. Knessl, C; Matkowsky, B.J.; Schuss, Z.; Tier, C. Busy period distribution of state-dependent queues. Queueing Systems 1987, 2, 285-305.
21. Koole, G.; Mandelbaum, A. Queueing models of call-centers: an introduction. Annals of Operations Research 2002, 113, 41-59.
22. Liu, L.Q.; Kulkarni, V.G. Explicit solutions for the steady-state distributions in M/PH/1 queues with workload-dependent balking. Queueing Systems 2006, 52, 251-260.
23. Lorìs-Teghem, J. On the waiting time distribution in a generalized queueing system with uniformly bounded sojourn time. Journal of Applied Probability 1972, 9, 642-649.
24. Mandjes, M.; Mitra, D.; Scheinhardt, W. A simple model of network access: feedback adaptation of rates and admission control. Proceedings of Infocom 2002. 3-12.
25. Perry, D.; Asmussen, S. Rejection rules in the M/G/l queue. Queueing Systems 1995, 19, 105-130.
26. Perry, D.; Stadje, W.; Zacks, S. Busy period analysis of M/G/l and G/M/1 type queues with restricted accessibility. Operations Research Letters 2000, 27, 163-174.
27. Perry, D.; Stadje, W.; Zacks, S. The M/G/l queue with finite workload capacity. Queueing Systems 2001, 39, 7-22.
28. Perry, D.; Stadje, W.; Zacks, S. Hitting and ruin probabilities for compound Poisson processes and the cycle maximum for M/G/l. Stochastic Models 2002. 18, 553-564.
29. Perry, D.; Stadje, W. Duality of dams via mountain processes. Operations Research Letters 2003,31, 451-458.
30. 7in the Engineering and Informational Sciences 2003, 17, 459-465.
31. Stanford, R.E. Reneging phenomena in single channel queues. Mathematics of Operations Research 1979, 4, 162-178.
32. Swensen, A.R. On a GI/M/c queue with bounded waiting times. Operations Research 1986,34, 895-908.
33. Whitt, W. Comparing counting processes and queues. Advances in Applied Probability 1981,13 207-220.
34. Whitt, W. Engineering solution of a basic call-center model. Management Science 2005, 51. 221-235.
35. Zacks, S.; Perry, D.; Bshouty, D.; Bar-Ley S. Distribution of stopping times for compound Poisson processes with positive jumps and linear boundaries. Stochastic Models 1999, I5, 89-101.