edited by
48,137 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

1 votes
1 votes

simply:

L = 1000 bits (frame size)

Tp = 25 ms  (propagation delay)

B = 10^6 bps  (Bandwidth)

Tt = L/B = 1000/1000000 = 1 ms for 1 frame

in question given there is no any gap between two frames

so , i frame travel from sender to receiver there are 25 frames comes on link for fully utilize the link

Here 25 frames on link , 

so no. of required bits = ceil(log25)) = 5 

correct option (C)

1 votes
1 votes
Actually, the question is asking the bits needed or frames needed so as to pack the link. We don't need to think more beyond this.  

Now, $1$st bit will take $25$ms to reach other host. So, to fill the link we need frames occupying the link all this while which is $25$ms. Since $1$ frame is being transmitted in $1$ms, a host need to fire at least $25$ frames at once to keep the link fully occupied.  Therefore, $5$ bits needed.
0 votes
0 votes

Here transmission time Tt = L/B = 1000/10^6 = 1 ms

i.e  to transmit 1 frame we need 1 ms.

Now we are given that propagation time Tp=25 ms i.e in Tp time we can send 1*25 = 25 frames only.

Therefore no of bits required for sequence no = ceil( log2(25) ) = 5 bits.

 

0 votes
0 votes

A possible ans:

Every 1 ms we hv a new frame on the line. (BW 10^6 bps and frame size 1000 b).

See it as the first bit of the frame, the first bit touches the other end at 25 ms delay.

How many frames have we pushed on the line during this 25 ms as we were pushing 1 frame each 1 ms?

25 frames on the line at a time.

To identify 25 frames, we need 5 bits.

Answer:

Related questions

20 votes
20 votes
5 answers
9
Kathleen asked Sep 22, 2014
8,375 views
In which one of the following page replacement policies, Belady's anomaly may occur?FIFOOptimalLRUMRU
34 votes
34 votes
7 answers
10
Kathleen asked Sep 22, 2014
20,214 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
12
Kathleen asked Sep 21, 2014
33,743 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...