20.01.2014 Views

Lectures notes for 2010 - KTH

Lectures notes for 2010 - KTH

Lectures notes for 2010 - KTH

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.

Routing Tables<br />

• Aggregate IP addresses (i.e., exploit CIDR)<br />

• more specific networks (with longer prefixes)<br />

• less specific networks (with shorter prefixes)<br />

• ⇒ smaller routing tables<br />

• If each routing domain exports (i.e., tells others) only a small set of<br />

prefixes, this makes it easier <strong>for</strong> other routers to send traffic to it<br />

• Un<strong>for</strong>tunately this requires clever address assignments<br />

• Some mechanisms lead to increased fragmentation<br />

• Due to limited availability of addresses long prefixes (particularily /24) are scattered<br />

geographically<br />

• Increasingly sites are connected to multiple ISPs (<strong>for</strong> redundancy) i.e., Multihoming<br />

- thus they have addresses from several different subnetworks<br />

• Current routing tables have ~157,975 entries [7] (of which a large<br />

fraction are /24 prefixes) with a growth rate of “18,000 entries per<br />

year”[8].<br />

There are a limited number of prefixes <strong>for</strong> Class A + B + C networks (2,113,664). If the longest prefixes which a backbone<br />

router had to deal with were /24, then a table with 16,777,216 entries would be sufficient (even without aggregation) - each<br />

entry only needs to store the outgoing port number! This would allow a direct lookup in a memory of ~26Mbytes - with<br />

upto 256 outgoing ports.<br />

Maguire Routing Tables 2: 11 of 52<br />

maguire@kth.se <strong>2010</strong>.03.21 Internetworking/Internetteknik

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

Saved successfully!

Ooh no, something went wrong!