Descendant Set: An Efficient Approach for the Analysis of Polling Systems

IEEE Transactions on Communications

Volumn 42, Issue 234, 1994, Pages 1245-1253

  Konheim, Alan G ^a   Levy, Hanoch ^b   Srinivasan, Mandyam M ^c  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b RUTGERS UNIVERSITY   (United States)

^c UNIVERSITY OF TENNESSEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; DATA COMMUNICATION SYSTEMS; MATHEMATICAL MODELS; OPTIMIZATION;

CUSTOMER DELAY; DESCENDANT SET; POLLING SYSTEMS;

COMPUTER NETWORKS;

EID: 0028370336     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCOMM.1994.580233     Document Type: Article

References (27)

1. M. Eisenberg, “Queues with Periodic Service and Changeover Time,” Operations Research, vol. 20, pp. 440–451, Mar.-Apr. 1972.
2. J.E. Baker and I. Rubin, “Polling with a General-Service Order Table,” IEEE Trans. on Commun., vol. COM-35, pp. 283–288, Mar. 1987.
3. G.L. Choudhury, “Polling With A General Service Order Table : Gated Service,” Proceedings of the IEEE INFOCOM '90, San Francisco, CA, USA, pp. 268–276, June 1990.
4. L. Kleinrock and H. Levy, “The Analysis of Random Polling Systems,” Operations Research, vol. 36, pp. 716–332, Sept.-Oct. 1988.
5. O.J. Boxma, J.A., Weststrate, Waiting times in polling systems with Markovian server routing. In: G. Stiege and J.S. Lie (eds.), Messung, Modellierung und Bewertung von Rechensystemen und Netzen (Springer, Berlin), pp. 89–104, Sept. 1989.
6. M.M. Srinivasan, “Nondeterministic Polling Systems,” Management Science, vol. 37, pp. 667–681, June 1991.
7. H. Levy, “Binomial-Gated Service: A Method for Effective Operation and Optimization of Polling Systems" IEEE Trans. on Commun., vol. 39, pp. 1341–1350, Sep. 1991.
8. O.J. Boxma, “Workloads and waiting times in single-server systems,” Queueing Systems and Their Applications, vol. 5, pp. 185–214, 1989.
9. S. Browne and U. Yechiali, “Dynamic server routing in binomial-gated, gated, binomial-exhaustive, Bernoulli-gated, Bernoulli-exhaustive and mixed polling systems,” Technical Report, Department of Statistics, Tel-Aviv University, 1989.
10. H. Levy, “Optimization of Polling Systems: The Fractional-Exhaustive Service Method,” Report, Department of Computer Science, Tel-Aviv University, Tel-Aviv, Israel, Nov. 1988.
11. M. Sidi, H. Levy and S.W. Fuhrmann, “A Queueing Network with a Single Cyclically Roving Server,” Queueing Systems and their Applications, vol. 11, pp. 121–144, 1992.
12. S.W. Fuhrmann and R.B. Cooper, “Stochastic decompositions in the M/G/1 queue with server vacations,” Operations Research, vol. 32, 1985.
13. O.J. Boxma and W.P. Groenendijk, “Pseudo conservation laws in cyclic service systems,” Journal of Applied Probability, vol. 24, pp. 949–964, Dec. 1987.
14. E.G. Coffman and A. Stoylar, “Continuous Polling on Graphs,” Prob. Eng. and Info. Sc., vol. 7, no. 2, pp. 209–226, 1993.
15. H. Levy, “Delay Computation and Dynamic Behavior of Polling Systems,” Performance Evaluation, vol. 10, pp. 35–51, Oct. 1989.
16. M.J. Ferguson, “Computation of the Variance of the Waiting Time for Token Rings,” IEEE J. on Sel. Areas in Commun., vol. SAC-4, pp. 775–782, Sept. 1986.
17. H. Levy and M. Sidi, “Polling Systems with Simultaneous Arrivals,” IEEE Trans. on Commun., vol. 39, pp. 823–827, June 1991.
18. O. J. Boxma, H. Levy and J. A. Weststrate, “Optimization of Polling Systems,” in: Performance '90, eds. P.J.B King, I. Mitrani and R.J. Pooley (North-Holland, Amsterdam), pp. 349–361, Sept. 1990.
19. O.J. Boxma, H. Levy and J.A. Weststrate, “Efficient Visit Frequencies for Polling Tables: Minimization of Waiting Cost" Queueing Systems and their Applications, vol. 9, pp. 133–162, 1991.
20. D. Sarkar and W. I. Zangwill, “Expected Waiting Time for Nonsymmetric Cyclic Queueing Systems - Exact Results and Applications,” Management Science, vol. 35, pp. 1463–1474, Dec. 1989.
21. G. B. Swartz, “Polling in a loop system,” J. Ass. Comp. Mach., vol. 27, pp. 42–59, Dec. 1980.
22. L. D. Servi, “Average Delay Approximation of M/G/1 Cyclic Service Queues with Bernoulli Schedules,” IEEE J. on Sel. Areas in Commun., mun., vol. SAC-4, pp. 813–822, Sept. 1986.
23. K.K. Leung, “Waiting time distributions for token-passing systems with limited-K service via discrete Fourier transforms, in: Performance '90, eds. P.J.B. King, I. Mitrani, R.J. Pooley (North-Holland, Amsterdam), pp. 333–347, Sept. 1990.
24. K.K. Leung and M. Eisenberg, “A single-server queue with vacations and gated time-limited service,” IEEE Trans. on Commun., vol. 38, pp. 1454–1462, Sept. 1990.
25. Tedijanto, “Exact Analysis for the Cyclic-Service Queue with a Ber-noulli Schedule,” Performance Evaluation, vol. 11, pp. 107–115, 1990.
26. R.O. LaMaire, “An M/G/1 vacation model of an FDDI station,” IEEE J. on Sel. Areas in Commun., vol. 9, pp. 257–264, Feb. 1991.
27. H. Takagi, “Analysis of Polling Systems,” MIT Press, Apr. 1986.