Efficient and Agile 1+N Protection

This paper introduces an efficient implementation of the network coding-based 1+N protection. The strategy provides proactive protection to N link-disjoint full-duplex connections against single link failures. The implementation is efficient and uses a tree shaped minimum cost protection circuit. The protection circuit carries linear combinations of data units originally transmitted on the working circuits, and these linear combinations can be used to recover data units lost due to failures. This recovery is carried out with the assistance of one node on the protection tree, which is chosen to reduce the recovery time.