Link-state routing protocol: Difference between revisions

Revision as of 16:17, 19 February 2005

Revision as of 01:42, 25 February 2005

Line 93:

==Notes==

If all the nodes are not working from '''exactly''' the same map, ''routing loops'' can form. (These are situations in which, in the simplest form, two neighbouring nodes each think the other is the best next hop to a given destination. Any packet headed to that destination arriving at either node will loop bewteenbetween the two, hence the name. Routing loops involving more than two nodes are also possible.)

The reason is fairly simple: since each node computes its shortest-path tree, and its routing table, without interacting in any way with any other nodes, if two nodes start with different maps it is easy to have scenarios in which routing loops are created.