Efficient Recovery Path Computation for Fast Reroute in Large-Scale Software-Defined Networks

With an increasing demand for resilience in software-defined networks (SDN), it becomes critical to minimize service recovery delay upon route failures. Fast reroute (FRR) mechanisms are widely used in IP and MPLS networks by computing the recovery path before a failure occurs. The centralized contr...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications Vol. 37; no. 8; pp. 1755 - 1768
Main Authors: Qiu, Kun, Zhao, Jin, Wang, Xin, Fu, Xiaoming, Secci, Stefano
Format: Journal Article
Language:English
Published: New York IEEE 01.08.2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Institute of Electrical and Electronics Engineers
Subjects:
Algorithms
Complexity theory
Computer Science
Failure
fast reroute
Heuristic algorithms
Indexing
IP (Internet Protocol)
IP networks
Minimum cost
Multiprotocol label switching
Networking and Internet Architecture
Networks
path computation
Recovery
Software-defined networking
Software-defined networks
Switches
Switching theory
Topology
Fast Reroute
Path Computation
Software-Defined Networks
ISSN:0733-8716, 1558-0008
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:With an increasing demand for resilience in software-defined networks (SDN), it becomes critical to minimize service recovery delay upon route failures. Fast reroute (FRR) mechanisms are widely used in IP and MPLS networks by computing the recovery path before a failure occurs. The centralized control plane in SDN can potentially enhance path computation, so that FRR path computation can better scale in SDN than in traditional networks. However, the traditional FRR path computation algorithms could lead to a poor performance in large-scale SDN. The problem can become more severe for a highly dynamic network, which often sees dozens of failures or configuration changes in any single day. We propose a new algorithm that exploits pruned searching to quickly compute recovery paths for all-pair switches/hosts upon a link failure. For applications requiring stringent path robustness levels, we also extend this algorithm to quickly find the shortest guaranteed-cost path, which ensures that the recovery path used upon on-path link failures has the minimum cost. Compared with traditional solutions, our evaluations show that our algorithm is about 8 ~ 81 times faster than the practical implementation, 1.93 ~ 3.11 times faster than the state-of-the-art solution. Our results also show that the shortest guaranteed-cost path can reduce the cost of the recovery path significantly. Moreover, we design a prototype to show how to deploy our algorithm in an OpenFlow network.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0733-8716
1558-0008
DOI:10.1109/JSAC.2019.2927098