Hostname: page-component-7b7567c8c-kwt9d Total loading time: 0 Render date: 2026-11-13T21:32:13.455Z Has data issue: false hasContentIssue false
  • English
  • Français

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

Part of:Operations research and management scienceSpecial processes

Published online by Cambridge University Press:  14 July 2016

Robert B. Cooper,
Shun-Chen Niu and
Mandyam M. Srinivasan
Robert B. Cooper*
Affiliation:
Florida Atlantic University
Shun-Chen Niu*
Affiliation:
University of Texas at Dallas
Mandyam M. Srinivasan*
Affiliation:
University of Tennessee
*
∗ Postal address: Department of Computer Science and Engineering, Florida Atlantic University, Boca Raton, FL 33431–0991, USA. Email address: bob@cse.fau.edu.
∗∗ Postal address: School of Management, The University of Texas at Dallas, P.O. Box 830688, Richardson, TX 75083–0688, USA.
∗∗∗ Postal address: Management Science Program, College of Business Administration, The University of Tennessee, Knoxville, TN 37996–0562, USA.
Get accessRights & Permissions [Opens in a new window]

Abstract

We compare two versions of a symmetric two-queue polling model with switchover times and setup times. The SI version has State-Independent setups, according to which the server sets up at the polled queue whether or not work is waiting there; and the SD version has State-Dependent setups, according to which the server sets up only when work is waiting at the polled queue. Naive intuition would lead one to believe that the SD version should perform better than the SI version. We characterize the difference in the expected waiting times of these two versions, and we uncover some surprising facts. In particular, we show that, regardless of the server utilization or the service-time distribution, the SD version performs (i) the same as, (ii) worse than, or (iii) better than its SI counterpart if the switchover and setup times are, respectively, (i) both constants, (ii) variable (i.e. non-deterministic) and constant, or (iii) constant and variable. Only (iii) is consistent with naive intuition.

Keywords

Polling modelsstate-dependent setup timeswaiting timesswitchover timesvacation modelsdecomposition

MSC classification

Primary:60K25: Queueing theory
Secondary:60K30: Applications (congestion, allocation, storage, traffic, etc.)90B22: Queues and service

Information

Type
Research Papers
Information
Journal of Applied Probability , Volume 36 , Issue 2 , June 1999, pp. 585 - 592
Copyright
Copyright © Applied Probability Trust 1999 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

Footnotes

Research supported in part by the National Science Foundation under grants DMI-9500216, 9500040, 9500471.

Research also supported in part by a Summer Research Grant from the School of Management, The University of Texas at Dallas.

References

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.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
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.Google Scholar
Cooper, R. B. (1981). Introduction to Queueing Theory, 2nd edn. North-Holland, New York. Available from University Microfilms International, Ann Arbor, MI.Google Scholar
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.CrossRefGoogle Scholar
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.CrossRefGoogle Scholar
Eisenberg, M. (1995). The polling system with changeover times that depend on the occupancy of the visited queue. Proc. 3rd INFORMS Telecommunications Conference. INFORMS, Baltimore, MD.Google Scholar
Ferguson, M. J. (1986). Mean waiting time for a token ring with station-dependent overheads. In Local Area and Multiple Access Networks, ed. Pickholtz, R. L. Computer Science Press, Rockville, Md, pp. 43–67.Google Scholar
Fuhrmann, S. W. (1985). Symmetric queues served in cyclic order. Operat. Res. Lett. 4, 139–144.CrossRefGoogle Scholar
Fuhrmann, S. W. (1992). A decomposition result for a class of polling models. Queueing Systems 11, 109–120.CrossRefGoogle Scholar
Fuhrmann, S. W., and Cooper, R. B. (1985). Stochastic decompositions in the M/G/1 queue with generalized vacations. Operat. Res. 33, 1117–1129.CrossRefGoogle Scholar
Günalay, Y. (1995). State dependent server scheduling rules in polling systems. Ph.D. Dissertation, McMaster University, Hamilton, CA.Google Scholar
Günalay, Y., and Gupta, D. (1997). Polling systems with a patient server and state-dependent setup times. IIE Transactions 29, 469–480.CrossRefGoogle Scholar
Gupta, D., and Srinivasan, M. M. (1996). Polling systems with state-dependent setup times. Queueing Systems 22, 403–423.Google Scholar
Kuehn, P. J. (1979). Multiqueue systems with nonexhaustive cyclic service. The Bell System Technical Journal 58, 671–698.CrossRefGoogle Scholar
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.Google Scholar
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.Google Scholar
Sarkar, D., and Zangwill, W. I. (1991). Variance effects in cyclic production systems. Management Sci. 37, 443–453.Google Scholar
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.CrossRefGoogle Scholar
Wolff, R. W. (1982). Poisson arrivals see time averages. Operat. Res., 30, 223–231.CrossRefGoogle Scholar
Wolff, R. W. (1989). Stochastic Modeling and the Theory of Queues. Prentice-Hall, Englewood Cliffs, NJ.Google Scholar