Abstract
We characterize the impact of the means and distributions of setup times in polling systems. Starting with cyclic systems with exhaustive service, we show that the vector of average setup times affects the complete distribution of waiting times and queue sizes only via its sum. In addition, all moments of all waiting times and queue sizes are reduced if the higher order moments of one or more of the setup times is reduced while maintaining their means. We also obtain a fundamental decomposition result of the queue sizes at polling instants which is reminiscent of those obtained in vacation models. We show that the above results continue to apply under more general and more efficient protocols, e.g., general polling tables, systems with gated service, and systems with mixed service.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
