Network Layer

By
Anusha J
Network Layer

• Host to Host (source to

destination) delivery
• Logical addressing (IP)
• Routing
• Fragmentation - Packets
• Congestion control
 NETWORK LAYER DESIGN ISSUES

• Store-and-Forward Packet Switching

• Services Provided to the Transport Layer
• Implementation of Connectionless Service
• Implementation of Connection-Oriented
Service
• Comparison of Virtual-Circuit and Datagram
Networks
Store-and-Forward Packet Switching

• A host with a packet to send

transmits it to the nearest
router.
• The packet is stored there
until it has fully arrived.
• the link has finished its
processing by verifying the
checksum.
• Then it is forwarded to the
next router along the path
until it reaches the
destination host.
• This mechanism is store-
and-
forward packet switching.
Services Provided to the Transport Layer

Before providing these services to the transport

layer following goals must be kept in mind:
• The services should be independent of the
router technology.
• The transport layer should be shielded from
the number, type, and topology of the routers
present.
• The network addresses made available to the
transport layer should use a uniform numbering
plan, even across LANs and WANs.
Services Provided to the Transport Layer - cont.

• Connection-oriented service : is a network communication mode, where a

communication session or a semi-permanent connection is established before any
useful data can be transferred, and where a stream of data is delivered in the
same order as it was sent.
• Connectionless service: is a data transmission method used in packet switching
networks by which each data unit is individually addressed and routed based on
information carried in each unit, rather than in the setup information of a pre-
arranged fixed data channel as in connection-oriented communication.
• Packet Switching: is a digital networking communications method that groups all
transmitted data into suitably sized blocks, called packets.
• A Datagram: is a basic transfer unit associated with a packet-switched network.
The Delivery, Arrival time, and order of arrival need not be guaranteed by the
network.
• A Virtual circuit: is a means of transporting data over a packet switched computer
network in such a way that it arrears as though there is a dedicated physical layer
link between the source and destination end systems of this data
 Which service is the best ?
• The discussion is about on whether the network layer
should provide connection oriented service or
connectionless service.
• One camp (represented by the Internet community)
argues that the routers’ job is moving packets around
and nothing else /connectionless.
• The other camp (represented by the telephone
companies) argues that the network should provide a
reliable, connection-oriented service.
• connectionless network layers have grown tremendously in
popularity. The IP protocol is now an ever-present symbol of
success.
 Implementation of Service

• If connectionless service • If connection-oriented

is offered, packets are service is used, a path from
injected into the the source router all the
network individually and way to the destination
routed independently of router must be established
each other. No advance before any data packets can
setup is needed. In this be sent. This connection is
context, the packets are called a VC (Virtual Circuit).
frequently called
Datagram.
Implementation of Connectionless Service

• Suppose that the process P1 in

Fig. has a long message for P2. It
hands the message to the
transport layer,
• with instructions to deliver it to
process P2 on host H2. The
transport layer code runs on H1,
typically within the operating
system. It prepends a transport
header to the front of the message
and hands the result to the
network layer, probably just
another procedure within the
operating system
Implementation of Connection-Oriented Service

• For connection-oriented service, we need

a virtual-circuit network. The idea behind
virtual circuits is to avoid having to choose
a new route for every packet sent.
• With connection-oriented service, each
packet carries an identifier telling which
virtual circuit it belongs to.
• Assigns a different connection identifier
to the outgoing traffic for the second
connection. Avoiding conflicts of this kind
is why routers need the ability to replace
connection identifiers in outgoing
packets. In some contexts, this process is
called label switching
Comparison of Virtual-Circuit and Datagram
Networks
Shortest Path Algorithm

• The first 5 steps used in computing the shortest path from A to D.

The arrows indicate the working node.
Shortest Path Algorithm
4 Link State Routing (1)

• Each router must do the following:

• Discover its neighbors, learn their network
address.
• Measure the delay or cost to each of its neighbors.
• Construct a packet telling all it has just learned.
• Send this packet to all other routers.
• Compute the shortest path to every other router.
4 Link State Routing (2): Learning
about the Neighbors

(a)Nine routers and a LAN.

(b)A graph model of (a).
4 Link State Routing (3): Measuring
Line Cost
• A subnet in which the East and West parts
are connected by two lines.
4 Link State Routing (4): Building Link
State Packets
• (a) A subnet. (b)
The link state
packets for this
subnet.
4 Link State Routing (5): Distributing
the Link State Packets
• The packet buffer for router B in the
previous slide.
Hierarchical Routing
• Hierarchical routing.
Broadcast Routing algorithm
Broadcast Routing algorithm
Flooding
• Static algorithm. In this, every incoming packet is sent out on every outgoing
line except the one it arrived on.
• generate vast numbers of duplicate packets
• some measures - hop counter contained in the header of each packet,
which is decremented at each hop, with the packet being discarded when
the counter reaches zero.
• The hop counter should be initialized to the length of the path from source to
destination. If the sender does not know how long the path is it can initialize
the counter to full diameter of the subnet.
• A variation of flooding is ‗Selective Flooding‘. In this the routers do not
send every incoming packet on every line, instead only on those lines that
are going approximately in the right direction which leads to the destination.
Routing in Ad Hoc Networks (1)
• Possibilities when the routers are mobile:
• Military vehicles on battlefield.
– No infrastructure.
• A fleet of ships at sea.
– All moving all the time
• Emergency works at earthquake .
– The infrastructure destroyed.
• A gathering of people with notebook computers.
– In an area lacking 802.11.
 Routing in Ad Hoc Networks (2): Route
Discovery

• (a) Range of A's broadcast.

• (b) After B and D have received A's broadcast.
• (c) After C, F, and G have received A's broadcast.
• (d) After E, H, and I have received A's broadcast.
• Shaded nodes are new recipients. Arrows show possible reverse routes.
6. Routing in Ad Hoc Networks (3):
Route Discovery

• Format of a ROUTE REQUEST packet.

6. Routing in Ad Hoc Networks (5): Route
Maintenance

• (a) D's routing table before G

goes down.
• (b) The graph after G has gone
down.
6. Routing in Ad Hoc Networks (4):
Route Discovery

• Format of a ROUTE REPLY packet.

Multicast Routing algorithm