IP Addressing

Download as pdf or txt
Download as pdf or txt
You are on page 1of 41

Chapter No 18 – Internet Protocols

Lecture 34-36

Data Communication &


Networking

Compiled By:
Daw ood Univ ersity of Engineering & Technology
Department of Telecommunication Engineering
Saima Khadim
Saima.khadim@@duet.edu.pk
IPv4 ADDRESSES

An IPv4 address is a 32-bit address that uniquely and


universally defines the connection of a device (for
example, a computer or a router) to the Internet.

Topics discussed in this section:


Address Space
Notations
Classful Addressing
Classless Addressing
Note

The address space of IPv4 is


232 or 4,294,967,296.
Note

In classful addressing, the address


space is divided into five classes:
A, B, C, D, and E.
Figure 1 Dotted-decimal notation and binary notation for an IPv4 address
IP Addresses - Class A

◼ start with binary 0


◼ 01111111 (127) reserved for loopback
◼ range 1.x.x.x to 126.x.x.x
◼ all allocated
◼ 00000000.00000000.00000000.00000000
◼ N.H.H.H
IP Addresses - Class B

◼ start with binary 10


◼ range 128.x.x.x to 191.x.x.x
◼ second octet also included in network
address
◼ 214 = 16,384 class B addresses
◼ all allocated
◼ N.N.H.H
IP Addresses - Class C

◼ start with binary 110


◼ range 192.x.x.x to 223.x.x.x
◼ second and third octet also part of
network address
◼ 221 = 2,097,152 addresses
◼ nearly all allocated
◼ N.N.N.H
Class D

◼ Class D is used for multicast addressing


◼ class D address the first octet would
always start with ‘1110’.
◼ Thus, class D addresses range from
224.0.0.0 to 239.255.255.255.
◼ Example: 239.2.2.2
◼ Class D addresses are used by routing
protocols like OSPF, RIP, etc.
Class E

◼ Class E addresses are reserved for


research purposes and future use.
◼ The first octet in a class E address starts
with ‘1111’.
◼ Thus, class E addresses range from
240.0.0.0 to 255.255.255.255.
IPv4 Address Formats
Figure 2 Finding the classes in binary and dotted-decimal notation
Example 1

Change the following IPv4 addresses from binary


notation to dotted-decimal notation.

Solution
We replace each group of 8 bits with its equivalent
decimal number and add dots for separation.
Example 2

Change the following IPv4 addresses from dotted-decimal


notation to binary notation.

Solution
We replace each decimal number with its binary
equivalent.
Example 3

Find the error, if any, in the following IPv4 addresses.

Solution
a. There must be no leading zero (045).
b. There can be no more than four numbers.
c. Each number needs to be less than or equal to 255.
d. A mixture of binary notation and dotted-decimal
notation is not allowed.
Example 4

Find the class of each address.


a. 00000001 00001011 00001011 11101111
b. 11000001 10000011 00011011 11111111
c. 14.23.120.8
d. 252.5.15.111

Solution
a. The first bit is 0. This is a class A address.
b. The first 2 bits are 1; the third bit is 0. This is a class C
address.
c. The first byte is 14; the class is A.
d. The first byte is 252; the class is E.
◼ Given the network address 132.21.0.0, find the
class, the block(network id) and the range of the
addresses.
◼ Given the network address 220.34.76.0, find the class, the
block, and the range of the addresses.
Table 2 Default masks for classful addressing
Note

In classful addressing, a large part of the


available addresses were wasted.
Disadvantage of Classful
Addressing:
1. Class A with a mask of 255.0.0.0 can
support 16, 777, 214 addresses
2. Class B with a mask of 255.255.0.0 can
support 65, 534 addresses
3. Class C with a mask of 255.255.255.0 can
support 254 addresses
◼ But what if someone requires 2000
addresses ?
Disadvantage of Classful
Addressing:
◼ One way to address this situation would
be to provide the person with class B
network. But that would result in a waste
of so many addresses.
Another possible way is to provide
multiple class C networks, but that too can
cause a problem as there would be too
many networks to handle.
◼ To resolve problems like the one
mentioned above CIDR was introduced.
Note

Classful addressing, which is almost


obsolete, is replaced with classless
addressing.
Example 5

Figure 19.3 shows a block of addresses, in both binary


and dotted-decimal notation, granted to a small business
that needs 16 addresses.

We can see that the restrictions are applied to this block.


The addresses are contiguous. The number of addresses
is a power of 2 (16 = 24), and the first address is divisible
by 16.
Figure 3 A block of 16 addresses granted to a small organization
Note

In IPv4 addressing, a block of


addresses can be defined as
x.y.z.t /n
in which x.y.z.t defines one of the
addresses and the /n defines the mask.
Note

The first address in the block can be


found by setting the rightmost
32 − n bits to 0s.
Example 6

A block of addresses is granted to a small organization.


We know that one of the addresses is 205.16.37.39/28.
What is the first address in the block?
11111111.111111111. 111111111. 11110000
Solution
The binary representation of the given address is
11001101 00010000 00100101 00100111
If we set 32−28 rightmost bits to 0, we get
11001101 00010000 00100101 0010000
or
205.16.37.32.
This is actually the block shown in Figure 19.3.
Note

The last address in the block can be


found by setting the rightmost
32 − n bits to 1s.
Example 7

Find the last address for the block in Example 19.6.

Solution
The binary representation of the given address is
11001101 00010000 00100101 00100111
If we set 32 − 28 rightmost bits to 1, we get
11001101 00010000 00100101 00101111
or
205.16.37.47
This is actually the block shown in Figure 19.3.
Note

The number of addresses in the block


can be found by using the formula
232−n.
Example 8

Find the number of addresses in Example 6.

Solution
The value of n is 28, which means that number
of addresses is 2 32−28 or 16.
Example 9

Another way to find the first address, the last address, and
the number of addresses is to represent the mask as a 32-
bit binary (or 8-digit hexadecimal) number. This is
particularly useful when we are writing a program to find
these pieces of information. In Example 19.5 the /28 can
be represented as
11111111 11111111 11111111 11110000
(twenty-eight 1s and four 0s).

Find
a. The first address
b. The last address
c. The number of addresses.
Example 9 (continued)

Solution
a. The first address can be found by ANDing the given
addresses with the mask. ANDing here is done bit by
bit. The result of ANDing 2 bits is 1 if both bits are 1s;
the result is 0 otherwise.
Example 9 (continued)

b. The last address can be found by ORing the given


addresses with the complement of the mask. ORing
here is done bit by bit. The result of ORing 2 bits is 0 if
both bits are 0s; the result is 1 otherwise. The
complement of a number is found by changing each 1
to 0 and each 0 to 1.
Example 9 (continued)

c. The number of addresses can be found by


complementing the mask, interpreting it as a decimal
number, and adding 1 to it.
Figure 4 A network configuration for the block 205.16.37.32/28
Note

The first address in a block is


normally not assigned to any device;
it is used as the network address that
represents the organization
to the rest of the world.

You might also like