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
.

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

What is data link layer in the OSI reference model responsible for?

2 Answers   HCL,

---

Login security can be given by

2 Answers  

---

What are the various classes of IP addressing? Calculate the maximum number of class A, B and C network Ids.

0 Answers  

---

Why data link layer is divided into two layers?

2 Answers   HCL,

---

not able to connect to SBI Visa payment server...Getting message like "Server not found"...."proxy protected by firewall"....how to resolve this issue?

1 Answers   TCS,

---

---

What is cladding?

1 Answers   Elgi Equipments,

---

what is dhcp server?

4 Answers  

---

What is ARP and RARP?

6 Answers   CA,

---

Explain Any Standalnoe Application with rispect to OSI model, letus Consider Voice Recognition....!! One Has To tell function of all layers with rispect to given Application.

0 Answers   CMC,

---

How to use a user of domain as a SQL server database login.

3 Answers   Coca Cola,

---

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

1 Answers  

---

According to you which is the most important OSI layer?

0 Answers   IOCL,

---