Scribd
Upload
58 views1 page

Routing Information Protocol

The Routing Information Protocol (RIP) is a distance-vector routing protocol that uses hop count as a metric, with a maximum limit of 15 hops to prevent routing loops. It incorporates stability features such as split horizon, route poisoning, and holddown mechanisms, but is less favored in modern networks due to poor scalability and convergence times compared to other protocols like EIGRP and OSPF. Despite its limitations, RIP is easy to configure as it does not require additional parameters on routers.

Uploaded by

Rocky ⎝⏠⏝⏠⎠ Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
58 views1 page

Routing Information Protocol

The Routing Information Protocol (RIP) is a distance-vector routing protocol that uses hop count as a metric, with a maximum limit of 15 hops to prevent routing loops. It incorporates stability features such as split horizon, route poisoning, and holddown mechanisms, but is less favored in modern networks due to poor scalability and convergence times compared to other protocols like EIGRP and OSPF. Despite its limitations, RIP is easy to configure as it does not require additional parameters on routers.

Uploaded by

Rocky ⎝⏠⏝⏠⎠ Kumar
Copyright
© Attribution Non-Commercial (BY-NC)
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

The Routing Information Protocol (RIP) is a distance-vector routing protocol, wh ich employs the hop count as a routing metric.

RIP prevents routing loops by imp lementing a limit on the number of hops allowed in a path from the source to a d estination. The maximum number of hops allowed for RIP is 15. This hop limit, ho wever, also limits the size of networks that RIP can support. A hop count of 16 is considered an infinite distance and used to deprecate inaccessible, inoperabl e, or otherwise undesirable routes in the selection process. RIP implements the split horizon, route poisoning and holddown mechanisms to pre vent incorrect routing information from being propagated. These are some of the stability features of RIP. It is also possible to use the so called RMTI[1] (Rou ting Information Protocol with Metric-based Topology Investigation) algorithm to cope with the count-to-infinity problem. With its help, it is possible to detec t every possible loop with a very small computation effort. Originally each RIP router transmitted full updates every 30 seconds. In the ear ly deployments, routing tables were small enough that the traffic was not signif icant. As networks grew in size, however, it became evident there could be a mas sive traffic burst every 30 seconds, even if the routers had been initialized at random times. It was thought, as a result of random initialization, the routing updates would spread out in time, but this was not true in practice. Sally Floy d and Van Jacobson showed in 1994[2] that, without slight randomization of the u pdate timer, the timers synchronized over time. In most current networking envir onments, RIP is not the preferred choice for routing as its time to converge and scalability are poor compared to EIGRP, OSPF, or IS-IS (the latter two being li nk-state routing protocols), and (without RMTI) a hop limit severely limits the size of network it can be used in. However, it is easy to configure, because RIP does not require any parameters on a router unlike other protocols (see here fo r an animation of basic RIP simulation visualizing RIP configuration and exchang ing of Request and Response to discover new routes).

You might also like