Network Software

Network Software
Network Software refers to any software
application or program designed to facilitate
communication and data exchange between
computers or devices within network.
Protocol Hierarchies
To reduce their design complexity, most
networks are organized as a stack of layers or
levels, each one built upon the one below it.
The number of layers, the name of each layer,
the contents of each layer, and the function of
each layer differ from network to network.
The protocol depends on the following −

Syntax − Syntax is the format of data which

is to be sent or received.
Semantics − Semantics is the meaning of
every section of bits that are transferred.
Timings − It refers to the time at which data
is transferred as well as the speed at which it
is transferred.
Layers, protocols, and interfaces.
Setp 1 − Generally the entities present on
different layers are called peers who are
present on different machines.
Setp 2 − There is no data transferred directly
from layer n on one machine to layer n on
another machine.
Setp 3 − Each layer passes data and control
information to the layer below it, until the
lowest layer is reached.
Setp 4 − Below layer 1 there is a "physical
medium" through which the actual
communication occurs.
Setp 5 − In the above figure the virtual
communication is shown by dotted lines and
physical communication by solid line.
Setp 6 − Between each pair of adjacent layers
there is an "interface", the interface defines
which operations and services that the lower
layer offers to the upper layer through it.
Setp 7 − A list of protocols used by system one
protocol per layer is called a "protocol stack".
information flow supporting virtual
communication in layer 5
Virtual Communication
A massage M is produced by an application process
running in layer 5.and given to layer 4 for
transmission.
Layer 4 puts a " header " in front of massage M to
identify the massage and passes the result to layer
3.
In many networks, there is no limit to the size of
massage in layer 4-protocol, but there is nearly
always a limit imposed by layer 3 protocol.
Hence, layer 3 must break up the incoming
message into small units (packets) prepending
layer 3 header to each packet.
In this example the message M is split into
two parts, M1, and M2.
Layer 3 decides which of outgoing lines to
use and passes the packet to layer 2.
Layer 2 adds a header and trailer to each
packet and gives the result to layer 1 for
physical transmission.
At the receiving machine, the message moves
up word from layer to layer with the header
being stripped off as it progresses till the
message m arrives at application layer 5.
Design issues for layers
Design issues for layers
Addressing- whom I m going to talk to ? i.e how do you
identify senders and receivers.
Rules for data transfer-simplex, half-duplex, full-duplex
Logical channels-usually 2.one for the normal mode
transmission and other for the urgent transmission
Reconstructing the messages: Out of order messages
need to be numbered.
Error control-communicating along imperfect channels
and correcting them.(attenuation, delay distortion and
noise
Large Messages -Procedure for disassembling,
transmitting and reassembling. what to do when
messages are small
Connection-Oriented Services
In a connection-oriented service, each packet
is related to a source/destination connection.
These packets are routed along a similar
path, known as a virtual circuit.
it provides an end-to-end connection to the
client for reliable data transfer.
The host machine requests a connection to
interact and closes the connection after the
transmission of the data.
Ex: Mobile Communication
Connectionless-Service
In connectionless service, a router treats
each packet individually. The packets are
routed through different paths through the
network according to the decisions made by
routers.
No-guarantee of data delivery
The data to be transmitted is broken into
packets. These independent packets are
called datagram's in analogy with telegrams.
Ex:Postal system
 Connection Oriented Connectionless Services−
Services
It can generate an end to end It can transfer the data packets
connection between the senders to between senders to the receiver
the receiver before sending the data without creating any connection.
over the same or multiple networks.

It generates a virtual path between It does not make any virtual

the sender and the receiver. connection or path between the
sender and the receiver.

It needed a higher bandwidth to It requires low bandwidth to share

transmit the data packets. the data packets.

There is no congestion as it supports There can be congestion due to not

an end-to-end connection between providing an end-to-end connection
sender and receiver during data between the source and receiver to
transmission. transmit data packets.

It is a more dependable connection It is not a dependent connection

service because it assures data service because it does not ensure
packets transfer from one end to the the share of data packets from one
other end with a connection. end to another for supporting a
 Service Primitives
A service is formally specified by a set of
primitives (operations) available to user
processes to access the service.
These primitives tell the service to perform
some action or report on an action taken by a
peer entity.
The set of primitives available depends on the
nature of the service being provided.
The primitives for connection-oriented
service are different from those of
connectionless service.
Uses of service primitives
A simple client-server interaction using
acknowledged datagram's
Relationship between service and protocol