2016/03/10 by Theodore Elhourani, Abishek Gopalan, Srinivasan Ramasubramanian
Computer Science · Engineering · #Advanced Optical Network Technologies #Interconnection Networks and Systems #Software-Defined Networks and 5G
paper · doi:10.1109/tnet.2016.2516442
openalex publication_date 2016/03/10 · openalex created_date 2025/10/10 · openalex updated_date 2026/06/26
IP fast reroute methods are used to recover packets in the data plane upon link failures. Previous work provided methods that guarantee failure recovery from at most two-link failures. We develop an IP fast reroute method that employs rooted arc-disjoint spanning trees to guarantee recovery from up to k-1 link failures in a k-edge-connected network. As arc-disjoint spanning trees may be constructed in sub-quadratic time in the size of the network, our approach offers excellent scalability. Through experimental results, we show that employing arc-disjoint spanning trees to recover from multiple failures reduces path stretch in comparison with previously known techniques.