The DOI matches its Crossref record; 29 of the 29 references it cites were found in a registry or an index.
DRILL: Micro Load Balancing for Low-latency Data Center Networks
Abstract
The trend towards simple datacenter network fabric strips most network functionality, including load balancing, out of the network core and pushes it to the edge. This slows reaction to microbursts, the main culprit of packet loss in datacenters. We investigate the opposite direction: could slightly smarter fabric significantly improve load balancing? This paper presents DRILL, a datacenter fabric for Clos networks which performs micro load balancing to distribute load as evenly as possible on microsecond timescales. DRILL employs per-packet decisions at each switch based on local queue occupancies and randomized algorithms to distribute load. Our design addresses the resulting key challenges of packet reordering and topological asymmetry. In simulations with a detailed switch hardware model and realistic workloads, DRILL outperforms recent edge-based load balancers, particularly under heavy load. Under 80% load, for example, it achieves 1.3-1.4x lower mean flow completion time than recent proposals, primarily due to shorter upstream queues. To test hardware feasibility, we implement DRILL in Verilog and estimate its area overhead to be less than 1%. Finally, we analyze DRILL's stability and throughput-efficiency.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1402946.1402967 · Cited by 3,175
Allman, M., Paxson, V., & Blanton, E. (2009) · doi:10.17487/rfc5681 · Cited by 2,523
Network traffic characteristics of data centers in the wild
Benson, T., Akella, A., & Maltz, D. A. (2010) · Proceedings of the 10th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1879141.1879175 · Cited by 2,214
Alizadeh, M., Greenberg, A., Maltz, D. A., Padhye, J., Patel, P., Prabhakar, B., Sengupta, S., & Sridharan, M. (2010) · Proceedings of the ACM SIGCOMM 2010 conference · doi:10.1145/1851182.1851192 · Cited by 1,877
A scalable, commodity data center network architecture
Al-Fares, M., Loukissas, A., & Vahdat, A. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402967 · Cited by 1,679
Hedera: dynamic flow scheduling for data center networks
Al-Fares, M., Radhakrishnan, S., Raghavan, B., Huang, N., & Vahdat, A. M. (2010) · doi:10.5555/1855711.1855730 · Cited by 1,450
The power of two choices in randomized load balancing
Mitzenmacher, M. (2001) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/71.963420 · Cited by 1,399
Fat-trees: Universal networks for hardware-efficient supercomputing
Leiserson, C. E. (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.6312192 · Cited by 1,325
The nature of data center traffic: measurements & analysis
Kandula, S., Sengupta, S., Greenberg, A., Patel, P., & Chaiken, R. (2009) · Proceedings of the 9th ACM SIGCOMM conference on Internet measurement · doi:10.1145/1644893.1644918 · Cited by 1,030
PortLand: a scalable fault-tolerant layer 2 data center network fabric
Niranjan Mysore, R., Pamboris, A., Farrington, N., Huang, N., Miri, P., Radhakrishnan, S., Subramanya, V., & Vahdat, A. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592575 · Cited by 929
Inside the Social Network's (Datacenter) Network
Roy, A., Zeng, H., Bagga, J., Porter, G., & Snoeren, A. C. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787472 · Cited by 849
Understanding network failures in data centers: measurement, analysis, and implications
Gill, P., Jain, N., & Nagappan, N. (2011) · Proceedings of the ACM SIGCOMM 2011 conference · doi:10.1145/2018436.2018477 · Cited by 714
(2014) · SIAM Journal on Computing · doi:10.1137/sicomp · Cited by 618
MicroTE: fine grained traffic engineering for data centers
Benson, T., Anand, A., Akella, A., & Zhang, M. (2011) · Proceedings of the Seventh COnference on emerging Networking EXperiments and Technologies · doi:10.1145/2079296.2079304 · Cited by 604
Jupiter Rising: A Decade of Clos Topologies and Centralized Control in Google's Datacenter Network
Singh, A., Ong, J., Agarwal, A., Anderson, G., Armistead, A., Bannon, R., Boving, S., Desai, G., Felderman, B., Germano, P., et al. (2015) · Proceedings of the 2015 ACM Conference on Special Interest Group on Data Communication · doi:10.1145/2785956.2787508 · Cited by 556
Understanding data center traffic characteristics
Benson, T., Anand, A., Akella, A., & Zhang, M. (2010) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1672308.1672325 · Cited by 548
Safe and effective fine-grained TCP retransmissions for datacenter communication
Vasudevan, V., Phanishayee, A., Shah, H., Krevat, E., Andersen, D. G., Ganger, G. R., Gibson, G. A., & Mueller, B. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592604 · Cited by 427
Dynamic load balancing without packet reordering
Kandula, S., Katabi, D., Sinha, S., & Berger, A. (2007) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1232919.1232925 · Cited by 402
Mahout: Low-overhead datacenter traffic management using end-host-based elephant detection
Curtis, A. R., Kim, W., & Yalagandula, P. (2011) · 2011 Proceedings IEEE INFOCOM · doi:10.1109/infcom.2011.5934956 · Cited by 402
Jellyfish: Networking Data Centers Randomly
Singla, A., Hong, C.-Y., Popa, L., & Godfrey, P. B. (2011) · arXiv (Cornell University) · doi:10.48550/arxiv.1110.1687 · Cited by 357
Self-citationProgrammable Packet Scheduling at Line Rate
Sivaraman, A., Subramanian, S., Alizadeh, M., Chole, S., Chuang, S.-T., Agrawal, A., Balakrishnan, H., Edsall, T., Katti, S., & McKeown, N. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934899 · Cited by 276
Measurement and analysis of TCP throughput collapse in cluster-based storage systems
Phanishayee, A., Krevat, E., Vasudevan, V., Andersen, D. G., Ganger, G. R., Gibson, G. A., & Seshan, S. (2008) · File and Storage Technologies · Cited by 258
Implementing an OpenFlow switch on the NetFPGA platform
Naous, J., Erickson, D., Covington, G. A., Appenzeller, G., & McKeown, N. (2008) · Proceedings of the 4th ACM/IEEE Symposium on Architectures for Networking and Communications Systems · doi:10.1145/1477942.1477944 · Cited by 232
F10: a fault-tolerant engineered network
Liu, V., Halperin, D., Krishnamurthy, A., & Anderson, T. E. (2013) · Networked Systems Design and Implementation · Cited by 228
Fabric: a retrospective on evolving SDN
Casado, M., Koponen, T., Shenker, S., & Tootoonchian, A. (2012) · Proceedings of the first workshop on Hot topics in software defined networks · doi:10.1145/2342441.2342459 · Cited by 223
WCMP: weighted cost multipathing for improved fairness in data centers
Zhou, J., Tewari, M., Zhu, M., Kabbani, A., Poutievski, L., Singh, A., & Vahdat, A. (2014) · Proceedings of the Ninth European Conference on Computer Systems · doi:10.1145/2592798.2592803 · Cited by 215
Evolve or Die: High-Availability Design Principles Drawn from Googles Network Infrastructure
Govindan, R., Minei, I., Kallahalla, M., Koley, B., & Vahdat, A. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934891 · Cited by 215
Modeling and understanding TCP incast in data center networks
Zhang, J., Ren, F., & Lin, C. (2011) · IEEE Conference on Computer Communications (INFOCOM) · doi:10.1109/infcom.2011.5934923 · Cited by 86
Inside Cisco IOS Software Architecture
Bollapragada, V., White, R., & Murphy, C. (2000) · CERN Document Server (European Organization for Nuclear Research) · Cited by 34
Cited by
Revisiting network support for RDMA
Mittal, R., Shpiner, A., Panda, A., Zahavi, E., Krishnamurthy, A., Ratnasamy, S., & Shenker, S. (2018) · Proceedings of the 2018 Conference of the ACM Special Interest Group on Data Communication · doi:10.1145/3230543.3230557 · Cited by 258
Metadata
- Authors
- Ghorbani, S., Yang, Z., Godfrey, P. B., Ganjali, Y., & Firoozshahian, A.
- Venue
- Proceedings of the Conference of the ACM Special Interest Group on Data Communication
- Publisher
- ACM
- Published
- 2017-08-07
- Pages
- 225-238
- OpenAlex
- W2744567246
- Cited by
- 271
- References
- 29
- FWCI
- 16.00
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.