|
|
|
|
|
|
|
|
|
|
|
n |
Example
1
|
|
|
|
– |
F
detects that link to G has failed
|
|
|
|
– |
F
sets distance to G to infinity and sends update to A
|
|
|
|
– |
A
sets distance to G to infinity since it uses F to reach G
|
|
|
– |
A
receives periodic update from C with 2-hop path to G
|
|
|
|
– |
A
sets distance to G to 3 and sends update to F
|
|
|
|
– |
F
decides it can reach G in 4 hops via A
|
|