3) Distance Vector Versus Link State
B) Distance Vector Protocols
3) Broken Network Example
(from A): A=0, B=3, D=1
on link 1
The following table results
| A's Routing Table after D update | ||
|---|---|---|
| Route from A to | Link | Cost |
| A | local | 0 |
| B | 1 | 1 |
| C | 1 | 2 |
| D | 3 | 1 |
| E | 1 | 2 |