Joint working and spare capacity assignment for anycast streaming in survivable networks protected by p-Cycles

p-Cycles provide very interesting method of protecting computer networks against failures. They have been recently used to protect anycast flows, using concept of Anycast-Protecting p-Cycles. This novel technique is a p-cycle with special properties dedicated for protection of anycast traffic. They have been proved to be very effective. In this paper we use Anycast-Protecting p-Cycles to formulate a new problem, with working and spare capacity assignment. We present a detailed description of an ILP (Integer Linear Programming) model, optimal and reference algorithms, results and extended analysis.

[1]  Sudipto Guha,et al.  Improved algorithms for fault tolerant facility location , 2001, SODA '01.

[2]  P. Krishnan,et al.  The cache location problem , 2000, TNET.

[3]  Lili Qiu,et al.  On the placement of Web server replicas , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

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

[5]  Krzysztof Walkowiak,et al.  Optimal results for Anycast-Protecting p-Cycles problem , 2010, International Congress on Ultra Modern Telecommunications and Control Systems.

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

[7]  Krzysztof Walkowiak,et al.  Optimization of p-cycles for survivable anycasting streaming , 2009, 2009 7th International Workshop on Design of Reliable Communication Networks.

[8]  Biswanath Mukherjee,et al.  A heuristic method for design of survivable WDM networks with p-cycles , 2004, IEEE Communications Letters.

[9]  Michal Pioro,et al.  SNDlib 1.0—Survivable Network Design Library , 2010 .

[10]  Wayne D. Grover,et al.  Algorithmic approaches for efficient enumeration of candidate p-cycles and capacitated p-cycle network design , 2003, Fourth International Workshop on Design of Reliable Communication Networks, 2003. (DRCN 2003). Proceedings..

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