Computer Networks Unit 3
Computer Networks Unit 3
NETWORK LAYER
THE OSI MODEL
NETWORK LAYER
NETWORK LAYER
NETWORK LAYER
Network layer is the third layer in the OSI model of computer
networks
It’s main function is to transfer network packets from the
source to the destination.
It is involved both at the source host and the destination host.
At the source, it accepts a packet from the transport layer,
encapsulates it in a datagram and then deliver the packet to the
data link layer so that it can further be sent to the receiver. At
the destination, the datagram is decapsulated, the packet is
extracted and delivered to the corresponding transport layer.
NETWORK LAYER
Features :
Main responsibility of Network layer is to carry the data packets from the
source to the destination without changing or using it.
If the packets are too large for delivery, they are fragmented i.e., broken
down into smaller packets.
It decides the root to be taken by the packets to travel from the source to
the destination among the multiple roots available in a network (also called
as routing).
The source and destination addresses are added to the data packets inside
PACKETIZING
ROUTING
FORWARDING
ERROR CONTROL
FLOW CONTROL
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
SERVICES
NETWORK LAYER
DESIGN ISSUES
NETWORK LAYER
DESIGN ISSUES
20
NETWORK LAYER
DESIGN ISSUES
Circuit switching
22
Packet switching
23
packet switching
24
ROUTING
ALGORITHMS
ROUTING
ALGORITHMS
SHORTEST PATH
ALGORITHMS
SHORTEST PATH
ALGORITHMS
SHORTEST PATH
ALGORITHMS
SHORTEST PATH
ALGORITHMS
SHORTEST PATH
ALGORITHMS
SHORTEST PATH
ALGORITHM
SHORTEST PATH
ALGORITHM
FLOODING
OPTIMALITY
PRINCIPLE
DISTANCE VECTOR
ROUTING
DISTANCE VECTOR
ROUTING
DISTANCE VECTOR
ROUTING
DISTANCE VECTOR ROUTING- COUNT
TO INFINITY PROBLEM
DISTANCE VECTOR ROUTING-
COUNT TO INFINITY PROBLEM
DISTANCE VECTOR ROUTING-
COUNT TO INFINITY PROBLEM
DISTANCE VECTOR ROUTING-
COUNT TO INFINITY PROBLEM
DISTANCE VECTOR ROUTING-
COUNT TO INFINITY PROBLEM
DISTANCE VECTOR ROUTING-
COUNT TO INFINITY PROBLEM
DISTANCE VECTOR ROUTING-
COUNT TO INFINITY PROBLEM
LINK STATE ROUTING
LINK STATE ROUTING
LINK STATE ROUTING
LINK STATE ROUTING
HIERARCHICAL ROUTING
•IP ADDRESS
•IP4 ADDRESS
•IP6 ADDRESS
IP ADDRESS
CLASSIFICATION OF IP ADDRESS
DYNAMIC IP ADDRESS
STATIC IP ADDRESS
DYNAMIC IP
ADDRESS
DYNAMIC IP
ADDRESS
•Temporary ip address assigned by
ISP
•Dynamic ip address always change
STATIC IP
ADDRESS
IP ADDRESS
TYPES
IP4 ADDRESS
IP4 ADDRESS
IP4 32 bit numerical address
66 . 94 . 29 . 13 (decimal to binary)
66 94 29 13
4*8=32 bit
IP4 ADDRESS
IP4 ADDRESS
IP4 is 4 numerical digit (decimal numbers) separated by dots
66 . 94 . 29 . 13
0.0.0.0 – 255.255.255.255
IP4 ADDRESS
IPv4 binary
conversion
8-bit octent chat
128 64 32 16 8 4 2 1
66.99.29.13
66 = 64 + 4
128 64 32 16 8 4 2 1
0 1 0 0 0 1 0 0
64=01000100
IPv4 binary
conversion
8-bit octent chat
128 64 32 16 8 4 2 1
66.99.29.13
99 = 64 + 32+2+1
128 64 32 16 8 4 2 1
0 1 1 0 0 0 1 1
99 = 01100011
CATEGORIES OF IPV4
ADDRESSING
Classful Addressing
Classless Addressing
CLASSFUL ADDRESSING
Class A
Class B
Class C
Class D
Class E
IP4 uses best effort delivery, i.e. it does not guarantee that
packets would be delivered to the destined host, but it will
do its best to reach the destination. So IPv4 is a
connectionless protocol
Forwarding means to deliver the packet to the next hop (which can be the final
destination or the intermediate connecting device).
FORWARDING OF IP PACKETS
IPV6 PROTOCOL
It is the most recent version of the Internet Protocol.
It was aimed to resolve issues which are associated with IPv4.