NETWORK LAYER

PROTOCOLS
 NETWORK LAYER
PROTOCOLS
Network Layer is responsible for the

transmission of data or communication

from one host to another host connected

in a network.
 Functions of Network Layer
• Logical Addressing
• Host-to-host Delivery of Data
• Fragmentation
• Congestion Control
• Routing and Forwarding
Network Layer Protocols
 IPfor(Internet
• IP stands Protocol)
Internet Protocol. Internet
Protocol helps to uniquely identify each device
on the network.
• Internet protocol is responsible for transferring
the data from one node to another node in the
network.
• Internet protocol is a connectionless protocol
therefore it does not guarantee the delivery of
data.
 IPv4
• IPv4 provides with the 32 bit address scheme.

• IPv4 addressing has four numeric fields and are

separated by dot.
 IPv4
• IPv4 can be configured either using DHCP or
manually.
• IPv4 is further divided into five classes as
Class A, Class B, Class C, Class D and Class
E.
 Characteristics of IPv4
• 32-bit address length

• Dot-decimal notation

• Checksum fields

• Fragmentation

• Network Address Translation (NAT)

 IPv6
• IPv6 is the most recent version of IP.
• If provided with a 128 bit addressing scheme.
• IP address has eight fields that are separated by
colon, and these fields are alphanumeric.
 IPv6
• To switch from IPv4 to IPv6, there are several

strategies

1. Dual Stacking

2. Tunneling

3. Network Address Translation (NAT)

 IPv4 to IPv6

• Dual Stacking : Devices can use both IPv4

and IPv6 at the same time. This way, they can

talk to networks and devices using either

version.
 IPv4 to IPv6

• Tunneling : This method allows IPv6 users to

send data through an IPv4 network to reach

other IPv6 users. Think of it as creating a

“tunnel” for IPv6 traffic through the older IPv4

system.
 IPv4 to IPv6

• Network Address Translation (NAT) : NAT

helps devices using different versions of IP

addresses (IPv4 and IPv6) to communicate

with each other by translating the addresses so

they understand each other.

 Characteristics
• IPv6 uses of IPv6
128-bit addresses, offering a much
larger address space than IPv4’s 32-bit system.
• IPv6 addresses use a combination of numbers
and letters separated by colons, allowing for
more unique addresses.
• The IPv6 header has fewer fields, making it
more efficient for routers to process.
• IPv6 supports Unicast, Multicast, and Anycast,
but no Broadcast, reducing network traffic.
 IP PROTOCOLS
• ARP (Address Resolution Protocol)

• RARP(Reverse Address Resolution

Protocol)
ARP - Address Resolution Protocol.
• ARP is used to convert the logical address ie.
IP address into physical address ie. MAC
address.
• While communicating with other nodes, it is
necessary to know the MAC address or
physical address of the destination node.
 Types
• Static Entry
of ARP Entries
• Dynamic Entry
 How Does ARP Work?
• The host broadcasts an ARP inquiry packet
containing the IP address over the network in
order to find out the physical address of
another computer on its network.
• The ARP packet is received and processed by
all hosts on the network; however, only the
intended recipient can identify the IP address
and reply with the physical address.
How Does ARP Work?
 RARP stands for Reverse Address
• It is used Resolution
to convert MACProtocol.
address ie. physical
address into IP address ie. logical address.
• RARP provides with a feature for the systems
and applications to get their own IP address
from a DNS( Domain Name System) or
router.
 How Does RARP Work?
• Data is sent between two places in a network
using the RARP, which is on the Network
Access Layer.
• Every user on the network has two distinct
addresses: their MAC (physical) address and
their IP (logical) address.
• Software assigns the IP address, and the
hardware then builds the MAC address into the
device.
RARP
 ICMP
• CMP stands for Internet Control Message
Protocol.
• ICMP is a part of IP protocol suite.
• ICMP is an error reporting and network
diagnostic protocol.
• Feedback in the network is reported to the
designated host.
 ICMP are divided into two types.
• Error Message: Error message states about the
issues or problems that are faced by the host or
routers during processing of IP packet.

• Query Message: Query messages are used by

the host in order to get information from a
router or another host.
 How
• The main andDoes ICMP protocol
most significant Work?in the
IP suite is called ICMP.
• However, unlike TCP and UDP, ICMP is a
connectionless protocol, meaning it doesn't
require a connection to be established with the
target device in order to transmit a message.
 How
• TCP and Does
ICMP ICMP
operate Work?
differently from one
another;
• TCP is a connection-oriented protocol, while
ICMP operates without a connection.
• Every time a connection is made prior to a
message being sent, a TCP Handshake is
required of both devices.
How Does ICMP Work?
 How Does ICMP Work?
• Datagrams including an IP header containing
ICMP data are used to transmit ICMP packets.
• IGMP is a multicasting communication
IGMP stands for Internet Group
protocol.
Message Protocol.
• It utilizes the resources efficiently while
broadcasting the messages and data packets.
• IGMP is also a protocol used by TCP/IP.
• Other hosts connected in the network and
routers makes use of IGMP for multicasting
communication that have IP networks.
 How
• Devices Does
that can IGMP
support Work?
dynamic multicasting
and multicast groups can use IGMP.
• The host has the ability to join or exit the
multicast group using these devices.
• It is also possible to add and remove customers
from the group using these devices.
• The host and local multicast router use this
communication protocol.
 Mobile Internet Protocol (or Mobile
• Mobile IP is a communication protocol (created
IP)
by extending Internet Protocol, IP) that allows
users to move from one network to another with
the same IP address.
• It ensures that the communication will continue
without the user’s sessions or connections being
dropped.
 Basic Terminologies Related to
Mobile IP
• A Mobile Node (MN)
• A Home Network
• Home Agent (HA)
• Home Address
• Foreign Network
• A Foreign Agent (FA)
 Key Mechanisms in Mobile IP

• Agent Discovery

• Agent Registration

• Tunneling
• Route
The routeOptimization
optimization adds ain Mobiledata
conceptual IP
structure, the binding cache, to the
correspondent node.
• The binding cache contains bindings for the
mobile node’s home address and its current
care-of-address.
MOBILE IP TOPOLOGY
 Process of Mobile IP
1. Agent Discovery
2. Registration
3. Tunneling
 Unicast Routing Algorithms

• Unicast means the transmission from a single

sender to a single receiver.
• It is a point-to-point communication between
the sender and receiver.
• There are various unicast protocols such as
TCP, HTTP, etc.
 Unicast Routing Algorithms
• TCP is the most commonly used unicast protocol.

It is a connection-oriented protocol that relies on

acknowledgment from the receiver side.

• HTTP stands for HyperText Transfer Protocol.

• It is an object-oriented protocol for

communication.
Unicast Routing Algorithms
 Unicast Routing Algorithms
• Major Protocols of Unicast Routing
1. Distance Vector Routing

2. Link-State Routing

3. Path-Vector Routing
 Unicast Routing Algorithms
• Distance Vector Routing: Distance-Vector
routers use a distributed algorithm to compute
their routing tables.

• Link-State Routing: Link-State routing uses

link-state routers to exchange messages that
allow each router to learn the entire network
topology.
 Unicast Routing Algorithms
• Path-Vector Routing: It is a routing protocol
that maintains the path that is updated
dynamically.
 Link State Routing
• Link state routing is the second family of
routing protocols.
• While distance-vector routers use a distributed
algorithm to compute their routing tables.
• Link-state routing uses link-state routers to
exchange messages that allow each router to
learn the entire network topology.
 Link State Routing
• Link state routing is a technique in which each
router shares the knowledge of its
neighborhood with every other router i.e. the
internet work.
 Three keys to understand the link
state routing algorithm
1 Knowledge about the neighborhood
Instead of sending its routing table, a router
sends the information about its neighborhood
only.
2. Flooding: Each router sends the information
to every other router on the internetwork
except its neighbors. This process is known as
flooding.
 Three keys to understand the link
state routing algorithm
3. Information Sharing : A router send the
information to every other router only when
the change occurs in the information.
 Link state routing has two phase
1. Reliable Flooding: Initial state
Each node knows the cost of its neighbors. Final
state. Each node knows the entire graph.
2 Route Calculation
Each node uses Dijkstra’ s algorithm on the graph
to calculate the optimal routes to all nodes. The
link state routing algorithm is also known as
Dijkstra’s algorithm which is used to find the
shortest path from one node to every other node in
 Features of Link State Routing
• Link State Packet: A small packet that
Protocols
contains routing information.
• Link-State Database: A collection of
information gathered from the link-state packet.
• Shortest Path First Algorithm (Dijkstra
algorithm): A calculation performed on the
database results in the shortest path
• Routing Table: A list of known paths and
interfaces.
 Calculation of Shortest Path
• To find the shortest path, each node needs to
run the famous Dijkstra algorithm.
• Let us understand how can we find the shortest
path using an example.
 Calculation of Shortest Path
Illustration
• To understand the Dijkstra Algorithm, let’s
take a graph and find the shortest path from the
source to all nodes.
 Calculation of Shortest Path
• Note: We use a boolean array sptSet[] to
represent the set of vertices included in SPT. If
a value sptSet[v] is true, then vertex v is
included in SPT, otherwise not. Array dist[] is
used to store the shortest distance values of all
vertices.
Consider the below graph and src =
0.
• STEP 1: The set sptSet is initially empty and
distances assigned to vertices are {0, INF, INF,
INF, INF, INF, INF, INF} where INF indicates
infinite. Now pick the vertex with a minimum
distance value. The vertex 0 is picked and
included in sptSet. So sptSet becomes {0}.
After including 0 to sptSet, update the distance
values of its adjacent vertices. Adjacent vertices
of 0 are 1 and 7. The distance values of 1 and 7
• STEP 2: Pick the vertex with minimum
distance value and not already included in SPT
(not in sptSET). The vertex 1 is picked and
added to sptSet. So sptSet now becomes {0,
1}. Update the distance values of adjacent
vertices of 1. The distance value of vertex 2
becomes 12.
• The following subgraph shows vertices and
their distance values. Vertices included in SPT
are included in GREEN color.
STEP 3: Pick the vertex with minimum distance
value and not already included in SPT (not in
sptSET). Vertex 7 is picked. So sptSet now
becomes {0, 1, 7}. Update the distance values
of adjacent vertices of 7. The distance value of
vertex 6 and 8 becomes finite (15 and 9
respectively).
STEP 4: Pick the vertex with minimum distance
value and not already included in SPT (not in
sptSET). Vertex 6 is picked. So sptSet now
becomes {0, 1, 7, 6}. Update the distance
values of adjacent vertices of 6. The distance
value of vertex 5 and 8 are updated.
• We repeat the above steps until sptSet includes
all vertices of the given graph. Finally, we get
the following Shortest Path Tree (SPT).
 Characteristics of Link State
Protocol
• It requires a large amount of memory.
• Shortest path computations require many CPU
circles.
• If a network uses little bandwidth; it quickly
reacts to topology changes
• All items in the database must be sent to
neighbors to form link-state packets.
• All neighbors must be trusted in the topology.