Gated polling systems with lévy inflow and inter-dependent switchover times: A dynamical-systems approach

Queueing Systems

Volumn 49, Issue 1, 2005, Pages 49-72

  Eliazar, Iddo ^a  

^a BAR ILAN UNIVERSITY   (Israel)

Author keywords

Gated service regime; L vy subordinators; Poincar map; Polling systems

Indexed keywords

LAPLACE TRANSFORMS; STOCHASTIC SYSTEMS;

DETERMINISTIC DYNAMICAL SYSTEMS; DYNAMICAL SYSTEMS APPROACH; GATED SERVICES; POINCARE; POLLING SYSTEM; STATISTICAL CHARACTERISTICS; STOCHASTIC DYNAMICS; SUBORDINATORS;

DYNAMICAL SYSTEMS;

EID: 17544373818     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-004-5555-7     Document Type: Article

References (24)

1. J. Bertoin, Lévy Processes (Cambridge Univ. Press, Cambridge, 1996).
2. D. Bertsimas and G. Mourtzinou, Decomposition results for general polling systems and their applications, Queueing Systems 31(3/4) (1999) 295-316.
3. S.C. Borst and O.J. Boxma, Polling models with and without switchover times, Oper. Res. 45(4) (1997) 536-543.
4. O.J. Boxma, Analysis and optimization of polling systems, in: Queueing, Performance and Control in ATM, eds. J.W. Cohen and C.D. Pack (North-Holland, Amsterdam, 1991) pp. 173-183.
5. R.B. Cooper, Queues served in cyclic order: waiting times, Bell System Tech. J. 49 (1970) 399-413.
6. R.B. Cooper and G. Murray, Queues served in cyclic order, Bell System Tech. J. 48 (1969) 675-689.
7. R.B. Cooper, S.C. Niu and M.M. Srinivasan, A decomposition theorem for polling models: The switchover times are effectively additive, Oper. Res. 44 (1996) 629-633.
8. M. Eisenberg, Two queues with changeover times, Oper. Res. 19 (1971) 386-401.
9. M. Eisenberg, Queues with periodic service and changeover times, Oper. Res. 20 (1972) 440-451.
10. P. Embrechts and M. Maejima, Selfsimilar Processes (Princeton Univ. Press, Princeton, 2002).
11. D. Grillo, Polling mechanism models in communication systems - some applications and examples, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp. 659-698.
12. A.G. Konheim, H. Levy and M.M. Srinivasan, Descendant set: An efficient approach for the analysis of polling systems, IEEE Trans. Commun. 42 (1994) 1245-1253.
13. A. Lasota and M.C. Mackey, Chaos, Fractals, and Noise, 2nd ed. (Springer, Berlin, 1994).
14. H. Levy and M. Sidi, Polling systems: Applications, modeling, and optimization, IEEE Trans. Commun. 38 (1990) 1750-1760.
15. C. Mack, T. Murphy and N.L. Webb, The efficiency of N machines unidirectionally patrolled by one operative when walking times and repair times are constants, J. Roy. Statist. Soc. B 19 (1957) 1066-172.
16. J.A.C. Resing, Polling systems and multitype branching processes, Queueing Systems 13(4) (1993) 409-426.
17. M.P. Singh and M.M. Srinivasan, Exact analysis of state-dependent polling model, Queueing Systems 41 (2002) 371-399.
18. M.M. Srinivasan, S.C. Niu and R.B. Cooper, Relating polling models with nonzero and zero switchover times, Queueing Systems 19 (1995) 149-168.
19. L. Takács, Two queues attended by a single server, Oper. Res. 16 (1968) 639-650.
20. H. Takagi, Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).
21. H. Takagi, Queueing analysis of polling systems: An update, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990) pp. 267-318.
22. H. Takagi, Application of polling models to computer networks, Comput. Networks ISDN Systems 22 (1991) 193-211.
23. H. Takagi, Queueing analysis of polling models: Progress in 1990-1994, in: Frontiers in Queueing: Models and Applications in Science and Engineering, ed. J.H. Dshalalow (CRC Press, Boca Raton, FL, 1997) pp. 119-146.
24. U. Yechiali, Analysis and control of polling systems, in: Performance Evaluation of Computer and Communication Systems, eds. L. Donatiello and R. Nelson (Springer, Berlin, 1993) pp. 630-650.