Abstract
In this paper, a nonsymmetric cyclic queueing system is considered. In this system, there are N stations and k queues at each station. A single server visits each station and serves a queue at the station according to the priority rule. The arrival process at each queue is assumed to be Poisson and customers are served according to a general service time distribution. The system is termed a CPB system. A detailed mathematical analysis for this system proceeds and the equilibrium equations for the probabilities are deduced, and as a result, useful generating functions ( PGFs) are obtained. The mean waiting time for customers and the mean queue length, for example, are obtained.
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.
