Scribd
Upload
14 views

DVR Routing Algorithm

Distance Vector Routing (DVR) Protocol is a method used by routers to determine the best path for data transmission by maintaining a table of distances to other routers. The protocol involves routers sharing distance information with neighbors to update their routing tables, and it has applications in computer networking, telephone systems, and military operations. While it effectively finds the shortest path and is easy to implement, it has disadvantages such as slower convergence, susceptibility to the count-to-infinity problem, and increased traffic due to periodic updates.

Uploaded by

sudanharshpreetkaur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
14 views

DVR Routing Algorithm

Distance Vector Routing (DVR) Protocol is a method used by routers to determine the best path for data transmission by maintaining a table of distances to other routers. The protocol involves routers sharing distance information with neighbors to update their routing tables, and it has applications in computer networking, telephone systems, and military operations. While it effectively finds the shortest path and is easy to implement, it has disadvantages such as slower convergence, susceptibility to the count-to-infinity problem, and increased traffic due to periodic updates.

Uploaded by

sudanharshpreetkaur
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 6
Distance Vector Routing (DVR) Protocol Distance Vector Routing (DVR) Protocol is a method used by routers to find the best path for data to travel across a network. Each router keeps a table that shows the shortest distance to every other router, based on the number of hops (or steps) needed to reach them. Routers share this information with their neighbors, allowing them to update their tables and find the most efficient routes. This protocol helps ensure that data moves quickly and smoothly through the network. What is the Distance Vector Routing Algorithm? The protocol requires that a router inform its neighbors of topology changes periodically. Historically known as the old ARPANET routing algorithm (or known as the Bellman- Ford algorithm). Bellman-Ford Basics Each router maintains a Distance Vector table containing the distance between itself and All possible destination nodes. Distances, based on a chosen metric, are computed using information from the neighbors' distance vectors. How Distance Vector Algorithm works? ¢ A router transmits its distance vector to each of its neighbors in a routing packet. ¢ Each router receives and saves the most recently received distance vector from each of its neighbors. ¢ Arouter recalculates its distance vector when: o It receives a distance vector from a neighbor containing different information than before. o It discovers that a link to a neighbor has gone down. Applications of Distance Vector Routing Algorithm The Distance Vector Routing Algorithm has several uses: ¢ Computer Networking : It helps route data packets in networks. ¢ Telephone Systems: It's used in some telephone switching systems. ¢ Military Applications : It has been used to route missiles. Advantages of Distance Vector routing ¢ Shortest Path : Distance Vector Routing finds the shortest path for data to travel in a network. e Usage: It is used in local, metropolitan, and wide-area networks. ¢ Easy Implementation : The method is simple to set up and doesn't require many resources. Disadvantages of Distance Vector Routing Algorithm It is slower to converge than link state. ¢ It is at risk from the count-to-infinity problem. ¢ It creates more traffic than link state since a hop count change must be propagated to all routers and processed on each router. Hop count updates take place on a periodic basis, even if there are no changes in the network topology , so bandwidth -wasting broadcasts still occur. For larger networks, distance vector routing results in larger routing tables than link state since each router must know about all other routers. This can also lead to congestion on WAN links.

You might also like