Professional Documents
Culture Documents
Network Layer:
IPv4
Delivery, Forwarding,
and Routing
10.1
10-1 NETWORK LAYER
The network layer responsible for the source to destination delivery of a packet, possibly
Network layer adds a header that the logical address of the sender and receiver to the packet.
IPv4
IPv6
10.2
10-1 NETWORK LAYER
10.3
10-1 NETWORK LAYER
10.4
10-1 NETWORK LAYER
10.5
10-1 NETWORK LAYER
10.6
10-2 CLASSFUL ADDRESSING
10.7
10-2 CLASSFUL ADDRESSING
10.8
10-2 CLASSFUL ADDRESSING
10.9
10-2 CLASSES AND MASK
10.10
10-2 CLASSLESS ADDRESSING
10.11
10-2 CLASSLESS ADDRESSING
Example 16.9
A block of addresses is granted to a small organization. We know that one of the addresses is
205.16.37.39/28
10.12
10-2 CLASSLESS ADDRESSING
Solution
or 205.16.37.32
or 205.16.37.47
10.13
10-2 CLASSLESS ADDRESSING
Example 19.9
A block of addresses is granted to a small organization. We know that one of the addresses is
205.16.37.39/26
10.14
10-2 CLASSLESS ADDRESSING
10.15
10-3 DELIVERY
The network layer supervises the handling of the packets by the underlying physical networks.
10.16
Figure 10.1 Direct and indirect delivery
10.17
10-4 FORWARDING
Forwarding means to place the packet in its route to its destination. Forwarding requires a
host or a router to have a routing table. When a host has a packet to send or when a router
has received a packet to be forwarded, it looks at this table to find the route to the final
destination.
Forwarding Techniques
Forwarding Process
Routing Table
10.18
Figure 10.2 Route method versus next-hop method
10.19
Figure 10.3 Host-specific versus network-specific method
10.20
Figure 10.4 Default method
10.21
Figure 10.5 Simplified forwarding module in classless address
10.22
10-5 UNICAST ROUTING PROTOCOLS
A routing table can be either static or dynamic. A static table is one with manual entries. A
dynamic table is one that is updated automatically when there is a change somewhere in the
Internet. A routing protocol is a combination of rules and procedures that lets routers in the
Optimization
10.23
Figure 10.12 Autonomous systems
10.24
Figure 10.13 Popular routing protocols
10.25
Figure 10.14 Distance vector routing tables
10.26
Figure 10.15 Initialization of tables in distance vector routing
10.27
Note
In distance vector routing, each node shares its routing table with its
10.28
Figure 10.16 Updating in distance vector routing
10.29
Figure 10.20 Concept of link state routing
10.30
Figure 10.21 Link state knowledge
10.31
Figure 10.10 Dijkstra algorithm
10.32
Figure 10.23 Example of formation of shortest path tree
10.33
Table 10.2 Routing table for node A
10.34
Figure 10.30 Initial routing tables in path vector routing
10.35
Figure 10.31 Stabilized tables for three autonomous systems
10.36
10-5 MULTICAST ROUTING PROTOCOLS
Applications
Multicast Routing
Routing Protocols
10.37
Figure 10.33 Unicasting
10.38
Note
10.39
Figure 10.34 Multicasting
10.40