{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T17:53:34Z","timestamp":1775066014288,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2008,8,17]],"date-time":"2008-08-17T00:00:00Z","timestamp":1218931200000},"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":[],"published-print":{"date-parts":[[2008,8,17]]},"DOI":"10.1145\/1402958.1402968","type":"proceedings-article","created":{"date-parts":[[2008,8,19]],"date-time":"2008-08-19T08:38:39Z","timestamp":1219135119000},"page":"75-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":542,"title":["Dcell"],"prefix":"10.1145","author":[{"given":"Chuanxiong","family":"Guo","sequence":"first","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Haitao","family":"Wu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Kun","family":"Tan","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Lei","family":"Shi","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Yongguang","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Songwu","family":"Lu","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]}],"member":"320","published-online":{"date-parts":[[2008,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.21148"},{"key":"e_1_3_2_1_2_1","volume-title":"The Calculating Predator","author":"Arnold S.","year":"2007","unstructured":"S. Arnold . Google Version 2.0 : The Calculating Predator , 2007 . Infonortics Ltd . S. Arnold. Google Version 2.0: The Calculating Predator, 2007. Infonortics Ltd."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_3_2_1_4_1","volume-title":"Do It Green: Media Interview with Michael Manos","author":"Carter A.","year":"2007","unstructured":"A. Carter . Do It Green: Media Interview with Michael Manos , 2007 . http:\/\/edge.technet.com\/Media\/Doing-IT-Green\/. A. Carter. Do It Green: Media Interview with Michael Manos, 2007. http:\/\/edge.technet.com\/Media\/Doing-IT-Green\/."},{"key":"e_1_3_2_1_5_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat . MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04 , 2004 . J. Dean and S. Ghemawat. MapReduce: Simplified Data Processing on Large Clusters. In OSDI'04, 2004."},{"key":"e_1_3_2_1_6_1","volume-title":"Morgan Kaufmann","author":"Duato J.","year":"2003","unstructured":"J. Duato , S. Yalamanchili , and L. Ni . Interconnection networks: an engineering approach . Morgan Kaufmann , 2003 . J. Duato, S. Yalamanchili, and L. Ni. Interconnection networks: an engineering approach. Morgan Kaufmann, 2003."},{"key":"e_1_3_2_1_7_1","volume-title":"Bigtable: A Distributed Storage System for Structured Data. In OSDI'06","author":"F. Chang","year":"2006","unstructured":"F. Chang et. al. Bigtable: A Distributed Storage System for Structured Data. In OSDI'06 , 2006 . F. Chang et. al. Bigtable: A Distributed Storage System for Structured Data. In OSDI'06, 2006."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_9_1","unstructured":"T. Hoff. Google Architecture July 2007. http:\/\/highscalability.com\/google-architecture.  T. Hoff. Google Architecture July 2007. http:\/\/highscalability.com\/google-architecture."},{"key":"e_1_3_2_1_10_1","unstructured":"Intel. High-Performance 1000BASE-SX and 1000BASE-LX Gigabit Fiber Connections for Servers. http:\/\/www.intel.com\/network\/connectivity\/resources\/doc_library\/data_sheets\/pro1000mf_mf-lx.pdf.  Intel. High-Performance 1000BASE-SX and 1000BASE-LX Gigabit Fiber Connections for Servers. http:\/\/www.intel.com\/network\/connectivity\/resources\/doc_library\/data_sheets\/pro1000mf_mf-lx.pdf."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1272996.1273005"},{"key":"e_1_3_2_1_12_1","volume-title":"Trees. Hypercubes. Morgan Kaufmann","author":"Leighton F.","year":"1992","unstructured":"F. Leighton . Introduction to Parallel Algorithms and Architectures: Arrays . Trees. Hypercubes. Morgan Kaufmann , 1992 . F. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays. Trees. Hypercubes. Morgan Kaufmann, 1992."},{"key":"e_1_3_2_1_13_1","volume-title":"Oct-Dec","author":"Liszka K.","year":"1997","unstructured":"K. Liszka , J. Antonio , and H. Siegel . Is an Alligator Better Than an Armadillo? IEEE Concurrency , Oct-Dec 1997 . K. Liszka, J. Antonio, and H. Siegel. Is an Alligator Better Than an Armadillo? IEEE Concurrency, Oct-Dec 1997."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863999"},{"key":"e_1_3_2_1_15_1","first-page":"2328","volume":"2","year":"1998","unstructured":"J. Moy. OSPF Version 2 , April 1998 . RFC 2328 . J. Moy. OSPF Version 2, April 1998. RFC 2328.","journal-title":"J. Moy. OSPF Version"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/2.191995"},{"key":"e_1_3_2_1_17_1","volume-title":"Introduction to Parallel Processing: Algorithms and Architectures","author":"Parhami B.","year":"2002","unstructured":"B. Parhami . Introduction to Parallel Processing: Algorithms and Architectures . Kluwer Academic , 2002 . B. Parhami. Introduction to Parallel Processing: Algorithms and Architectures. Kluwer Academic, 2002."},{"key":"e_1_3_2_1_18_1","unstructured":"Jon Postel. Internet Protocol. RFC 791.  Jon Postel. Internet Protocol. RFC 791."},{"key":"e_1_3_2_1_19_1","volume-title":"Powering the Yahoo! network","author":"Rabbe L.","year":"2006","unstructured":"L. Rabbe . Powering the Yahoo! network , 2006 . http:\/\/yodel.yahoo.com\/2006\/11\/27\/powering-the-yahoo-network\/. L. Rabbe. Powering the Yahoo! network, 2006. http:\/\/yodel.yahoo.com\/2006\/11\/27\/powering-the-yahoo-network\/."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383072"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of the IEEE","author":"Seigel H. Jay","year":"1989","unstructured":"H. Jay Seigel , W. Nation , C. Kruskal , and L. Napolitando . Using the Multistage Cube Network Topology in Parallel Supercomputers . Proceedings of the IEEE , Dec 1989 . H. Jay Seigel, W. Nation, C. Kruskal, and L. Napolitando. Using the Multistage Cube Network Topology in Parallel Supercomputers. Proceedings of the IEEE, Dec 1989."},{"key":"e_1_3_2_1_22_1","volume-title":"Microsoft: Datacenter Growth Defies Moore's Law","author":"Snyder J.","year":"2007","unstructured":"J. Snyder . Microsoft: Datacenter Growth Defies Moore's Law , 2007 . http:\/\/www.pcworld.com\/article\/id,130921\/article.html. J. Snyder. Microsoft: Datacenter Growth Defies Moore's Law, 2007. http:\/\/www.pcworld.com\/article\/id,130921\/article.html."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/383059.383071"}],"event":{"name":"SIGCOMM '08: ACM SIGCOMM 2008 Conference","location":"Seattle WA USA","acronym":"SIGCOMM '08","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the ACM SIGCOMM 2008 conference on Data communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1402958.1402968","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1402958.1402968","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T10:47:19Z","timestamp":1750243639000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1402958.1402968"}},"subtitle":["a scalable and fault-tolerant network structure for data centers"],"short-title":[],"issued":{"date-parts":[[2008,8,17]]},"references-count":23,"alternative-id":["10.1145\/1402958.1402968","10.1145\/1402958"],"URL":"https:\/\/doi.org\/10.1145\/1402958.1402968","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1402946.1402968","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2008,8,17]]},"assertion":[{"value":"2008-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}