What is Link State Routing Protocols?
Link state routing protocols maintain complete road map of the network in each router
running a link state routing protocol. Each router running a link state routing protocol
originates information about the router, its directly connected links, and the state of those
links. This information is sent to all the routers in the network as multicast messages.
Link-state routing always try to maintain full networks topology by updating itself
incrementally whenever a change happens in network.
Each router in the network keeps a copy of it, without changing it. After obtaining the
complete picture of network topology, each router will independently calculate its own
best paths to reach the destination networks.
Link state protocols are based on Shortest Path First (SPF) algorithm to find the best path
to a destination. Shortest Path First (SPF) algorithm is also known as Dijkstra algorithm,
since it is conceptualized by Dijkstra. In Shortest Path First (SPF) algorithm, whenever a
link's state changes, a routing update called a Link-State Advertisement (LSA) is
exchanged between routers. When a router receives an LSA routing update, the link-state
algorithm is used to recalculate the shortest path to affected destinations. Each router
constructs a map of the complete network. An example of Link State protocol is OSPF
(Open Shortest Path First).
Some important terms related with Link State Routing Protocols;
• Link-state advertisements (LSAs) – A link-state advertisement (LSA) is a small packet
of routing information that is sent between routers.
• Topological database – A topological database is a collection of information gathered
from LSAs.
• SPF algorithm (Dijkstra algorithm) – The shortest path first (SPF) algorithm is a
calculation performed on the database resulting in the SPF tree.
• Routing tables – A list of the known paths and interfaces.
Link State Routing Protocols converge more quickly and they are less prone to Routing
Loops than Distance Vector Routing Protocols. On the other hand, Link State Routing
Protocols require more CPU power and memory than Distance Vector Routing Protocol
algorithms. Link State Protocols use a hierarchical structure that limits the distance that
a Link-State Advertisement (LSA) need to travel. Link State Protocols use multicasts to
share the routing information. Only the routers which run Link State protocol only process
the updates. Link State routers send updates only when there is a change in the state of
the network (incremental updates).
Link-state algorithms can be more complex and expensive to implement and support.
Open Shortest Path First (OSPF) Protocol
The Open Shortest Path First (OSPF) protocol is a link state protocol that handles routing
for IP traffic. Open Shortest Path First (OSPF) is an open standard (not proprietary) and
it will run on most routers independent of make. Open Shortest Path First (OSPF) uses
the Shortest Path First (SPF) algorithm, developed by Dijkstra, to provide a loop-free
topology. Open Shortest Path First (OSPF) provides fast convergence with triggered,
incremental updates via Link State Advertisements (LSAs). Open Shortest Path First
(OSPF) is a classless protocol and allows for a hierarchical design with VLSM and route
summarization.
The main disadvantages of Open Shortest Path First (OSPF) are Open Shortest Path First
(OSPF) requires more memory to hold the adjacency (list of OSPF neighbors), topology
(a link state database containing all of the routers and their routes), and routing tables,
Open Shortest Path First (OSPF) requires extra CPU processing to run the SPF algorithm
and Open Shortest Path First (OSPF) is a complex routing protocol.
The two important concepts in case of OSPF are Autonomous Systems and Areas. Areas
are used to provide hierarchical routing, within an Autonomous System. Areas are used
to control when and how much routing information is shared across your network.
OSPF implements a two-layer hierarchy: the backbone (Area 0) and areas off of the
backbone (Areas 1–65,535). Here the two different areas can summarize routing
information between them. Route summarization helps to compact the routing tables. All
areas should connect to Area 0 and all routers in an Area will have the same topology
table.
Important Terms related with Open Shortest Path First (OSPF)
Router ID: Every Router in an OSPF network needs a unique OSPF Router ID. The OSPF
Router ID is used to provide a unique identity to the OSPF Router. It is the highest active
IP address present on the router. First, highest loopback address is considered. If no
loopback is configured then the highest active IP address on the interface of the router
is considered.
What is a Loopback Interface?
A loopback interface is a logical, virtual interface on a router. By default, the router doesn’t
have any loopback interfaces, but they can easily be created. These interfaces are treated
as physical interfaces on a router and we can assign ip addresses to them.
Area border router (ABR)
An Area border router (ABR) is a router that connects one or more OSPF areas to the main
backbone network. It is considered a member of all areas it is connected to.
Internal router
An Internal Router is a router that has only OSPF neighbour relationships with routers in
the same area.
Backbone router
Backbone Routers are part of the OSPF backbone. This includes all area border routers
and also routers connecting different areas.
Autonomous System Border Router
A router that connects two autonomous systems is called Autonomous System Border
Router.
Designated Router (DR)
It is elected to minimize the number of adjacencies formed. DR distributes the LSAs to
all the other routers. DR is elected in a broadcast network to which all the other routers
share their DBD. In a broadcast network, router requests for an update to DR and DR will
respond to that request with an update. The Designated Router (DR) maintains a
complete topology table of the network and sends the updates to the other routers via
multicast.
Backup Designated Router (BDR)
BDR is backup to DR in a broadcast network. When DR goes down, BDR becomes DR
and performs its functions.
Router priority
It is a 8 bit value assigned to a router operating OSPF, used to elect DR and BDR in a
broadcast network.
DR and BDR election – DR and BDR election takes place in broadcast network or multi-
access network. Here are the criteria for the election:
1. Router having the highest router priority will be declared as DR.
2. If there is a tie in router priority then highest router I’d will be considered. First,
the highest loopback address is considered. If no loopback is configured then
the highest active IP address on the interface of the router is considered.
Open Shortest Path First (OSPF) Protocol Configuration
Router(config)# router ospf process_ID
Router(config-router) # network network_id wildcard_mask area area_#
Note:
Process id: A value in the range 1–65,535 identifies the OSPF Process ID. OSPF Process
ID is a unique number on this router that groups a series of OSPF configuration
commands under a specific running process.
Wildcard Mask: The wildcard mask is the inverse mask of the subnet mask. For example,
Subnet mask: [Link]
Wildcard mask: [Link]
Wildcard Mask=Global Subnet Mask – Customized Subnet Mask
Area Number: The area_# given above is the Area Number. Area Number can always be
zero (0) for small networks, but for larger networks, the Area Number need to be properly
planned as all routing updates must traverse Area 0.
Open Shortest Path First (OSPF) Protocol - Lab Practice
Open Shortest Path First (OSPF) Protocol configuration in Router01
Router01(config)#router ospf 1
Router01(config-router) #network [Link] [Link] area 0
Router01(config-router) #network [Link] [Link] area 0
Router01(config-router) #exit
Open Shortest Path First (OSPF) Protocol configuration in Router02
Router02(config)#router ospf 1
Router02(config-router) #network [Link] [Link] area 0
Router02(config-router) #network [Link] [Link] area 0
Router02(config-router) #network [Link] [Link] area 0
Router02(config-router) #exit
Open Shortest Path First (OSPF) Protocol configuration in Router03
Router03(config)#router ospf 1
Router03(config-router) #network [Link] [Link] area 0
Router03(config-router) #network [Link] [Link] area 0
Router03(config-router) #exit
OSPF Rules:
• Become Neighbours
• Exchange Database Information
• Choose Best Routes