a) So far, we have mostly discussed TCP\'s congestion control and AIMD in the co

Question

a) So far, we have mostly discussed TCP's congestion control and AIMD in the context of single-packet losses. This question examines how very long-lived TCP flows sending large amounts of data respond to 2-packet bursts of losses. For sake of simplicity, you should assume only data packets are lost (no acknowledgements are lost), the RTT is constant, the packet loss rate is independent of the transmission rate, and the drop rate is low enough that the congestion window can grow to be at least 8 segments before a loss. Furthermore, packet losses are periodic rather than probabilistic. For example, with a 2% packet loss rate, single packet losses will cause 49 packets to be successfully delivered, followed by one loss, while 2-packet bursts will lead to 98 successful delivered packets followed by 2 losses. Under these constraints, which of the following is true? Part 1: It might be helpful to walk through a simple case, such as the 2% case above. Hint: sketch the congestion window over time. a) TCP Tahoe will have lower throughput with 2-packet bursts of losses than evenly-spaced single losses b) TCP Tahoe will have higher throughput with 2-packet bursts of losses than evenly-spaced single losses Part 2: Assume that 1 in 256 of packets are lost (1 every 256 for single losses, 2 in 512 for double losses). Which of the following most closely describes the difference in throughput? a) They will be greatly different (the higher throughput one will be over twice as fast) b) They will be significantly different (the higher throughput one will be over 10% faster but less than 100%) c) They will be slightly different (the higher one will be over 1% faster but less than 10%)

Explanation / Answer

b) They will be significantly different (the higher throughput one will be over 10% faster but less than 100%)

Related Questions

Navigate

• Browse (All)
• Browse A
• Subjects

---

---

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.