Talk:Destination-Sequenced Distance Vector routing
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. --220.127.116.11 (talk) 17:12, 12 November 2011 (UTC)
|WikiProject Computing / Networking||(Rated Stub-class)|
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".
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)