Scribd
Upload
9 views6 pages

Distance Vector Routing Explained

Distance Vector Routing maintains the best known distance to each destination through periodic updates with neighboring routers, utilizing the distributed Bellman-Ford algorithm. It calculates the least-cost paths based on estimated delays and can encounter issues such as the Count to Infinity problem when nodes fail. The document also includes routing tables and references for further reading on computer networks.

Uploaded by

yashrajsinhrathod9999
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
9 views6 pages

Distance Vector Routing Explained

Distance Vector Routing maintains the best known distance to each destination through periodic updates with neighboring routers, utilizing the distributed Bellman-Ford algorithm. It calculates the least-cost paths based on estimated delays and can encounter issues such as the Count to Infinity problem when nodes fail. The document also includes routing tables and references for further reading on computer networks.

Uploaded by

yashrajsinhrathod9999
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd

Introduction to Distance Vector Routing

• It operates by maintaining best known distance to each destination and an out going line
• These tables are updated by exchanging info with its neighbors
• It is also known as distributed Bellman-Ford or Ford-Fulkerson algorithm.
• It’s original Arpanet routing algorithm.
• The router is assumed to know the ‘distance’ of each of its neighbors
• If delay is the metric, once every T msec each router sends a list of estimated delays

L.J. Institute Of Computer Applications 1


9
1 B E
dx(y) = cost of least-cost path from x to y
A 3 2

5
C D
4

A to B = 1
A to C = 5 and A-B-C = 1 + 3 = 4, So A-to-C = 4 is selected
A to D is A-B-C-D = 1 + 3 + 4 = 8 and A-C-D = 9, So A-to-D = 8 is selected
A to E is A-B-E = 10 and A-C-D-E = 11, So, A-E = 10 is selected

2
1 B
9
E B’s Routing Table D’s Routing Table
A 3 2 Destination Next Hop Cost Destination Next Hop Cost
5
A A 1 A C 8
C D
4 C C 3 B C 7
D C 7 C C 4
E E 9 E E 2

A’s Routing Table C’s Routing Table


Destination Next Hop Cost Destination Next Hop Cost
B B 1 A B 4
C B 4 B B 3
D B 8 D D 4
E B 10 E D 6
3
Count to Infinity Problem
1 1 1
A B C D

B-3 C-2 D–1 Initial distance to D calculated by each node A, B and C

3 2 3 When D goes down, C calculated the distance to D w.r.t. B

3 4 3 After 1st exchange B calculated distance to D w.r.t. C


5 4 5 After 2nd exchange A and C calculated distance to D w.r.t. B
5 6 5 After 3rd exchange B calculated distance to D w.r.t. C

7 6 7 After 4th exchange A and C calculated distance to D w.r.t. B


7 8 7 After 5th exchange B calculated distance to D w.r.t. C
9 8 9 After 6th exchange A and C calculated distance to D w.r.t. B
9 10 9 After 7th exchange B calculated distance to D w.r.t. C
4
Assignment
• What are the advantages of using distance vector routing algorithm?
• What is the problem with DVR? Explain in detail with example.

L.J. Institute Of Computer Applications 5


References
• Books:
• Andrew S Tanenbaum, David. J. Wetherall, “Computer Networks”, Pearson Education, 5th Edition,
• Bhushan H Trivedi ,“Computer Networks”, Oxford University Press
• Behrouz A. Forouzan, "Data Communications and Networking", Tata McGraw-Hill, Fourth Edition
• Kurose and Ross,Computer Networking- A Top-Down approach, Pearson, 5 th edition
• Larry L. Peterson, Bruce S. Davie, “Computer Networks: A Systems Approach”, Morgan Kaufmann Publishers, Fifth
Edition, 2011.
• Fred Halsall,Computer Networking and the Internet, Addison Wesley, (5th edition)
• Ying-Dar Lin, Ren-Hung Hwang, Fred Baker, “Computer Networks: An Open Source Approach”, Mc Graw Hill Publisher,
2011

L.J. Institute Of Computer Applications 6

You might also like