T. S. Priyadharsini, M. Udhayamoorthi, C. Senthilkumar, Information Technology, SNS College of Technology, Coimbatore, Tamilnadu, India.
DOI : 01.0401/ijaict.2014.07.21
International Journal of Advanced Information and Communication Technology
Received On : November 22, 2017
Revised On : December 13, 2017
Accepted On : January 11, 2017
Published On : February 05, 2017
Volume 04, Issue 02
Pages : 618-621
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.
Keywords
Convergence, Routing, Loops, Metrics, OSPF networks, RIP.
Cite this article
T. S. Priyadharsini, M. Udhayamoorthi, C. Senthilkumar, “A Review on Fast Convergence Scheme in OSPF Network” INTERNATIONAL JOURNAL OF ADVANCED INFORMATION AND COMMUNICATION TECHNOLOGY, pp.618-621, February 05, 2017.
Copyright
© 2017 T. S. Priyadharsini, M. Udhayamoorthi, C. Senthilkumar. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.