Polling systems with periodic server routing in heavy traffic: Renewal arrivals

Operations Research Letters

Volumn 33, Issue 1, 2005, Pages 17-25

  Olsen, Tava Lennon ^a   Van Der Mei, R D ^b,c  

^a WASHINGTON UNIVERSITY IN ST LOUIS   (United States)

^b CWI   (Netherlands)

^c VU UNIVERSITY AMSTERDAM   (Netherlands)

Author keywords

Delay; Distributional approximations; Heavy traffic; Polling table; Setup times; Switch over times

Indexed keywords

APPROXIMATION THEORY; MATHEMATICAL MODELS; POISSON DISTRIBUTION; PROBLEM SOLVING; SERVERS; TRAFFIC CONTROL;

DISTRIBUTION APPROXIMATIONS; HEAVY TRAFFIC; POLLING TABLE; SETUP TIMES; SWITCH OVER TIME;

OPERATIONS RESEARCH;

EID: 4544339528     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2004.05.003     Document Type: Article

References (20)

1. Baccelli F., Brémaud P. Elements of Queueing Theory. 1991;Springer, Berlin.
2. Baker J.E., Rubin I.R. Polling with a general-service order table. IEEE Trans. Commun. 35:1987;283-288.
3. Boxma O.J., Cohen J.W. The single server queue: heavy tails and heavy traffic. Park K., Willinger W. Self-Similar Network Traffic and Performance Evaluation. 2000;143-169 Wiley, New York.
4. Boxma O.J., Deng Q., Resing J.A.C. Polling systems with regularly varying service and/or switch-over times. Adv. Perf. Anal. 3:2000;71-107.
5. Coffman E.G., Puhalskii A.A., Reiman M.I. Polling systems with zero switch-over times. a heavy-traffic principle Ann. Appl. Prob. 5:1995;681-719.
6. Coffman E.G., Puhalskii A.A., Reiman M.I. Polling systems in heavy-traffic. a Bessel process limit Math. Oper. Res. 23:1998;257-304.
7. Fricker C., Jaïbi M.R. Monotonicity and stability of periodic polling models. Queueing Systems. 15:1994;211-238.
8. Harrison J.M., Nguyen V. Brownian models of multiclass queueing networks. current status and open problems Queueing Systems. 13:1993;5-40.
9. Levy H., Sidi M. Polling models. applications, modeling and optimization IEEE Trans. Commun. 38:1991;1750-1760.
10. Markowitz D.M., Reiman M.I., Wein L.M. The stochastic economic lot scheduling problem. heavy traffic analysis of dynamic cyclic policies Oper. Res. 48:2000;136-154.
11. Markowitz D.M., Wein L.M. Heavy traffic analysis of dynamic cyclic policies. a unified treatment of the single machine scheduling problem Oper. Res. 49:2001;246-270.
12. Olsen T.L. Approximations for the waiting time distribution in polling models with and without state-dependent setups. Oper. Res. Lett. 28:2001;113-123.
13. Olsen T.L. A practical scheduling method for multi-class production systems with setups. Management Sci. 45:1999;116-130.
14. Olsen T.L., van der Mei R.D. Polling systems with periodic server routing in heavy traffic. distribution of the delay J. Appl. Probab. 40:2002;305-326.
15. Reiman M.I., Rubio R., Wein L.M. Heavy traffic analysis of the dynamic stochastic inventory-routing problem. Transportation Sci. 33:1999;361-380.
16. Reiman M.I., Wein L.M. Dynamic scheduling of a two-class queue with setups. Oper. Res. 46:1998;532-547.
17. Reiman M.I., Wein L.M. Heavy traffic analysis of polling systems in tandem. Oper. Res. 47:1999;524-534.
18. Resing J.A.C. Polling systems and multitype branching processes. Queueing Systems. 13:1993;409-426.
19. Takagi H. Applications of polling models to computer networks. Comput. Network ISDN Syst. 22:1991;193-211.
20. Van der Mei R.D., Levy H. Polling systems in heavy traffic. exhaustiveness of service policies Queueing Systems. 27:1997;227-250.