OSPF Using Dijkstra's Algorithm
Open Shortest Path First (OSPF) It's a routing protocol used in routers to find the shortest path between routers. It's based on Dijkstra's Algorothm . OSPF supports variable length subnet masks ( VLSM ) and route summarization. It uses link state routing (LSR) . OSPF routers maintain a map of internetwork called Link State Database. Here each router maintains the information of all other domains, routers, subnets within the entire network and based on this information, they determine the shortest path using dijkstra's algo. The routers gets this information through LSA. LSA - Link State Advertisements . They contains information about routers. An LSA is a router's way of communicating information in OSPF. There are different types of LSAs. We'll learn about them later in this blog Once this LSA have been flooded, OSPF stores information in Link State Database called LSDB . A large OSPF domain is broken into seperate areas to restrict the propagation of routes