Anycast Communication—A New Approach to Survivability of Connection-Oriented Networks

In this paper, we tackle the question of how anycast communication can improve survivability of connection-oriented networks. The focus on network survivability arises naturally in the context of growing role of computer networks in almost all aspects of human life. We concentrate on connection-oriented networks e.g. MPLS, ATM for the reason that these techniques can provide effective and reliable services in transport network. We take a detailed view on anycast communication from the perspective of network survivability. A new optimization problem is formulated that is equivalent to the problem of joint unicast and anycast flows restoration in connection-oriented networks. Next, we propose a heuristic algorithm solving that problem. Finally, we present results of exhaustive numerical experiments and a comprehensive discussion on the application of anycast communication in the context of network survivability.

[1]  Sy-Yen Kuo,et al.  Load-balanced anycast routing , 2004, Proceedings. Tenth International Conference on Parallel and Distributed Systems, 2004. ICPADS 2004..

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

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

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

[5]  Christian Scheideler,et al.  Anycasting in Adversarial Systems: Routing and Admission Control , 2003, ICALP.

[6]  K. Walkowiak.  Survivable Routing of Unicast and Anycast Flows in MPLS Networks , 2007, 2007 Next Generation Internet Networks.

[7]  Hanif D. Sherali,et al.  Optimal base station selection for anycast routing in wireless sensor networks , 2006, IEEE Transactions on Vehicular Technology.

[8]  Christian Scheideler,et al.  Improved bounds for the unsplittable flow problem , 2002, SODA '02.

[9]  Gang Peng,et al.  CDN: Content Distribution Network , 2004, ArXiv.

[10]  Paul Francis,et al.  Towards a global IP anycast service , 2005, SIGCOMM '05.

[11]  Mostafa Ammar,et al.  QoS routing for anycast communications: motivation and an architecture for DiffServ networks , 2002, IEEE Commun. Mag..

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

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

[14]  Jon M. Kleinberg,et al.  Approximation algorithms for disjoint paths problems , 1996 .

[15]  Krzysztof Walkowiak.  Lagrangean Heuristic for Anycast Flow Assignment in Connection-Oriented Networks , 2006, International Conference on Computational Science.

[16]  Krzysztof Walkowiak,et al.  Unsplittable Anycast Flow Problem: Formulation and Algorithms , 2006, International Conference on Computational Science.

[17]  Masayuki Murata,et al.  IPv6 anycast for simple and effective service-oriented communications , 2004, IEEE Communications Magazine.

[18]  Murali S. Kodialam,et al.  Minimum interference routing with applications to MPLS traffic engineering , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).