NETWORK LAYER

Unit no.4
DESIGN ISSUES
STORE & FORWARD PACKET
SWITCHING
SERVICES PROVIDED TO
TRANSPORT LAYER
Connectionless service
Connection-oriented service
IMPLEMENTATION OF
CONNECTIONLESS SERVICE
IMPLEMENTATION OF CONNECTION-
ORIENTED SERVICE
COMPARISON OF VIRTUAL-CIRCUIT
SUBNET & DATAGRAM SUBNET
DIJKSTRA’S ALGORITHM EXAMPLE
Example : find shortest distance between A & D

Step 1 : Assign the labels to every node & make Node A as a permanent node

Step 2 : Consider adjacent node & give tentative names. Make smallest
Label permanent .
 Step 4 : Instead of node G , node E decided & its adjacent node F
Assigned tentative label.

Step 5 : Node F assigned permanent label & adjacent nodes C & H are
Considered..

Step 6: Instead of node C , node H decided on less distance metric

& assigned permanent label.
 Shortest path between A & D is
 A- B-E-F-H-D
IP ADDRESSES
IP ADDRESSES
 IPv4 or IP address is 32 bit address that uniquely and
universally defines the connection of a device.
 Address space
 Address space=2n
 Address space of IPv4=232

 Notations
 Binary notation
 Dotted decimal notation
 Hexadecimal notation
CLASSFUL ADDRESSING
 Used the concept of classes
 Address space is divided in five classes A B C D E
RECOGNIZING CLASSES
 Finding class in binary notation
RECOGNIZING CLASSES
 Finding class in decimal notation
NET ID & HOST ID
CLASSES & BLOCKS
 Each class is divided into blocks
 Class A
Designed for multicasting

Reserved for future use

MASK
 Mask is used to find network address from given address
 Concept

 Default mask
SUBNETTING &
SUPERNETTING
SUBNETTING
 Two level of hierarchy
 Netid – first level (site)
 Hostid – second level (host)
 Solution : subnetting
 Address

 Subnet mask
SUPERNETTING
 Supernet mask
CLASSLESS ADDRESSING
CLASSLESS ADDRESSING
 No classess
 Variable length blocks

 Organization can block as per the requirement

 No of address in block must be power of two.

 First address must be evenly divisible by no. of addresses

 E.g. Which of the following can be the beginning

address of a block that contains 16 addresses?

 205.16.37.32
 17.17.33.80

 Mask
 255.0.0.0 (/8)
IPV4 DATAGRAM
IP DATAGRAM
 VER – version
 HLEN- header length

 Total length

How to find length of data?

 Differentiated services
 Previously called as
service type
 Diffrentiated services
 6 bits makeup a codepoint
 If 3 right most bits are 0s ,

remaining bits are treated

as precedence.
 If 3 right most bits are not

all 0s , total 6 bits define 64

services.
 Fragmentation
 MTU- maximum transfer
unit
 Why we need?
 problems
 Fields
 Identification
 Flags

 Fragmentation offset
 Identification
D -1 no fragmentation
 D- 0 can be

 M- 0 last fragment
 M- 1
 Fragmentation offset
ADDRESS RESOLUTION
PROTOCOL(ARP)
ARP
 Two levels of addressing
 Logical addressing
 Physical addressing

 Mapping
 Static
mapping
 Dynamic mapping
ARP OPERATION
 Query packet with senders IP address & physical address
& receivers IP address
 Broadcast

 Unicast reply
PROXY ARP