Abstract
For many years, link fault recovery has always been a hotspot problem in Software-Defined Networking (SDN). Current researches mainly include proactive and reactive schemes. However, proactive scheme wastes the Ternary Content Addressable Memory (TCAM) and bandwidth resources seriously, and reactive scheme has a long recovery time. Hence, none of them qualifies as a complete solution. In this paper, we present a new two-stage fast fault recovery scheme based on link importance (FFRLI) to balance backup resource consumption and recovery time. In stage 1, FFRLI innovatively introduces Markov chains and pinning control to evaluate the importance and rank of different links, and labels them as main link, minor link and edge link. On this basis, in stage 2, we develop different recovery schemes and optimization objectives for different links. More specifically, for main links, we minimize the hops of backup path and install flow rules into switches in advance. Similarly, we store backup path of minor link in controller, and improve A-star algorithm to minimize hops and distance of backup path. Finally, FFRLI takes reactive recovery for edges link and adopts bidirectional Dijkstra to reduce backup path calculation time. Compared to existing state-of-the-art solutions, the simulation results present that FFRLI can effectively balance the consumption of backup resource and fault recovery time, and achieve fast fault link recovery.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call