EFFICIENT ALGORITHMS TO ENHANCE RECOVERY SCHEMA IN LINK STATE PROTOCOLS

With the increasing demands for real-time applications traffic in net- works such as video and voice a highconvergence time for the existing routing protocols when failure occurred is required. These applicationscan be very sensitive to packet loss when link/node goes down. In this paper, we propose two algorithmsschemas for the link state protocol to reroute the traffic in two states; first, pre-calculated an alternativeand disjoint path with the primary one from the source to the destination by re-routing traffic through it,regardless of the locations of failure and the number of failed links. Second, rerouting the traffic via analternative path from a node whose local link is down without the need to wait until the source node knowsabout the failure. This is achieved by creating a new backup routing table based on the original routingtable which is computed by the dijkstra algorithm. The goal of these algorithms is to reduce loss of packets,end-to-end delay time, improve throughput and avoiding local loop when nodes re-converge the topologyin case of failure.