What routing protocol uses distance-vector algorithms?

The choice of RIP as the routing protocol that uses distance-vector algorithms is correct. Distance-vector protocols determine the best path for data by sharing information about the distance and direction to reach a network. In the case of Routing Information Protocol (RIP), it uses hop count as its metric to assess the distance to a destination. Each router shares its routing tables with its immediate neighbors, which helps build a map of the network with each router relaying the shortest path information based on hop count.

RIP's simplicity makes it suitable for smaller networks but also limits it in scalability and performance compared to more complex protocols. For instance, it has a maximum hop count of 15, which constrains its effectiveness in larger networks. The periodic updates it sends every 30 seconds can also lead to issues like routing loops.

Other routing protocols mentioned do not utilize distance-vector algorithms. OSPF (Open Shortest Path First) is a link-state protocol that maintains a complete view of the network topology. EIGRP (Enhanced Interior Gateway Routing Protocol) is classified as a hybrid protocol, incorporating elements of both distance-vector and link-state routing. BGP (Border Gateway Protocol) is a path-vector protocol used extensively on the internet for exchanging routing information between autonomous systems.