on a

(Data Layer
hapta-2DLL
link

② Flow control

③ Access Control

④ switching

⑤ Error detection & correction

⑤ Ethernet 802 3 .

what is Computer Network ?

How the
groups of computer are
communicating
to each other that is called computer Network .

#daysI n
Network :

The time taken by the Packet from source

to reach the destination .

Types of Delay :

① Transmission Delay (Tt)

② Propogation Delay/one-way delay (Tp)
③ Quering Delay (Ta)

⑨ Processing Delay (Toroc)

 ⑦ Delay : (Tz)
Transmission
-

The time taken by the node to push the Packet to

the communication link is known Tt

as
Length
.

-
1 bits -

&

I
Package - Tt

R
S in meter
~
-
Velocity , B W .
(bits/see)
(m/s)
-

It depends on
Length of Packet & Bandwidth of

the channel .

~ Length
To
= -Bandwid

Power
Hata: 2
eh Late :
is
T

① 2k = 21 02k
= 103

② IM = 220 ② IM = 106

③ 1G = 230 ③ 2G = 109

②
ropogation Delay (Tp) : Communication
rink
&
The time taken by Packet from
-

the source or C . L
to reach the destination is called Tp .

Package T
I
DD
-

S in meter
~
-
Velocity , B W .
(bits/see)
(m/s)
 -

It depends on distance and the velocity of the

medium .

To stancee
=

Delay (Tq) :
③newing
-
The time taken by the
Package to buffer in queue

is know as
Quering Delay (Ta) ·

( S
may be the data is divided into several packages for

that reason
,
we wait for the collection of whole package
that wait is known
time or as Tq .

Package (P)
~
I R
S in meter
~
-
Velocity , B W . (bits/se)
....---
(m/s)
X
Tq

It doesn't have any particular formula .

Delay /Toroc)i
④ Processing
-

The time required to process the data or Package

is known as
proc

RY
Toroc.
S in meter
~

---d
Velocity B (bits/se) W
. . . . . .

A
.
,

(m/s)

Tq
 Total time taken

by package
To atTo
the
= Tt +
from the
source/sender
to
destination/receiver,
Treat =
O Treat = O

S
Because Nowadays

(
,
processor

are fast in
processing
and
queuing

·
: Total time =
To + Tp

I byte = 8 bits

1 MB = 220x8 bits

#low
control :
method machanism
>
- The to control speed matching
between sender & Receiver is called flow control .

>
- Flow control is local issue .

5( We talk about only sender & receiver only

control methods a at
How
- o

Protocol

wind
slimy
Pro to col e no
or

Back v)
>
-
SR
(Selective Reject or Repeat)
 - set of rules

① p and wait Protocol :

Package
sender

Em ·
Package

acknowledgement
(received or not?)
D

Destination

This is

the wait
time .

#eline
Diagram :

Sender Receiver

ES ..........

· ---
-

: Total time
=
T +
To tacin + To

( (
To send one Package
from Sender to Receiver
and Receive ack from
the receiver .
·: Total time =
Tt + 2 * Tp

(in protocol
stopd wait
&
Frame = Data + header

(1)
Efficiency =

Y =l

- /Wecontalling a
abou

2tp

Fea (a = )
=

·
Man =
Exa

1 = -Fix
-
Note : Stop & wait Protocol is
-

t
Good for large Pkt & LAN

im a

: efficiency is directly propotional to Length

distance
& inversaly proportional to .
 Through
putor EffecteBW roadband plane then the

actual speed that we get is not 50 mbps .

we get less Mbps

and that mbps or speed is know as throughput.

Bandwidth
~
Through put
B
or = +

Effective B W
.

=
- To

kithe bits

But
Through put Total time me

os send kar pa raha hai

,

Elective that is throughput-

06-03-22

#p : (Transmission Control Protocol) :

>
-Different names on different layer for msg .

Application layer is msg

I
O
M

d
Transport layer is segment
e
M Network layer is Packet

Data link layer is frame

V
physical layer in PDU

[Protocol Data Unit)

 & If i
the of stop and wait protocol atleast 50 %.

Then find out the minimum frame size .

-

Lmeans we are talking

about data link layer .

=>
43 2 Tt > Te + 2 Tp

Tt ,
2 * Tp

>
-

T 2 * Tp

Tp * B
L 2 *

-answer

#roblems
in stop & wait Protocol :

is lost :
Octa
Okt R
Porta

sender is
T lost
·
Receiver is

for ack. waiting for Pkt

waiting

Problem
occur : Deadlock

Now the question is ,

How to solve ??
 Cata
S

-
S

Time out Timer

S Data
-----

TOT
S
(ToT) 2* Tp
Wait Certain time
RTT =
and then if didn't get --Rata----

-
we

the
any ack then send again
after Tot time.
same data

ToT = 2 * RTT

(Round Trip Time]

. Total time =
S & W + To T

Acknowledgement is lost
# :

S R

Totala a
,

&
Kata
·
Received
Duplicate

S
roblem occur :
& Duplicate Pkt

How to solve this ? dost

=>
Assign sequence no. to the
* s already
received
data Plat .
then discard
.
it
8
Ifack is delayed

S
:

tot
:
ack is
to

D2
: Now
lost

the sender

sender thinks
is

,
I
reached
that

received
it will send Dz .

Pkt
-roblem
occur :
missing
How to solve this ?
=> assign sequence no . (#) to Ack.

S R

i
is
has
know

to

because

came .
send D2
that he

acke is
 of the Transmission medium :
#apacity
There are total three types of mode :

①
simplex :
Data goes only one direction.
-

senden
Receiver

FM receiver .

②
of duplex :
time
at a

~
receive
send or .

senden
Receiver

Tata

& wokitol"

pacity of channel/medium
:
=
--

- B
Channel

-
- 1

·: Capacity of channel = Tp * B

(in half Imple

 Full
Duplex : send and receive

↑
Data
- at the same time .

senden
Receiver

Tata

& mobile phone .

pacity of channel/medium
:
=
-
-B
Channel

-
- 1
-
-

·: Capacity of channel = 2 *Tp * B

(in full duplex

& stop & wait protocol is good for thick Pipe or this pipe ?
=> Rsow =Fo Channel
↑
thin Pipe
good
V

= Channel pipe
Thick
*
bad

Raw =
↓
Means
2xTpx
Capacity of
value of

Ccity
more the

the duplex
↑ B . W and Tp

em
 06/05/22

② If the error probability of channel is 20 % & sender

wants to send 200 pkts using stop & wait protocol .
Then ,

how transmission pkts

many are required to send 200 .

=>
approach:
General

~ pkts Error Probability = P %

,

transmission ,

n +
up + np + p + np * p +... - -
- -

n
(1 + p + p+ p + p+ . . . . . .
)
N

infinite GP . - Sum =

·
nx = p

Total

for n
pats

pkts
to send
= p

Now ,

total pkt === 250

second
method
a

, 200 plats then 200xare currupt

Now will send 40 pkts

we ,
then
60x80k are

currupted ,

Now will send

we
8 PKts ,
then
8X = 10612pK are

currupted,

Now we will send 2 pkts ,

then 2x = 0 .
150 pkt is

currupted .

· total pkts that we have send = 200 + 40 + 8 + 2 = 250

pkfs .
·
The efficiency of stop& wait protocol Msaw) is very less .

=> Because

sender
is
doing nothing
in this
interval
time

.
------
& find polynomial passing brough

:; Els slit
also
aid Y at x = 0 .
5 & x = 5 5
.