Decomposition results for general polling systems and their applications

Queueing Systems

Volumn 31, Issue 3-4, 1999, Pages 295-316

  Bertsimas, Dimitris ^a   Mourtzinou, Georgia ^b  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

^b Dynamic Ideas LLC   (United States)

Author keywords

Decomposition; Distributional laws; Heavy traffic; Mixed generalized Erlang arrivals; Performance analysis; Polling systems; Switch over times

Indexed keywords

DISTRIBUTIONAL LAWS; HEAVY TRAFFICS; MIXED GENERALIZED ERLANG ARRIVALS; PERFORMANCE ANALYSIS; POLLING SYSTEM;

DECOMPOSITION;

EID: 0033243596     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019118516504     Document Type: Article

References (26)

1. F. Baccelli and P. Bremaud, Elements of Queueing Theory: Palm-Martingale Calculus and Stochastic Recurrences (Springer, New York, 1994).
2. J.E. Baker and I. Rubin, Polling with a general-service order table, IEEE Trans. Commun. 35 (1987) 283-288.
3. D. Bertsimas and G. Mourtzinou, A unified method to analyze overtake-free queueing systems, Adv. in Appl. Probab. 28 (1996) 588-625.
4. D. Bertsimas and G. Mourtzinou, Multiclass queueing systems in heavy traffic: An asymptotic approach based on distributional and conservation laws, Oper. Res. 45(3) (1997) 470-487.
5. D. Bertsimas and D. Nakazato, The distributional Little's law and its applications, Oper. Res. 43 (1995) 298-310.
6. S.C. Borst and O.J. Boxma, Polling models with and without switchover times, Oper. Res. 45 (1997) 536-543.
7. O.J. Boxma, Workloads and waiting times in single-server systems with multiple customer classes, Queueing Systems 5 (1989) 185-214.
8. O.J. Boxma and W.P. Groenendijk, Pseudo-conservation laws in cyclic-service systems, J. Appl. Probab. 24 (1987) 949-964.
9. O.J. Boxma and J.A. Weststrate, Waiting times in polling systems with Markovian server routing, in: Lecture Notes in Computer Science 218, eds. G. Stiege and J.S. Lie (Academic Press, Berlin, 1989) pp. 89-104.
10. R.B. Cooper and G. Murray, Queues served in cyclic order, Bell Syst. Tech. J. 48 (1969) 675-689.
11. D.R. Cox, The analysis of non-Markovian stochastic processes by the inclusion of supplementary variables, Proc. Cambridge Philos. Soc. 51 (1955) 433-441.
12. M. Eisenberg, Queues with periodic service and change-over times, Oper. Res. 20 (1972) 440-451.
13. S.W. Fuhrmann, Symmetric queues served in cyclic order, Oper. Res. Lett. 4 (1985) 139-144.
14. S.W Fuhrmann and R.B. Cooper, Stochastic decompositions in a M/G/1 queue with generalized vacation, Oper. Res. 33 (1985) 1117-1129.
15. R. Haji and G. Newell, A relation between stationary queue and waiting time distributions, J. Appl. Probab. 8 (1971) 617-620.
16. J. Keilson and L. Servi, A distributional form of Little's law, Oper. Res. Lett. 7 (1988) 223-227.
17. J. Keilson and L. Servi, The distributional form of Little's law and the Fuhrmann-Cooper decomposition, Oper. Res. Lett. 9 (1990) 239-247.
18. F.P. Kelly, Reversibility and Stochastic Networks (Wiley, New York, 1979).
19. L. Kleinrock and H. Levy, The analysis of random polling systems, Oper. Res. 36 (1988) 716-732.
20. A.G. Konheim and B. Meister, Waiting lines and times in a system with polling, J. Assoc. Comput. Mach. 21 (1974) 470-490.
21. H. Levy, Binomial-gated service: A method for effective operation and optimization of polling systems, IEEE Trans. Commun. 39 (1991) 1341-1349.
22. H. Levy and M. Sidi, Polling systems: Applications, modeling and optimization, IEEE Trans. Commun. 38 (1990) 1750-1760.
23. S.C. Srinivasan, M.M. Niu and R.B. Cooper, Relating polling systems with zero and nonzero switchover times, Queueing Systems 19 (1995) 149-168.
24. H. Takagi, Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).
25. H. Takagi, ed., Stochastic Analysis of Computer and Communication Systems (Elsevier, Amsterdam, 1990).
26. P. Tran-Gia, Analysis of polling systems with general input process and finite capacity, IEEE Trans. Commun. 40 (1992) 337-344.