edited by
12,069 views
22 votes
22 votes

A channel has a bit rate of $4$ $kbps$ and one-way propagation delay of $20$ $ms$. The channel uses stop and wait protocol. The transmission time of the acknowledgment frame is negligible. To get a channel efficiency of at least $50$$\text{%}$, the minimum frame size should be

  1. $80$ $\text{bytes}$
  2. $80$ $\text{bits}$
  3. $160$ $\text{bytes}$
  4. $160$ $\text{bits}$
edited by

3 Answers

Best answer
42 votes
42 votes

For $50\%$ utilization with Stop-and-wait,

$\large\dfrac{t_t}{t_t+2t_p}\geq \dfrac{1}{2},$

where, $t_t-$ Transmission time, $t_p-$ propagation delay. Here, $t_t = \frac{L}{B},$ where $L$ is the frame length in bits and $B$ is the bitrate of the channel.

$\large2t_t\geq t_t+2t_p$

$\large t_t\geq 2t_p$

$\dfrac{L}{B}\large\geq 2\times t_p$

$L\geq 2\large\times t_p\times B$

$\implies L=2\times 20\times 10^{-3}\times 4\times 10^{3}=160\text{ bits}$

So, answer is D.

edited by
6 votes
6 votes

Answer: D

Transmission Time/(Transmission Time + 2*Propagation Time) = 0.5

=> Transmission Time/(Transmission Time + 2*20*10-3) = 0.5

=> Transmission Time = 40*10-3

Option D satisfies the Transmission Time as 160 bits/4 Kbps = 40*10-3

1 votes
1 votes
Answer->D \

efficiency = transmision time of packet/(transmission time of packet+2xprop delay+tranmission time for ack(~0))
Answer:

Related questions

15.3k
views
7 answers
48 votes
Ishrat Jahan asked Nov 3, 2014
15,312 views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...
5.5k
views
4 answers
23 votes
Ishrat Jahan asked Nov 3, 2014
5,462 views
Consider a simple graph with unit edge costs. Each node in the graph represents a router. Each node maintains a routing table indicating the next hop router to be used to...
7.4k
views
3 answers
27 votes
Ishrat Jahan asked Nov 3, 2014
7,374 views
Suppose that two parties $A$ and $B$ wish to setup a common secret key (D-H key) between themselves using the Diffie-Hellman key exchange technique. They agree on $7$ as ...
20.6k
views
3 answers
28 votes
Ishrat Jahan asked Nov 3, 2014
20,638 views
Consider the following message $M = 1010001101$. The cyclic redundancy check (CRC) for this message using the divisor polynomial $x^5+x^4+x^2+1$ is :$01110$$01011$$10101$...