25.02.2013 Views

TCP/IP Tutorial and Technical Overview - IBM Redbooks

TCP/IP Tutorial and Technical Overview - IBM Redbooks

TCP/IP Tutorial and Technical Overview - IBM Redbooks

SHOW MORE
SHOW LESS

Create successful ePaper yourself

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

5.3.6 R<strong>IP</strong> limitations<br />

There are a number of limitations observed in R<strong>IP</strong> environments:<br />

► Path cost limits: The resolution to the counting to infinity problem enforces a<br />

maximum cost for a network path. This places an upper limit on the maximum<br />

network diameter. Networks requiring paths greater than 15 hops must use<br />

an alternate routing protocol.<br />

► Network-intensive table updates: Periodic broadcasting of the distance vector<br />

table can result in increased utilization of network resources. This can be a<br />

concern in reduced-capacity segments.<br />

► Relatively slow convergence: R<strong>IP</strong>, like other distance vector protocols, is<br />

relatively slow to converge. The algorithms rely on timers to initiate routing<br />

table advertisements.<br />

► No support for variable length subnet masking: Route advertisements in a<br />

R<strong>IP</strong> environment do not include subnet masking information. This makes it<br />

impossible for R<strong>IP</strong> networks to deploy variable length subnet masks.<br />

5.4 Routing Information Protocol Version 2 (R<strong>IP</strong>-2)<br />

The IETF recognizes two versions of R<strong>IP</strong>:<br />

► R<strong>IP</strong> Version 1 (R<strong>IP</strong>-1): This protocol is described in RFC 1058.<br />

► R<strong>IP</strong> Version 2 (R<strong>IP</strong>-2): R<strong>IP</strong>-2 is also a distance vector protocol designed for<br />

use within an AS. It was developed to address the limitations observed in<br />

R<strong>IP</strong>-1. R<strong>IP</strong>-2 is described in RFC 2453. The st<strong>and</strong>ard (STD 56) was<br />

published in late 1994.<br />

In practice, the term R<strong>IP</strong> refers to R<strong>IP</strong>-1. Whenever you encounter the term R<strong>IP</strong><br />

in <strong>TCP</strong>/<strong>IP</strong> literature, it is safe to assume that the reference is to R<strong>IP</strong> Version 1<br />

unless otherwise stated. This same convention is used in this document.<br />

However, when the two versions are being compared, the term R<strong>IP</strong>-1 is used to<br />

avoid confusion.<br />

R<strong>IP</strong>-2 is similar to R<strong>IP</strong>-1. It was developed to extend R<strong>IP</strong>-1 functionality in small<br />

networks. R<strong>IP</strong>-2 provides these additional benefits not available in R<strong>IP</strong>-1:<br />

► Support for CIDR <strong>and</strong> VLSM: R<strong>IP</strong>-2 supports supernetting (that is, CIDR) <strong>and</strong><br />

variable-length subnet masking. This support was the major reason the new<br />

st<strong>and</strong>ard was developed. This enhancement positions the st<strong>and</strong>ard to<br />

accommodate a degree of addressing complexity not supported in R<strong>IP</strong>-1.<br />

Chapter 5. Routing protocols 189

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

Saved successfully!

Ooh no, something went wrong!