5 - Link State Routing Flashcards
What do link state protocols atempt to achieve?
Minimise convergence times.
Eliminate non-transient packet looping
Allows multiple metrics to be used
What do routers broadcast the state of?
The state of its locally attached links and IP subnets
What do routers construct?
in terms of toplogy
A complete topology view of the net, based on link state updates.
Its next-hop routing table
Topology Database
Router IDs
Link IDs
- From Router ID
- To Router ID
Metric(s)
Sequence Number
List of shortest paths to destinations
How are removals announced?
Link State Operation
By metric set to infinity
What process occurs when adjacencies refresh?
Neighbours use “hello” protocol
If a router loses a neighbour then recompute routes via there.
Send announcemens with metric set to infinity
What type of algorithm is Djikstra’s Algorithm?
Shortest Path First graph algorithm
Summary of Djikstra’s Algo
Search outward and add router IDs as you expand the front
OSPF
Open Shortest Path First
OSPF two level hierarchy
2 items
Local area and backbone
OSPF: Link state announcements only where?
Link state announcements only in respective areas
OSPF: What knowledge do nodes in each area have?
Nodes in each area have detailed topology and only know direction (shortest path) to networks in other other areas
Area border routers
Summarise distances to networks in the area and advertise them.
What algorithm do Backbone routers run and where is it limited to?
Run an OSPF routing algorithm limited to the backbone
Boundary routers
Connect to other ASes
IS:IS Routing Protocol
Intermediate System to Intermediate System Routing
Intermediate System
Router