Talk:Distance-vector routing protocol
From Wikipedia, the free encyclopedia
 |
This article is part of WikiProject Computer networking, an attempt to build a comprehensive and detailed guide to Computer networking on Wikipedia. If you would like to participate, you can edit the article attached to this page, or visit the project page, where you can join the project and/or contribute to the discussion. | |
| B | This article has been rated as B-Class on the assessment scale. | |
| Mid | This article is on a subject of mid priority within Computer networking for inclusion in Wikipedia 1.0. | |
|
Computer networking To-do:
|
||
[edit] Example
replaced IGRP example by RIP example... —The preceding unsigned comment was added by The Anome (talk • contribs) 10:07, 4 January 2004.
[edit] Need to cover
This page should be expanded to cover what Yakov named "path-vector" algorithms, which are part of a large class of "destination vector" algorithms, along with "distance-vector" (in that they both pass their neighbours vectors of destination info, i.e. routing tables). Noel (talk) 15:26, 2 October 2005 (UTC)
I understand that the Distance-vector routing is very useful in this sophisticated networking science
[edit] More explanation
This article seems to be good, (if a tad short) but the graph at the bottom needs some explanation. For example, what is T? Unless I am mistaken, it doesn't say in the article. Someone who knows about this stuff needs to add a bit more to this. Spacerat3004 23:28, 14 February 2007 (UTC)
- I fleshed out the example, still missing a better explanation for poison reverse, and why it doesn't work for all cases. (I think it only works for loops of 3 routers, or of a "diameter" of 2. right?) --Scraimer 00:43, 23 February 2007 (UTC)
