Second moments of the waitng time in symmetric polling systems

Journal of the Operations Research Society of Japan

Volumn 43, Issue 2, 2000, Pages 306-316

  Kudoh, Seiya ^b   Takagi, Hideaki ^a   Hashida, On ^b  

^a UNIVERSITY OF TSUKUBA   (Japan)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0034196005     PISSN: 04534514     EISSN: None     Source Type: Journal    
DOI: 10.15807/jorsj.43.306     Document Type: Article

References (19)

1. [1] Y. J. Aminetzah: An Exact Approach to the Polling System (Ph.D. dissertation. Department of Electrical Engineering, McGill University, Montreal, Quebec, Canada, 1975).
2. [2] O. J. Boxma: Workloads and waiting times in single-server systems with multiple customer classes. Queueing Systems, 5 (1989) 185-214.
3. [3] E. G. Coffman, Jr. and E. N. Gilbert: A continuous polling system with constant service times. IEEE Transactions on Information Theory, IT-33 (1986) 584-591.
4. [4] E. G. Coffman, Jr., A. A. Puhalskii, and M. I. Reiman: Polling systems with zero switchover times: a heavy-traffic averaging principle. The Annals of Applied Probability, 5 (1995) 681-719.
5. [5] M. J. Ferguson: Computation of the variance of the waiting time for token rings. IEEE Journal on Selected Areas in Communications, SAC-4 (1986) 775-782.
6. [6] M. J. Ferguson and Y. J. Aminetzah: Exact results for nonsymmetric token ring systems. IEEE Transactions on Communications, COM-33 (1985) 223-231. Correction in: G. L. Choudhury and H. Takagi: Comments on "Exact results for nonsymmetric token ring systems." IEEE Transactions on Communications, 38 (1990) 1125-1127.
7. [7] O. Hashida: Analysis of multiqueue. Review of the Electrical Communication Laboratories, 20 (1972) 189-199.
8. [8] A. G. Konheim, H. Levy, and M. M. Srinivasan: Descendant set: An efficient approach for the analysis of polling systems. IEEE Transactions on Communications, 42 (1994) 1245-1253.
9. [9] H. Levy and M. Sidi: Polling systems: applications, modeling, and optimization. IEEE Transactions on Communications, 38 (1990) 1750-1760.
10. [10] D. Sarkar and W. I. Zangwill: Expected waiting time for nonsymmetric cyclic queueing systems - Exact results and applications. Management Science, 35 (1989) 1463-1474.
11. [11] D. Sarkar and W. I. Zangwill: Waiting time variance for nonsymmetric cyclic queueing systems. (Preprint, AT&T Bell Laboratories, 1991).
12. [12] M. M. Srinivasan, H. Levy, and A. G. Konheim: The individual station technique for the analysis of cyclic polling systems. Naval Research Logistics, 43 (1986) 79-101.
13. [13] L. Takács: Two queues attended by a single server. Operations Research, 16 (1968) 639-650.
14. [14] H. Takagi: Analysis of Polling Systems (The MIT Press, Cambridge, Massachusetts, 1986).
15. [15] H. Takagi: Queuing analysis of polling models. ACM Computing Surveys, 20 (1988) 5-28.
16. [16] H. Takagi: Application of polling models to computer networks. Computer Networks and ISDN Systems, 22 (1991) 193-211.
17. [17] H. Takagi: Queueing Analysis, A Foundation of Performance Evaluation, Volume 1: Vacation and Priority Systems, Part 1 (Elsevier, Amsterdam, 1991).
18. [18] R. D. van der Mei: Polling systems in heavy traffic: higher moments of the delay. In V. Ramaswami and P. E. Wirth (eds.): Teletraffic Analysis for the Communication Age (Elsevier, Amsterdam, 1997), 275-284.
19. [19] S. Wolfram: Mathematica: A System for Doing Mathematics by Computer, Second edition (Addison-Wesley, Reading, Massachusetts, 1991).