CH 19 - Lecture 4 Network Layer - Logical Addressing (Part 1)
CH 19 - Lecture 4 Network Layer - Logical Addressing (Part 1)
CH 19 - Lecture 4 Network Layer - Logical Addressing (Part 1)
Network Layer:
Logical Addressing
19.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
19-1 IPv4 ADDRESSES
19.2
Note
19.3
Figure 19.1 Dotted-decimal notation and binary notation for an IPv4 address
Note
19.4
Example 19.1
Solution
We replace each group of 8 bits with its equivalent
decimal number (see Appendix B) and add dots for
separation.
19.5
Example 19.2
Solution
We replace each decimal number with its binary
equivalent (see Appendix B).
19.6
Example 19.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.
19.7
Note
19.8
Figure 19.2 Finding the classes in binary and dotted-decimal notation
Unicast
Multicast
19.9
Example 19.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.
19.10
Table 19.1 Number of blocks and block size in classful IPv4 addressing
Note
19.11
Table 19.2 Default masks for classful addressing
Note
19.12
Example 19.5
19.13
Figure 19.3 A block of 16 addresses granted to a small organization
19.14
Note
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.16
Note
19.17
Example 19.7
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.18
Note
19.19
Example 19.8
Solution
The value of n is 28, which means that number
of addresses is 2 32−28 or 16.
19.20
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.21
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.22
Example 19.9 (continued)
19.23
Example 19.9 (continued)
19.24
Figure 19.4 A network configuration for the block 205.16.37.32/28
19.25