3) Distance Vector Versus Link State
B) Distance Vector Protocols
2) Working Example
![]()
A's Routing Table | ||
---|---|---|
Route from A to | Link | Cost |
A | local | 0 |
B | 1 | 1 |
C | 1 | 2 |
D | 3 | 1 |
E | 1 | 2 |
E's Routing Table | ||
---|---|---|
Route from E to | Link | Cost |
A | 4 | 2 |
B | 4 | 1 |
C | 6 | 1 |
D | 5 | 1 |
E | local | 0 |
Note: if more than 1 path to the same destination have the same cost,
router arbitararily picks one as the path to use.