Distance Vector Routing Protocol Program in c

A distance-vector routing protocol is a primary type of routing protocol in computer network theory for packet-switched networks, alongside the link-state protocol category. The Bellman-Ford algorithm is utilized within distance-vector routing protocols to determine paths.

A distance-vector routing protocol mandates that a router inform its neighbors whenever there is a change in the network's topology or, in some instances, as soon as a change is detected. Distance-vector routing protocols typically involve less message overhead and computational complexity compared to link-state protocols, which necessitate a router to communicate topology changes to all nodes in the network.

1. New estimated
delay liom J

To A I HK + Line

Ala] [24] [20] [21 g|A

B[42] [38] [31] [28 20| A

C{25] [18] [19] [38 28/1

D| «0 27 3 24 20] H

Ef[14] [7 | [30] [22 17/1

F[23] [20] [19] [40 30] 1

Gi 4a] [31]! 6 | {31 18[H

H[47] [20] | o | [49 12] H

ı [21] Lo | [14] [22 jo] 1

! da E Js] 11] [5] lo o|-
K[24] [22] [22] [o GE

(a) A subnet. L[zs] [sa] [o] [o 15[K
(b) Input from A, 4, H, K, alt, re au, at arn
and the new s is is is touting

8 10 12 6 table

couting table for J. ford

Vectors ¡eceived fiom fp)
u's four neighbors