A New Function for Optimization of Working Paths in Survivable MPLS Networks

We consider the problem of working paths optimization in survivable MPLS network. Both restoration methods: global and local repair are addressed. We focus on an existing facility network, in which only network flows can be optimized to provide network survivability. The lost flow due to a single failure of a network link is applied as the performance metric. Since joint optimization of working and recovery paths is very complex, we suggest to partition the problem into two simpler subproblems and first optimize working routes. We introduce a new objective function for optimization of working routes and propose a heuristic algorithm to solve the considered problem. Next, simulation performance of various methods for working paths assignment is examined.

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

[2]  Przemyslaw Ryba,et al.  The Gateways Location and Topology Assignment Problem in Hierarchical Wide Area Networks: Algorithms and Computational Results , 2006, ICCSA.

[3]  Daniel Bienstock,et al.  Potential Function Methods for Approximately Solving Linear Programming Problems: Theory and Practice , 2002 .

[4]  David Taniar,et al.  Computational Science and Its Applications - ICCSA 2006, International Conference, Glasgow, UK, May 8-11, 2006, Proceedings, Part I , 2006, ICCSA.

[5]  Eric S. Crawley,et al.  A Framework for QoS-based Routing in the Internet , 1998, RFC.

[6]  Koushik Kar,et al.  Minimum interference routing of bandwidth guaranteed tunnels with MPLS traffic engineering applications , 2000, IEEE Journal on Selected Areas in Communications.

[7]  Jordi Domingo-Pascual,et al.  Quality of Service in the Emerging Networking Panorama , 2004, Lecture Notes in Computer Science.

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

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

[10]  Marcin Markowski,et al.  The Web Replica Allocation and Topology Assignment Problem in Wide Area Networks: Algorithms and Computational Results , 2005, ICCSA.

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

[12]  David Taniar,et al.  Computational Science and Its Applications - ICCSA 2005, International Conference, Singapore, May 9-12, 2005, Proceedings, Part I , 2005, ICCSA.

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

[14]  Antoine B. Bagula,et al.  Online traffic engineering: the least interference optimization algorithm , 2004, 2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577).

[15]  D. Beinstock,et al.  Potential function methods for approximately solving linear programming problems: Theory and practic , 2001 .

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

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

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