Suppose that when a TCP segment is sent more than once, we take SampleRTT to be the time between the original transmission and the ACK, as in Figure 5.10(a). Show that if a connection with a one-packet window loses every other packet (i.e., each packet is transmitted twice), then EstimatedRTT increases to infinity. Assume TimeOut =

EstimatedRTT; both algorithms presented in the text always set TimeOut even larger. Hint: EstimatedRTT = EstimatedRTT+β×(SampleRTT−

EstimatedRTT).