4.12 - Distance Vector Routing Algorithm

This video describes about Distance Vector Routing Algorithm - DSDV with example.

"Distance Vector Routing Algorithm - DSDV:
- Distance-vector (DV) algorithm is iterative, asynchronous, and distributed.
- It is distributed in that each node receives some information from one or more of its directly attached neighbours, performs a calculation, and then distributes the results of its calculation back to its neighbours.
- It is iterative. so, process continues on until no more information is exchanged between neighbours.
- The algorithm is asynchronous. It does not require all of the nodes to operate with each other.
- Distance-vector routing protocols use the Bellman–Ford algorithm and Ford–Fulkerson algorithm to calculate the best route.

GTU - Computer Engineering (CE) - Semester 4 - 2140709 - Computer Networks - Network Layer - Distance Vector Routing Algorithm

Darshan Institute of Engineering & Technology, Rajkot is a leading institute offering undergraduate, graduate and postgraduate programs in engineering. The Institute is affiliated to the Gujarat Technological University (GTU) and approved by the AICTE, New Delhi.

[siyabazala]

It's look like sir only read an English story from book, try to explain sir not just only read

[kapadiyajay]

Bitte versuch nicht, uns zu belehren.