Abstract
We consider a polling model in which a number of queues are served, in cyclic order, by a single server. Each queue has its own distinct Poisson arrival stream, service time, and switchover time (the server's travel time from that queue to the next) distribution. A setup time is incurred if the polled queue has one or more customers present. This is the polling model with State-Dependent service (the SD model). The SD model is inherently complex; hence, it has often been approximated by the much simpler model with State-Independent service (the SI model) in which the server always sets up for a service at the polled queue, regardless of whether it has customers or not. We provide an exact analysis of the SD model and obtain the probability generating function of the joint queue length distribution at a polling epoch, from which the moments of the waiting times at the various queues are obtained. A number of numerical examples are presented, to reveal conditions under which the SD model could perform worse than the corresponding SI model or, alternately, conditions under which the SD model performs better than a corresponding model in which all setup times are zero. We also present expressions for a variant of the SD model, namely, the SD model with a patient server.
This is a preview of subscription content, log in via an institution to check access.
We’re sorry, something doesn't seem to be working properly.
Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.
References
E. Altman, H. Blanc, A. Khamisy and U. Yechiali, Gated-type polling systems with walking and switch-in times, Stochastic Models 10 (1994) 741-763.
H.S. Bradlow and H.F. Byrd, Mean waiting time evaluation of packet switches for centrally controlled PBX's, Performance Evaluation 7 (1987) 309-327.
R.B. Cooper and G. Murray, Queues served in cyclic order, Bell System Techn. J. 48 (1969) 675-689.
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.
R.B. Cooper, S.-C. Niu and M.M. Srinivasan, When does forced idle time improve performance in polling models? Managm. Sci. 44 (1998) 1079-1086.
R.B. Cooper, S.-C. Niu and M.M. Srinivasan, Some refletions on the renewal-theory paradox in queuing theory, J. Appl. Math. Stochastic Anal. 11 (1998) 355-368.
R.B. Cooper, S.-C. Niu and M.M. Srinivasan, Setups in polling models: Does it make sense to set up if no work is waiting? J. Appl. Probab. 36 (1999) 585-592.
I. Duenyas and M.P. Van Oyen, Can setup reduction result in worse performance? Working paper (1994).
M. Eisenberg, The polling system with a stopping server, Queueing Systems 18 (1994) 387-431.
M. Eisenberg, The polling system with changeover times that depend on the occupancy of the visited queue, in: Proc. of the 3rd INFORMS Telecommunications Conf., 1995, Abstract 77.
M.J. Ferguson, 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, 1986) pp. 43-67.
Y. Günalay, State dependent server scheduling rules in polling systems, Ph.D. dissertation, School of Business, McMaster University (1995).
Y. Günalay and D. Gupta, Polling systems with a patient server and state-dependent setup times, IIE Transactions 29 (1997) 469-480.
D. Gupta and M.M. Srinivasan, Polling systems with state-dependent setup times, Queueing Systems 22 (1996) 403-423.
D. Gupta and M.M. Srinivasan, The variance paradox and its implications for Japanese production theory, Interfaces 26 (1996) 69-77.
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.
T. Lennon, Response-time approximations for multi-server, multi-class production systems with significant setups, Technical Report, The University of Michigan (1994) (revised 1995).
T.L. Olsen, Approximations for the waiting time distribution in polling models with and without statedependent setups, Technical Report, The University of Michigan (1996).
J.A.C. Resing, Polling systems and multitype branching processes, Queueing Systems 13 (1993) 409-426.
R. Righter and J.G. Shanthikumar, Multiclass production systems with setup times, Oper. Res. 46 (1998) S146-S153.
D. Sarkar and W.I. Zangwill, Variance effects in cyclic production systems, Managm. Sci. 37 (1991) 443-453.
M.M. Srinivasan and D. Gupta, When should a roving server be patient, Managm. Sci. 42 (1996) 437-451.
M.M. Srinivasan, S.-C. Niu and R.B. Cooper, Relating polling models with zero and nonzero switchover times, Queueing Systems 19 (1995) 149-168.
H. Takagi, Queueing analysis of polling models: An update, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (North-Holland, Amsterdam, 1990).
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.
M.P. Van Oyen, Monotonicity of optimal performance measures for polling systems, Probab. Engrg. Inform. Sci. 11(2) (1997) 219-228.
R. Yehia, Polling models: Decomposition of waiting times and effects of switchover and setup times, Ph.D. dissertation, Department of Computer Science and Engineering, Florida Atlantic University (1998).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Singh, M.P., Srinivasan, M.M. Exact Analysis of the State-Dependent Polling Model. Queueing Systems 41, 371–399 (2002). https://doi.org/10.1023/A:1016287431905
Issue Date:
DOI: https://doi.org/10.1023/A:1016287431905