Waiting-time approximations for service systems with a polling table
(1989) Proceedings of the Tenth Symposium on Information Theory in the Benelux — Location: Houthalen, Belgium (25.May.1989)
Files
No attached file found for this publication.
Details
- Authors
- Abstract
- Waiting-time approximations for service systems with a polling table seem extremely useful since they enable some form of optimization and moreover they lead to the ability to control the systems under consideration. In this paper a special group of priority polling sequences is considered; for such a group, explicit formulas are derived for the mean waiting times at individual stations. Based on these explicit formulas, a comparison of the performance of a given station (i.e. the priority station) under different polling sequences is presented.
- Affiliations
Citations
Giannakouros, N. P., & Laloux, A. (1989). Waiting-time approximations for service systems with a polling table. In Barbe, A.M.; (ed.), Proceedings of the Tenth Symposium on Information Theory in the Benelux (p. p. 139-145). Werkgemeenschap voor inf.- & communicatietheorie. https://hdl.handle.net/2078.5/222621