A decomposition theorem for polling models: The switchover times are effectively additive

Operations Research

Volumn 44, Issue 4, 1996, Pages 629-633

  Cooper, Robert B ^a   Niu, Shun Chen ^b   Srinivasan, Mandyam M ^c  

^a FLORIDA ATLANTIC UNIVERSITY   (United States)

^b UNIVERSITY OF TEXAS AT DALLAS   (United States)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; OPERATIONS RESEARCH;

DECOMPOSITION THEOREM; POLLING MODELS; SWITCHOVER TIMES;

QUEUEING THEORY;

EID: 0030182229     PISSN: 0030364X     EISSN: None     Source Type: Journal    
DOI: 10.1287/opre.44.4.629     Document Type: Article

References (37)

1. AMINETZAH, Y. J. 1975. An Exact Approach to the Polling System. PhD Dissertation. Department of Electrical Engineering, McGill University, Montreal, Quebec, Canada.
2. BAKER, J., AND I. RUBIN. 1987. Polling with a General-Service Order Table. IEEE Trans. Comm. COM-35, 283-288.
3. BLANC, J. P. C. 1990. Cyclic Polling Systems: Limited Versus Bernoulli Schedules. Report FEW 422, Department of Economics, Tilburg University, Tilburg.
4. CHOUDHURY, G. L. 1990. Polling with a General Service Order Table: Gated Service. In Proc. IEEE INFOCOM '90.
5. CHOUDHURY, G. L., AND H. TAKAGI. 1990. Comments on "Exact Results for Nonsymmetric Token Ring Systems." IEEE Trans. Comm. 38, 1125-1127.
6. COOPER, R. B. 1970. Queues Served in Cyclic Order: Waiting Times. Bell Syst. Tech. J. 49, 399-413.
7. COOPER, R. B., AND G. MURRAY. 1969. Queues Served in Cyclic Order. Bell Syst. Tech. J. 48, 675-689.
8. COOPER, R. B., S.-C. NIU, AND M. M. SRINIVASAN. 1993. A Decomposition Theorem for Polling Models: The Switchover Times are Effectively Additive-Proof, Unpublished.
9. DAGANZO, C. F. 1990. Some Properties of Polling Systems. Queueing Systems 6, 137-154.
10. DOSHI, B. T. 1990. Single-Server Queues with Vacations. In Stochastic Analysis of Computer and Communication Systems, H. Takagi (Ed.), North-Holland, Amsterdam.
11. EISENBERG, M. 1972. Queues with Periodic Service and Changeover Times. Opus. Res. 20, 440-451.
12. EISENBERG, M. 1994. The Polling System with a Stopping Server. Queueing Systems 18, 387-431.
13. FERGUSON, M. J., AND Y. J. AMINETZAH. 1985. Exact Results for Nonsymmetric Token Ring Systems. IEEE Trans. Comm. COM-33, 223-231.
14. FUHRMANN, S. W. 1992. A Decomposition Result for a Class of Polling Models. Queueing Systems 11, 109-120.
15. FUHRMANN, S. W., AND R. B. COOPER. 1985. Stochastic Decompositions in the M/G/1 Queue with Generalized Vacations. Opns. Res. 33, 1117-1129.
16. FUHRMANN, S. W., AND A. MOON. 1990. Queues Served in Cyclic Order with an Arbitrary Start-up Distribution. Naval Res. Logistics 37, 123-133.
17. GARNER, G. M. 1990. Mean and Variance of Waiting Time for Nonsymmetric Cyclic Queueing Systems. Technical Report, AT&T Bell Laboratories.
18. HASHIDA, O. 1972. Analysis of Multiqueue. Rev. Electrical Comm. Labs 20, 189-199.
19. HASHIDA, O., AND G. NAKAMURA. 1969. Analysis of Multiqueues. Keiei Kagaku (in Japanese)/Mgmt. Sci. 13, 30-47.
20. HUMBLET, P. A. 1978. Source Coding for Communication Concentrators. Report ESL-R-798, Electronic Systems Laboratory, Massachusetts Institute of Technology, Cambridge, Mass.
21. KONHEIM, A. G., H. LEVY, AND M. M. SRINIVASAN. 1994. Descendant Set: An Efficient Approach for the Analysis of Polling Systems. IEEE Trans. Comm. 42, 1245-1253.
22. KONHEIM, A. G., AND B. MEISTER. 1974. Waiting Lines and Times in a System with Polling. J. Assoc. Comput. Mach. 21, 470-490.
23. KUEHN, P. J. 1979. Multiqueue Systems with Nonexhaustive Cyclic Service. Bell Syst. Tech. J. 58, 671-698.
24. LEVY, H., AND L. KLEINROCK. 1991. Polling Systems with Zero Switch-Over Periods: A General Method for Analyzing the Expected Delay. Performance Evaluation 13, 97-107.
25. LEVY, H., AND M. SIDI. 1991. Polling Systems with Simultaneous Arrivals. IEEE Trans. Comm. 39, 823-827.
26. SARKAR, D., AND W. I. ZANGWILL. 1989. Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems-Exact Results and Applications. Mgmt. Sci. 35, 1463-1474.
27. SARKAR, D., AND W. I. ZANGWILL. 1991. Variance Effects in Cyclic Production Systems. Mgmt. Sci. 37, 443-453.
28. SRINIVASAN, M. M. 1991. The Individual Station Technique for the Analysis of Continuous-Time Polling Systems. Technical Report 91-36, Department of Industrial and Operations Engineering, University of Michigan, Ann Arbor, MI.
29. SRINIVASAN, M. M., S.-C. NIU, AND R. B. COOPER. 1995. Relating Polling Models with Zero and Nonzero Switchover Times. Queueing Systems 19, 149-168.
30. SWARTZ, G. B. 1980. Polling in a Loop System. J. Assoc. Comput. Mach. 27, 42-59.
31. TAKAGI, H. 1986. Analysis of Polling Systems. MIT Press, Cambridge, Mass.
32. TAKAGI, H. 1987. Queueing Analysis of Polling Systems with Zero Switchover Times. TRL Research Report, TR87-0034, IBM Japan, Ltd., Tokyo.
33. TAKAGI, H. 1989. Analysis of Polling Systems with a Mixture of Exhaustive and Gated Service Disciplines. J. Opns. Res. Soc. Japan 32, 450-461.
34. TAKAGI, H. 1990. Queueing Analysis of Polling Models: An Update. In Stochastic Analysis of Computer and Communication Systems, H. Takagi (ed.), North-Holland, Amsterdam.
35. TAKAGI, H. 1991a. Application of Polling Models to Computer Networks. Computer Networks and ISDN Systems 22, 193-211.
36. TAKAGI, H. 1991b. Queueing Analysis, Vol. 1: Vacation and Priority Systems, Part 1, North-Holland, Amsterdam.
37. TAYUR, S., AND D. SARKAR. 1988. Implementation of an Efficient Algorithm to Calculate Waiting Times in a Nonsymmetric Cycle Queueing System. Internal Memorandum, 45313-880822-01IM. AT&T Bell Laboratories.