Mean value analysis for polling systems

Queueing Systems

Volumn 54, Issue 1, 2006, Pages 35-44

  Winands, E M M ^a   Adan, I J B F ^a   Van Houtum, G J ^a  

^a EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Exhaustive service; Gated service; Mean value analysis; Polling systems

Indexed keywords

EXHAUSTIVE SERVICE; GATED SERVICES; MEAN DELAYS; MEAN VALUE ANALYSIS; POLLING SYSTEM;

VALUE ENGINEERING;

EID: 33748563998     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1007/s11134-006-7898-8     Document Type: Article

References (25)

1. D. Bertsekas, R. Gallager, Data Networks (Prentice-Hall, New Jersey, 1987).
2. O.J. Boxma, Workloads and waiting times in single-server systems with multiple customer classes (Queueing Systems, 5 (1989) 185-214).
3. R.B. Cooper, G. Murray, Queues served in cyclic order (The Bell System Technical Journal, 48 (1969) 675-689).
4. R.B. Cooper, Queues served in cyclic order: waiting times (The Bell System Technical Journal, 49 (1970) 399-413).
5. M. Eisenberg, Queues with periodic service and changeover time (Operations Research, 20 (2)(1972) 440-451).
6. M.J. Ferguson, Y. Aminetzah,Exactresultsfornonsymmetric token ring systems (IEEE Transactions on Communications, COM-33 (1985) 223-231).
7. P. Franken, D. Koenig, W. Arndt, F. Schmidt, Queues and Point Processes (John Wiley, New York, 1982).
8. S.W. Fuhrmann, Performance analysis of a class of cyclic schedules (Bell Laboratories Technical Memorandum 81-59531-1, 1981).
9. T. Hirayama, S.J. Hong, M. Krunz, A new approach to analysis of polling systems (Queueing Systems, 48 (1-2)(2004) 135-158).
10. A.G. Konheim, B. Meister, Waiting lines and times in a system with polling (Journal of the Association for Computing Machinery, 21 (3)(1974) 470-490).
11. A.G. Konheim, H. Levy, M.M. Srinivasan, Descendant set: an efficient approach for the analysis of polling systems (IEEE Transactions on Communications, 42 (2/3/4)(1994) 1245-1253).
12. H. Levy, Delay computation and dynamic behavior of non-symmetric polling systems (Performance Evaluation, 10 (1) (1989) 35-51).
13. H. Levy, M. Sidi, Polling systems: applications, modeling and optimization (IEEE Transactions on Communications, COM-38 (10)(1990) 1750-1760).
14. J.D.C. Little, A proof of the queueing formula L = λW (Operations Research, 9 (1961) 383-387).
15. C. Mack, T. Murphy, N.L. Webb, The efficiency of N machines uni-directionally patrolled by one operative when walking time and repair times are constants (Journal of the Royal Statistical Society Series B, 19 (1)(1957) 166-172).
16. C. Mack, The efficiency of N machines uni-directionally patrolled by one operative when walking time is constant and repair times are variable (Journal of the Royal Statistical Society Series B, 19 (1)(1957) 173-178).
17. J.A.C. Resing, Polling systems and multitype branching processes (Queueing Systems, 13 (1993) 409-426).
18. I. Rubin, L.F.M. De Moraes, Message delay analysis for polling and token multiple-access schemes for local communication networks (IEEE Journal on Selected Areas in Communications, SAC-1 (5)(1983) 935-947).
19. D. Sarkar, W.I. Zangwill, Expected waiting time for nonsymmetric cyclic queueing systems - exact results and applications (Management Science, 35 (1989) 1463-1474).
20. M.M. Srinivasan, H. Levy, A.G. Konheim, The individual station technique for the analysis of polling systems (Naval Research Logistics, 43 (1)(1996) 79-101).
21. G.B. Swartz, Polling in a loop system (Journal of the Association for Computing Machinery, 27 (1)(1980) 42-59).
22. H. Takagi, Queueing analysis of polling models: an update (In Stochastic Analysis of Computer and Communication Systems, H. Takagi (ed.), North-Holland, Amsterdam (1990) 267-318).
23. H. Takagi, Queueing analysis of polling models: progress in 1990-1994 (In Frontiers in Queueing: Models, Methods and Problems, J.H. Dshalalow (ed.), CRC Press, Boca Raton (1997) 119-146).
24. H. Takagi, Analysis and application of polling models (In Performance Evaluation: Origins and Directions, G. Haring, C. Lindemann and M. Reiser (eds.), Lecture Notes in Computer Science, vol. 1769, Springer, Berlin (2000) 423-442).
25. R.W. Wolff, Poisson arrivals see time averages (Operations Research, 30 (2) (1982) 223-231).