Shared Backup Path Protection for Anycast and Unicast Flows Using the Node-Link Notation

In this paper we address the problem of shared backup path protection (SBPP) against random failures of single links in connection-oriented communication networks. Most of recent works has been concentrated on protecting the unicast traffic. Our paper is also focused on shared protection of anycast (i.e. one-to-one-out-of-many) flows. Anycasting is frequently met in practice (e.g. in Content Delivery Networks, peer-to-peer systems, or DNS service). A new ILP model for joint optimization of dedicated working and shared backup paths of anycast and unicast demands is introduced and is followed by extensive simulation research. The model is the first one that provides the optimal solutions to the problem of anycast traffic shared protection by using the Node-Link notation. The results show that our approach reduces the network cost and capacity utilization ratio by 36% and 42% accordingly, compared to the case when capacity sharing is not used.

[1]  H. T. Mouftah,et al.  Diverse routing for shared protection in survivable optical networks , 2003, GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489).

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

[3]  Eng Keong Lua,et al.  P2p Networking And Applications , 2009 .

[4]  Pin-Han Ho,et al.  A framework for service-guaranteed shared protection in WDM mesh networks , 2002, IEEE Commun. Mag..

[5]  Chor Ping Low,et al.  On anycast routing with bandwidth constraint , 2003, Comput. Commun..

[6]  Markus Hofmann,et al.  Content Networking - Architecture, Protocols, and Practice , 2005, The Morgan Kaufmann series in networking.

[7]  Tibor Cinkler,et al.  Segment shared protection in mesh communications networks with bandwidth guaranteed tunnels , 2004, IEEE/ACM Transactions on Networking.

[8]  Der-Rong Din.  Anycast Routing and Wavelength Assignment Problem on WDM Network , 2005, IEICE Trans. Commun..

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

[10]  Krzysztof Walkowiak,et al.  Anycasting in connection-oriented computer networks: Models, algorithms and results , 2010, Int. J. Appl. Math. Comput. Sci..