Course – Data Communication

Unit-6
The Network Layer

Mr. Bhushan B. Shaharkar

(bbshaharkar@witsolapur.org)
Assistant Professor,
Information Technology

Walchand Institute of Technology, Solapur.

www.witsolapur.org)

Walchand Institute of Technology, Solapur 1

 Network Layer Design Issues
•Store-and-forward packet switching
•Services provided to transport layer
•Implementation of connectionless service
•Implementation of connection-oriented service

•Comparison of virtual-circuit and datagram

networks

Walchand Institute of Technology, Solapur 2

Store-and-Forward Packet Switching

Fig-1 The environment of the network layer protocols.

Walchand Institute of Technology, Solapur 3

Services Provided to the Transport Layer
1.Services independent of router technology.
2.Transport layer shielded from number, type,
topology of routers.

3.Network addresses available to transport

layer use uniform numbering plan,even across
LANs and WANs

Walchand Institute of Technology, Solapur 4

Implementation of Connectionless Service

A’s table (initially) A’s table (later) C’s Table E’s Table

Fig-2 Routing within a datagram network

Walchand Institute of Technology, Solapur 5

Implementation of Connection-Oriented Service

A’s table C’s Table E’s Table

Fig-3 Routing within a virtual-circuit network

Walchand Institute of Technology, Solapur 6

Comparison of Virtual-Circuit and Datagram Networks

Table-1 Comparison of datagram and virtual-circuit networks

Walchand Institute of Technology, Solapur 7

 Routing Algorithms (1)
•Optimality principle
•Shortest path algorithm
•Flooding
•Distance vector routing
•Link state routing
•Routing in ad hoc networks

Walchand Institute of Technology, Solapur 8

 Routing Algorithms (2)

• Broadcast routing
• Multicast routing
• Anycast routing
• Routing for mobile hosts
• Routing in ad hoc networks

Walchand Institute of Technology, Solapur 9

 Fairness vs. Efficiency

Fig-5 Network with a conflict between fairness and efficiency.

Walchand Institute of Technology, Solapur 10

 The Optimality Principle

Fig-6 (a) A network. (b) A sink tree for router B.

Walchand Institute of Technology, Solapur 11

 Shortest Path Algorithm (1)

The first five steps used in computing the shortest path from A to D. The arrows indicate the working node

Walchand Institute of Technology, Solapur 12

 Shortest Path Algorithm (2)

Dijkstra’s algorithm to compute the shortest path through a graph.

Walchand Institute of Technology, Solapur 13

 Shortest Path Algorithm (2)

Dijkstra’s algorithm to compute the shortest path through a graph.

Walchand Institute of Technology, Solapur 14

 Shortest Path Algorithm (2)

Dijkstra’s algorithm to compute the shortest path through a graph.

Walchand Institute of Technology, Solapur 15

 Flooding

Walchand Institute of Technology, Solapur 16

Distance Vector Routing

(a) A network.
(b) Input from A, I, H, K, and the new routing table for J.

Walchand Institute of Technology, Solapur 17

The Count-to-Infinity Problem

The count-to-infinity problem

Walchand Institute of Technology, Solapur 18

 Link State Routing

1.Discover neighbors, learn network addresses.

2.Set distance/cost metric to each neighbor.
3.Construct packet telling all learned.
4.Send packet to, receive packets from other routers.
5.Compute shortest path to every other router.

Walchand Institute of Technology, Solapur 19

Learning about the Neighbors

Nine routers and a broadcast LAN.

Walchand Institute of Technology, Solapur 20

Learning about the Neighbors

A graph model of previous slide.

Walchand Institute of Technology, Solapur 21

 Building Link State Packets

(a) A network. (b) The link state packets for this network.

Walchand Institute of Technology, Solapur 22

Distributing the Link State Packets

The packet buffer for router B in previous slide

Walchand Institute of Technology, Solapur 23

Hierarchical Routing

Hierarchical routing.
Walchand Institute of Technology, Solapur 24
 Congestion Control Algorithms (1)

•Approaches to congestion control

•Traffic-aware routing
•Admission control
•Traffic throttling
•Load shedding

Hierarchical routing.
Walchand Institute of Technology, Solapur 25
 Congestion Control Algorithms (1)

When too much traffic is offered, congestion sets in and

performance degrades sharply.
Walchand Institute of Technology, Solapur 26
Approaches to Congestion Control

Walchand Institute of Technology, Solapur 27

Traffic-Aware Routing

Walchand Institute of Technology, Solapur 28

 Traffic Throttling

(a) A congested network. (b) The portion of the network that is

not congested. A virtual circuit from A to B is also shown.

Walchand Institute of Technology, Solapur 29

 Traffic Throttling

Explicit congestion notification

Walchand Institute of Technology, Solapur 30

 Traffic Throttling

A choke packet that affects only the source..

Walchand Institute of Technology, Solapur 31

 Traffic Throttling

A choke packet that affects each hop it passes through.

Walchand Institute of Technology, Solapur 32

Load Shedding

Walchand Institute of Technology, Solapur 33

 Internetworking

•How networks differ

•How networks can be connected
•Tunneling
•Internetwork routing
•Packet fragmentation

Walchand Institute of Technology, Solapur 34

 How Networks Differ

Some of the many ways networks can differ

Walchand Institute of Technology, Solapur 35

 How Networks Can Be Connected

(a)A packet crossing different networks.

(b)Network and link layer protocol processing.

Walchand Institute of Technology, Solapur 36

 Tunneling

Tunneling a packet from Paris to London.

Walchand Institute of Technology, Solapur 37

 Tunneling

Tunneling a car from France to England

Walchand Institute of Technology, Solapur 38

 Packet Fragmentation
Packet size issues:

1.Hardware
2.Operating system
3.Protocols
4.Compliance with (inter)national standard.
5.Reduce error-induced retransmissions
6.Prevent packet occupying channel too long.

Walchand Institute of Technology, Solapur 39

 Packet Fragmentation

(a)Transparent fragmentation.
(b)Nontransparent fragmentation
Walchand Institute of Technology, Solapur 40
 Packet Fragmentation

Fragmentation when the elementary data size is 1 byte.

(a) Original packet, containing 10 data bytes.

Walchand Institute of Technology, Solapur 41

 Packet Fragmentation

Fragmentation when the elementary data size is 1 byte

(b) Fragments after passing through a network
with maximum packet size of 8 payload bytes plus header.

Walchand Institute of Technology, Solapur 42

 Packet Fragmentation

Fragmentation when the elementary data size is 1 byte

(c) Fragments after passing through a size 5 gateway.

Walchand Institute of Technology, Solapur 43

Packet Fragmentation

Path MTU Discovery

Walchand Institute of Technology, Solapur 44

 Reference

• Computer Networks by Andrew S Tanenbaum 3rd

edition PHI Publication

Walchand Institute of Technology, Solapur 45