Revision as of 10:13, 4 January 2004 edit The Anome (talk \| contribs) Edit filter managers, Administrators 260,137 edits cleanups ← Previous edit		Revision as of 10:16, 4 January 2004 edit undo The Anome (talk \| contribs) Edit filter managers, Administrators 260,137 edits Compare with: link-state routing protocol Next edit →
Line 10: # Bad routing paths are then purged from the new routing table. If two identical paths to the same network exists, only the one with the smallest hop-count is kept. When the new table has been cleaned up, it may be used to replace the existing routing table used for packet forwarding. #The new routing table is then communicated to all neighbors of this router. This way the routing information will spread and eventually all routers know the routing path to each network, which router it shall use to reach this network, and to which router it shall route next. Compare with: [[link-state routing protocol]]

Distance-vector routing protocol: Difference between revisions