28.06.2014 Views

Discussion

Discussion

Discussion

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

Chapter<br />

CHAPTER<br />

10<br />

10<br />

RIP 10<br />

10.0 Introduction<br />

The Routing Information Protocol (RIP) is an interior gateway protocol (IGP) that<br />

was developed as part of the ARPANET project and was included in the Unix BSD<br />

operating system in the early 1980s. RIP was widely deployed in the 1980s and<br />

became the industry standard for interior routing. It was standardized by the IETF in<br />

1988, in RFC 1058. This version is referred to as RIP Version 1. RIP Version 2,<br />

defined in RFC 2453, added support for Classless Interdomain Routing (CIDR) and<br />

authentication. RIP Version 2 MD5 authentication is defined in RFC 2082. RFCs<br />

2080 and 2081 define RIPng, which is designed for IPv6 networks. JUNOS software<br />

supports RIP Versions 1 and 2, and RIPng.<br />

RIP is a relatively simple protocol. It uses a distance-vector algorithm (also called the<br />

Bellman-Ford algorithm) to determine the best route to a destination. The distance is<br />

measured in hops, which is the number of routers that a packet must pass through to<br />

reach the destination. The best route is the one with the shortest number of hops. In<br />

the routing table, the router maintains two basic pieces of information for RIP<br />

routes: the IP address of the destination network or host and the hop count (metric)<br />

to that destination.<br />

Every 30 seconds, devices on a RIP network broadcast RIP route information, which<br />

describes their view of the network topology and generates a lot of traffic on the network.<br />

RIP uses two techniques to reduce the amount of traffic:<br />

Split horizon<br />

A device receives a route advertisement on an interface but does not retransmit<br />

that advertisement back on the same interface. This limits the amount of RIP<br />

traffic by eliminating information that its RIP neighbor has already learned.<br />

Poison reverse<br />

If a RIP device learns from an interface that a device is no longer connected or<br />

reachable, it advertises that device’s route back on the same interface, setting the<br />

number of hops to 16, which means infinite or unreachable. Poison reverse<br />

improves the convergence time on a RIP network.<br />

332<br />

This is the Title of the Book, eMatter Edition<br />

Copyright © 2008 O’Reilly & Associates, Inc. All rights reserved.

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!