An Algorithmic Solution of Polling Models with Limited Service Disciplines

IEEE Transactions on Communications

Volumn 40, Issue 7, 1992, Pages 1152-1155

  Blanc, J P C ^a  

^a TILBURG UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL TECHNIQUES - ITERATIVE METHODS; PROBABILITY - QUEUEING THEORY;

LIMITED SERVICE DISCIPLINES; MULTIQUEUE SYSTEMS; POISSON ARRIVAL STREAMS; POLLING MODELS; POWER-SERIES ALGORITHM;

TELECOMMUNICATION;

EID: 0026886541     PISSN: 00906778     EISSN: None     Source Type: Journal    
DOI: 10.1109/26.153357     Document Type: Article

References (8)

1. J. P. C. Blanc, “A numerical approach to cyclic-service queueing models,” Queueing Syst. vol. 6, pp. 173–188, 1990.
2. J. P. C. Blanc, “Cyclic polling systems: limited service versus Bernoulli schedules,” Rep. FEW 422, Dept. Economics, Tilburg University, 1990.
3. O. J. Boxma, and B. W. Meister, “Waiting-time approximations in multiqueue systems with cyclic service,” Perform. Eval vol. 7, pp. 59–70, 1987.
4. S. W. Fuhrmann, and Y. T. Wang, “Analysis of cyclic service systems with limited service: bounds and approximations,” Perform. Eval., vol. 9, pp. 35–54, 1988.
5. L. Kleinrock, Queueing Systems, vol. 2. New York: Wiley, 1976.
6. K. K. hung, “Waiting time distributions for token-passing systems with limited-K service via discrete Fourier transforms,” in Performance ’90, P. J. B. King, I. Mitrani, and R. J. Pooley, Eds. Amsterdam: North-Holland, 1990, pp. 333-347.
7. H. Takagi, “Queueing analysis of polling models: an update,” in Stochastic Analysis of Computer Communication Systems, H. Takagi Ed. Amsterdam: North-Holland, 1990, pp. 267–318.
8. P. Wynn, “On the convergence and stability of the epsilon algorithm,” SIAM J. Numer. Anal. vol. 3, pp. 91–122, 1966.