Distance Vector

Distance-vector routing protocol

Distance-vector routing protocols are used to determine the best route for data packets based on distance, hop count, network latency and other factors. They use the Bellman–Ford algorithm to calculate the best route and exchange information with neighbouring routers. The original ARPANET routing algorithm was a distance vector algorithm, implemented through Routing Information Protocol (RIP).

1 courses cover this concept

COS 461 Computer Networks

Princeton University

Spring 2023

Princeton University's COS 461 offers a comprehensive survey of computer networks, exploring principles from end-to-end principle to overlay networks. The course involves a study of classic to contemporary research papers and assumes prior knowledge of computer science.

No concepts data

+ 25 more concepts