Polling systems with a patient server and state-dependent setup times

IIE Transactions (Institute of Industrial Engineers)

Volumn 29, Issue 6, 1997, Pages 469-480

  Gunalay, Yavuz ^a   Gupta, Diwakar ^b  

^a EASTERN MEDITERRANEAN UNIVERSITY   (Turkey)

^b MCMASTER UNIVERSITY   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL METHODS; FOURIER TRANSFORMS; NUMERICAL METHODS; QUEUEING THEORY;

CYCLIC SERVICE POLLING SYSTEMS; DISCRETE FOURIER TRANSFORMS (DFT);

OPERATIONS RESEARCH;

EID: 0031153395     PISSN: 0740817X     EISSN: 15458830     Source Type: Journal    
DOI: 10.1080/07408179708966353     Document Type: Article

References (17)

1. Takagi, H., (1990) Queuing analysis of polling models an update, in Stochastic Analysis of Computer and Communication Systems, Takagi, H. (ed.), Elsevier, Amsterdam, pp. 267–318.
2. Takagi, H., (1994) Queueing Analysis of Polling Models Progress in (1990–93, Institute of Socio–Economic Planning, University of Tsukuba, Japan.
3. Gupta, D., and Snnivasan, M. M., (1996) Polling systems with state dependent setup times. Queueing Systems, 22, 403–423.
4. Bradlow, H. S., and Byrd, H. F., (1987) Mean waiting time evaluation of packet switches for centrally controlled PBX's. Performance Evaluation, 7, 309–327.
5. Ferguson, M. J., (1986) Mean waiting time for token ring with station dependent overheads, in Local Area and Multiple Access Networks, Pickholtz, R. L. (ed.), Computer Science Press, Rockville, MD. pp. 43–67.
6. Srinivasan, M. M., and Gupta, D., (1996) When should a roving server be patient? Management Science, 42 (42), 437–451.
7. Konheim, A. G., Levy, H., and Snnivasan, M. M., (1994) Descendant set an efficient approach for the analysis of polling systems. IEEE Transactions on Communications, 42 (2/3/4), 1245–1253.
8. Eisenberg, M., (1971) Two queues with changeover Times. Operations Research, 19 (19), 386–401.
9. Altman, E., Konstantopoulos, P., and Liu, Z., (1992) Stability, monotonicity and invanant quantities in general polling Systems. Queueing Systems, 11, 35–57.
10. Fuhrmann, S. W., and Cooper, R. B., (1985) Stochastic decompositions in the M/G/l queue with generalized vacations. Operations Research, 33 (33), 1117–1129.
11. Cooper, R. B., and Murray, G., (1969) Queues served in cyclic order. The Bell System Technical Journal, 19 (19), 675–689.
12. Daigle, J. N., (1989) Queue length distributions from probability generating functions via discrete Fourier transforms. Operations Research Letters, 8 (8), 229–236.
13. Leung, K. K., (1991) Cyclic–service systems with probabilistically-limited service. IEEE Journal on Selected Areas in Communications, 9 (9), 185–193.
14. Eisenberg, M., (1972) Queues with penodic service and changeover time. Operations Research, 20 (20), 440–451.
15. Poularikas, A. D., and Seely, S., (1991) Signals and Systems. PWS-KENT Publishing Co., Boston, MA.
16. Press, W. H., Teukolsky, S. A., Vetterling, W. T., and Flannery, B. P., (1992) Numerical Recipes in C, Cambridge University Press, New York.
17. Srinivasan, M. M., Niu, S. C., and Cooper, R. B., (1995) Relating polling models with zero and nonzero switchover times. Queueing Systems, 19 (19), 149–168.