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.

IP datagrams for which <strong>the</strong> local host does not have a route entry in its local routing<br />

table.<br />

Dynamically generated routing tables are usually found on ISs/routers ra<strong>the</strong>r than<br />

end-stations. Dynamic routing tables are created by using a dynamic routing<br />

pro<strong>to</strong>col, and are required when multiple routers and <strong>network</strong> exit points exist in <strong>the</strong><br />

<strong>network</strong>. A dynamic routing pro<strong>to</strong>col enables <strong>the</strong> router <strong>to</strong> build <strong>the</strong> routing table on<br />

its own by communicating with o<strong>the</strong>r routers designated <strong>to</strong> share routing<br />

information with each o<strong>the</strong>r. The routers <strong>the</strong>n have conversations with each o<strong>the</strong>r<br />

about <strong>the</strong> state of <strong>the</strong>ir links, <strong>the</strong>ir type and speed, how long <strong>the</strong>y have been up, and<br />

so on. Each router can use <strong>the</strong> information it has about <strong>the</strong> state of <strong>the</strong> <strong>network</strong> <strong>to</strong><br />

choose <strong>the</strong> best route path. TCP/IP dynamic routing pro<strong>to</strong>cols will be covered in<br />

Chapter 8, "TCP/IP Dynamic Routing Pro<strong>to</strong>cols."<br />

Regardless of how <strong>the</strong> routing table is created, it is imperative that <strong>the</strong> information<br />

in <strong>the</strong> routing table be correct. If a host's or router's routing table has incorrect<br />

information, it will not be able <strong>to</strong> forward datagrams properly and <strong>the</strong>y will not be<br />

delivered.<br />

The actual route table lookup is handled by a process known as a match lookup. The<br />

match lookup compares <strong>the</strong> datagram's <strong>network</strong> destination address <strong>to</strong> those listed<br />

in <strong>the</strong> routing table. This lookup is performed by comparing <strong>the</strong> binary <strong>network</strong><br />

address <strong>to</strong> each <strong>network</strong> address that is in <strong>the</strong> routing table. The destination<br />

<strong>network</strong> address is compared, reading left <strong>to</strong> right, until <strong>the</strong> longest match is found.<br />

Look at <strong>the</strong> two following examples.<br />

In Example 1, <strong>the</strong> router has two interfaces: e1:192.168.3.21 /24 and<br />

s1:147.28.0.1 /30. The destination address of <strong>the</strong> datagram is 12.14.180.220. The<br />

binary routing table looks like this:<br />

Decimal Network Binary Network Address<br />

Address<br />

e1: 192.168.3.0 11000000.10101000.00000011.00000000<br />

s1: 147.28.0.0 10010011.00011100.00000000.00000000<br />

The binary address of <strong>the</strong> destination address looks like this:<br />

Decimal Network Binary Network Address<br />

Address<br />

12.14.180.220 00001100.00001110.10110100.11011100

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

Saved successfully!

Ooh no, something went wrong!