6 replies
"Distance Vector Routing : Distance vector algorithms use the Bellman-_x000D_ Ford algorithm. Distance vector algorithms are examples of dynamic_x000D_ routing protocols. Algorithms allow each device in the network to_x000D_ automatically build and maintain a local routing table or matrix. Routing_x000D_ table contains list of destinations, the total cost to each, and the next hop_x000D_ to send data to get there._x000D_ This approach assigns a number, the cost, to each of the links between_x000D_ each node in the network. Nodes will send information from point A to_x000D_ point B via the path that results in the lowest total cost i.e. the sum of the_x000D_ costs of the links between the nodes used._x000D_ _x000D_ Source: http://in.docsity.com/en-docs/Network_Technologies_and_TCP_IP__Lecture_notes__SUBASH"
to see other 4 answers
Related documents
Search questions by subject