| Routing Loops |
| D |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| n | Example
2 |
|||||||||||||
| – | Link
from A to E fails |
|||||||||||||
| – | A
advertises distance of infinity to E |
|||||||||||||
| – | B and
C advertise a distance of 2 to E |
|||||||||||||
| – | B
decides it can reach E in 3 hops; advertises this to A |
|||||||||||||
| – | A
decides it can reach E in 4 hops; advertises this to C |
|||||||||||||
| – | C
decides that it can reach E in 5 hops...... |
|||||||||||||
| n | Heuristics
to break routing loops |
|||||||||||||
| – | set
infinity to 16 |
|||||||||||||
| – | split
horizon |
|||||||||||||
| – | split
horizon with poison reverse |
|||||||||||||
