2 posts • Page 1 of 1
How do distance vector routing protocols function?
Also known as Bellman-Ford-Fulkerson algorithms, distance vector routing protocols pass complete routing tables to neighboring routers. Neighboring routers then combine the received routing table with their own routing table. Each router receives a routing table from its directly connected neighbor. Distance vector routing tables include information about the total cost and the logical address of the first router on the path to each network they know about.
Who is online
Users browsing this forum: No registered users and 3 guests