Description: Distance Vector Routing, also known as the Bellman-Ford shortest path algorithm. The basic idea is : Each router (routing nodes) has maintained a routing table, the destinations include routing (V) and the routing of distance (D). Each router regularly with neighboring nodes to exchange routing table information, updated accordingly their own routing table. All nodes are monitored from other nodes sent a routing table, and in accordance with the following rules to update its routing table :- found a purpose to reach a node of the new routing, The routing of the original routing table does not exist (that is, found a new routing), the routing table to increase the routing.- Found a purpose to reach an end point, the short distance between the new routing, the router can be used to replace
File list (Check if you may need any files):
Download