{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T05:36:43Z","timestamp":1782970603373,"version":"3.54.5"},"reference-count":23,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T00:00:00Z","timestamp":1298937600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Commun. ACM"],"published-print":{"date-parts":[[2011,3]]},"abstract":"<jats:p>To be agile and cost effective, data centers must allow dynamic resource allocation across large server pools. In particular, the data center network should provide a simple flat abstraction: it should be able to take any set of servers anywhere in the data center and give them the illusion that they are plugged into a physically separate, noninterfering Ethernet switch with as many ports as the service needs. To meet this goal, 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 s---sustaining a rate that is 94% of the maximum possible.<\/jats:p>","DOI":"10.1145\/1897852.1897877","type":"journal-article","created":{"date-parts":[[2011,3,1]],"date-time":"2011-03-01T20:14:26Z","timestamp":1299010466000},"page":"95-104","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":158,"title":["VL2"],"prefix":"10.1145","volume":"54","author":[{"given":"Albert","family":"Greenberg","sequence":"first","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"James R.","family":"Hamilton","sequence":"additional","affiliation":[{"name":"Amazon Web Services"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Navendu","family":"Jain","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Srikanth","family":"Kandula","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Changhoon","family":"Kim","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Parantap","family":"Lahiri","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"David A.","family":"Maltz","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Parveen","family":"Patel","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sudipta","family":"Sengupta","sequence":"additional","affiliation":[{"name":"Microsoft Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2011,3]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851191"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(01)00427-3"},{"key":"e_1_2_1_4_1","unstructured":"Cisco. Data center Ethernet. http:\/\/www.cisco.com\/go\/dce.  Cisco. Data center Ethernet. http:\/\/www.cisco.com\/go\/dce."},{"key":"e_1_2_1_5_1","volume-title":"Data center: Load balancing data center services","author":"Cisco","year":"2004","unstructured":"Cisco : Data center: Load balancing data center services , 2004 . Cisco: Data center: Load balancing data center services, 2004."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2821589"},{"key":"e_1_2_1_7_1","volume-title":"OSDI","author":"Dean J.","year":"2004","unstructured":"Dean , J. , Ghemawat , S. MapReduce: simplified data processing on large clusters . In OSDI ( 2004 ). Dean, J., Ghemawat, S. MapReduce: simplified data processing on large clusters. In OSDI (2004)."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/316188.316209"},{"key":"e_1_2_1_9_1","volume-title":"D., Meyer, D., Brimm, S. Locator\/ID Separation Protocol (LISP). Internet-draft","author":"Farinacci D.","year":"2008","unstructured":"Farinacci , D. , Fuller , V. , oran , D., Meyer, D., Brimm, S. Locator\/ID Separation Protocol (LISP). Internet-draft , Dec. 2008 . Farinacci, D., Fuller, V., oran, D., Meyer, D., Brimm, S. Locator\/ID Separation Protocol (LISP). Internet-draft, Dec. 2008."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1397718.1397732"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_2_1_14_1","volume-title":"Conference on Innovative Data Systems Research (Jan","author":"Hamilton J.","year":"2009","unstructured":"Hamilton , J. Cems : Low-cost, low-power servers for internetscale services . In Conference on Innovative Data Systems Research (Jan 2009 ). Hamilton, J. Cems: Low-cost, low-power servers for internetscale services. In Conference on Innovative Data Systems Research (Jan 2009)."},{"key":"e_1_2_1_15_1","volume-title":"The Art of Computer Systems Performance Analysis","author":"Jain R.","year":"1991","unstructured":"Jain , R. The Art of Computer Systems Performance Analysis . John Wiley and Sons, Inc. , 1991 . Jain, R. The Art of Computer Systems Performance Analysis. John Wiley and Sons, Inc., 1991."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644918"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402961"},{"key":"e_1_2_1_18_1","volume-title":"HotNets","author":"Kodialam M.","year":"2004","unstructured":"Kodialam , M. , Lakshman , T.V. , Sengupta , S. Efficient and robust routing of highly variable traffic . In HotNets ( 2004 ). Kodialam, M., Lakshman, T.V., Sengupta, S. Efficient and robust routing of highly variable traffic. In HotNets (2004)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/279227.279229"},{"key":"e_1_2_1_20_1","volume-title":"NSDI","author":"Mudigonda J.","year":"2010","unstructured":"Mudigonda , J. , Yalagandula , P. , Al-Fares , M. , Mogul , J.C. Spain: Cots data-center ethernet for multipathing over arbitrary topologies . In NSDI ( 2010 ). Mudigonda, J., Yalagandula, P., Al-Fares, M., Mogul, J.C. Spain: Cots data-center ethernet for multipathing over arbitrary topologies. In NSDI (2010)."},{"key":"e_1_2_1_21_1","first-page":"5556","author":"Touch J.","year":"2009","unstructured":"Touch , J. , Perlman , R. Transparent interconnection of lots of links (TRILL): Problem and applicability statement. IETF RFC 5556 ( 2009 ). Touch, J., Perlman, R. Transparent interconnection of lots of links (TRILL): Problem and applicability statement. IETF RFC 5556 (2009).","journal-title":"IETF RFC"},{"key":"e_1_2_1_22_1","volume-title":"OSDI","author":"Yu Y.","year":"2008","unstructured":"Yu , Y. , Isard , M. , Fetterly , D. , Budiu , M. , Erlingsson , U. , Gunda , P.K. , Currey , J. DryadLINQ: a system for general-purpose distributed data-parallel computing using a high-level language . In OSDI ( 2008 ). Yu, Y., Isard, M., Fetterly, D., Budiu, M., Erlingsson, U., Gunda, P.K., Currey, J. DryadLINQ: a system for general-purpose distributed data-parallel computing using a high-level language. In OSDI (2008)."},{"key":"e_1_2_1_23_1","volume-title":"HotNets","author":"Zhang-Shen R.","year":"2004","unstructured":"Zhang-Shen , R. , McKeown , N. Designing a Predictable Internet Backbone Network . In HotNets ( 2004 ). Zhang-Shen, R., McKeown, N. Designing a Predictable Internet Backbone Network. In HotNets (2004)."}],"container-title":["Communications of the ACM"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1897852.1897877","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1897852.1897877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:59:46Z","timestamp":1750244386000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1897852.1897877"}},"subtitle":["a scalable and flexible data center network"],"short-title":[],"issued":{"date-parts":[[2011,3]]},"references-count":23,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2011,3]]}},"alternative-id":["10.1145\/1897852.1897877"],"URL":"https:\/\/doi.org\/10.1145\/1897852.1897877","relation":{},"ISSN":["0001-0782","1557-7317"],"issn-type":[{"value":"0001-0782","type":"print"},{"value":"1557-7317","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,3]]},"assertion":[{"value":"2011-03-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}