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
- 8356 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 following ARQ techniques in detail 1. Stop and wait ARQ 2. Selective repeat ARQ
Write down the basic features of HDLC protocol? Could HDLC be used as a data link protocol for a LAN? Justify your answer.
i want to known about the ubuntu enumerate the various costs associated with the performance, security, support, and maintenance Thanks. please reply the saiwoontip9@gmail.com
Login security can be given by
1.what is ram , hard disk ,processor,motherboard ,bios and use of
Which layer is used to convert packets to frame
What are Network Components and explain their uses?
Explain various cabling techniques used in IEEE 802.3 standard.
i would like to say sir right now i have done hard/w networkig course ad doing a job as ATE engineer from CMS computer .Ltd so what r doing for future career ,which course is good ,&where is more opportunity plz tell me detils sir i m dialma??
Discuss Shannon’s capacity. What implications does it have ?
what is the name of the Jack used for Network Setup between one computer to Another and from computer to another device?
What do you meant by "triple X" in Networks?
Networking Protocols 
