Random early detection gateways for congestion avoidance
IEEE/ACM Transactions on Networking (TON)
The synchronization of periodic routing messages
IEEE/ACM Transactions on Networking (TON)
Network support for multimedia: a discussion of the Tenet approach
Computer Networks and ISDN Systems - Special issue on a multi-dimensional view of multimedia
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
TCP-Real: receiver-oriented congestion control
Computer Networks: The International Journal of Computer and Telecommunications Networking
Digital Video and HDTV Algorithms and Interfaces
Digital Video and HDTV Algorithms and Interfaces
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
Policing congestion response in an internetwork using re-feedback
Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications
CUBIC: a new TCP-friendly high-speed TCP variant
ACM SIGOPS Operating Systems Review - Research and developments in the Linux kernel
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
Power management of online data-intensive services
Proceedings of the 38th annual international symposium on Computer architecture
Better never than late: meeting deadlines in datacenter networks
Proceedings of the ACM SIGCOMM 2011 conference
Deconstructing datacenter packet transport
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference
Deadline-aware data plane for internet video
Proceedings of the 2012 ACM conference on CoNEXT student workshop
Adaptive parallelism for web search
Proceedings of the 8th ACM European Conference on Computer Systems
Bobtail: avoiding long tails in the cloud
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
FCP: a flexible transport framework for accommodating diversity
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
pFabric: minimal near-optimal datacenter transport
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
R2D2: bufferless, switchless data center networks using commodity ethernet hardware
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Small is better: avoiding latency traps in virtualized data centers
Proceedings of the 4th annual Symposium on Cloud Computing
Explicit multipath congestion control for data center networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Plinko: building provably resilient forwarding tables
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Catch the whole lot in an action: rapid precise packet loss notification in data centers
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
Hi-index | 0.00 |
An important class of datacenter applications, called Online Data-Intensive (OLDI) applications, includes Web search, online retail, and advertisement. To achieve good user experience, OLDI applications operate under soft-real-time constraints (e.g., 300 ms latency) which imply deadlines for network communication within the applications. Further, OLDI applications typically employ tree-based algorithms which, in the common case, result in bursts of children-to-parent traffic with tight deadlines. Recent work on datacenter network protocols is either deadline-agnostic (DCTCP) or is deadline-aware (D3) but suffers under bursts due to race conditions. Further, D3 has the practical drawbacks of requiring changes to the switch hardware and not being able to coexist with legacy TCP. We propose Deadline-Aware Datacenter TCP (D2TCP), a novel transport protocol, which handles bursts, is deadline-aware, and is readily deployable. In designing D2TCP, we make two contributions: (1) D2TCP uses a distributed and reactive approach for bandwidth allocation which fundamentally enables D2TCP's properties. (2) D2TCP employs a novel congestion avoidance algorithm, which uses ECN feedback and deadlines to modulate the congestion window via a gamma-correction function. Using a small-scale implementation and at-scale simulations, we show that D2TCP reduces the fraction of missed deadlines compared to DCTCP and D3 by 75% and 50%, respectively.