Revision as of 22:46, 20 September 2005 edit 65.171.255.181 (talk) →Advantages and disadvantages ← Previous edit		Revision as of 15:33, 2 October 2005 edit undo Jnc (talk \| contribs) Autopatrolled, Administrators 17,621 edits Add mention of Bellman-Ford Next edit →
Line 1: A '''distance-vector routing protocol''' is a [[routing protocol]] used in [[routing]] of [[packet-switched network]]s in [[computer communication]]s, as in for example the [[Routing Information Protocol]] for [[Internet]] traffic. They use the [[Bellman-Ford]] [[algorithm]] to calculate paths. Examples of distance-vector routing protocols include [[Routing information protocol\|RIPv1 or 2]] and [[IGRP]].

Distance-vector routing protocol: Difference between revisions