An algorithm proposed for busy-period subcomponent analysis of bulk queues

This paper presents an algorithmic procedure for a busy-period subcomponent analysis of bulk queues. A component of interest for many server queues is the periodt_k to reduce congestion from a levelk to levelk-1. For anM^(x)/M/c system with the possibility of total or partial rejection of batches, it is demonstrated that the expected length of busy periods, the proportion of delayed batch and the steady state queue length probabilities can be easily obtained. The procedure is based on the nested partial sums and monotonic properties of expected lengths of the busy periods.Formerly University of Ife.