Threshold start-up control policy for polling systems

Queueing Systems

Volumn 29, Issue 2-4, 1998, Pages 399-421

  Günalay, Yavuz ^a   Gupta, Diwakar ^b  

^a BILKENT UNIVERSITY   (Turkey)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

Descendant sets; Dormant patient server; Globally gated service; Polling models; Queueing theory; Threshold start up control

Indexed keywords

QUEUEING THEORY;

AGGREGATE PERFORMANCE; COMPUTATIONALLY EFFICIENT; DESCENDANT SETS; GATED SERVICES; MATHEMATICAL ANALYSIS; MEAN WAITING TIME; MULTI-PRODUCT SYSTEMS; POLLING MODEL;

COMPUTER CIRCUITS;

EID: 0041179473     PISSN: 02570130     EISSN: 15729443     Source Type: Journal    
DOI: 10.1023/a:1019152601966     Document Type: Article

References (20)

1. E. Altman, P. Konstantopoulos and Z. Liu, Stability, monotonicity and invariant quantities in general polling systems, Queueing Systems 11 (1992) 35-57.
2. S.C. Borst, A globally gated polling system with a dormant server, Probab. Engrg. Inform. Sci. 9 (1995) 239-254.
3. O.J. Boxma and W.P. Groenendijk, Pseudo-conservation laws in cyclic-service systems, J. Appl. Probab. 24 (1987) 949-964.
4. O.J. Boxma, J.A. Weststrate and U. Yechiali, A globally gated polling system with server interruptions, and applications to the repairman problem, Probab. Engrg. Inform. Sci. 7 (1993) 187-208.
5. P.J. Burke, Delays in single-server queues with batch input, Oper. Res. 23 (1975) 830-833.
6. R.B. Cooper, Introduction to Queueing Theory, 3rd ed. (CEE Press, 1990).
7. M. Eisenberg, The polling system with a stopping server, Queueing Systems 18 (1994) 387-431.
8. S.W. Fuhrmann and R.B. Cooper, Stochastic decompositions in the M/G/1 queue with generalized vacations, Oper. Res. 33 (1985) 1117-1129.
9. Y. Günalay and D. Gupta, Threshold start-up control policy for polling systems, Working paper, McMaster University, Hamilton, Ontario, Canada (1996).
10. D.P. Heyman and M.J. Sobel, Stochastic Models in Operations Research, Vol. I: Stochastic Processes and Operating Characteristics (McGraw-Hill, New York, 1982).
11. D.P. Heyman and M.J. Sobel, Stochastic Models in Operations Research, Vol. II: Stochastic Optimization (McGraw-Hill, New York, 1984).
12. A.G. Konheim, H. Levy and M.M. Srinivasan, Descendant set: An efficient approach for the analysis of polling systems, Trans. Commun. 42 (1993) 1245-1253.
13. Z. Liu, P. Nain and D. Towsley, On optimal polling policies, Queueing Systems 11 (1992) 59-83.
14. J.A.C. Resing, Polling systems and multitype branching processes, Queueing Systems 13 (1993) 409-426.
15. W.E. Smith, Various optimizers for single-stage production, Naval Res. Logist. Quart. 3 (1956) 59-66.
16. M.M. Srinivasan and D. Gupta, When should a server be patient?, Mangm. Sci. 42 (1996) 437-451.
17. M.M. Srinivasan, S.C. Niu and R.B. Cooper, Relating polling models with nonzero and zero switchover times, Queueing Systems 19 (1995) 149-168.
18. H. Takagi, Analysis of Polling Systems (MIT Press, Cambridge, MA, 1986).
19. H. Takagi, Queuing analysis of polling models: An update, in: Stochastic Analysis of Computer and Communication Systems, ed. H. Takagi (Elsevier/North-Holland, 1990) pp. 267-318.
20. H. Takagi, Queueing Analysis of Polling Models: Progress in 1990-1993 (Institute of Socio-Economic Planning, University of Tsukuba, Japan, 1994).