Recursive Aggregation-Disaggregation Method to Approximate Large-Scale Closed Queueing Networks with Multiple Job Types

摘要

A recursive aggregation-disaggregation method is introduced to bypass the computational problems involved in evaluating the standard multidimensional recursive schemes associated with exact mean value analysis in separable queuing networks with multiple job types. As a side result, the influence of Pollaczek-Khintchine type approximations for the mean response times at first-in first-out single server queues with nonexponential service demand distributions is studied. The power of the method is shown with a closed central server model involving multiple central processors, disk units, and job types.