Optimal Algorithms for Near-Hitless Network Restoration via Diversity Coding
Serhat Nazim Avci, Ender Ayanoglu

TL;DR
This paper introduces two optimal algorithms for implementing diversity coding in network restoration, achieving near-hitless recovery with reduced signaling and faster restoration times compared to existing methods.
Contribution
It develops optimal algorithms for diversity coding with static and dynamic traffic provisioning, improving restoration speed and simplifying synchronization.
Findings
Diversity coding offers significantly faster restoration than SPP and p-cycle.
The proposed algorithms reduce signaling complexity and synchronization effort.
Extra capacity required is comparable to existing techniques, with minimal impact on total capacity.
Abstract
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, we 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 first technique pre-provisions static traffic whereas the second technique carries out the dynamic provisioning of the traffic on-demand. In both cases, diversity coding results in smaller restoration time, simpler synchronization, and much reduced signaling complexity than the existing techniques in the literature. A Mixed Integer Programming (MIP) formulation and an algorithm based on Integer…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
