Max-Flow Protection Using Network Coding
In this paper, the authors present a new way to enhance the survivability of the information flow between two communicating nodes S and T without compromising the maximum achievable S-T information rate. To do this, bottleneck links should only forward useful information, and not redundant data units. They introduce the idea of extra source or destination connectivity with respect to a certain S-T max-flow, and then they introduce two problems: namely, pre-cut protection and post-cut protection. Because of space limitations they only focus on the precut protection problem.