• edited by
1,433 views
2 2 votes
Am I Correct? Suppose we have 3-bit sequence number and acknowlwdgements are piggybacked. Then channel utilization is

A. Stop and Wait

                       =Transmission time/(2*transmission time + 2*propagation time)

B.GBN           

                       =7*transmission time/(2*transmission time + 2*propagation time)

C.SR

                     =4*transmission time/(2*transmission time + 2*propagation time)

Okay, here is the full question in which i applied above formulas::

Frames of 1000 bits are sent over a 1Mbps link between earth and moon whose propagation delay is 270msec. Headers are very short and acknowledgments are always piggybacked on to data frames.

Three bit sequence numbers are used. What is the maximum channel achievable channel utilization in

A.Stop and wait

B. GBN

C.SR

1 Answer

0 0 votes
@Shivam. Why are you taking

2*transmission time

in the remainder? It must be simply transmission time.
Position:
Show:

Related questions

0 0 votes
0 0 answers
872
872 views
Tuhin Dutta asked Dec 19, 2017
872 views
Suppose,size of a full window is 24 Kb.There is no congestion.1 MSS = 2 Kb.RTT = 10 msHow long does it take to send the first full window?Approach 1) 2 | 4 | 8 | 16 | 24 ...
2 2 votes
2 answers 2 answers
2.3k
2.3k views
Shivam Chauhan asked Sep 25, 2016
2,310 views
AM I CORRECTIs there a difference between channel utilization, sender utilization, Throughput and efficiency ?According to me , Sliding Window ProtocolChannel utilization...
1 1 vote
1 1 answer
1.2k
1.2k views
iarnav asked Nov 12, 2018
1,163 views
Say sequence # field has 5 bits.then what would be the max SWS (sender window size) in case of simple SWP where nothing is mentioned explicitly that the SWP is GBN or SN,...
1 1 vote
0 0 answers
1.3k
1.3k views
iarnav asked Nov 11, 2018
1,301 views
Say sequence # field has 5 bits. So, I know, we have a relation Ws+Wr <= avail seq #So in simple SWP = 2^5 = 32 sequence number and SWS = 32 packets ( is it correct)?in G...