Abstract
This paper investigates mean delays in a single-server queueing model with cyclic service. An approximate analysis is performed for an arbitrary number of queues, constant switch-over time, exhaustive service discipline, Poisson arrival processes, and general service-time distributions. Neither inter-arrival nor service-time distributions have to be identical for the different queues. A major value of our approximation lies in the simplicity of its numerical evaluation for an arbitrary number of queues and any traffic pattern. Extensive comparisons with simulation results show the high accuracy of the approximation over a wide range of parameters.
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.
