edited by
48,713 views
126 votes
126 votes

Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link).

What is the minimum number of bits $(I)$ that will be required to represent the sequence numbers distinctly? Assume that no time gap needs to be given between transmission of two frames.

  1. $I=2$
  2. $I=3$
  3. $I=4$
  4. $I=5$
edited by

18 Answers

0 votes
0 votes
L=1000b,B=1000000b/s

Tt = L/B = 1ms

Tp = 25 ms

a  = Tp/Tt

For maximising the efficiency,no of frames that must be transmitted is 1+2a

thus no. of frames is 51

so no of bits required to represent 51 is 5(ans).
0 votes
0 votes
Since, it is duplex link Therefore PIGGYBACKING is used.

Formula to be used here is
$\eta = \frac{w*2tx}{2tx + 2tp}$
where n = 1 here

Since in Piggybacking with frame ack. is also sent so txa should not be ignored here and txa=tx in piggybacking.

Therefore, Useful time = 2tx and total time is 2tx+2tp.

Use this formula you will get the answer.
0 votes
0 votes

maximally pack them in transit 

Bits will only stay  in transit for max 25ms, because that's the propagation delay.

 

In $1$ second —> $10^6$ bits are passed through the link at max.

In $25 ms$ —> $25m * 10^6$ bits are passed through the link at max.

=> In $ 25 ms$ —> $25 * 10^3$ bits are passed through the link at max.

=> In $25ms$ —> $25 packets$ are passed through the link at max..

 

To uniquely identify 25 packets., we need 5 bits.

 

Option D

Answer:

Related questions

20 votes
20 votes
5 answers
1
Kathleen asked Sep 22, 2014
8,532 views
In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU
34 votes
34 votes
7 answers
2
Kathleen asked Sep 22, 2014
20,404 views
$$S \to aSa \mid bSb\mid a\mid b$$The language generated by the above grammar over the alphabet $\{a,b\}$ is the set of:all palindromesall odd length palindromesstrings t...
27 votes
27 votes
4 answers
4
Kathleen asked Sep 21, 2014
33,994 views
The message $11001001$ is to be transmitted using the CRC polynomial $x^3 +1$ to protect it from errors. The message that should be transmitted is:$11001001000$$110010010...