Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

Abstract Our discussion in this article centers on the application of a Lagrangean relaxation and a subgradient optimization technique to the problem of primary route assignment (PRA) in survivable connection-oriented networks. The PRA problem consists in a static optimization of primary routes minimizing the Lost Flow in Node (LFN) function. The major contribution of this work is a combination of the Lagrangean relaxation with other heuristic algorithms. We evaluate the performance of the proposed Lagrangean-based heuristic by making a comparison with their counterparts including evolutionary algorithm and GRASP using various network topologies and demand patterns. The results of simulation tests show that the new algorithm provides sub-optimal results, which are better than other heuristics.

[1]  Michal Pioro,et al.  Link protection within existing backbone network , 2003 .

[2]  Cynthia Barnhart,et al.  Using Branch-and-Price-and-Cut to Solve Origin-Destination Integer Multicommodity Flow Problems , 2000, Oper. Res..

[3]  Tuna Tuǧcu.  New Trends in Computer Networks , 2005, Advances in Computer Science and Engineering : Reports and Monographs.

[4]  Tibor Cinkler,et al.  A novel Lagrangian-relaxation to the minimum cost multicommodity flow problem and its application to OSPF traffic engineering , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[5]  Sidney L. Hantler,et al.  An Algorithm for Optimal Route Selection in SNA Networks , 1983, IEEE Trans. Commun..

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

[7]  Oktay Günlük,et al.  A branch-and-cut algorithm for capacitated network design problems , 1999, Math. Program..

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

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

[10]  K Walkowiak,et al.  The Hop-Limit Approach for Flow Assignment in survivable Connection-Oriented Networks , 2005, New Trends in Computer Networks.

[11]  Celso C. Ribeiro,et al.  A GRASP with path‐relinking for private virtual circuit routing , 2003, Networks.

[12]  Andrzej Kasprzak,et al.  Exact and Approximate Algorithms for Topological Design of Wide Area Networks with Non-simultaneous Single Commodity Flows , 2003, International Conference on Computational Science.

[13]  Krzysztof Walkowiak,et al.  Evolutionary Algorithm for Congestion Problem in Connection-Oriented Networks , 2005, ICCSA.

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

[15]  Anthony E. Krzesinski,et al.  Path selection and bandwidth allocation in MPLS networks , 2003, Perform. Evaluation.

[16]  Deep Medhi,et al.  Some approaches to solving a multihour broadband network capacity design problem with single-path routing , 2000, Telecommun. Syst..

[17]  Eduardo Camponogara,et al.  Implementing traffic engineering in MPLS-based IP networks with Lagrangean relaxation , 2003, Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003.

[18]  Di Yuan,et al.  A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem , 2000, Oper. Res..

[19]  Deep Medhi,et al.  Routing, flow, and capacity design in communication and computer networks , 2004 .

[20]  Wayne D. Grover,et al.  Mesh-based Survivable Transport Networks: Options and Strategies for Optical, MPLS, SONET and ATM Networking , 2003 .

[21]  David Tipper,et al.  Prioritized traffic restoration in connection oriented QoS based networks , 2003, Comput. Commun..

[22]  Mariusz Gola,et al.  The Two-Criteria Topological Design Problem in WAN with Delay Constraint: An Algorithm and Computational Results , 2003, ICCSA.

[23]  Bezalel Gavish,et al.  A system for routing and capacity assignment in computer communication networks , 1989, IEEE Trans. Commun..

[24]  Krzysztof Walkowiak,et al.  Survivable Online Routing for MPLS Traffic Engineering , 2004, QofIS.

[25]  Bezalel Gavish,et al.  Routing in a Network with Unreliable Components , 1988, IEEE Trans. Commun..

[26]  Krzysztof Walkowiak,et al.  A Unified Approach to Survivability of Connection-Oriented Networks , 2005, ISCIS.

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

[28]  Di Yuan,et al.  A Lagrangean approach to network design problems , 1998 .

[29]  Krzysztof Walkowiak.  A New Method of Primary Routes Selection for Local Restoration , 2004, NETWORKING.

[30]  Krzysztof Walkowiak.  A New Approach to Survivability of Connection Oriented Networks , 2003, International Conference on Computational Science.

[31]  Krzysztof Walkowiak.  A Branch and Bound Algorithm for Primary Routes Assignment in Survivable Connection Oriented Networks , 2004, Comput. Optim. Appl..

[32]  Panos M. Pardalos,et al.  Handbook of applied optimization , 2002 .

[33]  Kenneth L. Calvert,et al.  Modeling Internet topology , 1997, IEEE Commun. Mag..