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)
SEDA: an architecture for well-conditioned, scalable internet services
SOSP '01 Proceedings of the eighteenth ACM symposium on Operating systems principles
Congestion control for high bandwidth-delay product networks
Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications
MapReduce: simplified data processing on large clusters
OSDI'04 Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6
Scheduling deadline-constrained bulk data transfers to minimize network congestion
CCGRID '07 Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid
Dryad: distributed data-parallel programs from sequential building blocks
Proceedings of the 2nd ACM SIGOPS/EuroSys European Conference on Computer Systems 2007
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
Rate control protocol (rcp): congestion control to make flows complete quickly
Rate control protocol (rcp): congestion control to make flows complete quickly
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Dcell: a scalable and fault-tolerant network structure for data centers
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Controlled experiments on the web: survey and practical guide
Data Mining and Knowledge Discovery
VL2: a scalable and flexible data center network
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 TCP incast throughput collapse in datacenter networks
Proceedings of the 1st ACM workshop on Research on enterprise networking
Symbiotic routing in future data centers
Proceedings of the ACM SIGCOMM 2010 conference
Proceedings of the ACM SIGCOMM 2010 conference
Finding a needle in Haystack: facebook's photo storage
OSDI'10 Proceedings of the 9th USENIX conference on Operating systems design and implementation
A guided tour of data-center networking
Communications of the ACM
A Guided Tour through Data-center Networking
Queue - Networks
Hot-ICE'12 Proceedings of the 2nd USENIX conference on Hot Topics in Management of Internet, Cloud, and Enterprise Networks and Services
Pricing cloud bandwidth reservations under demand uncertainty
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
Reviving delay-based TCP for data centers
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
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
DeTail: reducing the flow completion time tail in datacenter networks
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Mirror mirror on the ceiling: flexible wireless links for data centers
Proceedings of the ACM SIGCOMM 2012 conference on Applications, technologies, architectures, and protocols for computer communication
Why let resources idle? aggressive cloning of jobs with dolly
HotCloud'12 Proceedings of the 4th USENIX conference on Hot Topics in Cloud Ccomputing
Reviving delay-based TCP for data centers
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Deadline-aware datacenter tcp (D2TCP)
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Finishing flows quickly with preemptive scheduling
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
DeTail: reducing the flow completion time tail in datacenter networks
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Mirror mirror on the ceiling: flexible wireless links for data centers
ACM SIGCOMM Computer Communication Review - Special october issue SIGCOMM '12
Design and implementation of an intelligent end-to-end network QoS system
SC '12 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Coflow: a networking abstraction for cluster applications
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Deconstructing datacenter packet transport
Proceedings of the 11th ACM Workshop on Hot Topics in Networks
Cake: enabling high-level SLOs on shared storage systems
Proceedings of the Third ACM Symposium on Cloud Computing
Proceedings of the 9th Middleware Doctoral Symposium of the 13th ACM/IFIP/USENIX International Middleware Conference
Demand-aware flow allocation in data center networks
Proceedings of the 2012 ACM workshop on Capacity sharing
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
Ensuring connectivity via data plane mechanisms
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Bobtail: avoiding long tails in the cloud
nsdi'13 Proceedings of the 10th USENIX conference on Networked Systems Design and Implementation
Participatory networking: an API for application control of SDNs
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
FCP: a flexible transport framework for accommodating diversity
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Achieving high utilization with software-driven WAN
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Proceedings of the ACM SIGCOMM 2013 conference on SIGCOMM
Speeding up distributed request-response workflows
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
Pushing CDN-ISP collaboration to the limit
ACM SIGCOMM Computer Communication Review
Small is better: avoiding latency traps in virtualized data centers
Proceedings of the 4th annual Symposium on Cloud Computing
Harmony: coordinating network, compute, and storage in software-defined clouds
Proceedings of the 4th annual Symposium on Cloud Computing
Per-packet load-balanced, low-latency routing for clos-based data center networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Explicit multipath congestion control for data center networks
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
Towards minimal-delay deadline-driven data center TCP
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
SENIC: scalable NIC for end-host rate limiting
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.02 |
The soft real-time nature of large scale web applications in today's datacenters, combined with their distributed workflow, leads to deadlines being associated with the datacenter application traffic. A network flow is useful, and contributes to application throughput and operator revenue if, and only if, it completes within its deadline. Today's transport pro- tocols (TCP included), given their Internet origins, are agnostic to such flow deadlines. Instead, they strive to share network resources fairly. We show that this can hurt application performance. Motivated by these observations, and other (previously known) deficiencies of TCP in the datacenter environment, this paper presents the design and implementation of D3, a deadline-aware control protocol that is customized for the datacenter environment. D3 uses explicit rate control to apportion bandwidth according to flow deadlines. Evaluation from a 19-node, two-tier datacenter testbed shows that D3, even without any deadline information, easily outper- forms TCP in terms of short flow latency and burst tolerance. Further, by utilizing deadline information, D3 effectively doubles the peak load that the datacenter network cansupport.