|
Explain Distance vector routing protocol? priyadarshini 12-January-2008 01:51:13 PMComments en.wikipedia.org/wiki/Distance-vector_routing_protocol Posted by crouse Distance Vector (Number of hops) - Distance vector routing determines the direction (vector) and distance to any link in the internetwork. Typically, the smaller the metric, the better the path. EX: Examples of distance vector protocols are RIP and IGRP. Distance vector routing is useful for smaller networks. The limitation is that any route which is greater than 15 hops is considered unreachable. One important thing that differentiates distance vector with Link state is that distance vector listens to second hand information to learn routing tables whereas, Link state builds its routing tables from first hand information. Distance vector algorithms call for each router to send its entire routing table to each of its adjacent neighbors Posted by areil |
Posted: 12-January-2008 02:31:31 PM By: areil Distance Vector (Number of hops) - Distance vector routing determines the direction (vector) and distance to any link in the internetwork. Typically, the smaller the metric, the better the path. EX: Examples of distance vector protocols are RIP and IGRP. Distance vector routing is useful for smaller networks. The limitation is that any route which is greater than 15 hops is considered unreachable. One important thing that differentiates distance vector with Link state is that distance vector listens to second hand information to learn routing tables whereas, Link state builds its routing tables from first hand information. Distance vector algorithms call for each router to send its entire routing table to each of its adjacent neighbors | |
Posted: 16-September-2009 03:56:54 AM By: crouse en.wikipedia.org/wiki/Distance-vector_routing_protocol |