networking - Sliding window algorithm implementation -
i having trouble figuring how derive numbers solution question. following steps, numbers not come near of solution. can give concise step step way figuring out both problems.
solution
part a
t = 0 rtt
sender sends frames 0, 1 , 2 (theoretically) simultaneously.
t = 0.5rtt
receiver receives frames 0,1 , 2. receiver updates lfr = 2
, laf = 5
. receiver sends ack
each of 3 frames.
t = 1 rtt
sender receives ack frames 0, 1, , 2, , sends out frames 3,4, , 5. sender updates lar = 2
, , lfs = 5
.
t = 1.5 rtt
receiver receives frames 3 , 5. receiver updates lfr = 3
, laf = 6
. sends ack
frame 3.
t = 2 rtt
sender receives ack frame 3, , sends out frame 6. sender updates lar = 3
, , lfs = 6
.
t = 2.7 rtt
sender times out on frame 4
.
part b
t = 0 rtt
sender sends frames 0, 1 , 2 (theoretically) simultaneously.
t = 0.5rtt
receiver receives frames 0,1 , 2. receiver updates lfr = 2
, laf = 5
. receiver sends ack
each of 3 frames.
t = 1 rtt
sender receives ack frames 0, 1, , 2, , sends out frames 3,4, , 5. sender updates lar = 2
, , lfs = 5
.
t = 1.5 rtt
receiver receives frames 3,4, , 5. receiver updates lfr = 5
, laf = 8
. sends ack each of frames received.
t = 2 rtt
sender receives ack frame 5, , sends out frames 6,7, 8. sender updates lar = 5
, , lfs = 8
.
t = 2.5 rtt
receiver receives frames 6,7, , 8. receiver updates lfr = 8
, laf = 11
. sends ack each of frames received.
t = 2.7 rtt
sender times out on frame 4
.
Comments
Post a Comment