|
⇤ ← Revision 1 as of 2003-09-16 23:30:14
Size: 529
Comment:
|
Size: 579
Comment:
|
| Deletions are marked like this. | Additions are marked like this. |
| Line 1: | Line 1: |
| Back to ComputerTerms |
|
| Line 15: | Line 17: |
Back to ComputerTerms |
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.
Back to ComputerTerms