Network recovery using IP fast rerouting for multi link failures

In circuit switching and packet switching networks, if a router or a link gets failed, the packets that are travelling on the failed link, path or router will be lost and dropped until network self re-converges although there exists an alternate path avoiding or bypassing the network failure. During this period the specific destinations will not be reachable from the source, causing the network traffic and degrade the quality parameters of the network. The network re-converges process takes time from few milliseconds to tens of seconds. To overcome this issue Internet Engineering Task Force (IETF) published IP Fast ReRoute (IPFRR) framework. Many routing protocols are developed to recover network against such a network failures using IPFRR mechanism. The main aims of this mechanism are to reduce the network recovery time after a link or router gets failed and activate the alternate routing paths to avoid delay in network. Nowadays, in a network, multiple link-failures are occurring which causes heavy network traffic and loss of packets in network. Many existing IPFRR mechanisms are developed for providing the best possible routes. In this paper, we used a new algorithm named Dijkstra's algorithm disjoint spanning trees edge cut, which provides effective rerouting from source node to destination node against multi link failures.