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

Author

Conway, Adrian E. ; Pinsky, Eugene

Author_Institution

GTE Lab. Inc., Waltham, MA, USA

fYear

1992

fDate

4-8 May 1992

Firstpage

996

Abstract

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

Keywords

circuit switching; statistical analysis; telecommunication network routing; telecommunication networks; blocking probabilities; computational costs; decomposition and aggregation technique; exact analysis; general-purpose decomposition method; interrelated subsystems; multirate circuit-switched networks; overall dimensionality; recursive algorithm; reduced system; routing matrix; sparsity; Approximation methods; Bandwidth; Circuit analysis; Computational efficiency; Computer networks; Computer science; Laboratories; Matrix decomposition; Queueing analysis; Routing;

fLanguage

English

Publisher

ieee

Conference_Titel

INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE

Conference_Location

Florence

Print_ISBN

0-7803-0602-3

Type

conf

DOI

10.1109/INFCOM.1992.263448

Filename

263448