Differences between revisions 4 and 5
⇤ ← Revision 4 as of 2003-09-16 23:33:34 →
Size: 629
Editor: yakko
Comment:
← Revision 5 as of 2003-09-25 01:31:15 → ⇥
Size: 742
Editor: yakko
Comment:
Deletions are marked like this. Additions are marked like this.
Line 17: Line 17:
   * Routing loops between neighbors can be fixed with either SplitHorizon or SplitHorizon with poison reverse.

Back to ComputerTerms

Routing Algorithm

The Distance Vector algorithm is one in which global information is given to local nodes - that is neighboring nodes. Below is a table of how a node interacts with it's peers.

.

Who:

Broadcasts information to it's neighbors

What:

(Destination, Cost) tuples

When:

Periodically and when triggered by a change. Information is deleted after a time out.

Notes:

  • Converges when the topology is static
  • Suseptible to routing loops - race to infinity problem.

  • Routing loops between neighbors can be fixed with either SplitHorizon or SplitHorizon with poison reverse.

Example: InteriorGatewayRoutingProtocol (IGRP)

Back to ComputerTerms

DistanceVector (last edited 2003-09-25 17:49:53 by yakko)