A REVIEW ON FAST CONVERGENCE SCHEME IN OSPF NETWORK

Abstract- This paper proposes a fast-convergence scheme to update metrics without loop in Open Shortest Path First (OSPF) networks. In OSPF networks, while updating the metrics to improve the routing performance, packets may be routed in a loop in transient states. This results in packet loss and inefficiency in network resources. To avoid transient loops, a conventional scheme gives priority to each router to update metrics. When the updated metrics include both larger and smaller values than the ones before the update, it requires two updating processes, each of which contains either larger or smaller values. It takes time to converge to update all the metrics in the conventional scheme. This paper includes introduction, advantages, limitations and applications, comparison of OSPF with RIP, OSPF Areas and Routers, OSPF network types and convergence scheme in OSPF