• edited by
19,314 views
54 54 votes

Consider the following statements about the timeout value used in TCP.

  1. The timeout value is set to the RTT (Round Trip Time) measured during TCP connection establishment for the entire duration of the connection.
  2. Appropriate RTT estimation algorithm is used to set the timeout value of a TCP connection.
  3. Timeout value is set to twice the propagation delay from the sender to the receiver.

Which of the following choices hold?

  1. $(i)$ is false, but $(ii)$ and $(iii)$ are true
  2. $(i)$ and $(iii)$ are false, but $(ii)$ is true
  3. $(i)$ and $(ii)$ are false, but $(iii)$ is true
  4. $(i), (ii)$ and $(iii)$ are false

7 Answers

Best answer
49 49 votes
  1. (i) TCP connection established in $3$ phase between $\text{SYN}$ send and $\text{SYN}$ received $(\text{SYN},\text{SYN}+\text{ACK},\text{ACK})$. After this connection establishment, data transfer takes place. Now, $\text{FIN}$ flag is called to close the connection. $\text{FIN}$ flag can close the connection after getting the $\text{ACK}$ from the receiver. If $\text{ACK}$ is not received, a timer is set which wait for the time out. So, there is no relationship between TCP connection establishment and Timeout of $\text{RTT}.$


     
  2. This is Jacobson's algorithm (Thanks @Anirudh)
    $\text{ERTT}=p\times \text{IRTT}+(1-p)\times \text{NRTT}$
    $p$ is scaling factor
    $\text{IRTT}$ initial $\text{RTT}$
    $\text{NRTT}$ is new $\text{RTT}$
    Link here

     
  3. Actually timeout value is more than twice the propagation delay from sender to receiver. Because after connection establishment and data transfer complete, then only timeout occurs. So, if we start timer at the beginning of transaction, Time Out occurs after RTT completes and after final $\text{ACK}$ comes. So, Time Out time must be more than $\text{RTT}.$

So, only (ii) is TRUE. Answer (B).

• edited by
1 flag:
✌ Edit necessary (goku4199 “Answer is correct, but little bit thing is wrong, re-transmission timeout timer(RTO) can get activated at any point of time. It’s not necessary that only after data transfer, it will get activated.”)
14 14 votes

Statement-I: It is False.
The timeout value cannot be fixed for entire duration as it will turn timer to static timer, we need dynamic timer for timeout.
Statement-II: It is True.
Basic algorithm, Jacobson's algorithm, Karl's modification; these three algorithms are to be appropriate to RTT estimation algorithm used to set timeout value dynamically.
Statement-III: It is False.
Because timeout value is set to twice the propagation delay in data link layer where hop to hop distance is known, not in TCP layer.

1 1 vote

🔍 Statement Breakdown:

i. “The timeout value is set to the RTT measured during TCP connection establishment for the entire duration of the connection.” ❌ False — TCP doesn’t freeze the timeout at the initial RTT. It continuously updates RTT estimates using algorithms like Jacobson/Karels to adapt to network conditions.

ii. “Appropriate RTT estimation algorithm is used to set the timeout value of a TCP connection.” ✅ True — TCP uses Smoothed RTT (SRTT) and RTT variance to calculate Retransmission Timeout (RTO) dynamically.

iii. “Timeout value is set to twice the propagation delay from sender to receiver.” ❌ False — TCP doesn’t use raw propagation delay. It uses RTT (which includes both forward and backward delays) and variance. Doubling propagation delay is not a standard rule.

✅ Correct Option:

B. (i) and (iii) are false, but (ii) is true

Answer:
Position:
Show:

Related questions

62 62 votes
7 answers 7 answers
18.7k
18.7k views
Ishrat Jahan asked Oct 29, 2014
18,728 views
Consider a $TCP$ connection in a state where there are no outstanding $ACK$s. The sender sends two segments back to back. The sequence numbers of the first and second seg...
1 1 vote
2 2 answers
4.0k
4.0k views
Ishrat Jahan asked Oct 30, 2014
3,969 views
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is al...
3 3 votes
2 answers 2 answers
5.3k
5.3k views
Ishrat Jahan asked Oct 30, 2014
5,316 views
Consider a token ring topology with N stations (numbered 1 to N) running token ring protocol where the stations are equally spaced. When a station gets the token it is al...
28 28 votes
3 answers 3 answers
17.6k
17.6k views
Ishrat Jahan asked Oct 30, 2014
17,631 views
You are given the following four bytes : $$\begin{array}{| c | c | c | c |} \hline 10100011 & 00110111 & 11101001 & 10101011 \\\hline \end{array}$$ Which of the fol...