Jump to content

Talk:Distance-vector routing protocol

Page contents not supported in other languages.
From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Spacerat3004 (talk | contribs) at 23:28, 14 February 2007. The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

Template:Cnproj

Example

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

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]

Retrieved from "https://en.wikipedia.org/w/index.php?title=Talk:Distance-vector_routing_protocol&oldid=108197288"