A cyclic queue has one server and n nodes, where each node has its own distinct type of customers that arrive from the outside. The server visits the nodes cyclically, serving the customers first at node 1, then at node 2, and so on through node n, and then repeating from node 1 again. Setup...

This paper provides the expected waiting time of a nonsymmetric cyclic server queueing system with Poisson traffic, arbitrary switchover and arbitrary service times. For n the number of queues, the expected waiting time is obtained using n equations which is a significant improvement over the...