Extended diversity coding: Coding protection and primary paths for network restoration

The technique of diversity coding offers fast recovery against failures in networks while keeping spare capacity comparable to the alternative state-of-the art network restoration techniques. It provides near-hitless recovery when coding is performed on connections with the same destination node. When the coding structure is extended to cover the primary paths, diversity coding can achieve higher capacity efficiency than its conventional version and other restoration techniques. In this paper, we develop a systematic approach to implement the diversity coding structures for pre-provisioning with coding of the protection and primary paths. In addition, we present an algorithm to map these coding structures into arbitrary topologies. We present simulation results that show capacity efficiency of diversity coding.