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
- 8254 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 |
Give two examples of a ‘collision-free’ protocol ?
What is an Operating System?
Which layer is used to detect and correct errors
hi,i want to do the certification course in ethical hacking& hacking....wats is the difference...can any one suggest the good institutes.....wat r the fee particulars.....wat job opportunitie will be there? thanks in advance
What is the difference between OS and IOS ?
which are the institutes in mumbai for CCNA training & how much is the cost of teaching and the exam fees?
How to find Who is accesing my network or my folder through network?netstat will shows connections.
Explain various cabling techniques used in IEEE 802.3 standard.
what is frame realy
what are the two sub layers of data link layer called ?
What is the Rule of 17 concerning mapping devices to FAs?
What is your expertise with SymCLI? ( a few command-specific questions may follow)
Networking Protocols 
