Chapter 22
Network Layer:
Delivery, Forwarding,
and Routing
22.1 Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display.
Figure 22.1 Direct and indirect delivery
22.2
22-2 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.
Topics discussed in this section:
Forwarding Techniques
Forwarding Process
Routing Table
22.3
Figure 22.2 Route method versus next-hop method
22.4
Figure 22.3 Host-specific versus network-specific method
22.5
Figure 22.4 Default method
22.6
Figure 22.5 Simplified forwarding module in classless address
22.7
Note
In classless addressing, we need at
least four columns in a routing table.
22.8
Figure 22.7 Address aggregation
22.9
Figure 22.8 Longest mask matching
22.10
Figure 22.10 Common fields in a routing table
22.11
Figure 22.11 Configuration of the server for Example 22.6
22.12
22-3 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 Internet inform each other of
changes.
Topics discussed in this section:
Optimization
Intra- and Interdomain Routing
Distance Vector Routing and RIP
Link State Routing and OSPF
Path Vector Routing and BGP
22.13
Figure 22.13 Popular routing protocols
22.14
Figure 22.14 Distance vector routing tables
22.15
Figure 22.15 Initialization of tables in distance vector routing
22.16
Note
In distance vector routing, each node
shares its routing table with its
immediate neighbors periodically and
when there is a change.
22.17
Figure 22.16 Updating in distance vector routing
22.18
Figure 22.17 Two-node instability
22.19
Figure 22.18 Three-node instability
22.20
Figure 22.20 Concept of link state routing
22.21
Figure 22.21 Link state knowledge
22.22
Figure 22.22 Dijkstra algorithm
22.23
Figure 22.23 Example of formation of shortest path tree
22.24
Table 22.2 Routing table for node A
22.25
22-4 MULTICAST ROUTING PROTOCOLS
In this section, we discuss multicasting and multicast
routing protocols.
Topics discussed in this section:
Unicast, Multicast, and Broadcast
Applications
Multicast Routing
Routing Protocols
22.26
Figure 22.33 Unicasting
22.27
Note
In unicasting, the router forwards the
received packet through
only one of its interfaces.
22.28
Figure 22.34 Multicasting
22.29
Note
In multicasting, the router may
forward the received packet
through several of its interfaces.
22.30
Figure 22.35 Multicasting versus multiple unicasting
22.31