WAITING-TIMES FOR THE CPB SYSTEM

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.