22-04-2014, 11:24 AM
LINK STATE ROUTING
LINK STATE ROUTING.pptx (Size: 1.08 MB / Downloads: 11)
INTRODUCTION
Link state routing protocols
Also known as shortest path first algorithms
These protocols built around Dijkstra’s SPF algm.
BASICS
Each node in the domain has the entire topology of the domain.
It includes list of nodes & links,how they are connected(type,cost,links-up or down)
Each node uses DIJKTRA’S algm to build routing table.
CONCEPT OF ROUTING
It’s a simple domain with 5 nodes
Each node uses the same topology to create a routing table.
Analogous to a city map.
Routing table of each node is unique.
Topology must be dynamic (representing the latest state of each node & link).
SUMMARY
Link State Packets
After initial flooding, additional LSP are sent out when a change in topology occurs
Example of link state routing protocols
Open shortest path first