A decomposition method for the exact analysis of circuit-switched networks

A general-purpose decomposition method is formulated for the exact analysis of blocking probabilities in multirate circuit-switched networks. The procedure is based on a decomposition and aggregation technique that exploits the sparsity that can be found in the routing matrix of a network. Use is also made of a recursive algorithm developed by the authors (see Ann. Oper. Res. vol.35, no.1-4, p.31-41, 1992). No special assumptions are made with regard to the structure of the network. By reducing the analysis to that of a set of interrelated subsystems and a reduced system, the overall dimensionality of the problem is diminished, and the computational costs are reduced significantly. This enables the efficient exact analysis of larger network models. An example is provided to illustrate the computational savings that can be realized