edited by
20,564 views
45 45 votes

A $20$ $\text{Kbps}$ satellite link has a propagation delay of $400$ $\text{ms}$. The transmitter employs the "go back $n$ $ARQ$" scheme with $n$ set to $10$. Assuming that each frame is $100$ $\text{byte}$ long, what is the maximum data rate possible?

  1. $5$ $\text{Kbps}$
  2. $10$ $\text{Kbps}$​​​​​​​
  3. $15$ $\text{Kbps}$​​​​​​​
  4. $20$ $\text{Kbps}$​​​​​​​

7 Answers

Best answer
79 79 votes

Answer: B
Transmission TIme $=\dfrac{100\times 8\text{bits}}{20\text{ Kbps}}=40\ ms$

Propagation Time $=400\ ms$

Efficiency $=\dfrac{\text{Window Size$\times$ Transmission Time}}{\text{(Transmission Time + 2$\times$ Propagation Time)}}$

$=\dfrac{10\times 40}{(40+2\times 400)}=0.476$

Maximum Data Rate$=0.476\times 20\text{ Kbps}=9.52\text{ Kbps}$

which is close to option B.

edited by
39 39 votes


Option(B) is correct!

There are 3 ways to do  this question.
1.
Tp = 400 ms,  R.T.T = 2*400 ms = 800 ms
Tt = 40 ms
In one round trip, we only  send 10 packets = 10*100 = 1000 Bytes = 8000 bits.

In 800 ms we send 8000 bits, throughput = In 1 second, how many bits can be sent? 
1 ms = $\frac{8000}{800}$ = 10 bits, and in 1 second = 10 k bits 
2.
  $$\text{Throughput = efficiency*B.W}$$
efficiency = $\frac{n}{(1+2*a)}$ where $a=\frac{tp}{tt}$
efficiency = $\frac{10}{1+2*400/40}$ = $\frac{10}{21}$
Throughout = (10/21)*20Kbps = 10 Kbps (almost)

3.
R.T.T = 2*TP = 800 ms
Tt = 40 ms
in 1 R.T.T we can send maximum $\frac{800ms}{40ms}$ = 20 packets


But as mentioned in the question we are sending only 10 packets, it means efficiency is 50% (or) we are utilizing the bandwidth only 50%, so effective bandwidth or throughout will be 50% of total bandwidth i.e. 10 kbps.

 

edited by
18 18 votes

The definition of round trip time in Stop and wait protocol or Sliding window protocols is author dependent. Let us go through them one by one.

Definition 1(More popular):

The total time from the moment we start transmission of a frame till we receive the acknowledgment of the respective frame.

Round Trip Time(RTT) = Transmission Time + 2*(Propagation Time)

Resources that follow this definition:

Tanenbaum : https://csc-knu.github.io/sys-prog/books/Andrew%20S.%20Tanenbaum%20-%20Computer%20Networks.pdf

(Page 233)

Definition 2:

The total time from the moment we place a frame completely into the link till we receive the acknowledgment of the respective frame.

Round Trip Time(RTT) = 2*(Propagation Time)

Resources that follow this definition:

1 . Foruzan : https://dpvipracollege.in/wp-content/uploads/2023/01/Data-Communications-and-Networking-By-Behrouz-A.Forouzan.pdf   

(Page 322 | Example 11.4)

2. Washington University:  https://courses.cs.washington.edu/courses/cse461/17au/lectures/reliable_data_transfer.pdf 

(Page 9)

Conclusion:

So either or not we have to include the Transmission time in the Round trip time is completely author dependent. Although the definition 1 is more commonly used , some questions may require us to follow the definition 2 also. According to the following MIT question it is always better to check both.

Link : https://web.mit.edu/6.02/www/s2011/handouts/tutprobs/transport.html

 

Efficiency $=\dfrac{\text{Window Size$\times$ Transmission Time}}{\text{Round Trip Time(RTT)}}$

Transmission Time  $=\dfrac{100\times 8\text{bits}}{20\text{ Kbps}}=40\ ms$

Propagation Time $=400\ ms$

Using definition 1:

Efficiency $=\dfrac{\text{Window Size$\times$ Transmission Time}}{\text{(Transmission Time + 2$\times$ Propagation Time)}}$

$=\dfrac{10\times 40}{(40+2\times 400)}=0.476$

Maximum Data Rate $=0.476\times 20\text{ Kbps}=9.52\text{ Kbps}$  (None of the options matches)

 

Using definition 2:

Efficiency $=\dfrac{\text{Window Size$\times$ Transmission Time}}{\text{2$\times$ Propagation Time}}$

$=\dfrac{10\times 40}{2\times 400}=0.5$

Maximum Data Rate $=0.5\times 20\text{ Kbps}=10\text{ Kbps}$  (Option B matches)

This question requires us to use definition 2.

0 0 votes

Answer  is B

Given that;

Bandwidth = 20Kbps 

\(T_p\) = 400 mS

Window Size = \(N\) = 10

Frame Size = 100 Bytes

\[
\text{So, }T_t = \frac{100 \times 8}{20 \times 10^3} = \frac{800}{20000}  = 40\ \text{ms}
\]

RTT can be calculated in two ways (or we can say that, "RTT has 2 definitions varying from Author to Author") :


Way 1 : We INCLUDE \(T_t\) in RTT (the Popular one)

\[\text{RTT} = T_t + 2\times T_p\]

In this case, \[\text{Efficiency} = \frac{N \times T_t}{T_t + 2 \times T_p} = \frac{10 \times 40}{40 + 2 \times 400} = \frac{400}{840} = 0.476\] 

So, maximum data rate possible (or maximum bandwidth consumed) = \[0.476 \times 20 Kbps = 9.52 Kbps\]



Way 2 : We DO NOT INCLUDE \(T_t\) in RTT 

\[\text{RTT} =  2\times T_p\]

In this case, \[\text{Efficiency} = \frac{N \times T_t}{2 \times T_p} = \frac{10 \times 40}{2 \times 400} = \frac{400}{800} = 0.5\] 

So, maximum data rate possible (or maximum bandwidth consumed) = \[0.5 \times 20 Kbps = 10 Kbps\]


 

In the above question there is no any option which equals \(9.52 Kbps\) but there is an option which equals \(10 Kbps\).


So, the question was framed on the assumption that RTT doesn't include \(T_t\).


Hence, B is the correct option.
 



There are some GATE PYQs which follow the assumption that RTT includes \(T_t\) like this one GATE CSE 2003 | Question : 84.

Solve these two questions and you will get full clarity on \(T_t\) being included and excluded from RTT.

edited by
Answer:
Position:
Show:

Related questions

87 87 votes
15 answers 15 answers
41.3k
41.3k views
Ishrat Jahan asked Nov 2, 2014
41,349 views
Suppose that the maximum transmit window size for a TCP connection is $12000$ $\text{bytes}$. Each packet consists of $2000$ $\text{bytes}$. At some point in time, the co...
46 46 votes
6 answers 6 answers
18.8k
18.8k views
Ishrat Jahan asked Nov 2, 2014
18,788 views
In a sliding window $ARQ$ scheme, the transmitter's window size is $N$ and the receiver's window size is $M$. The minimum number of distinct sequence numbers required to ...
69 69 votes
8 answers 8 answers
36.1k
36.1k views
Ishrat Jahan asked Nov 2, 2014
36,056 views
A TCP message consisting of $2100$ $bytes$ is passed to IP for delivery across two networks. The first network can carry a maximum payload of $1200$ $bytes$ per frame an...
93 93 votes
9 answers 9 answers
29.9k
29.9k views
Ishrat Jahan asked Nov 2, 2014
29,932 views
Consider a simplified time slotted MAC protocol, where each host always has data to send and transmits with probability $p$ = $0.2$ in every slot. There is no backoff and...