|
What is Distance Vector Routing Protocols?
|
|
02-07-2014, 03:57 PM,
|
|||
|
|||
|
What is Distance Vector Routing Protocols?
In computer communication theory relating to packet-switched networks, a distance-vector routing protocol is one of the two major classes of routing protocols, the other major class being the link-state protocol. Distance-vector routing protocols use the Bellman–Ford algorithm, Ford–Fulkerson algorithm, or DUAL FSM (in the case of Cisco Systems's protocols) to calculate paths. A distance-vector routing protocol requires that a router informs its neighbors of topology changes periodically. Compared to link-state protocols, which require a router to inform all the nodes in a network of topology changes, distance-vector routing protocols have less computational complexity and message overhead
shukoorpa9, proud to be a member of VoIP Call Provider - Discussion Forums for the VoIP Call Provider since Jan 2014.
|
|||
|
« Next Oldest | Next Newest »
|
Search
Member List
Calendar
Help
