Scribd
Upload
74 views10 pages

,'5&ODVVOHVV, Qwhugrpdlq5Rxwlqj: 6Xudvdn6Dqjxdqsrqj QJXDQ#NXDFWK Kwwszzzfshnxdfwkaqjxdq

This document discusses the problems of classful IP address allocation and the solutions provided by Classless Inter-Domain Routing (CIDR). It describes how CIDR addresses the issues of exhaustion of class B addresses and rapid growth of routing tables by allowing multiple class C addresses to be summarized into a single routing entry through supernetting. This reduces the number of entries required in routing tables. The document provides examples to illustrate how CIDR and supernetting work to optimize IP address usage and routing efficiency.

Uploaded by

PavithraRam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
74 views10 pages

,'5&ODVVOHVV, Qwhugrpdlq5Rxwlqj: 6Xudvdn6Dqjxdqsrqj QJXDQ#NXDFWK Kwwszzzfshnxdfwkaqjxdq

This document discusses the problems of classful IP address allocation and the solutions provided by Classless Inter-Domain Routing (CIDR). It describes how CIDR addresses the issues of exhaustion of class B addresses and rapid growth of routing tables by allowing multiple class C addresses to be summarized into a single routing entry through supernetting. This reduces the number of entries required in routing tables. The document provides examples to illustrate how CIDR and supernetting work to optimize IP address usage and routing efficiency.

Uploaded by

PavithraRam
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 10

Applied Network Research Group Department of Computer Engineering, Kasetsart University

1/10
CIDR: CIassIess
Interdomain Routing
Surasak Sanguanpong
nguanku.ac.th
http.//www.cpe.ku.ac.th/~nguan
Last updated: May 24, 1999
Applied Network Research Group Department of Computer Engineering, Kasetsart University
2/10
Address aIIocation probIem
Exhaustion of the cIass B network address space.
The Iack of a network cIass of a size which is appropriate for
mid-sizes organization;
cIass C, with a max of 254 hosts, is too smaII,
whiIe cIass B, with a max of 65534 hosts, is too Iarge.
AIIocate bIocks of cIass C instead and downside is more
routes entry in routing tabIe
1) requires fewer than 256 addresses 1 cIass C network
2) requires fewer than 512 addresses 2 contiguous cIass C networks
3) requires fewer than 1024 addresses 4 contiguous cIass C networks
4) requires fewer than 2048 addresses 8 contiguous cIass C networks
5) requires fewer than 4096 addresses 16 contiguous cIass C networks
6) requires fewer than 8192 addresses 32 contiguous cIass C networks
7) requires fewer than 16384 addresses 64 contiguous cIass C networks
Applied Network Research Group Department of Computer Engineering, Kasetsart University
3/10
Routing TabIe probIems
Issue muItipIe (bIock) cIass C addresses (instead singIe cIass
B address) soIves a running out of cIass B address but...
Introduces a probIem of routing tabIe
By defauIt, a routing tabIe contains an entry for every network
How Iarge a routing tabIe shouId be for aII CIass C networks?
Growth of routing tabIe in the Internet routers beyond the
abiIity of current software and hardware to manage
Applied Network Research Group Department of Computer Engineering, Kasetsart University
4/10
How to SoIve
TopoIogicaI aIIocate IP address assignment
We divide the worId into 8 regions Iike this : (RFC1466)
MuIti-regionaI
Europe
Others
North America
CentraI/South America
Pacific Rim
Others
Others
IANA reserved
192.0.0.0 - 193.255.255.255
194.0.0.0 - 195.255.255.255
196.0.0.0 - 197.255.255.255
198.0.0.0 - 199.255.255.255
200.0.0.0 - 201.255.255.255
202.0.0.0 - 203.255.255.255
204.0.0.0 - 205.255.255.255
206.0.0.0 - 207.255.255.255
208.0.0.0 - 223.255.255.255
Applied Network Research Group Department of Computer Engineering, Kasetsart University
5/10
CIassIess Interdomain Routing
CIass C address's concept becomes meaningIess on these
route between 'domains', the technique is caIIed CIassIess
Interdomain Routing or CIDR (pronounce cider)
Key concept is to aIIocate muItipIe IP addresses in the way
that aIIow summarization into a smaIIer number of routing
tabIe (route aggregate)
CIDR is supported by BGP4 and based on route aggregation
e.g 16 cIass C addresses can be summarized to a singIe routing
entry (router can hoId a singIe route entry for the main trunks
between these areas
Applied Network Research Group Department of Computer Engineering, Kasetsart University
6/10
Supernetting
CIDR is aIso caIIed Supernetting in contrast to subnetting
an organization has been aIIocated a bIock of cIass C
addresses in 2
n
with contiguous address space
archive by using bits which beIongs to the network address as
host bits
cIass C exampIe : aItering the defauIt cIass C subnet mask such
that some bit change from 1 to 0
11111111 11111111 11111100 00000000
(Super) netmask
4 class C networks appear
to networks outside as
a single network
255.255.252.0
Applied Network Research Group Department of Computer Engineering, Kasetsart University
7/10
Supernetting SampIe
an organization with 4 cIass C
190.0.32.0, 190.0.33.0, 190.0.34.0 190.0.35.0
11111111 11111111 11111100 00000000 mask = 255.255.255.252.0
11000010 00000000 00100000 00000000 net = 190.0.32.0
11000010 00000000 00100001 00000000 net = 190.0.33.0
11000010 00000000 00100010 00000000 net = 190.0.34.0
11000010 00000000 00100011 00000000 net = 190.0.35.0
Bit wise AND resuIts 190.0.32.0
This organization's network has changed from 4 net to a single net
with 1022 hosts
Applied Network Research Group Department of Computer Engineering, Kasetsart University
8/10
Supernetting SampIe, cont.
org#1 192.0.0.X - 192.0.127.X 255.255.0.0 (128 nets)
org#1 192.0.128.X - 192.0.255.X 255.255.128.0 (128 nets)
datagrams 192.0.5.1 & 255.255.0.0 = 192.0.0.0 => org#1
datagrams 192.0.5.1 & 255.255.128.0 = 192.0.0.0 not match org#2
Applied Network Research Group Department of Computer Engineering, Kasetsart University
9/10
The Longest Match Supernetting
Europe has 194.0.0.0 - 195.255.255.255 with mask 254.0.0.0
A case of one organization (195.0.16.0-195.0.36.0 mask
255.255.254.0) needs different routing entry
datagrams 195.0.20.1 matches both Europe's and this
organization. How to do?
Routing mechanism seIects the Iongest mask (255.255.254.0 is
Ionger than 254.0.0.0), then route to the organization
Applied Network Research Group Department of Computer Engineering, Kasetsart University
10/10
Summary
routing decisions are now made based on masking
operations of the entire 32 bit address, hence the term
"cIasses"
No existing routes is changed
CIDR sIows down the growth of routing tabIes (current ~
50K entries in core routers)
Short term soIution to soIve routing probIem
Iimitation : not aII host/router software aIIows supernet
mask

You might also like