IP Addressing
IP Addressing
IP Addressing
Lecture 34-36
Compiled By:
Daw ood Univ ersity of Engineering & Technology
Department of Telecommunication Engineering
Saima Khadim
Saima.khadim@@duet.edu.pk
IPv4 ADDRESSES
Solution
We replace each group of 8 bits with its equivalent
decimal number and add dots for separation.
Example 2
Solution
We replace each decimal number with its binary
equivalent.
Example 3
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
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
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
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)