Optimal algorithms for near-hitless network restoration via diversity coding

Serhat Nazim Avci, Ender Ayanoglu
2012 2012 IEEE Global Communications Conference (GLOBECOM)  
Diversity coding is a network restoration technique which offers near-hitless restoration, while other state-of-theart 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
more » ... first 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. A Mixed Integer Programming (MIP) formulation and an algorithm based on Integer Linear Programming (ILP) are developed for preprovisioning and dynamic provisioning, respectively. Simulation results indicate that diversity coding has significantly higher restoration speed than Shared Path Protection (SPP) and pcycle techniques. It requires more extra capacity than the p-cycle technique and SPP. However, the increase in the total capacity is negligible compared to the increase in the restoration speed.
doi:10.1109/glocom.2012.6503389 dblp:conf/globecom/AvciA12 fatcat:6vogwc3juvhn3az7jk2mzc5tde