The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
VL2: a scalable and flexible data center network
Abstract
To be agile and cost effective, data centers should allow dynamic resource allocation across large server pools. In particular, the data center network should enable any server to be assigned to any service. To meet these goals, we present VL2, a practical network architecture that scales to support huge data centers with uniform high capacity between servers, performance isolation between services, and Ethernet layer-2 semantics. VL2 uses (1) flat addressing to allow service instances to be placed anywhere in the network, (2) Valiant Load Balancing to spread traffic uniformly across network paths, and (3) end-system based address resolution to scale to large server pools, without introducing complexity to the network control plane. VL2's design is driven by detailed measurements of traffic and fault data from a large operational cloud service provider. VL2's implementation leverages proven network technologies, already available at low cost in high-speed hardware implementations, to build a scalable and reliable network architecture. As a result, VL2 networks can be deployed today, and we have built a working prototype. We evaluate the merits of the VL2 design using measurement, analysis, and experiments. Our VL2 prototype shuffles 2.7 TB of data among 75 servers in 395 seconds - sustaining a rate that is 94% of the maximum possible.
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
Principles and Practices of Interconnection Networks
Dally, W. J., & Towles, B. (2004) · CERN Document Server (European Organization for Nuclear Research) · Cited by 3,735
Lamport, L. (1998) · ACM Transactions on Computer Systems · doi:10.1145/279227.279229 · Cited by 2,737
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
BCube: a high performance, server-centric network architecture for modular data centers
Guo, C., Lu, G., Li, D., Wu, H., Zhang, X., Shi, Y., Tian, C., Zhang, Y., & Lu, S. (2009) · Proceedings of the ACM SIGCOMM 2009 conference on Data communication · doi:10.1145/1592568.1592577 · Cited by 1,372
The art of computer systems performance analysis
Chlamtac, I. (1992) · Journal of Molecular Graphics · doi:10.1016/0263-7855(92)80055-i · Cited by 1,020
TCP Friendly Rate Control (TFRC): Protocol Specification
Handley, M. J., Floyd, S., Padhye, J. D., & Widmer, J. (2003) · doi:10.17487/rfc3448 · Cited by 927
Dcell: a scalable and fault-tolerant network structure for data centers
Guo, C., Wu, H., Tan, K., Shi, L., Zhang, Y., & Lu, S. (2008) · Proceedings of the ACM SIGCOMM 2008 conference on Data communication · doi:10.1145/1402958.1402968 · Cited by 563
Walking the tightrope: responsive yet stable traffic engineering
Kandula, S., Katabi, D., Davie, B., & Charny, A. (2005) · Proceedings of the 2005 conference on Applications, technologies, architectures, and protocols for computer communications · doi:10.1145/1080091.1080122 · Cited by 352
Self-citationA parameterizable methodology for Internet traffic flow profiling
Claffy, K. C., Braun, H.-W., & Polyzos, G. C. (1995) · IEEE Journal on Selected Areas in Communications · doi:10.1109/49.464717 · Cited by 330
Towards a next generation data center architecture: scalability and commoditization
Greenberg, A. G., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S. (2008) · doi:10.1145/1397718.1397732 · Cited by 247
Self-citation
Cited by
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
Self-citationXORing elephants: novel erasure codes for big data
Sathiamoorthy, M., Asteris, M., Papailiopoulos, D., Dimakis, A. G., Vadali, R., Chen, S., & Borthakur, D. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2535573.2488339 · Cited by 689
Recent advances in optical technologies for data centers: a review
Cheng, Q., Bahadori, M., Glick, M., Rumley, S., & Bergman, K. (2018) · Optica · doi:10.1364/optica.5.001354 · Cited by 669
Verma, S., Kawamoto, Y., Fadlullah, Z. M., Nishiyama, H., & Kato, N. (2017) · IEEE Communications Surveys & Tutorials · doi:10.1109/comst.2017.2694469 · Cited by 422
The Internet of Things, Fog and Cloud continuum: Integration and challenges
Bittencourt, L., Immich, R., Sakellariou, R., Fonseca, N., Madeira, E., Curado, M., Villas, L., DaSilva, L., Lee, C., & Rana, O. (2018) · Internet of Things · doi:10.1016/j.iot.2018.09.005 · Cited by 370
A Manifesto for Future Generation Cloud Computing: Research Directions for the Next Decade
Buyya, R., Srirama, S. N., Casale, G., Calheiros, R., Simmhan, Y., Varghese, B., Gelenbe, E., Javadi, B., Vaquero, L. M., Netto, M. A. S., et al. (2019) · ACM Computing Surveys · doi:10.1145/3241737 · Cited by 362
SoftCell: scalable and flexible cellular core network architecture
Jin, X., Li, L. E., Vanbever, L., & Rexford, J. (2013) · Proceedings of the ninth ACM conference on Emerging networking experiments and technologies · doi:10.1145/2535372.2535377 · Cited by 359
Understanding network failures in data centers: measurement, analysis, and implications
Gill, P., Jain, N., & Nagappan, N. (2011) · ACM SIGCOMM Computer Communication Review · doi:10.1145/2043164.2018477 · Cited by 304
Self-citationA bibliometric approach to tracking big data research trends
Kalantari, A., Kamsin, A., Kamaruddin, H. S., Ale Ebrahim, N., Gani, A., Ebrahimi, A., & Shamshirband, S. (2017) · Journal of Big Data · doi:10.1186/s40537-017-0088-1 · Cited by 300
ProjecToR: Agile Reconfigurable Data Center Interconnect
Ghobadi, M., Mahajan, R., Phanishayee, A., Devanur, N., Kulkarni, J., Ranade, G., Blanche, P.-A., Rastegarfar, H., Glick, M., & Kilper, D. (2016) · Proceedings of the 2016 ACM SIGCOMM Conference · doi:10.1145/2934872.2934911 · Cited by 286
Pham, C., Tran, N. H., Ren, S., Saad, W., & Hong, C. S. (2020) · IEEE Transactions on Services Computing · doi:10.1109/tsc.2017.2671867 · Cited by 260
The Internet of Things: A Review of Enabled Technologies and Future Challenges
Ud Din, I., Guizani, M., Hassan, S., Kim, B.-S., Khurram Khan, M., Atiquzzaman, M., & Ahmed, S. H. (2019) · IEEE Access · doi:10.1109/access.2018.2886601 · Cited by 254
Toward Delay-Efficient Game-Aware Data Centers for Cloud Gaming
Amiri, M., Osman, H. A., Shirmohammadi, S., & Abdallah, M. (2016) · ACM Transactions on Multimedia Computing, Communications, and Applications · doi:10.1145/2983639 · Cited by 40
Network-Aware Virtual Machine Placement and Migration in Cloud Data Centers
Ferdaus, M. H., Murshed, M., Calheiros, R. N., & Buyya, R. (2015) · Advances in Systems Analysis, Software Engineering, and High Performance Computing · doi:10.4018/978-1-4666-8213-9.ch002 · Cited by 38
Hierarchical CORD for NFV Datacenters: Resource Allocation with Cost-Latency Tradeoff
Lin, Y.-D., Wang, C.-C., Huang, C.-Y., & Lai, Y.-C. (2018) · IEEE Network · doi:10.1109/mnet.2017.1700037 · Cited by 18
Optimal Allocation of Virtual Machines in Cloud Computing
Lin, M.-H., Tsai, J.-F., Hu, Y.-C., & Su, T.-H. (2018) · Symmetry · doi:10.3390/sym10120756 · Cited by 7
Metadata
- Authors
- Greenberg, A., Hamilton, J. R., Jain, N., Kandula, S., Kim, C., Lahiri, P., Maltz, D. A., Patel, P., & Sengupta, S.
- Venue
- ACM SIGCOMM Computer Communication Review
- Published
- 2009-08-16
- Volume
- 39
- Issue
- 4
- Pages
- 51-62
- ISSN
- 0146-4833 (ISSN-L)
- OpenAlex
- W4237515752
- Cited by
- 711
- References
- 11
- FWCI
- 25.26
- Type
- journal article
- 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.