Network coding protection based on p-cycles for mesh networks

Network protection is very important to ensure the service continuity. However, most of existing protection strategies studied only the traditional dedicated protection and shared protection in which each traffic connection will be assigned to a primary path and a link-disjoint backup path to protect any single link failure and the consequence is that the backup resource redundancy and the traffic blocking probability may be high. To improve performances, this paper proposes a Network Coding Protection (NCP) based on p-cycle by performing the XOR operation for data packets traversing the network nodes, so that NCP can provide the protection for any single on-cycle link failure or straddling link failure. Simulation results show that, compared to the traditional dedicated path protection and shared path protection, NCP has better performances in protection recovery time, resource redundancy and blocking probability.

[1]  Biswanath Mukherjee,et al.  Survivable WDM mesh networks , 2003 .

[2]  Biswanath Mukherjee,et al.  Survivable Multipath Traffic Grooming in Telecom Mesh Networks With Inverse Multiplexing , 2010, IEEE/OSA Journal of Optical Communications and Networking.

[3]  Wayne D. Grover,et al.  Hamiltonian p-cycles for fiber-level protection in semi-homogeneous homogeneous and optical networks , 2004, IEEE Network.

[4]  Ahmed E. Kamal,et al.  1 + N network protection for mesh networks: network coding-based protection using p-cycles , 2010, TNET.

[5]  Rudolf Ahlswede,et al.  Network information flow , 2000, IEEE Trans. Inf. Theory.

[6]  W.D. Grover,et al.  Failure-independent path-protecting p-cycles: efficient and simple fully preconnected optical-path protection , 2005, Journal of Lightwave Technology.

[7]  Dominic A. Schupke,et al.  On Hamiltonian cycles as optimal p-cycles , 2005, IEEE Communications Letters.

[8]  E KamalAhmed 1 + N network protection for mesh networks , 2010 .

[9]  Lei Guo,et al.  Local and global hamiltonian cycle protection algorithm based on abstracted virtual topology in fault-tolerant multi-domain optical networks , 2010, IEEE Transactions on Communications.

[10]  Wayne D. Grover,et al.  Design and performance of protected working capacity envelopes based on p-cycles for dynamic provisioning of survivable services , 2005 .

[11]  Zhenrong Zhang,et al.  Dynamically survivable WDM network design with p-cycle-based PWCE , 2005, IEEE Communications Letters.

[12]  Wayne D. Grover,et al.  Physical-Layer p-Cycles Adapted for Router-Level Node Protection: A Multi-Layer Design and Operation Strategy , 2007, IEEE Journal on Selected Areas in Communications.