Explain distance vector routing . What are its limitations and how are they overcome?
- 2 Answers
- 6937 Views
- I also Faced
- E-Mail Answers
Answers were Sorted based on User's Feedback
Answer / sanjay poudel
It is a dynamic vector routing algorithm.
consists of data structure called routing tables.
it calculates the best route based on the distance.
Distance vector routing updates full routing table.
The utilization of CPU and memory in distance vector routing is lower than the link state routing.
Bellman -Ford algorithm is used for performing distance vector routing.
LIMITATIONS
It is slower to converge than link state.
it creates more traffic than link state since a hop count change must be propogated to all routers and processed on each route.
The bellman-ford algorithm does not prevent routing loops from happening and suffers from the count-to identify problem.
In such such a scenario 3 hop-counts path will be selected although other path is congestion free. This can be overcome by using LSA .
(Link State Analysis) protocols and Hybrid Protocols. In these not only the hop-count is considered but also link quality is checked at regular interval to ensure the selection of not only shortest path but also the most efficient path for the destination
.
| Is This Answer Correct ? | 4 Yes | 1 No |
Answer / sanjaypoudel135@gmail.com
Distance Vector Routing Definition. Distance vector routing is a simple routing protocol used in packet-switched networks that utilizes distance to decide the best packet forwarding path. ... A hop is the trip that a packet takes from one router to another as it traverses a network on the way to its destination.
it is a dynamic vector routing algorithm.
consists of data structure called routing table.
it calculates the best route based on the distance.
distance vector routing updates full routing table.
it is simple to implement and manage.
Bellman ford algorithm is used for performing distance vector routing.
The utilization of CPU and memory in distance vector routing is lower than the link state routing.
Limitations
It is slower to converge than link state.
bellman ford algorithm does not prevent routing loops from happening and suffers from the count-to identify problem
Limitations overcome
In such such a scenario 3 hop-counts path will be selected although other path is congestion free. This can be overcome by using LSA
(Link State Analysis) protocols and Hybrid Protocols. In these not only the hop-count is considered but also link quality is checked at regular interval to ensure the selection of not only shortest path but also the most efficient path for the destination
| Is This Answer Correct ? | 2 Yes | 1 No |
What is meant by DCE and DTE when it comes to Router?
What are the 3 most common LAN architectures?
How the code in popup card number(SIM recharge card number) will be unique?How they designed?What is the formula?Please answer me?
how many backups in windows2003
What is the difference between process and thread ? also what is the difference between process and service >
What is the Bandwidth of ethernet ?
what are the major componets of client server application?
what is disk interleaving? why is disk interleaving adopted?
What MAU?
0 Answers Elgi Equipments, MCN Solutions,
How data flow from source to destination, Explain each step from layer to layer?
5 Answers Akamai Technologies, Juniper Networks, Satyam,
What is packet switching ? Explain two different approaches of packet switching. ?
What is Norton Ghost? How do i create a bootable disc?
Networking Protocols 
