Interested to Buy Any Domain ? << Click Here >> for more details...
Explain distance vector routing . What are its limitations and how are they overcome?
- 2 Answers
- 8252 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 |
Explain the working of 3 bit sliding window protocol with suitable example.
What is the advantage of Ring network ?
What are the advantages of cell switching that is used in ATM?
What Fabric Switch hardware have you worked on? (like Cisco9000, Brocade 3250 etc)
default route is analogous to ?
One of my friend told that M.C.A people are not prefered by the companies for networking side requirement is it true? please post your answer.because i want to make my career at networking side.
Explain the advantage and disadvantage of ethernet ?
12 Answers ABC, Cisco, Honeywell, IPP Media, PNC,
difference between parallel and serialo communication
wat is the course CCNA completely based on?
Which is better Router or Layer 3 switch?How.
What is MAC address
What do you meant by "triple X" in Networks?
Networking Protocols 
