4. Although slow start with congestion avoidance is an effective technique for coping with congestion, it can result in long recovery times in high-speed networks a. Assume a roundtrip time delay of 100 ms (about what might occur across a continent) and a link with an available bandwidth of 600 Mbps and a segment size of 3000 bits. Determine the window size needed to keep the pipe full. Now, suppose that TCP has reached that window size and then a time out occurs Compute the time that will take to get back to that window size after the timeout, assuming that there are no losses and that every packet is acked As in part (a), assume that TCP has reached the maximum window size required to keep the pipe full, and then a time out occurs. Compute the minimum segment size required to guarantee that the time to reach the maximum window size after the time out is no more than 1.0 s. Again, assume that there are no losses after the time out and that every packet is acked b. 4. Although slow start with congestion avoidance is an effective technique for coping with congestion, it can result in long recovery times in high-speed networks a. Assume a roundtrip time delay of 100 ms (about what might occur across a continent) and a link with an available bandwidth of 600 Mbps and a segment size of 3000 bits. Determine the window size needed to keep the pipe full. Now, suppose that TCP has reached that window size and then a time out occurs Compute the time that will take to get back to that window size after the timeout, assuming that there are no losses and that every packet is acked As in part (a), assume that TCP has reached the maximum window size required to keep the pipe full, and then a time out occurs. Compute the minimum segment size required to guarantee that the time to reach the maximum window size after the time out is no more than 1.0 s. Again, assume that there are no losses after the time out and that every packet is acked b