Network Layer

(Delivery, Forwarding, and Routing )

Unit III

By

Arvinda kushwaha

Professor

Department of Data Science

GCET Greater Noida(097)

 Content
Network Layer
Point - to Pont Networks
Routing
Congestion control
Internetworking -TCP / IP, IP
packet
IP address, IPv6.
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
Figure 1 Direct and indirect delivery
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
Figure 2 Route method versus next-hop method
Figure 3 Host-specific versus network-specific method
Figure 4 Default method
Figure 5 Simplified forwarding module in classless address
Note

In classless addressing, we need at

least four columns in a routing table.
 Example 1

Make a routing table for router R1, using the

configuration in Figure 6.

Solution
Table 1 shows the corresponding table.
Figure 6 Configuration for Example 1
Table 1 Routing table for router R1 in Figure 6
 Example 2

Show the forwarding process if a packet arrives at R1 in

Figure 6 with the destination address 180.70.65.140.
Solution
The router performs the following steps:
1. The first mask (/26) is applied to the destination address.
The result is 180.70.65.128, which does not match the
corresponding network address.
2. The second mask (/25) is applied to the destination
address. The result is 180.70.65.128, which matches the
corresponding network address. The next-hop address
and the interface number m0 are passed to ARP for
further processing.
 Example 3

Show the forwarding process if a packet arrives at R1 in

Figure 6 with the destination address 201.4.22.35.

Solution
The router performs the following steps:
1. The first mask (/26) is applied to the destination
address. The result is 201.4.22.0, which does not
match the corresponding network address.
2. The second mask (/25) is applied to the destination
address. The result is 201.4.22.0, which does not
match the corresponding network address (row 2).
 Example 3 (continued)

3. The third mask (/24) is applied to the destination

address. The result is 201.4.22.0, which matches the
corresponding network address. The destination
address of the packet and the interface number m3 are
passed to ARP.
 Example 4

Show the forwarding process if a packet arrives at R1 in

Figure 6 with the destination address 18.24.32.78.

Solution
This time all masks are applied, one by one, to the
destination address, but no matching network address is
found. When it reaches the end of the table, the module
gives the next-hop address 180.70.65.200 and interface
number m2 to ARP. This is probably an outgoing
package that needs to be sent, via the default router, to
someplace else in the Internet.
Figure 7 Address aggregation
Figure 8 Longest mask matching
 Example 5

As an example of hierarchical routing, let us consider

Figure 9. A regional ISP is granted 16,384 addresses
starting from 120.14.64.0. The regional ISP has decided
to divide this block into four subblocks, each with 4096
addresses. Three of these subblocks are assigned to three
local ISPs; the second subblock is reserved for future use.
Note that the mask for each block is /20 because the
original block with mask /18 is divided into 4 blocks.
The first local ISP has divided its assigned subblock into
8 smaller blocks and assigned each to a small ISP. Each
small ISP provides services to 128 households, each using
four addresses.
 Example 5 (continued)

The second local ISP has divided its block into 4 blocks
and has assigned the addresses to four large
organizations.
The third local ISP has divided its block into 16 blocks
and assigned each block to a small organization. Each
small organization has 256 addresses, and the mask is
/24.
There is a sense of hierarchy in this configuration. All
routers in the Internet send a packet with destination
address 120.14.64.0 to 120.14.127.255 to the regional
ISP.
Figure 9 Hierarchical routing with ISPs
Figure 10 Common fields in a routing table
 Example 6

One utility that can be used to find the contents of a

routing table for a host or router is netstat in UNIX or
LINUX. The next slide shows the list of the contents of a
default server. We have used two options, r and n. The
option r indicates that we are interested in the routing
table, and the option n indicates that we are looking for
numeric addresses. Note that this is a routing table for a
host, not a router. Although we discussed the routing table
for a router throughout this lecture, a host also needs a
routing table.
 Example 6 (continued)

The destination column here defines the network address.

The term gateway used by UNIX is synonymous with
router. This column actually defines the address of the next
hop. The value 0.0.0.0 shows that the delivery is direct. The
last entry has a flag of G, which means that the destination
can be reached through a router (default router). The Iface
defines the interface.
 Example 6 (continued)

More information about the IP address and physical

address of the server can be found by using the ifconfig
command on the given interface (eth0).
Figure 11 Configuration of the server for Example 6
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
Figure 12 Autonomous systems
Figure 13 Popular routing protocols
Figure 14 Distance vector routing tables
Figure 15 Initialization of tables in distance vector routing
Note

In distance vector routing, each node

shares its routing table with its
immediate neighbors periodically and
when there is a change.
Figure 16 Updating in distance vector routing
Figure 17 Two-node instability
Figure 18 Three-node instability
Figure 19 Example of a domain using RIP
Figure 20 Concept of link state routing
Figure 21 Link state knowledge
Figure 22 Dijkstra algorithm
Figure 23 Example of formation of shortest path tree
Table 2 Routing table for node A
Figure 24 Areas in an autonomous system
Figure 25 Types of links
Figure 26 Point-to-point link
Figure 27 Transient link
Figure 28 Stub link
Figure 29 Example of an AS and its graphical representation in OSPF
Figure 30 Initial routing tables in path vector routing
Figure 31 Stabilized tables for three autonomous systems
Figure 32 Internal and external BGP sessions
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
Figure 33 Unicasting
Note

In unicasting, the router forwards the

received packet through
only one of its interfaces.
Figure 34 Multicasting
Note

In multicasting, the router may

forward the received packet
through several of its interfaces.
Figure 35 Multicasting versus multiple unicasting
Note

Emulation of multicasting through

multiple unicasting is not efficient
and may create long delays,
particularly with a large group.
Note

In unicast routing, each router in the

domain has a table that defines
a shortest path tree to possible
destinations.
Figure 36 Shortest path tree in unicast routing
Note

In multicast routing, each involved

router needs to construct
a shortest path tree for each group.
Figure 37 Source-based tree approach
Note

In the source-based tree approach, each

router needs to have one shortest path
tree for each group.
Figure 38 Group-shared tree approach
Note

In the group-shared tree approach, only

the core router, which has a shortest
path tree for each group, is involved in
multicasting.
Figure 39 Taxonomy of common multicast protocols
Note

Multicast link state routing uses the

source-based tree approach.
Note

Flooding broadcasts packets, but

creates loops in the systems.
Note

RPF eliminates the loop in the

flooding process.
Figure 40 Reverse path forwarding (RPF)
Figure 41 Problem with RPF
Figure 42 RPF Versus RPB
Note

RPB creates a shortest path broadcast

tree from the source to each destination.
It guarantees that each destination
receives one and only one copy
of the packet.
Figure 43 RPF, RPB, and RPM
Note

RPM adds pruning and grafting to RPB

to create a multicast shortest
path tree that supports dynamic
membership changes.
Figure 44 Group-shared tree with rendezvous router
Figure 45 Sending a multicast packet to the rendezvous router
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.
Note

PIM-DM is used in a dense multicast

environment, such as a LAN.
Note

PIM-DM uses RPF and pruning and

grafting strategies to handle
multicasting.
However, it is independent of the
underlying unicast protocol.
Note

PIM-SM is used in a sparse multicast

environment such as a WAN.
Note

PIM-SM is similar to CBT but uses a

simpler procedure.
Figure 46 Logical tunneling
Figure 47 MBONE