UNIT III ROUTING
Basic Internetworking - Routing –
Unicast Routing – Algorithms -
Protocols – Multicast Routing -
Protocols – IPv4 & IPv6 Addressing -
Transition from IPv4 to IPv6
22-1 DELIVERY
The network layer supervises the handling of the
packets by the underlying physical networks. We
define this handling as the delivery of a packet.
Topics discussed in this section:
Direct Versus Indirect Delivery
22.2
Figure 22.1 Direct and indirect delivery
22.3
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.4
Figure 22.2 Route method versus next-hop method
22.5
Figure 22.3 Host-specific versus network-specific method
22.6
Figure 22.4 Default method
22.7
Figure 22.5 Simplified forwarding module in classless address
22.8
Note
In classless addressing, we need at
least four columns in a routing table.
22.9
Example 22.1
Make a routing table for router R1, using the
configuration in Figure 22.6.
Solution
Table 22.1 shows the corresponding table.
22.10
Figure 22.6 Configuration for Example 22.1
22.11
Table 22.1 Routing table for router R1 in Figure 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.12 Autonomous systems
22.14
Figure 22.13 Popular routing protocols
22.15
Figure 22.14 Distance vector routing tables
22.16
Figure 22.15 Initialization of tables in distance vector routing
22.17
Note
In distance vector routing, each node
shares its routing table with its
immediate neighbors periodically and
when there is a change.
22.18
Figure 22.16 Updating in distance vector routing
22.19
Figure 22.19 Example of a domain using RIP
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
Figure 22.24 Areas in an autonomous system
22.26
Figure 22.25 Types of links
22.27
Figure 22.26 Point-to-point link
22.28
Figure 22.27 Transient link
22.29
Figure 22.28 Stub link
22.30
Figure 22.29 Example of an AS and its graphical representation in OSPF
22.31
Figure 22.30 Initial routing tables in path vector routing
22.32
Figure 22.31 Stabilized tables for three autonomous systems
22.33
Figure 22.32 Internal and external BGP sessions
22.34
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.35
Figure 22.33 Unicasting
22.36
Note
In unicasting, the router forwards the
received packet through
only one of its interfaces.
22.37
Figure 22.34 Multicasting
22.38
Note
In multicasting, the router may
forward the received packet
through several of its interfaces.
22.39
Figure 22.35 Multicasting versus multiple unicasting
22.40
Note
Emulation of multicasting through
multiple unicasting is not efficient
and may create long delays,
particularly with a large group.
22.41
Note
In unicast routing, each router in the
domain has a table that defines
a shortest path tree to possible
destinations.
22.42
Figure 22.36 Shortest path tree in unicast routing
22.43
Note
In multicast routing, each involved
router needs to construct
a shortest path tree for each group.
22.44
Figure 22.37 Source-based tree approach
22.45
Note
In the source-based tree approach, each
router needs to have one shortest path
tree for each group.
22.46
Figure 22.38 Group-shared tree approach
22.47
Note
In the group-shared tree approach, only
the core router, which has a shortest
path tree for each group, is involved in
multicasting.
22.48
Figure 22.39 Taxonomy of common multicast protocols
22.49
Note
Multicast link state routing uses the
source-based tree approach.
22.50
Note
In CBT, the source sends the multicast
packet (encapsulated in a unicast
packet) to the core router. The core
router decapsulates the packet and
forwards it to all interested interfaces.
22.51
Note
PIM-DM is used in a dense multicast
environment, such as a LAN.
22.52
Note
PIM-SM is used in a sparse multicast
environment such as a WAN.
22.53
Note
PIM-SM is similar to CBT but uses a
simpler procedure.
22.54
