Some reflections on the renewal-theory paradox in queueing theory

Journal of Applied Mathematics and Stochastic Analysis

Volumn 11, Issue 3, 1998, Pages 355-368

  Cooper, Robert B ^a   Niu, Shun Chen ^b   Srinivasan, Mandyam M ^c  

^a Florida Atlantic Univ   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

Decomposition; Inspection Paradox; Polling Models; Renewal Theory Paradox; Vacation Models; Waiting Times; Waiting Time Paradox M G 1 Queues

Indexed keywords

EID: 54649083968     PISSN: 10489533     EISSN: 16872177     Source Type: Journal    
DOI: 10.1155/S104895339800029X     Document Type: Article

References (37)

1. Beneš, V.E., On queues with Poisson arrivals, The Annals of Mathematical Statistics 28 (1957), 670-677.
2. Boxma, O.J. and Groenendijk, W.P., Pseudo-conservation laws in cyclic-service systems, J. of Applied Probability 24 (1987), 949-964.
3. Burke, P.J., Delays in single-server queues with batch input, Operations Research 23 (1975), 830-833.
4. Cooper, R.B., Queues served in cyclic order: Waiting times, Bell System Tech. J. 49 (1970), 399-413.
5. Cooper, R.B. and Niu, S.-C., Beneš's formula for M/G/1-FIFO 'explained' by preemptive-resume LIFO, J. of Applied Probability 23 (1986), 550-554.
6. Cooper, R.B., Niu, S.-C and Srinivasan, M.M., A decomposition theorem for polling models: The switchover times are effectively additive, Operations Research 44 (1996), 629-633.
7. Cooper, R.B., Niu, S.-C. and Srinivasan, M.M., When does forced idle time improve performance in polling models?, Management Science (1998), to appear.
8. Cooper, R.B., Niu, S.-C. and Srinivasan, M.M., Setups in polling models: Does it make sense to set up if no work is waiting?, (1997), submitted.
9. Cooper, R.B. and Solomon, M.K., Teletraffic theory applied to the analysis of hash-structured files, Intern. J. of Electronics and Commun. 47 (1993), 336-341.
10. Doshi, B.T., A note on stochastic decomposition in a GI/G/1 queue with vaca-tions or set-up times, J. of Applied Prob. 22 (1985), 419-428.
11. Doshi, B.T., Single-server queues with vacations, Stoch. Anal, of Comp, and Commun. Systems, (ed. by H. Takagi), Elsevier, North-Holland (1990).
12. Ferguson, M.J., Mean waiting times for a token ring with station-dependent overheads, In: Local Area and Multiple Access Networks (ed. by R.L. Pickholtz), Computer Science Press (1986), 43-67.
13. Ferguson, M.J. and Aminetzah, Y.J., Exact results for nonsymmetric token ring systems, IEEE Trans, on Commun. COM-33 (1985), 223-231.
14. Fuhrmann, S.W., Symmetric queues served in cyclic order, Operations Research Letters 4 (1985), 139-144.
15. Fuhrmann, S.W., A decomposition result for a class of polling models, Queueing Systems, Theory and Appl. 11 (1992), 109-120.
16. Fuhrmann, S.W., On approximating mean waiting times in polling models with half of the mean cycle times, Teletraffic Cont. for the Info. Age, Proceedings, ITC 15 (ed. by V. Ramaswami and P.E. Wirth) Vol. 2a, Elsevier (1997), 265-273.
17. Fuhrmann, S.W. and Cooper, R.B., Stochastic decompositions in the M/G/1 queue with generalized vacations, Operations Research 33 (1985), 1117-1129.
18. Gupta, D. and Srinivasan, M.M., Polling systems with state-dependent setup times, Queueing Systems, Theory and Appl. 22 (1996), 403-423.
19. Heyman, D.P. and Sobel, M.J., Stochastic Models in Operations Research, Vol. 1, Mc-Graw Hill, New York 1982.
20. Kelly, F.P., Reversibility and Stochastic Networks, Wiley, Chicester 1979.
21. Levy, Y. and Yechiali, U., Utilization of idle time in an M/G/1 queueing system, Management Science 22 (1975), 202-211.
22. Li, J. and Niu, S.-C, The waiting-time distribution for the GI/G/1 queue under the D-policy, Prob. in the Eng. and Info. Sciences 6 (1992), 287-308.
23. Niu, S.-C., Representing workloads in GI/G/1 queues through the preemptive-resume LIFO queue discipline, Queueing Systems, Theory and Appl. 3 (1988), 157-178.
24. Ross, S.M., Stochastic Processes, Wiley, New York 1983.
25. Sarkar, D. and Zangwill, W.I., Variance effects in cyclic production systems, Management Science 37 (1991), 443-453.
26. Skinner, CE., A priority queueing system with server-walking time, Operations Research 15 (1967), 278-285.
27. Srinivasan, M.M., Niu, S.-C. and Cooper, R.B., Relating polling models with zero and nonzero switchover times, Queueing Systems, Theory and Appl. 19 (1995), 149-168.
28. Syski, R., Introduction to Congestion Theory in Telephone Systems (1960), Oliver and Boyd, Edinburgh, Second edition, North-Holland, Amsterdam 1986.
29. Takács, L., Introduction to the Theory of Queues, Oxford University Press, New York 1962.
30. Takagi, H., Queueing analysis of polling models: An update, In: Stochastic Analysis of Comp. and Commun. Systems (ed. by H. Takagi), North-Holland, Amsterdam 1990.
31. Takagi, H., Queueing Analysis, Vol. 1: Vacation and Priority Systems, Part 1, North-Holland, Amsterdam 1991.
32. Takagi, H., Queueing analysis of polling models: Progress in 1990-1994, Chapter 5 in Frontiers in Queueing: Models and Applications in Science and Engineering (ed. by J.H. Dshalalow), CRC Press, Boca Raton, Florida (1997), 119-146.
33. Whitt, W., Comparing batch delays and customer delays, Bell System Tech. J. 62 (1983), 2001-2009.
34. Whitt, W., The renewal-process stationary-excess operator, J. of Applied Prob. 22 (1985), 156-167.
35. Wolff, R.W., Poisson arrivals see time averages, Operations Research 30 (1982), 223-231.
36. Wolff, R.W., Sample-path derivations of the excess, age, and spread distributions, J. of Applied Prob. 25 (1988), 432-436.
37. Wolff, R.W., Stochastic Modeling and the Theory of Queues, Prentice-Hall, Englewood Cliffs, New Jersey 1989.