Journal of Algorithms
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
Safe and effective fine-grained TCP retransmissions for datacenter communication
Proceedings of the ACM SIGCOMM 2009 conference on Data communication
Proceedings of the ACM SIGCOMM 2010 conference
Better never than late: meeting deadlines in datacenter 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
Workload analysis of a large-scale key-value store
Proceedings of the 12th ACM SIGMETRICS/PERFORMANCE joint international conference on Measurement and Modeling of Computer Systems
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
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
Small is better: avoiding latency traps in virtualized data centers
Proceedings of the 4th annual Symposium on Cloud Computing
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
How to improve your network performance by asking your provider for worse service
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
Towards minimal-delay deadline-driven data center TCP
Proceedings of the Twelfth ACM Workshop on Hot Topics in Networks
High throughput data center topology design
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
Recursively cautious congestion control
NSDI'14 Proceedings of the 11th USENIX Conference on Networked Systems Design and Implementation
| Hi-index | 0.00 |
We present, pFabric, a minimalistic datacenter fabric design that provides near-optimal performance in terms of completion time for high-priority flows and overall network utilization. pFabric's design eliminates nearly all buffering on switches (switches have only ~20KB of buffering per port), requires almost no congestion control and uses only simple mechanisms at each switch. Specifically, switches are only required to locally and greedily decide what packets to schedule and drop according to priorities in the packet header and do not maintain any flow state or rate estimates. Rate-control is almost unnecessary, all flows start at line-rate and only slow down in the extreme case of congestion collapse. We show via simulations using realistic workloads and topologies that this simple design achieves near optimal flow completion times and network utilization.