On estimating end-to-end network path properties
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
The Eifel algorithm: making TCP robust against spurious retransmissions
ACM SIGCOMM Computer Communication Review
XORs in the air: practical wireless network coding
IEEE/ACM Transactions on Networking (TON)
On the properties of an adaptive TCP Minimum RTO
Computer Communications
Safe and effective fine-grained TCP retransmissions for datacenter communication
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Understanding TCP incast throughput collapse in datacenter networks
Proceedings of the 1st ACM workshop on Research on enterprise networking
Proceedings of the ACM SIGCOMM 2010 conference
Performance of Quantized Congestion Notification in TCP Incast Scenarios of Data Centers
MASCOTS '10 Proceedings of the 2010 IEEE International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems
ICTCP: Incast Congestion Control for TCP in data center networks
Proceedings of the 6th International COnference
A Probabilistic Approach to Address TCP Incast in Data Center Networks
ICDCSW '11 Proceedings of the 2011 31st International Conference on Distributed Computing Systems Workshops
A Random Linear Network Coding Approach to Multicast
IEEE Transactions on Information Theory
A switch-based approach to throughput collapse and starvation in data centers
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
When a TCP connection experiences a timeout, the sender must wait at least RTOmin (Minimum Retransmission Timeout) before doing the retransmission, during which the channel may be completely idle, undermining the throughput and channel efficiency. In this paper, we investigate the origin of RTOmin and find that it is needed to mitigate against spurious timeouts when the Delayed ACK (DA) scheme for TCP is implemented. Motivated by this observation, we propose a deployable and TCP-compatible new Delayed ACK (NDA) to replace the legacy DA. Our solution differs with previous work is that instead of using complex algorithms or fine-grained timer to tune RTOmin, we modify the DA scheme with minor changes to allow the sender to remove the RTOmin constraint while reserving the delayed ACK function at the receiver. In order to eliminate the aggressiveness of RTO (Retransmission Timeout) after removing RTOmin, we use coding techniques to encode the timeout retransmitted packets to make the potential spurious retransmissions useful. The simulation results demonstrate that in lossy wireless networks, NDA is efficient, because it achieves much higher TCP goodput and channel efficiency compared to DA. The gain we obtain by the use of NDA comes from two-order effects. One effect comes from removing the RTOmin constraint, because small RTO timer makes TCP react quickly to timeouts, resulting in small transmission idle. The other effect comes from eliminating consecutive RTO by allowing the receiver to acknowledge each timeout retransmission, which further reduces the RTO idle.