Ubigate iBG2016 Configuration Guide© SAMSUNG Electronics Co., Ltd. 97CHAPTER 4. RIPRouting Information Protocol(RIP) is a classical distance-vector routingprotocol. It is simple to implement and performs good for small networks.Distance Vector Routing requires that each node maintain the distance fromitself to each possible destination. The distances are computed using theinformation in neighbor’s distance vectors.RIP version 1(defined in RFC 1058) has been later augmented by RIP version2(RFC 2453) to increase its usefulness. RIP 2 enabled RIP messages to carrymore information, which permitted the use of a simple authenticationmechanism to secure table updates. More importantly, RIP 2 supported subnetmasks, a critical feature that was not available in RIP.RIP Protocol FeaturesRIP sends routing-update messages at regular intervals and when the networktopology changes. When a router receives a routing update that includeschanges to an entry, it updates its routing table to reflect the new route.The metric value for the path is increased by 1, and the sender is indicated asthe next hop. RIP routers maintain only the best route(the route with thelowest metric value) to a destination. After updating its routing table, therouter immediately begins transmitting routing updates to inform othernetwork routers of the change. These updates are sent independently of theregularly scheduled updates that RIP routers send.RIP uses a single routing metric(hop count) to measure the distance betweenthe source and a destination network. Each hop in a path from source todestination is assigned a hop count value, which is typically 1.
