Setups in polling models: Does it make sense to set up if no work is waiting?

Journal of Applied Probability

Volumn 36, Issue 2, 1999, Pages 585-592

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

^a UNIVERSITY OF TEXAS AT DALLAS   (United States)

^b Florida Atlantic Univ   (United States)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

Decomposition; Polling models; State dependent setup times; Switchover times; Vacation models; Waiting times

Indexed keywords

EID: 0033147549     PISSN: 00219002     EISSN: None     Source Type: Journal    
DOI: 10.1017/S0021900200017332     Document Type: Article

References (21)

1. ALTMAN, E., BLANC, H., KHAMISY, A. AND YECHIALI, U. (1994). Gated-type polling systems with walking and switch-in times. Stochastic Models 10, 741-763.
2. BRADLOW, H. S. AND BYRD, H. F. (1987). Mean waiting time evaluation of packet switches for centrally controlled PBX's. Perf. Eval. 7, 309-327.
3. BURKE, P. J. (1968). A recurrence relation for stationary birth-and-death processes with an application to finite-source traffic systems. Bell Telephone Laboratories Technical Memorandum.
4. COOPER, R. B. (1981). Introduction to Queueing Theory, 2nd edn. North-Holland, New York. Available from University Microfilms International, Ann Arbor, MI.
5. COOPER, R. B., NIU, S.-C. AND SRINIVASAN, M. M. (1996). A decomposition theorem for polling models: the switchover times are effectively additive. Operat. Res. 44, 629-633.
6. COOPER, R. B., NIU, S.-C. AND SRINIVASAN, M. M. (1998). When does forced idle time improve performance in polling models? Management Sci. 44, 1079-1086.
7. EISENBERG, M. (1995). The polling system with changeovertimes that depend on the occupancy of the visited queue. Proc. 3rd INFORMS Telecommunications Conference. INFORMS, Baltimore, MD.
8. FERGUSON, M. J. (1986). Mean waiting time for a token ring with station-dependent overheads. In Local Area and Multiple Access Networks, ed. R. L. Pickholtz. Computer Science Press, Rockville, Md, pp. 43-67.
9. FUHRMANN, S. W. (1985). Symmetric queues served in cyclic order. Operat. Res. Lett. 4, 139-144.
10. FUHRMANN, S. W. (1992). A decomposition result for a class of polling models. Queueing Systems 11, 109-120.
11. FUHRMANN, S. W. AND COOPER, R. B. (1985). Stochastic decompositions in the M/G/I queue with generalized vacations. Operat. Res. 33, 1117-1129.
12. GÜNALAY, Y. (1995). State dependent server scheduling rules in polling systems. Ph.D. Dissertation, McMaster University, Hamilton, CA.
13. GÜNALAY, Y. AND GUPTA, D. (1997). Polling systems with a patient server and state-dependent setup times. IIE Transactions 29, 469-480.
14. GUPTA, D. AND SRINIVASAN, M. M. (1996). Polling systems with state-dependent setup times. Queueing Systems 22, 403-423.
15. KUEHN, P. J. (1979). Multiqueue systems with nonexhaustive cyclic service. The Bell System Technical Journal 58, 671-698.
16. LENNON, T. (1995). Response-time approximations for multi-server, multi-class production systems with significant setups. Technical Report, The University of Michigan, Ann Arbor, MI. Revised, 1995.
17. OLSEN, T. L. (1996). Approximations for the waiting time distribution in polling models with and without state-dependent setups. Technical Report, The University of Michigan, Ann Arbor, MI.
18. SARKAR, D. AND ZANGWILL, W. I. (1991). Variance effects in cyclic production systems. Management Sci. 37, 443-453.
19. SRINIVASAN, M. M., NIU, S.-C. AND COOPER, R. B. (1995). Relating polling models with zero and nonzero switchover times. Queueing Systems 19, 149-168.
20. WOLFF, R. W. (1982). Poisson arrivals see time averages. Operat. Res., 30, 223-231.
21. WOLFF, R. W. (1989). Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.