Open Shortest Path First (OSPF)
OSPF is a Link-State routing protocol, designed to support larger networks in an efficient manner.
OSPF has following Link State characteristics:
| – | OSPF will form neighbor relationships with adjacent routers within the same Area. |
| – | OSPF advertises the status of directly connected links using Link-State Advertisements than advertising the distance to connected networks. |
| – | OSPF sends updates (LSAs) when there is a change in one of its links, and only the change is sent in the update. |
| – | OSPF uses the Dijkstra Shortest Path First algorithm to calculate the shortest path. |
Other characteristics of OSPF are:
| – | OSPF supports only IP routing. |
| – | The administrative distance of OSPF is 110. |
| – | It has cost as its metric, which is calculated on the basis of bandwidth of the link. OSPF has no hop-count limit. |
The OSPF maintains three separate tables:
| – | A neighbor table that contains a list of all neighboring routers. |
| – | A topology table that contains a list of all possible routes to all known networks within an area. |
| – | A routing table that contains the best route for each known network. |
The above mentioned features are offered and supported by VCL-MX-50xx family of IP/MPLS Routers.
Reference:
Balchunas, A. (2007). Open Shortest Path First. OSPF (v1.31, pp. 1-6). Router Alley Geeks-For-Geeks. (2022). Open Shortest Path First (OSPF) protocol States.
https://www.geeksforgeeks.org/open-shortest-path-first-ospf-protocol-states/