Talk:Destination-Sequenced Distance Vector routing

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

This article is rated Stub-class on Wikipedia's content assessment scale.
It is of interest to the following WikiProjects:

Computing: Networking

	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
???	This article has not yet received a rating on the project's importance scale.
	This article is supported by Networking task force.
	This article has been automatically rated by a bot or other tool as Stub-class because it uses a stub template. Please ensure the assessment is correct before removing the `\|auto=` parameter.

General Notability

I see no reason to doubt the general notability of the DSDV protocol. As mentioned in the text, it avoids loops, which is an important improvement w.r.t. basic Distance Vector routing. I came to this page because of a reference to DSDV in these lecture notes. Other secondary sources can be found through CiteSeerX. --84.74.162.147 (talk) 17:12, 12 November 2011 (UTC)[reply]

What is a "link", why "generally"?

The introduction says: "Each entry in the routing table contains a sequence number, the sequence numbers are generally even if a link is present; else, an odd number is used.". What is a link? Is that a connection all the way to the other end, or is a link a direct one-hop neighbor? And what does the word "generally" mean here? I think "generally" should be removed since the oddness either means something or does not, it does not "generally mean something".

85.97.21.117 (talk) 16:08, 26 May 2012 (UTC)[reply]

On notability

The Perkins paper has been cited 7k+ times as per google scholar. I'm not the person to improve this article, but I have no doubt that the topic is notable. Lesser Cartographies (talk) 04:54, 10 August 2013 (UTC)[reply]