The Routing Information Protocol (RIP) is among the known dynamic routing protocol utilized in local and wide area systems. Her administrative distance of 120.
RIP is classed like a distance-vector routing protocol, which utilizes the hop count like a routing metric, The utmost quantity of hops permitted for RIP is 15. A hop count of 16 is recognized as a vast distance viewing such distance as unreachable and undesirable route inside it routing process. This hop count limits how big network that RIP operate. it really works well in small systems, it has been seen to be inefficient in large network.
RIP operates a hold lower timer of 180 seconds, transmits full updates every thirty seconds. RIP implements the holddown, split horizon, route poisoning mechanisms to avoid incorrect routing information from being propagated. These and much more are the stability options that come with RIP.
RIP version 1
RIP version 1 uses only classful routine, meaning all devices within the network should be configure with similar subnet. it doesn’t include subnet information in the updates.
Among the lack of RIP v1 may be the lack of ability to to propagate periodic routing updates of subnet information, as well as doesn’t support Variable Length Subnet Masks (VLSM).
Because of the deficiencies of RIPv1, RIP version 5 (RIPv2) is really a classless routing protocol. It had been developed between 1993. It’s outfitted having the ability to include subnet information, additionally, it supports Classless Inter-Domain Routing (CIDR). Still it keep up with the hop count limit of 15. RIPv2 incorporated your password authentication mechanism. However, passwords were transmitted in obvious-text format that have been found inadequate for secure communications on the web.
If RIP finds several connect to a network with similar hop count, it’ll instantly perform load balancing. It may perform load balancing for approximately six equal-cost links (four automatically)
The lower turn of distance routing protocols like RIP is:
Their slow convergence can lead to inconsistency routing tables and routine loops
It’s capability to broadcast any alterations in the internetwork through their periodic routine updates including the entire routing tables. This in the own terms proves costly in term of CPU processes and link bandwidth utilization. This could cause problem throughout an outage around the network.