Free IP addressing and routing lessonsIP addressing and routing · Stage 1 · Forwarding and routing · Step 3
Link-state routing and Dijkstra
Flood every router's links to everyone, then let each router compute shortest paths itself. About 15 minutes.
What does each router in a link-state protocol flood to the rest of the network?
- AThe state and cost of its own links to its neighbours
- BIts whole routing table
- CCopies of the data packets it forwards
Show the answer
The state and cost of its own links to its neighbours. Everyone assembles those into the full map.
4 questions on this idea
Short questions that apply the idea to new cases: trace it, work out a number, put steps in order. A wrong answer explains itself.
Answer them in your browserFree account, no card. Your progress is saved, and the idea comes back in a quick review later.
Sign up free to solve