Why TCP timers don't work well
SIGCOMM '86 Proceedings of the ACM SIGCOMM conference on Communications architectures & protocols
Congestion avoidance and control
SIGCOMM '88 Symposium proceedings on Communications architectures and protocols
Random drop congestion control
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
RR-TCP: A Reordering-Robust TCP with DSACK
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
The Panasas ActiveScale Storage Cluster: Delivering Scalable High Bandwidth Storage
Proceedings of the 2004 ACM/IEEE conference on Supercomputing
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
VL2: a scalable and flexible data center network
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
BCube: a high performance, server-centric network architecture for modular data centers
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Safe and effective fine-grained TCP retransmissions for datacenter communication
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Understanding data center traffic characteristics
Proceedings of the 1st ACM workshop on Research on enterprise networking
The nature of data center traffic: measurements & analysis
Proceedings of the 9th ACM SIGCOMM conference on Internet measurement conference
An Analysis of Traces from a Production MapReduce Cluster
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Hedera: dynamic flow scheduling for data center networks
NSDI'10 Proceedings of the 7th USENIX conference on Networked systems design and implementation
ICTCP: Incast Congestion Control for TCP in data center networks
Proceedings of the 6th International COnference
Profiling network performance for multi-tier data center applications
Proceedings of the 8th USENIX conference on Networked systems design and implementation
Better never than late: meeting deadlines in datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Improving datacenter performance and robustness with multipath TCP
Proceedings of the ACM SIGCOMM 2011 conference
On the efficacy of fine-grained traffic splitting protocolsin data center networks
Proceedings of the ACM SIGCOMM 2011 conference
Less is more: trading a little bandwidth for ultra-low latency in the data center
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
The TCP outcast problem: exposing unfairness in data center networks
NSDI'12 Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation
Deadline-aware datacenter tcp (D2TCP)
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Finishing flows quickly with preemptive scheduling
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
pFabric: minimal near-optimal datacenter transport
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Hi-index | 0.00 |
An increasing number of TCP performance issues including TCP Incast, TCP Outcast, and long query completion times are common in large-scale data centers. We demonstrate that the root cause of these problems is that existing techniques are unable to maintain self-clocking or to achieve accurate and rapid packet loss notification. We present cutting payload (CP), a mechanism that simply drops a packet's payload at an overloaded switch, and a SACK-like precise ACK (PACK) mechanism to accurately inform senders about lost packets. Experiments demonstrate that CP successfully addresses the root cause of TCP performance issues. Furthermore, CP works well with other TCP variants used in data center networks.