RIP[1] is a simple distance-vector protocol that allows routers to share information about network reachability using hop counts. It is suitable for small networks but has limitations in scalability.
Key characteristics of RIP[1][2]:
Distance-vector protocol
Uses hop count as metric, each link between routers = 1 hop
Maximum allowed hops = 15 (16 = unreachable)
RIP[1] chooses the path with least hops to route packets
Simple, suitable for small networks
RIP[1] selects the path with the least number of hops. Each link = 1 hop (implicit).
Red line = shortest path (3 hops)
Blue dashed line = alternative path (4 hops)
RIP chooses the path with the least number of hops -> red line
