Network Layer: Logical

Addressing
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.

• They are unique in the sense that each address

defines one, and only one, connection to the
Internet.

• The IPv4 addresses are universal in the sense

that the addressing system must be accepted by
any host that wants to be connected to the
Internet.

19.2
IPv4 Address
The IPv4 addresses are unique and
universal.
An IPv4 address is 32 bits long.
◦ The address space of IPv4 is 232
(4,294,967,296)
◦ Notation.
 Binary notation
 Dotted-decimal notation

19.3
Example 19.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 (see Appendix B) and add dots for
separation.

19.4
Example 19.2

Change the following IPv4 addresses from dotted-

decimal notation to binary notation.

Solution
We replace each decimal number with its binary
equivalent (see Appendix B).

19.5
Example 19.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. 19.6
Classful Addressing
In classful addressing, the address
space is divided into five classes:
A, B, C, D, and E.
Each of the IP address belongs to a
particular class that's why they are
classful addresses.

19.7
Example 19.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.
19.8
Classes and Blocks
The classful addressing wastes a large
part of the address space.
◦ Class A:
◦ Class B:
◦ Class C:
◦ Class D:

19.9
A block in class A address is too large for almost any organization. This

means most of the addresses in class A were wasted and were not

used.

• A block in class B is also very large, probably too large for many of the

organizations that received a class B block.

• A block in class C is probably too small for many organizations.

• Class D addresses were designed for multicasting.

19.10
Structure of IPv4 Address
Consists of Net ID and Host ID.

Mask(Default Mask)
◦ 32-bit number of contiguous 1’s
followed by contiguous 0’s.
◦ To help to find the net ID and the host
ID.
19.12
Use of IPv4 Address
Subnetting
◦ Divide a large address block into several
smaller contiguous groups known as subnets.
◦ Use of flexible net mask as it increase no of 1
in mask.
Supernetting
◦ Several networks are combined to create a
supernetwork or supernet.
◦ To combine several contiguous address
spaces into a larger single address space.
◦ For example, an organization that needs
1000 addresses can be granted four
contiguous class C blocks as one
supernetwork.

19.13
Classless Addressing(CIDR)
 To overcome address depletion and give more
organizations access to the Internet, classless
addressing was designed and implemented.
 In classless addressing, when an entity, small
or large, needs to be connected to the
Internet, it is granted a block of addresses.
 The size of the block varies based on the
nature and size of the entity.
 For example, a household may be given only
two addresses; a large organization may be
given thousands of addresses.
 An ISP, as the Internet service provider, may
be given thousands or hundreds of thousands
based on the number of customers it may
serve.
19.14
Restriction
• The addresses in a block must be contiguous.
• The number of addresses in a block must be a power of 2.
• The first address must be evenly divisible by the number of address.

Mask
•Consists of n consecutive 1’s followed by zeros.
•n can be any number b/w 0 and 32.
Tips:

•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.
•The first address in the block can be found by setting the rightmost 32 − n bits to 0s.
19.15
Example 19.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. The first address, when
converted to a decimal number, is 3,440,387,360,
which when divided by 16 results in 215,024,210.

19.17
Figure 19.3 A block of 16 addresses granted to a small organization

19.18
Example 19.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?

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 00100000
or
205.16.37.32.
This is actually the block shown in Figure 19.3.
19.19
Example 19.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.

19.20
Example 19.8

Find the number of addresses in Example 19.6.

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

19.21
Example 19.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.

19.22
Example 19.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.

19.23
Example 19.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.

19.24
Example 19.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.

19.25
19.27
19.28
19.29
19.30
19.31
19.32
19.33