EXTENSIVE REVIEWS OF OSPF FOR REDUCING THE CONVERGENCE TIME

Pertik Garg, Anuj Kumar Gupta

Abstract


Link state routing protocols for example, OSPF synchronize the topology databases by flooding link state update messages occasionally or at whatever point there is an availability change. Topology changes trigger routing protocol to experience convergence procedure which gets ready new shortest routes required for packet delivery. Real-time applications these days need routing protocol to have a fast convergence time. This problem may be resolved by proposing an algorithm that can quickly respond to the topology change and reduce the convergence time by providing back up path which is already stored in routing table before the failover happens. EIGRP routing protocol gives a prevalent execution than OSPF routing protocol for real time applications. In this paper we reviewed the various papers on OSPF and EIGRP for the convergence time.

Keywords


OSPF, Link State Routing Protocol, IP, Packet loss, Convergence time.

Full Text:

PDF


DOI: https://doi.org/10.26483/ijarcs.v8i9.5101

Refbacks

  • There are currently no refbacks.




Copyright (c) 2017 International Journal of Advanced Research in Computer Science