Polling systems with periodic server routeing in heavy traffic: Distribution of the delay

Journal of Applied Probability

Volumn 40, Issue 2, 2003, Pages 305-326

  Olsen, Tava Lennon ^a   Van der Mei, R D ^b  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Delay; Distributional approximation; Heavy traffic; Periodic routeing; Polling system; Polling table; Setup time; Switch over time; Waiting time

Indexed keywords

EID: 0042413694     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1239/jap/1053003546     Document Type: Article

References (48)

1. ATHREYA, K. B. AND NEY, P. E. (1971). Branching Processes. Springer, Berlin.
2. BACCELLI, F. AND BRÉMAUD, P. (1991). Elements of Queueing Theory. Springer, Berlin.
3. BAKER, J. E. AND RUBIN, I. R. (1987). Polling with a general-service order table. IEEE Trans. Commun. 35, 283-288.
4. BLANC, J. P. C. (1993). Performance analysis and optimization with the power-series algorithm. In Performance Evaluation of Computer and Communication Systems, eds L. Donatiello and R. Nelson, Springer, Berlin, pp. 53-80.
5. BOXMA, O. J., GROENENDIJK, W. P. AND WESTSTRATE, J. A. (1990). A pseudoconservation law for service systems with a polling table. IEEE Trans. Commun. 38, 1865-1870.
6. CHOUDHURY, G. AND WHITT, W. (1994). Computing transient and steady state distributions in polling models by numerical transform inversion. Perf. Eval. 25, 267-292.
7. CHOUDHURY, G. L. (1990). Polling with a general service order table: gated service. In Proc. IEEE INFOCOM '90 (San Francisco. CA), Vol. 1, pp. 268-276.
8. CHUNG, K. L. (1974). A Course in Probability, 2nd edn. Academic Press. New York.
9. COFFMAN, E. G., PUHALSKII, A. A. AND REIMAN, M. I. (1995). Polling systems with zero switch-over times: a heavy-traffic principle. Ann. Appl. Prob. 5, 681-719.
10. COFFMAN, E. G., PUHALSKII, A. A. AND REIMAN, M. I. (1998). Polling systems in heavy-traffic: a Bessel process limit. Math. Operat. Res. 23, 257-304.
11. COHEN, J. W. AND BOXMA, O. J. (1981). The M/G/1 queue with alternating service formulated as a Riemann-Hilbert boundary value problem. In Performance '81 (Proc. 8th Internat. Symp. Comput. Perf. Model., Amsterdam), ed. F.J. Kylstra, North-Holland, Amsterdam, pp. 181-199.
12. EISENBERO, M. (1972). Queues with periodic service and changeover times. Operat. Res. 20, 440-451.
13. EISENBERO, M. (1994). The polling system with a stopping server. Queueing Systems 18, 387-431.
14. FEDERGRUEN, A. AND KATALAN, Z. (1994). Approximating queue size and waiting-time distributions in general polling systems. Queueing Systems 18, 353-386.
15. FEDERGRUEN, A. AND KATALAN, Z. (1998). Determining production schedules under base-stock policies in single facility multi-item production systems. Operat. Res. 46, 883-898.
16. FRICKER, C. AND JAÏBI, M. R. (1994). Monotonicity and stability of periodic polling models. Queueing Systems 15, 211-238.
17. FUHRMANN, S. W. AND COOPER, R. D. (1985). Stochastic decompositions in the M/G/1 queue with generalized vacations. Operat. Res. 33, 1117-1129.
18. HARRISON, J. M. AND NGUYEN, V. (1993). Brownian models of multiclass queueing networks: current status and open problems. Queueing Systems 13, 5-40.
19. JENNINGS, O. B. (1999). Generalized Round Robin Service Disciplines in Stochastic Networks with Setups: Stability Analysis and Diffusion Approximation. Doctoral Thesis, Georgia Institute of Technology, Atlanta.
20. KONHEIM, A. G., LEVY, H. AND SRINIVASAN, M. M. (1994). Descendant set: an efficient approach for the analysis of polling systems. IEEE Trans. Commun. 42, 1245-1253.
21. KROESE, D. P. (1997). Heavy traffic analysis for continuous polling models. J. Appl. Prob. 34, 720-732.
22. LEUNG, K. K. (1991). Cyclic service systems with probabilistically-limited service. IEEE J. Sel. Areas Commun. 9, 185-193.
23. LEVY, H. AND SIDI, M. (1991). Polling models: applications, modeling and optimization. IEEE Trans. Commun. 38, 1750-1760.
24. MARKOWITZ, D. M. AND WEIN, L. M. (2001). Heavy traffic analysis of dynamic cyclic policies: a unified treatment of the single machine scheduling problem. Operat. Res. 49, 246-270.
25. MARKOWITZ, D. M., REIMAN, M. I. AND WEIN, L. M. (2000). The stochastic economic lot scheduling problem: heavy traffic analysis of dynamic cyclic policies. Operat. Res. 48, 136-154.
26. OLSEN, T. L. (1999). A practical scheduling method for multi-class production systems with setups. Manag. Sci. 45, 116-130.
27. OLSEN, T. L. (2001). Approximations for the waiting time distribution in polling models with and without state-dependent setups. Operat. Res. Lett. 28, 113-123.
28. OLSEN, T. L. (2001). Limit theorems for polling models with increasing setups. Prob. Eng. Inf. Sci. 15, 35-55.
29. OLSEN, T. L. (2001). On multi-item production systems with setups: review and intuition. Working Paper, Washington University in St. Louis.
30. REIMAN, M. I. AND WEIN, L. M. (1998). Dynamic scheduling of a two-class queue with setups. Operat. Res. 46, 532-547.
31. REIMAN, M. I. AND WEIN, L. M. (1999). Heavy traffic analysis of polling systems in tandem. Operat. Res, 47, 524-534.
32. REIMAN, M. I., RUBIO, R. AND WEIN, L. M. (1999). Heavy traffic analysis of the dynamic stochastic inventory-routeing problem. Transport Sci. 33, 361-380.
33. RESING, J. A. C. (1993). Polling systems and multitype branching processes. Queueing Systems 13, 409-426.
34. TAKAGI, H. (1986). Analysis of Polling Systems. MIT Press, Cambridge, MA.
35. TAKAGI, H. (1990). Queueing analysis of polling models: an update. In Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi, North-Holland, Amsterdam, pp. 267-318.
36. TAKAGI, H. (1991). Applications of polling models to computer networks. Comput. Networks ISDN Systems 22, 193-211.
37. TAKAGI, H. (1997). Queueing analysis of polling models: progress in 1990-1994. In Frontiers in Queueing, ed. J. H. Dshalalow, CRC, Boca Raton, FL, pp. 119-146.
38. TAKAGI, H. AND MURATA, M. (1986). Queueing analysis of scan-type TDM and polling systems. In Computer Networking and Performance Evaluation, eds T. Hasegawa, H. Takagi and Y. Takahashi, North-Holland, Amsterdam, pp. 199-211.
39. VAN DER MEI, R. D. (1999). Delay in polling systems with large switch-over times. J. Appl. Prob. 36, 232-243.
40. VAN DER MEI, R. D. (1999). Distribution of the delay in polling systems in heavy traffic. Perf. Eval. 38, 133-148.
41. VAN DER MEI, R. D. (1999). Polling systems in heavy traffic: higher moments of the delay. Queueing Systems 31, 265-294.
42. VAN DER MEI, R. D. (1999). Polling systems with periodic server routeing in heavy traffic. Stoch. Models 15, 273-297.
43. VAN DER MEI, R. D. (2000). Polling systems with switch-over times under heavy load: moments of the delay. Queueing Systems 36, 381-404.
44. VAN DER MEI, R. D. (2002). Waiting-time distributions in polling systems with simultaneous batch arrivals. Ann. Operat. Res. 113, 155-173.
45. VAN DER MEI, R. D. AND BORST, S. C. (1997). Analysis of multiple-server polling systems by means of the power-series algorithm. Stock. Models 13, 339-369.
46. VAN DER MEI, R. D. AND LEVY, H. (1997). Polling systems in heavy traffic: exhaustiveness of service policies. Queueing Systems 27, 227-250.
47. VAN DER MEI, R. D. AND LEVY, H. (1998). Expected delay analysis of polling systems in heavy traffic. Adv. Appl. Prob. 30, 586-602.
48. WESTSTRATE, J. A. AND VAN DER MEI, R. D. (1994). Waiting times in a two-queue model with exhaustive and Bernoulli service. Z. Operat. Res. Math. Meth. Operat. Res. 40, 289-303.