Network Protection Codes Against Link Failures Using Network Coding

Protecting against link failures in communication networks is essential to increase robustness, accessibility, and reliability of data transmission. Recently, network coding has been proposed as a solution to provide agile and cost efficient network protection against link failures, which does not require data rerouting, or packet retransmission. To achieve this, separate paths have to be provisioned to carry encoded packets, hence requiring either the addition of extra links, or reserving some of the resources for this purpose. In this paper, we propose network protection codes against a single link failure using network coding, where a separate path using reserved links is not needed. In this case portions of the link capacities are used to carry the encoded packets. The scheme is extended to protect against multiple link failures and can be implemented at an overlay layer. Although this leads to reducing the network capacity, the network capacity reduction is asymptotically small in most cases of practical interest. We demonstrate that such network protection codes are equivalent to error correcting codes for erasure channels. Finally, we study the encoding and decoding operations of such codes over the binary field.

[1]  Jacobus H. van Lint,et al.  Coding Theory , 1971 .

[2]  David R. Karger,et al.  Random Sampling in Cut, Flow, and Network Design Problems , 1999, Math. Oper. Res..

[3]  Jörg Widmer,et al.  Network coding: an instant primer , 2006, CCRV.

[4]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[5]  Ahmed E. Kamal,et al.  A Generalized Strategy for 1+N Protection , 2008, 2008 IEEE International Conference on Communications.

[6]  C. Fragouli,et al.  A Network Coding Approach to Network Monitoring (Invited Paper) , 2005 .

[7]  W. Cary Huffman,et al.  Fundamentals of Error-Correcting Codes , 1975 .

[8]  Christina Fragouli,et al.  A Network Coding Approach to Overlay Network Monitoring , 2005 .

[9]  Yonggang Wen,et al.  Network monitoring in multicast networks using network coding , 2005, Proceedings. International Symposium on Information Theory, 2005. ISIT 2005..

[10]  R. Koetter,et al.  The benefits of coding over routing in a randomized setting , 2003, IEEE International Symposium on Information Theory, 2003. Proceedings..

[11]  Piotr Cholda,et al.  Network Recovery, Protection and Restoration of Optical, SONET-SDH, IP, and MPLS [Book Review] , 2005, IEEE Communications Magazine.

[12]  K. Jain,et al.  Practical Network Coding , 2003 .

[13]  David R. Karger,et al.  Random sampling in cut, flow, and network design problems , 1994, STOC '94.

[14]  Ahmed E. Kamal,et al.  OPN04-3: 1+N Protection in Mesh Networks Using Network Coding over p-Cycles , 2006, IEEE Globecom 2006.

[15]  Piet Demeester,et al.  Network Recovery: Protection and Restoration of Optical, SONET-SDH, IP, and MPLS , 2004 .

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

[17]  Ahmed E. Kamal GMPLS-Based Hybrid 1+N Link Protection Over p-Cycles: Design and Performance , 2007, IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference.

[18]  Suresh Subramaniam,et al.  Survivability in optical networks , 2000, IEEE Netw..

[19]  R. Yeung,et al.  Network coding theory , 2006 .

[20]  Baochun Li,et al.  How Practical is Network Coding? , 2006, 200614th IEEE International Workshop on Quality of Service.

[21]  Ahmed E. Kamal,et al.  Network coding-based protection strategies against a single link failure in optical networks , 2008, 2008 International Conference on Computer Engineering & Systems.

[22]  Arun K. Somani Survivability and Traffic Grooming in WDM Optical Networks , 2006 .

[23]  Arun Somani,et al.  Survivability and Traffic Grooming in WDM Optical Networks: References , 2006 .