RIP Routing Fundamentals
RIP Routing Fundamentals
RIP is a dyna P amic, dista ance vec ctor routing protocol and was l dev veloped for smaller IP based I
RIPv1,an nd RIPv2
RIPv RIP vers v1: sion 1 is am mong the old protoco dest ols.
Lim mitations of RIPv1: f 1. H Count Limit: Destination th is more than 15 hops away is considered Hop hat h y unre eachable by RIPv1. y 2. Classful Ro outing Only RIP is a classful routing pro y: r otocol. RIP doesn Pv1 t supp classle routing RIP v1ad port ess g. dvertises all network it know as classf a ks ws ful netw works, so it is not pos t ssible to su ubnet a ne etwork usin RIP v1.. ng 3. M Metric limit tation: The best rout in RIP is determin by coun e te s ned nting the num mber of hop required to reach t ps d thedestina ation. A low hop co wer ount route is alwa preferr over a higher hop count rou One disadvantag of using ays red p ute. d ge g hop count as m metric is th if there is a route with one additional hop, but with hat e a w sign nificantly h higher band dwidth, the route wit smaller bandwidth is taken. e th h This is illustra in the figure belo s ated ow:
The RIP route packets take the pa throug 56KBPS link sinc e ed ath gh S the d destination can be re n eached in o hop. Though, the alternativ provide a one T e ve es
minimum bandwidth of 1MBPS (though using two links of 1MBPS, and 2MBPS each), it represents 2 hops and not preferred by the RIP protocol. Features of RIP v2: RIP v2 is a revised version of its predecessor RIP v1. The following are the important feature enhancements provided in RIPv2: 1. RIPv2 packets carry the subnet mask in each route entry, making RIPv2 a classless routing protocol. It provides support for variable-length subnet masking (VLSM) and classless addressing (CIDR). 2. Next Hop Specification: In RIPv2, each RIP entry includes a space where an explicit IP address can be entered as the next hop router for datagrams intended for the network in that entry. For example, this field can be used when the most efficient route to a network is through a router that is not running RIP. Since, that a router will not exchange RIP messages, explicit Next Hop field allows the router to be selected as the next hop router.
3. Authentication: RIPv1 does not support authentication. This loophole may be used maliciously by hackers, that may resulting in delivering the data packets to a fictitious destination as determined by the hacker. RIPv2 provides a basicauthentication scheme, so that a router can accept RIP messages from a neighboring router only after ascertaining its authenticity.
4. Route Tag: Each RIPv2 entry includes a Route Tag field, where additional information about a route can be stored. It provides a method for distinguishing between internal routes (learned by RIP) and external routes (learned from other protocols). Limitations of RIP v2: One of the biggest limitations of RIPv1 still remains with RIPv2. It is hop count limitation, and metric. The hop count of 16 still remains as unreachable, and the metric still remains hop count. A smaller hop count limits the network diameter, that is the number of routers that can participate in the RIP network. Example Question:
While the packet travels from source to destination through an Internetwork, which of the following statements are true? (Choose 2 best answers). A. The source and destination hardware (interface) addresses change B. The source and destination hardware (interface) addresses remain constant. C. The source and destination IP addresses change D. The source and destination IP addresses remain constant. Ans. A, D Explanation: While a packet travels through an Internetwork, it usually involves multiple hops. It is important to know that the logical address (IP address) of the source (that created the packet) anddestination (final intended destination) remain constant, whereas the hardware (interface) addresses change with each hop.