The author presents performance analysis of a single buffer multiple-queue system. Four different types of service disciplines (i.e., non-preemptive, pre-emptive repeat different, state dependent random polling and globally gated) are analyzed. His model includes correlated input process and three different types of non-productive time (i.e., switchover, vacation and idle time). Special cases of the model includes server with mixed multiple and single vacations, stopping server with delayed vacation and stopping server with alternating vacation and idle time. For each of the four service disciplines the key performance measures such as average customer waiting time, loss probability, and throughput are computed. The results permit a detailed discussion of how these performance measures depends on the customer arrival rate, the customer service time, the switchover time, the vacation time, and the idle time. Moreover, extensive numerical results are presented and the four service disciplines are compared with respect to the performance measure. Previous studies of the single buffer multiple-queue systems tend to provide separate analysis for the two cases of zero and nonzero switchover time. The author is able to provide a unified analysis for the two cases. His results generalize and improve a number of known results on single buffer multiple-queue systems. Furthermore, this method does not require differentiation while it is needed if one uses the probability generating function approach. Lastly, the author's approach works for all single buffer multiple-queue systems in which the next queue to be served is determines solely on the basis of the occupancy states at the end of the cycle time.
Bounded truncation error for long-run averages in infinite Markov chains
