A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks

Issues of computer network survivability have gained much attention in recent years since computer networks plays an important role in modern world. Many organizations, institutions, companies use computer networks as a basic tool for transmitting many kinds of information. Service disruptions in modern networks are expected to be significant because loss of services and traffic in high-speed fiber systems could cause a lot of damages including economic loses, political conflicts, human health problems. In this paper we focus on problems of survivable connection oriented network design. A new objective function LF for primary routes assignment applying the local-destination rerouting strategy is defined. Next, an optimization problem of primary routes assignment using the LF function is formulated. Moreover, a branch and bound algorithm for that problem is proposed. The theory and experimental results demonstrate the ability to apply the LF function to dynamic and static design of survivable connection oriented networks.

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

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

[3]  Hamid Ahmadi,et al.  Equivalent Capacity and Its Application to Bandwidth Allocation in High-Speed Networks , 1991, IEEE J. Sel. Areas Commun..

[4]  Hans Vanderstraeten,et al.  A self-healing ATM network based on multilink principles , 1994, IEEE J. Sel. Areas Commun..

[5]  P. Veitch,et al.  ATM network resilience , 1997 .

[6]  Wayne D. Grover,et al.  Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks , 1998, TNET.

[7]  T. M. Chen,et al.  Reliable services in MPLS , 1999, IEEE Commun. Mag..

[8]  Subrahmanyam Dravida,et al.  Fast restoration of ATM networks , 1994, IEEE J. Sel. Areas Commun..

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

[10]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[11]  Richard D. Gitlin,et al.  Broadband network restoration , 1996 .

[12]  Wayne D. Grover,et al.  Comparison of k-shortest paths and maximum flow routing for network facility restoration , 1994, IEEE J. Sel. Areas Commun..

[13]  Ken-ichi Sato,et al.  Self-healing ATM networks based on virtual path concept , 1994, IEEE J. Sel. Areas Commun..

[14]  Roy D. Yates,et al.  A Layered Broadband Switching Architecture with Physical or Virtual Path Configurations , 1991, IEEE J. Sel. Areas Commun..

[15]  Srinivas V. Makam,et al.  Framework for MPLS - based Recovery , 2000 .

[16]  Kazutaka Murakami,et al.  Virtual path routing for survivable ATM networks , 1996, TNET.

[17]  I. Tokizawa,et al.  Self-healing virtual path architecture in ATM networks , 1995 .

[18]  Krzysztof Walkowiak,et al.  The branch and bound algorithm for a backup virtual path assignment in survivable ATM networks , 2002 .

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

[20]  M. Herzberg,et al.  The hop-limit approach for spare-capacity assignment in survivable networks , 1995, TNET.