09.12.2012 Views

Understanding the network.pdf - Back to Home

Understanding the network.pdf - Back to Home

Understanding the network.pdf - Back to Home

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Today, RIP is considered by some <strong>to</strong> be antiquated and ineffective,<br />

particularly RIPv1. Despite this belief, RIP is still common, especially<br />

in old Novell NetWare shops, because IPX uses RIP for route<br />

management. Ano<strong>the</strong>r popular use for RIP is <strong>to</strong> redistribute routing<br />

information from systems that only support RIP in<strong>to</strong> ano<strong>the</strong>r routing<br />

pro<strong>to</strong>col. RIP's real value <strong>to</strong> us is that it illustrates all <strong>the</strong> basic<br />

elements of a dynamic routing pro<strong>to</strong>col.<br />

NOTE<br />

Extended RIP (ERIP) is also available on some platforms. ERIP<br />

extends <strong>the</strong> <strong>network</strong> diameter <strong>to</strong> 128 hops.<br />

RIP uses only one metric <strong>to</strong> determine <strong>the</strong> best route: hop count. The<br />

term hop refers <strong>to</strong> <strong>the</strong> unit of distance between forwarding points,<br />

such as end-stations or routers. Corresponding <strong>to</strong> RIP's limited<br />

<strong>network</strong> <strong>to</strong>pology, RIP supports hop counts with a range from 1<br />

(directly connected) <strong>to</strong> 16 (unreachable <strong>network</strong>). This distance<br />

limitation constrains RIP's usage in large enterprise <strong>network</strong>s. But,<br />

RIP was not designed and should not be used <strong>to</strong> manage routing in an<br />

enterprise. RIP was designed <strong>to</strong> be used in <strong>network</strong>s of limited size<br />

using similar Layer 2 transport, which means that it does work well in<br />

small LAN <strong>network</strong>s.<br />

RIP is a distance vec<strong>to</strong>r pro<strong>to</strong>col, based on <strong>the</strong> vec<strong>to</strong>r distance<br />

algorithm (described in <strong>the</strong> "Distance Vec<strong>to</strong>r Pro<strong>to</strong>cols" section earlier<br />

in <strong>the</strong> chapter). Distance vec<strong>to</strong>r messages are sent as value pairs. The<br />

first value is <strong>the</strong> vec<strong>to</strong>r or destination. The second value is <strong>the</strong><br />

distance or hop count. After <strong>the</strong> router comes online, it builds its local<br />

routing table and <strong>the</strong>n joins <strong>the</strong> RIP process by sending a RIP message<br />

with <strong>the</strong> request command flag set. The router listens for responses<br />

from <strong>the</strong> o<strong>the</strong>r directly connected routers, which contain <strong>the</strong> o<strong>the</strong>r<br />

routers'routing tables.<br />

Using <strong>the</strong> example shown in Figure 8.7, Router E's initial routing table<br />

would look like what is shown in Table 8.4.

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

Saved successfully!

Ooh no, something went wrong!