Design of large scale systems with open finite queuing networks

Design and modelling of large scale systems such as computer and communications networks or manufacturing and production systems is a difficult task because of the volume and complexity of mixing traffic streams, contention for finite resources, and the corresponding difficulty of analytically solving the model representation. In this paper, an algebraic approach for modelling large scale systems as open finite queueing networks with general service times, finite waiting room, and multiple classes(chains) of customer types is presented. The underlying theory and algorithm for the approach together with an example application to a large scale manufacturing facility demonstrate the effectiveness and suitability of this approach for these types of systems.