Talk:Distance-vector routing protocol

	This article is within the scope of WikiProject Computing, a collaborative effort to improve the coverage of computers, computing, and information technology on Wikipedia. If you would like to participate, please visit the project page, where you can join the discussion and see a list of open tasks.ComputingWikipedia:WikiProject ComputingTemplate:WikiProject ComputingComputing
B	This article has been rated as B-class on Wikipedia's content assessment scale.
???	This article has not yet received a rating on the project's importance scale.
	This article is supported by Networking task force (assessed as Mid-importance).

Example

replaced IGRP example by RIP example... —Preceding unsigned comment added by The Anome (talk • contribs) 10:07, 4 January 2004

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)[reply]

I understand that the Distance-vector routing is very useful in this sophisticated networking science

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)[reply]

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)[reply]

less message overhead

"Compared to link-state protocols, which requires a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead." - is this really true? Link state is generally considered to scale better as its link state packets are far smaller than distance vectors routing info packets —Preceding unsigned comment added by 128.232.108.57 (talk) 20:58, 27 May 2008 (UTC)[reply]