Multicommodity flow models, failure propagation, and reliable loss network design

Multicommodity flow (MF) models are well known and have been widely used in the design of packet-switched networks. They have also been used as approximations in the design of circuit-switched networks with reliability constraints. We investigate the usefulness of multicommodity models both as routing models and as an integral part of design models conceived under the failure propagation strategy. First, we compare the performance measures calculated by the models with results produced by a real-time technique. Next, we study the performance of networks dimensioned with flow models and with known adaptive models under failures of transmission facilities when a real-time routing technique is used. Results obtained using realistic data show that the MF models compare favorably with exact dimensioning algorithms when failures are considered.

[1]  R. Doverspike.  A multi-layered model for survivability in intra-LATA transport networks , 1991, IEEE Global Telecommunications Conference GLOBECOM '91: Countdown to the New Millennium. Conference Record.

[2]  Deep Medhi,et al.  A unified approach to network survivability for teletraffic networks: models, algorithms and analysis , 1994, IEEE Trans. Commun..

[3]  Leonard Kleinrock,et al.  Communication Nets: Stochastic Message Flow and Delay , 1964 .

[4]  Youngho Lim.  Minimum-Cost Dimensioning Model for Common Channel Signaling Networks Under Joint Performance and Reliability Constraints , 1990, IEEE J. Sel. Areas Commun..

[5]  Martin J. Fischer,et al.  Large scale communication networks—Design and analysis , 1978 .

[6]  John A. Silvester,et al.  Performance Analysis of Networks with Unreliable Components , 1984, IEEE Trans. Commun..

[7]  B. Sanso,et al.  COMMUNICATION AND TRANSPORTATION NETWORKS RELIABILITY USING ROUTING MODELS. REVISED EDITION , 1987 .

[8]  Luigi Fratta,et al.  The flow deviation method: An approach to store-and-forward communication network design , 1973, Networks.

[9]  André Girard,et al.  Dimensioning of adaptively routed networks , 1993, TNET.

[10]  David J. Houck,et al.  Failure and Congestion Propagation Through Signaling Controls , 1994 .

[11]  Mokhtar S. Bazaraa,et al.  Nonlinear Programming: Theory and Algorithms , 1993 .

[12]  André Girard,et al.  Revenue optimization of telecommunication networks , 1993, IEEE Trans. Commun..

[13]  Clyde L. Monma,et al.  Computer-aided design procedures for survivable fiber optic networks , 1989, IEEE J. Sel. Areas Commun..

[14]  Kris Struyve,et al.  End-to-end survivable broadband networks , 1995 .

[15]  Jay Liebowitz,et al.  Editorial: World communications year and a new journal , 1984 .

[16]  R. Graham,et al.  Efficient realization techniques for network flow patterns , 1981, The Bell System Technical Journal.

[17]  David G. Luenberger,et al.  Linear and nonlinear programming , 1984 .

[18]  Michel Minoux,et al.  Networks synthesis and optimum network design problems: Models, solution methods and applications , 1989, Networks.

[19]  André Girard,et al.  Blocking evaluation for networks with residual capacity adaptive routing , 1989, IEEE Trans. Commun..

[20]  Michal Pioro,et al.  On adaptive call routing strategies in circuit switched networks - maximum revenue approach , 1988 .

[21]  Michel Gendreau,et al.  An algorithm for network dimensioning under reliability considerations , 1992, Ann. Oper. Res..

[22]  Michel Gendreau,et al.  On the evaluation of telecommunications network reliability using routing models , 1991, IEEE Trans. Commun..

[23]  J. E. Knepley.  Minimum Cost Design for Circuit Switched Networks. , 1973 .

[24]  Debasis Mitra,et al.  Comparative evaluations of randomized and dynamic routing strategies for circuit-switched networks , 1991, IEEE Trans. Commun..