A multi-objective approach for solving the survivable network design problem with simultaneous unicast and anycast flows

In this paper, we consider the survivable network design problem for simultaneous unicast and anycast flow requests. We assume that the network is modeled by a connected and undirected graph. This problem aims at finding a set of connections with a minimized network cost in order to protect the network against any single failure. The cost is computed using the all capacities modular cost (ACMC) model and a set of flow demands. We name it as ACMC-based survivable network design problem (A-SNDP). It is proved that the problem is NP-hard. We introduce a multi-objective approach to solve A-SNDP. The objectives are to minimize the network cost (NCost) and the network failure (NFail). Extensive simulation results on instances of Polska, Germany and Atlanta networks showed the efficiency of the multi-objective approach for solving A-SNDP.

[1]  Huynh Thi Thanh Binh,et al.  Genetic Algorithm for Solving Survivable Network Design with Simultaneous Unicast and Anycast Flows , 2013, BIC-TA.

[2]  Kalyanmoy Deb,et al.  Multi-objective optimization using evolutionary algorithms , 2001, Wiley-Interscience series in systems and optimization.

[3]  Hervé Kerivin,et al.  Design of Survivable Networks: A survey , 2005 .

[4]  Krzysztof Walkowiak,et al.  Optimization of survivable networks with simultaneous unicast and anycast flows , 2009, 2009 International Conference on Ultra Modern Telecommunications & Workshops.

[5]  Krzysztof Walkowiak,et al.  Tabu Search Algorithm for Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows , 2010 .

[6]  Krzysztof Walkowiak,et al.  A New Function for Optimization of Working Paths in Survivable MPLS Networks , 2006, ISCIS.

[7]  David B. Johnson,et al.  Reserved IPv6 Subnet Anycast Addresses , 1999, RFC.

[8]  Volker Nissen,et al.  Survivable Network Design with an Evolution Strategy , 2008 .

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

[10]  Huynh Thi Thanh Binh,et al.  Heuristic Algorithms for Solving Survivable Network Design Problem with Simultaneous Unicast and Anycast Flows , 2012, ICIC.

[11]  Mauro Brunato,et al.  Reactive Search and Intelligent Optimization , 2008 .

[12]  Marco Laumanns,et al.  A Tutorial on Evolutionary Multiobjective Optimization , 2004, Metaheuristics for Multiobjective Optimisation.

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

[14]  Krzysztof Walkowiak.  Anycast Communication—A New Approach to Survivability of Connection-Oriented Networks , 2007 .

[15]  Krzysztof Walkowiak.  A Flow Deviation Algorithm for Joint Optimization of Unicast and Anycast Flows in Connection-Oriented Networks , 2008, ICCSA.

[16]  Ivo F. Sbalzariniy,et al.  Multiobjective optimization using evolutionary algorithms , 2000 .

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

[18]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

[19]  Eduardo G. Carrano,et al.  Electric distribution network multiobjective design using a problem-specific genetic algorithm , 2006, IEEE Transactions on Power Delivery.