Traffic-Aware Fast Reroute Mechanism Exploiting Disjoint Subpaths for Named Data Networks

The popularized named data network (NDN) needs a fast reroute (FRR) to improve resilience in dealing with the norm of link faults. The resilience of the existing disjoint arborescences and paths based approaches is restricted in reroute options, due to the limited number of disjoint end-to-end routes available. Such restrictions can be weakened by exploiting of the disjoint subpaths (DSP) between two intermediate nodes in the primary path (PP), as what DSP can link together is not only the two ends. In this paper, we propose a novel NDN based traffic-aware fast reroute (TA-FRR) mechanism that exploits a new resilient subgraph (RSG) route involving multiple DSPs. TA-FRR proactively constructs an RSG with scalable computational complexity to maximize the resilience and to avoid a too high reroute stretch. In the RSG, TA-FRR efficiently computes the shortest detour path for the disconnected components actively identified according to packet arrival timeouts. We evaluated the performance of TA-FRR in the ndnSIM simulator using synthsized Internet topologies with different degrees of link faults. The results show that TA-FRR can efficiently recover serious link faults in PP with a scalable RSG construction and outperforms the existing approaches with a significantly higher resilience and the maximum stretch similar to the arborescences approach.