A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf
.
Optimal algorithms for near-hitless network restoration via diversity coding
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
doi:10.1109/glocom.2012.6503389
dblp:conf/globecom/AvciA12
fatcat:6vogwc3juvhn3az7jk2mzc5tde