Optimization of p-cycles for survivable anycasting streaming

Intensive and extensive development of computer networks generates the problem of providing a suitably high level of network survivability. A lot of research has been done in this area in recent years, including studies associated with the use of a modern tool called p-cycles. p-Cycles not only provide a high level of protection, but also achieve it at a quite low cost. Until now, p-cycles have been widely used in the context of unicast and multicast traffic. In this paper, we apply p-cycles for protecting the anycast traffic. According to our knowledge, this is the first paper in the literature on this topic. To solve the problem stated, we propose an original approach which combines protection on the level of physical links with protection on the flow level. By using special properties of p-cycles, we formulate the solution algorithm dedicated to minimising the total cost of full protection. Comparing the proposed algorithm with several ad hoc (but reasonable) methods we found, in extensive numerical tests, that the proposed methodology outperforms other algorithms.

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

[2]  Adam Smutnicki,et al.  Unrestored Flow Optimization in Survivable Networks Based on p-Cycles , 2009, ICCS.

[3]  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..

[4]  Adam Smutnicki,et al.  An Algorithm for Unrestored Flow Optimization in Survivable Networks Based on p-Cycles , 2009, ICCS.

[5]  Chuck Yoo,et al.  Minimum DVS gateway deployment in DVS-based overlay streaming , 2008, Comput. Commun..

[6]  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).

[7]  Brigitte Jaumard,et al.  Directed vs . Undirected p-Cycles and FIPP p-Cycles , 2009 .

[8]  Wayne D. Grover,et al.  Extending the p-cycle concept to path segment protection for span and node failure recovery , 2003, IEEE J. Sel. Areas Commun..

[9]  W.D. Grover,et al.  A disjoint route-sets approach to design of path-protecting p-cycle networks , 2005, DRCN 2005). Proceedings.5th International Workshop on Design of Reliable Communication Networks, 2005..

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

[11]  Yaohui Jin,et al.  Optimized Designs of p-Cycles for Survivable Multicast Sessions in Optical WDM Networks , 2007, 2007 Second International Conference on Communications and Networking in China.

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

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

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

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

[16]  Feng Zhang,et al.  Performance evaluation of p-cycle based protection methods for provisioning of dynamic multicast sessions in mesh WDM networks , 2008, Photonic Network Communications.