Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J. Anderson, B. Doshi, S. Dravida, and P. Harshavardhana, “Fast restoration of ATM networks,” IEEE JSAC, vol. 12, pp. 128–138, Jan. 1994.
E. Ayanoglu and R. Gitlin, “Broadband network restoration,” IEEE Communications Magazine, vol. 34, pp. 110–119, July 1996.
E. Calle, T. Jove, P. Vila, and J. Marzo, “A dynamic multilevel MPLS protection domain,” in Proc. DRCN 2001, Budapest, Hungary, Oct. 2001, pp. 289–294.
T. Chen and T. Oh, “Reliable services in MPLS,” IEEE Communications Magazine, vol. 37, pp. 58–62, Dec. 1999.
A. Dunn, W. Grover, and M. MacGregor, “Comparison of k-shortest paths and maximum flow routing for network facility restoration,” IEEE JSAC, vol. 12, pp. 88–99, Jan. 1994.
L. Fratta, M. Gerla, and L. Kleinrock, “The flow deviation method: An approach to store-and-forward communication network design,” Networks, vol. 3, pp. 97–133, 1973.
D. Goldberg, Genetic Algorithms in Search, Optimization, and Machine Learning. Addison-Wesley: Reading, MA, 1989.
R. Guerin, M. Ahmadi, and M. Nagshineh, “Equivalent capacity and its application to bandwidth allocation in high-speed networks,” IEEE JSAC, vol. 9, pp. 968–981, April 1991.
M. Herzberg, S. Bye, and A. Utano, “The hop-limit approach for spare-capacity assignment in survivable networks,” IEEE/ACM Transactions on Networking, vol. 3, pp. 775–784, Dec. 1995.
J. Hui, M. Gursoy, N. Moayeri, and R. Yates, “A layered broadband switching architecture with physical and virtual path configurations,” IEEE JSAC, vol. 9, pp. 1416–1426, Dec. 1991.
R. Iraschko, M. MacGregor, and W. Grover, “Optimal capacity placement for path restoration in STM or ATM mesh-survivable networks,” IEEE/ACM Transactions on Networking, vol. 6, pp. 325–335, June 1998.
R. Karp, “On the computational complexity of combinatorical problems,” Networks, vol. 5, pp. 45–68, 1975.
A. Kasprzak, “An optimal capacity and non-bifurcated flow assignment in a computer communication network,” Systems Science, vol. 11, no. 1, pp. 47–58, 1985.
A. Kasprzak and K. Walkowiak, “Designing of virtual private networks in the public ATM network environment,” in Proceedings of MOSIS 2000, Ostrava, 2000, pp. 111–116.
A. Kasprzak, Topological Design of Wide Area Networks. Wroclaw University of Technology Press, 2001.
R. Kawamura, K. Sato, and I. Tokizawa, “Self-healing ATM networks based on virtual path concept,” IEEE JSAC, vol. 12, pp. 120–127, Jan. 1994.
R. Kawamura and I. Tokizawa, “Self-healing virtual path architecture in ATM networks,” IEEE Communications Magazine, vol. 33, pp. 72–79, Sept. 1995.
D. Medhi, “A unified approach to network survivability for teletraffic networks: Models, algorithms and analysis,” IEEE Transaction on Communications, vol. 42, pp. 534–548, Feb./March/April 1994.
K. Murakami and H. Kim, “Virtual path routing for survivable ATM networks,” IEEE/ACM Transactions on Networking, vol. 4, pp. 22–39, Feb. 1996.
L. Nederlof, K. Struyve, C. O'Shea, H. Misser, Y. Du, and B. Tamayo, “End-to-end survivable broadband networks,” IEEE Communications Magazine, vol. 33, pp. 63–70, Sept. 1995.
B. Sanso, F. Soumis, and M. Gendreau, “On the evaluation of telecommunications network reliability using routing models,” IEEE Transaction on Communications, vol. 39, pp. 1494–1501, Oct. 1991.
V. Sharma and F. Hellstrand (ed.), “Framework for MPLS-based recovery.” RFC 3469.
T. Van Landegem, P. Vankwikelberge, and H. Vanderstraeten, “A self-healing ATM network based on multilink principles,” IEEE JSAC, vol. 12, pp. 139–148, Jan. 1994.
P. Veitch and D. Johnson, “ATM network resilience,” IEEE Network, vol. 11, pp. 26–33, Sept./Oct. 1997.
K. Walkowiak, “Algorithms for assignment of virtual paths in survivable ATM networks,” Ph.D Dissertation, Department of Electronics, Wroclaw University of Technology, 2000.
K. Walkowiak, “Assignment of virtual paths in survivable ATM networks for local-destination rerouting,” in Proc. DRCN 2001, Budapest, Hungary, Oct. 2001, pp. 273–280.
K. Walkowiak, “The branch and bound algorithm for backup virtual path assignment in survivable ATM networks,” Applied Mathematics and Computer Science, vol. 12, no. 2, pp. 257–267, 2002.
W. Wang, D. Tipper, B. Jager, and D. Mehdi, “Fault recover routing in wide area networks,” in Proc. of 15th International Teletraffic Congress, Washington DC, June 1997, pp. 1077–1086.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Walkowiak, K.M. A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks. Computational Optimization and Applications 27, 149–171 (2004). https://doi.org/10.1023/B:COAP.0000008650.91314.59
Issue Date:
DOI: https://doi.org/10.1023/B:COAP.0000008650.91314.59