191 191 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. $I=2$ $I=3$ $I=4$ $I=5$ Computer Networks gatecse-2009 computer-networks sliding-window normal isro2016 + – Kathleen 74.8k views answer comment Share Follow Print See all 36 Comments 36 36 Comments reply Show 33 previous comments js__ commented Nov 19, 2025 reply Follow flag This is not stop-and-wait. It is about maximally packing the link, so only one-way propagation delay matters. The factor 2 × Tp is only for protocols that wait for ACK before sending the next frame. 6 6 replyShare Siddharth_Perkar commented Jul 25 reply Follow flag No protocol is mentioned as well as asking sequence no.2^n >= Tp/TtTp/Tt = 25/1 = 25Hence, if we take n = 5 then 32 >= 25 ........condition satified 0 0 replyShare legend_of_cse commented Aug 29 reply Follow flag iarnav Thanks for ur explanation .In Transit Vs Full RTT In Transit --> This problem specifically asks to pack the link in transit (within the physical channel during propagation), which requires $T_p / T_t = 25$ frames.Full RTT Windo w==> If the question instead asked for the optimal sender window size for 100% throughput across the full round-trip time without waiting for acknowledgments, it would be $1 + 2a = 1 + \frac{2 T_p}{T_t} = 51$ frames 0 0 replyShare Please log in or register to add a comment.
0 0 votes we can solve like this?? xUnstoppableDhara answered Mar 24 xUnstoppableDhara comment Share Follow See 1 comment 1 1 comment reply xUnstoppableDhara commented Mar 24 reply Follow flag we 0 0 replyShare Please log in or register to add a comment.
0 0 votes . akshay_123 answered Apr 6 akshay_123 comment Share Follow 0 reply Please log in or register to add a comment.