Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding

Diversity coding is a network restoration technique which offers near-hitless restoration, while other state-of-the-art techniques are significantly slower. Furthermore, the extra spare capacity requirement of diversity coding is competitive with the others. Previously, the authors developed heuristic algorithms to employ diversity coding structures in networks with arbitrary topology. This paper presents two algorithms to solve the network design problems using diversity coding in an optimal manner. The rest technique pre-provisions static traffic whereas the second technique carries out the dynamic provisioning of the traffic ondemand. In both cases, diversity coding results in smaller restoration time, simpler synchronization, and much reduced signaling complexity than the existing techniques in the literature.