Computer Networks
Opening a connection…
Initializing Sorting Algorithms...
Sorting
Trees
Graphs
Preparing interactive visualizations...
Computer Networks
Opening a connection…
Tell everyone everything about your own links, then let each router work out the best paths for itself. Flooding builds one shared map; Dijkstra turns it into a forwarding table.
| database of | A | B | C | D | E | F |
|---|---|---|---|---|---|---|
| router A | #1 | · | · | · | · | · |
| router B | · | #1 | · | · | · | · |
| router C | · | · | #1 | · | · | · |
| router D | · | · | · | #1 | · | · |
| router E | · | · | · | · | #1 | · |
| router F | · | · | · | · | · | #1 |
Each cell is the sequence number of origin's LSA held by that router; ringed cells arrived this step.
Each router first discovers its own neighbours (with hello packets) and describes them in a link-state advertisement: its name, a sequence number, and every link with its cost. Right now each router's database holds exactly one LSA — its own. A's says: B at 2, F at 1.
Question 1 of 3
What does a link-state router know that a distance-vector router never does?