Jump to content

Routing Information Protocol: Difference between revisions

From Wikipedia, the free encyclopedia
Browse history interactively
← Previous editNext edit →
Content deleted Content added
VisualWikitext
removed dead link that links to domain squatter instead of animation
Line 7: Line 7:


Originally, each RIP router transmitted full updates every 30 seconds. In the early deployments, routing tables were small enough that the traffic was not significant. As networks grew in size, however, it became evident there could be a massive 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 Floyd and Van Jacobson showed in 1994<ref>[http://www.icir.org/floyd/papers/sync_94.pdf The Synchronization of Periodic Routing Messages], S. Floyd & V. Jacobson,April 1994</ref> that, without slight randomization of the update timer, the timers synchronized over time.
Originally, each RIP router transmitted full updates every 30 seconds. In the early deployments, routing tables were small enough that the traffic was not significant. As networks grew in size, however, it became evident there could be a massive 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 Floyd and Van Jacobson showed in 1994<ref>[http://www.icir.org/floyd/papers/sync_94.pdf The Synchronization of Periodic Routing Messages], S. Floyd & V. Jacobson,April 1994</ref> that, without slight randomization of the update timer, the timers synchronized over time.
In most current networking environments, RIP is not the preferred choice for [[routing protocol|routing]] as its [[Convergence (routing)#Convergence time|time to converge]] and [[scale (computing)|scalability]] are poor compared to [[Enhanced Interior Gateway Routing Protocol|EIGRP]], [[Open Shortest Path First|OSPF]], or [[IS-IS]] (the latter two being [[link-state routing protocol]]s), 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 [http://www.learningocean.com/view.php?cid=899&protocol=RIP&title=1.%20RIP%20Basic&ctype=1 here] for an animation of basic RIP simulation visualizing RIP configuration and exchanging of Request and Response to discover new routes).
In most current networking environments, RIP is not the preferred choice for [[routing protocol|routing]] as its [[Convergence (routing)#Convergence time|time to converge]] and [[scale (computing)|scalability]] are poor compared to [[Enhanced Interior Gateway Routing Protocol|EIGRP]], [[Open Shortest Path First|OSPF]], or [[IS-IS]] (the latter two being [[link-state routing protocol]]s), 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.


RIP uses the [[User Datagram Protocol]] (UDP) as its transport protocol, and is assigned the reserved [[port number]] 520.<ref name="IANA">{{cite web
RIP uses the [[User Datagram Protocol]] (UDP) as its transport protocol, and is assigned the reserved [[port number]] 520.<ref name="IANA">{{cite web

Revision as of 07:41, 16 October 2013

Internet protocol suite
Application layer
Transport layer
Internet layer
Link layer

The Routing Information Protocol (RIP) is one of the oldest distance-vector routing protocol, which employs the hop count as a routing metric. RIP prevents routing loops by implementing a limit on the number of hops allowed in a path from the source to a destination. The maximum number of hops allowed for RIP is 15. This hop limit, however, also limits the size of networks that RIP can support. A hop count of 16 is considered an infinite distance, in other words the route is considered unreachable.

RIP implements the split horizon, route poisoning and holddown mechanisms to prevent incorrect routing information from being propagated. These are some of the stability features of RIP. It is also possible to use the Routing Information Protocol with Metric-Based Topology (RMTI)[1] algorithm to cope with the count-to-infinity problem. With RMTI, it is possible to detect every possible loop with a very small computation effort.

Originally, each RIP router transmitted full updates every 30 seconds. In the early deployments, routing tables were small enough that the traffic was not significant. As networks grew in size, however, it became evident there could be a massive 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 Floyd and Van Jacobson showed in 1994[2] that, without slight randomization of the update timer, the timers synchronized over time. In most current networking environments, 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 link-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.

RIP uses the User Datagram Protocol (UDP) as its transport protocol, and is assigned the reserved port number 520.[3]

Versions

There are three versions of the Routing Information Protocol: RIPv1, RIPv2, and RIPng.

RIP version 1

The original specification of RIP, defined in RFC 1058,[4] uses classful routing. The periodic routing updates do not carry subnet information, lacking support for variable length subnet masks (VLSM). This limitation makes it impossible to have different-sized subnets inside of the same network class. In other words, all subnets in a network class must have the same size. There is also no support for router authentication, making RIP vulnerable to various attacks.

RIP version 2

Due to the deficiencies of the original RIP specification, RIP version 2 (RIPv2) was developed in 1993[5] and last standardized in 1998.[6] It included the ability to carry subnet information, thus supporting Classless Inter-Domain Routing (CIDR). To maintain backward compatibility, the hop count limit of 15 remained. RIPv2 has facilities to fully interoperate with the earlier specification if all Must Be Zero protocol fields in the RIPv1 messages are properly specified. In addition, a compatibility switch feature[6] allows fine-grained interoperability adjustments.

In an effort to avoid unnecessary load on hosts that do not participate in routing, RIPv2 multicasts the entire routing table to all adjacent routers at the address 224.0.0.9, as opposed to RIPv1 which uses broadcast. Unicast addressing is still allowed for special applications.

(MD5) authentication for RIP was introduced in 1997.[7][8]

RIPv2 is Internet Standard STD56 (which is RFC 2453).

Route tags were also added in RIP version 2. This functionality allows for routes to be distinguished from internal routes to external redistributed routes from EGP protocols..

RIPng

RIPng (RIP next generation), defined in RFC 2080,[9] is an extension of RIPv2 for support of IPv6, the next generation Internet Protocol. The main differences between RIPv2 and RIPng are:

  • Support of IPv6 networking.
  • While RIPv2 supports RIPv1 updates authentication, RIPng does not. IPv6 routers were, at the time, supposed to use IPsec for authentication.
  • RIPv2 allows attaching arbitrary tags to routes, RIPng does not;
  • RIPv2 encodes the next-hop into each route entries, RIPng requires specific encoding of the next hop for a set of route entries.

RIPng sends updates on UDP port 521 using the multicast group FF02::9.

RIPv1 Operation

RIP defines two types of messages.

  1. Request Message
  2. Response Message

When a RIP router comes up, it sends a broadcast Request Message on all of its RIP enabled interfaces. All the neighbouring routers which receive the Request message respond back with the Response Message containing their Routing table. The Response Message is also gratuitously sent when the Update timer expires. On receiving the Routing table, the router processes each entry of the routing table as per the following rules

  1. If there are no route entry matching the one received then the route entry is added to the routing table automatically, along with the information about the router from which it received the routing table
  2. If there are matching entry but the hop count metric is lower than the one already in its routing table, then the routing table is updated with the new route.
  3. If there are matching entry but the hop count metric is higher than the one already in its routing table, then the routing entry is updated with hop count of 16 (infinite hop). The packets are still forwarded to the old route. A Holddown timer is started and all the updates for that from other routers are ignored. If after the Holddown timer expires and still the router is advertising with the same higher hop count then the value is updated into its routing table. Only after the timer expires, the updates from other routers are accepted for that route.

Timers

There are 4 different timers that are used in RIP

  1. Update Timer
  2. Invalid Timer
  3. Flush Timer
  4. Holddown Timer

Update Timer

This timer controls the interval between two gratuitous Response Message. By default the value is 30 seconds. The response message is broadcast to all its RIP enabled interface.

Invalid Timer

This timer specifies how long a routing entry can be in the routing table without being updated. This is also called as expiration Timer. By default, the value is 180 seconds. After the timer expires the hop count of the routing entry will be set to 16, marking the destination as unreachable.

Flush Timer

This timer controls the time between the route is invalidated or marked as unreachable and removal of entry from the routing table. By default the value is 240 seconds. This is 60 seconds longer than Invalid timer. So for 60 seconds the router will be advertising about this unreachable route to all its neighbours. This timer has to be longer than Invalid Timer.

Holddown Timer

This timer is started per route entry, when the hop count is changing from lower value to higher value. This allows the route to get stabilized. During this time no update can be done to that routing entry. This is not part of the RFC 1058. This is Cisco's implementation. The default value of this timer is 180 seconds.

Limitations

  • Without using RMTI, Hop count can not exceed 15, in the case that it exceeds this limitation, it will be considered invalid.
  • Most RIP networks are flat. There is no concept of areas or boundaries in RIP networks.
  • Variable Length Subnet Masks were not supported by RIP version 1.
  • Without using RMTI, RIP has slow convergence and count to infinity problems.

Implementations

  • Cisco IOS, software used in Cisco routers (supports version 1, version 2 and RIPng)
  • Cisco NX-OS software used in Cisco Nexus data center switches (supports RIPv1 and RIPv2)
  • Junos software used in Juniper routers, switches, and firewalls (supports RIPv1 and RIPv2)
  • routed[10] and route6d, included in most BSD Unix systems
  • Routing and Remote Access, a Windows Server feature, contains RIP support
  • Quagga, a free open source routing software suite based on GNU Zebra
  • BIRD, a free open source routing software suite
  • OpenBSD, includes a RIP implementation

Similar protocols

Cisco's proprietary Interior Gateway Routing Protocol (IGRP) was a somewhat more capable protocol than RIP. It belongs to the same basic family of distance-vector routing protocols. Cisco has ceased support and distribution of IGRP in their router software. It was replaced by the Enhanced Interior Gateway Routing Protocol (EIGRP) which is a completely new design. While EIGRP still uses a distance-vector model, it relates to IGRP only in using the same routing metrics. IGRP supports multiple metrics for each route, including bandwidth, delay, load, MTU, and reliability.

See also

References

  1. ^ "RMTI project".
  2. ^ The Synchronization of Periodic Routing Messages, S. Floyd & V. Jacobson,April 1994
  3. ^ "Port Numbers" (plain text). The Internet Assigned Numbers Authority (IANA). 22 May 2008. Retrieved 25 May 2008.
  4. ^ RFC 1058, Routing Information Protocol, C. Hendrik, The Internet Society (June 1988)
  5. ^ RFC 1388, RIP Version 2 - Carrying Additional Information, G. Malkin, The Internet Society (January 1993)
  6. ^ a b RFC 2453, RIP Version 2, G. Malkin, The Internet Society (November 1998)
  7. ^ RFC 2082, RIP-2 MD5 Authentication, F. Baker, R. Atkinson, The Internet Society (January 1997)
  8. ^ RFC 4822, RIPv2 Cryptographic Authentication, R. Atkinson, M. Fanto, The Internet Society (January 2007)
  9. ^ RFC 2080, RIPng for IPv6, G. Malkin, R. Minnear, The Internet Society (January 1997)
  10. ^ Man-page for "routed(8)" on FreeBSD, http://www.freebsd.org/cgi/man.cgi?query=routed&sektion=8


Further reading

  • Malkin, Gary Scott (2000). RIP: An Intra-Domain Routing Protocol. Addison-Wesley Longman. ISBN 0-201-43320-6.
  • Edward A. Taft, Gateway Information Protocol (revised) (Xerox Parc, Palo Alto, May, 1979)
  • Xerox System Integration Standard - Internet Transport Protocols (Xerox, Stamford, 1981)
Retrieved from "https://en.wikipedia.org/enwiki/w/index.php?title=Routing_Information_Protocol&oldid=577396741"