Resilient flow decomposition of unicast connections with network coding
Name
Resilient-Flow-Decomposition.pdf
Size
266.5 KB
Format
Adobe PDF
Checksum (MD5)
1623e18fbfcc6e354276f4e1daa0190c
Author(s)
Babarczi, Peter
Tapolcai, Janos
Ronyai, Lajos
Medard, Muriel
Date Issued
June 2014
Journal
Proceedings of the 2014 IEEE International Symposium on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
Babarczi, Peter, Janos Tapolcai, Lajos Ronyai, and Muriel Medard. “Resilient Flow Decomposition of Unicast Connections with Network Coding.” 2014 IEEE International Symposium on Information Theory (June 2014).
Version
Author's final manuscript
Abstract
In this paper we close the gap between end-to-end diversity coding and intra-session network coding for unicast connections resilient against single link failures. In particular, we show that coding operations are sufficient to perform at the source and receiver if the user data can be split into at most two parts over the filed GF(2). Our proof is purely combinatorial and based on standard graph and network flow techniques. It is a linear time construction that defines the route of subflows A, B and A ⊕ B between the source and destination nodes. The proposed resilient flow decomposition method generalizes the 1+1 protection and the end-to-end diversity coding approaches while keeping both of their benefits. It provides a simple yet resource efficient protection method feasible in 2-connected backbone topologies. Since the core switches do not need to be modified, this result can bring benefits to current transport networks.
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Massachusetts Institute of Technology. Research Laboratory of Electronics
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1109/ISIT.2014.6874806
