Ch19 Network Layer Logical Addressing
Ch19 Network Layer Logical Addressing
Ch19 Network Layer Logical Addressing
Network Layer:
Logical Addressing
19.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
IPv4 IPv6
IPv4 addresses are 32 bit length. IPv6 addresses are 128 bit length.
Fragmentation is done by sender and forwarding routers. Fragmentation is done only by sender.
Options fields are available in IPv4 header. No option fields, but IPv6 Extension headers are available.
Address Resolution Protocol (ARP) is available to map Address Resolution Protocol (ARP) is replaced with a
IPv4 addresses to MAC addresses. function of Neighbor Discovery Protocol (NDP).
Internet Group Management Protocol (IGMP) is used to IGMP is replaced with Multicast Listener Discovery (MLD)
manage multicast group membership. messages.
IPv6 Advantages:
No more NAT (Network Address Translation)
Auto-configuration
No more private address collisions
Better multicast routing
Simpler header format
Simplified, more efficient routing
Built-in authentication and privacy support
Flexible options and extensions
Easier administration (say good-bye to DHCP)
Large address space.
Enhanced QoS.
Efficient routing
Built in security.
Larger addresses harder to remember.
Transition takes time and is not always smooth.
Not always usable some machines have to be replaced.
19.3
Why IPv6? IPv4 IPv6
IPv6 has improved Security is dependent on applications – IPv4 IPSEC is built into the IPv6 protocol, usable
security features was not designed with security in mind. with a suitable key infrastructure.
IPv4 was designed as a transport and Given the numbers of addresses, scalability and
communications medium, and increasingly any flexibility of IPv6, its potential for triggering
IPv6 encourages work on IPv4 is to find ways around the innovation and assisting collaboration is
19.4
innovation constraints. unbounded.
IPv6 HEADER
19.5
IPv4 HEADER
19.6
19-1 IPv4 ADDRESSES
19.7
Note
19.8
Note
19.9
Note
19.10
Figure 19.1 Dotted-decimal notation and binary notation for an IPv4 address
19.11
Note
19.12
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.13
Example 19.2
Solution
We replace each decimal number with its binary
equivalent (see Appendix B).
19.14
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.15
Note
19.16
Figure 19.2 Finding the classes in binary and dotted-decimal notation
19.17
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.18
Table 19.1 Number of blocks and block size in classful IPv4 addressing
19.19
Note
19.20
Table 19.2 Default masks for classful addressing
19.21
Note
19.22
Example 19.5
19.23
Figure 19.3 A block of 16 addresses granted to a small organization
19.24
Note
19.25
Note
19.26
Example 19.6
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.
19.27
Note
19.28
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.29
Note
19.30
Example 19.8
Solution
The value of n is 28, which means that number
of addresses is 2 32−28 or 16.
19.31
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.32
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.33
Example 19.9 (continued)
19.34
Note
19.35
Figure 19.5 Two levels of hierarchy in an IPv4 address
19.36
Figure 19.6 A frame in a character-oriented protocol
19.37
Note
19.38
Figure 19.7 Configuration and addresses in a subnetted network
19.39
Figure 19.8 Three-level hierarchy in an IPv4 address
19.40
Example 19.10
Solution
Figure 19.9 shows the situation.
Group 1
For this group, each customer needs 256 addresses. This
means that 8 (log2 256) bits are needed to define each
host. The prefix length is then 32 − 8 = 24. The addresses
are
19.42
Example 19.10 (continued)
Group 2
For this group, each customer needs 128 addresses. This
means that 7 (log2 128) bits are needed to define each
host. The prefix length is then 32 − 7 = 25. The addresses
are
19.43
Example 19.10 (continued)
Group 3
For this group, each customer needs 64 addresses. This
means that 6 (log264) bits are needed to each host. The
prefix length is then 32 − 6 = 26. The addresses are
19.45
Table 19.3 Addresses for private networks
19.46
Figure 19.10 A NAT implementation
19.47
Figure 19.11 Addresses in a NAT
19.48
Figure 19.12 NAT address translation
19.49
Table 19.4 Five-column translation table
19.50
Figure 19.13 An ISP and NAT
19.51
19-2 IPv6 ADDRESSES
19.52
Note
19.53
Figure 19.14 IPv6 address in binary and hexadecimal colon notation
19.54
Figure 19.15 Abbreviated IPv6 addresses
19.55
Example 19.11
Solution
We first need to align the left side of the double colon to
the left of the original pattern and the right side of the
double colon to the right of the original pattern to find
how many 0s we need to replace the double colon.
19.56
Table 19.5 Type prefixes for IPv6 addresses
19.57
Table 19.5 Type prefixes for IPv6 addresses (continued)
19.58
Figure 19.16 Prefixes for provider-based unicast address
19.59
Figure 19.17 Multicast address in IPv6
19.60
Figure 19.18 Reserved addresses in IPv6
19.61
Figure 19.19 Local addresses in IPv6
19.62