A unified approach to network survivability for teletraffic networks: models, algorithms and analysis

Addresses the problem of network survivability by presenting a unified approach where the wide-area circuit-switched teletraffic network and the underlying transmission facility network are considered simultaneously. The author assumes the backbone circuit-switched teletraffic network to be nonhierarchical with dynamic call routing capabilities. The transmission facility network is considered to be sparse (as is observed for emerging fiber optic networks) and is assumed to be two-arc connected. The approach addresses the network survivability objective by considering two grade-of-service parameters: one for the traffic network under normal operating condition and the other for affected part of the network under a network failure. The author presents unified mathematical models and develops heuristic algorithms. The author then presents computational results to demonstrate the effectiveness of the unified approach. >

[1]  Bernard Yaged,et al.  Minimum cost routing for static network models , 1971, Networks.

[2]  R. H. Cardwell,et al.  Design and optimization of networks with dynamic routing , 1981, The Bell System Technical Journal.

[3]  R. F. Rey,et al.  Engineering and Operations in the Bell System , 1983 .

[4]  Michael A. Saunders,et al.  MINOS 5. 0 user's guide , 1983 .

[5]  J. M. Akinpelu,et al.  The overload performance of engineered networks with nonhierarchical and hierarchical routing , 1984, AT&T Bell Laboratories Technical Journal.

[6]  Herb Schwetman,et al.  CSIM: a C-based process-oriented simulation language , 1986, WSC '86.

[7]  B. Hurley,et al.  A survey of dynamic routing methods for circuit-switched traffic , 1987, IEEE Communications Magazine.

[8]  Eric Rosenberg,et al.  A Nonlinear Programming Heuristic for Computing Optimal Link Capacities in a Multi-Hour Alternate Routing Communications Network , 1987, Oper. Res..

[9]  R. H. Cardwell,et al.  Survivable network architectures for broad-band fiber optic networks: model and performance comparison , 1988 .

[10]  Moshe Dror,et al.  Fiberoptic circuit network design under reliability constraints , 1989, IEEE J. Sel. Areas Commun..

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

[12]  Yogesh K. Agarwal.  An algorithm for designing survivable networks , 1989, AT&T Technical Journal.

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

[14]  Kathleen M. Buyers,et al.  The Microelectronics and Computer Technology Corporation , 1989 .

[15]  Andre Girard,et al.  Routing and Dimensioning in Circuit-Switched Networks , 1990 .

[16]  Toshikane Oda,et al.  Optimization of international ISDNs with dynamic routing under reliability constraint , 1990 .

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

[18]  Deep Medhi.  Diverse routing for survivability in a fiber-based sparse network , 1991, ICC 91 International Conference on Communications Conference Record.

[19]  Deep Medhi,et al.  Robust traffic design for dynamic routing networks , 1991, IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings.

[20]  R. D. Doverspike.  Algorithms for Multiplex Bundling in a Telecommunications Network , 1991, Oper. Res..

[21]  Dimitri P. Bertsekas,et al.  Data Networks: Second Edition , 1992 .

[22]  Tsong-Ho Wu,et al.  Fiber Network Service Survivability , 1992 .

[23]  Herb Schwetman,et al.  CSIM† Reference Manual (Revision 16) , 1992 .