pFabric
Stanford University · International Computer Science Institute · +1 more institution
Abstract
In this paper we present pFabric, a minimalistic datacenter transport design that provides near theoretically optimal flow completion times even at the 99th percentile for short flows, while still minimizing average flow completion time for long flows. Moreover, pFabric delivers this performance with a very simple design that is based on a key conceptual insight: datacenter transport should decouple flow scheduling from rate control. For flow scheduling, packets carry a single priority number set independently by each flow; switches have very small buffers and implement a very simple priority-based scheduling/dropping mechanism. Rate control is also correspondingly simpler; flows start at line rate and…
Citation impact
- FWCI
- 142.95
- Percentile
- 100%
- References
- 23
Authors
7Topics & keywords
- Computer science
- Scheduling (production processes)
- Network packet
- Throttle
- Intuition
- Distributed computing
- Flow control (data)
- Computer network