edited by
26,987 views
55 votes
55 votes

Station $A$ uses $32\; \text{byte}$ packets to transmit messages to Station $B$ using a sliding window protocol. The round trip delay between A and $B$ is $80\; \text{milliseconds}$ and the bottleneck bandwidth on the path between $A$ and $B$ is $128\; \text{kbps}$ . What is the optimal window size that $A$ should use?

  1. $20$
  2. $40$
  3. $160$
  4. $320$
edited by

12 Answers

3 votes
3 votes
It is already mentioned in the question that bottleneck bandwidth is used and initial bandwidth is not given ie. no use to calculate TT.

So, no. of packets = (128×80)/(32×8) = 40.      Ans.
2 votes
2 votes
ans b)
1 votes
1 votes

L = 32 Byte = 32*8 = 256 bits

B/w= 128 Kbps

Tt= L/B =2 ms

tp= RTT/2 = 40 ms

optimum window size = 1+2a

= 1+2*40/2 = 41 

0 votes
0 votes
$\underline{\textbf{Answer:}\Rightarrow}\;\mathbf {(B)}$

$\underline{\textbf{Explanation:}\Rightarrow}$

Round Trip propogation delay $=80\;\text{ms}$

Frame Size $=32\times 8\;\text{bits}$

Transmission Time $=\mathbf{\dfrac{L}{B}} = \dfrac{32 \times 8}{128} \;\text{ms} = 2\;\text{ms}$

Let $\mathbf n$ be the window size.

Utilization $=\mathbf{\dfrac{n}{1+2a}}$, where $\mathrm {a = \dfrac{Propogation\; time}{transmission\; time}} = \dfrac{\mathrm n}{1+\dfrac{80}{2}}$

For maximum Utilization Efficiency $ = 1$

$\Rightarrow 1 = \dfrac{\mathrm n}{1+\dfrac{80}{2}}\\ \Rightarrow\mathrm n = 41$

Which is close to option $\mathbf{ (B)}$

$\therefore\;\mathbf {(B)}$ is the correct answer.
Answer:

Related questions

21 votes
21 votes
1 answer
2