{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:03Z","timestamp":1772164023644,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,8,30]],"date-time":"2010-08-30T00:00:00Z","timestamp":1283126400000},"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":[[2010,8,30]]},"DOI":"10.1145\/1851182.1851190","type":"proceedings-article","created":{"date-parts":[[2010,8,31]],"date-time":"2010-08-31T09:06:04Z","timestamp":1283245564000},"page":"39-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":33,"title":["Generic and automatic address configuration for data center networks"],"prefix":"10.1145","author":[{"given":"Kai","family":"Chen","sequence":"first","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]},{"given":"Chuanxiong","family":"Guo","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Haitao","family":"Wu","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Beijing, China"}]},{"given":"Jing","family":"Yuan","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"given":"Zhenqian","family":"Feng","sequence":"additional","affiliation":[{"name":"NUDT, Changsha, China"}]},{"given":"Yan","family":"Chen","sequence":"additional","affiliation":[{"name":"Northwestern University, Evanston, IL, USA"}]},{"given":"Songwu","family":"Lu","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles, CA, USA"}]},{"given":"Wenfei","family":"Wu","sequence":"additional","affiliation":[{"name":"BUAA, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2010,8,30]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSPEC.2009.4768855"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2003.1196112"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"R. Droms \"Dynamic Host Configuration Protocol \" RFC 2131 March 1997.  R. Droms \"Dynamic Host Configuration Protocol \" RFC 2131 March 1997.","DOI":"10.17487\/rfc2131"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/945445.945450"},{"key":"e_1_3_2_1_5_1","volume-title":"MapReduce: Simplified Data Processing on Large Clusters,\" in OSDI","author":"Dean J.","year":"2004","unstructured":"J. Dean and S. Ghemawat , \" MapReduce: Simplified Data Processing on Large Clusters,\" in OSDI , 2004 . J. Dean and S. Ghemawat, \"MapReduce: Simplified Data Processing on Large Clusters,\" in OSDI, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402968"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_1_10_1","unstructured":"{Online}. Available: http:\/\/royal.pingdom.com\/2007\/10\/30\/human-errors-most-common-reason-for-data-center-outages\/  {Online}. Available: http:\/\/royal.pingdom.com\/2007\/10\/30\/human-errors-most-common-reason-for-data-center-outages\/"},{"key":"e_1_3_2_1_11_1","volume-title":"Jan","author":"Kerravala Z.","year":"2004","unstructured":"Z. Kerravala , \"As the value of enterprise networks escalates , so does the need for configuration management,\" The Yankee Group , Jan 2004 . Z. Kerravala, \"As the value of enterprise networks escalates, so does the need for configuration management,\" The Yankee Group, Jan 2004."},{"key":"e_1_3_2_1_12_1","unstructured":"Juniper \"What is behind network downtime?\" 2008.  Juniper \"What is behind network downtime?\" 2008."},{"key":"e_1_3_2_1_13_1","unstructured":"{Online}. Available: http:\/\/searchdatacenter.techtarget.com\/news\/column\/0 294698 sid80_gci1148903 00.html  {Online}. Available: http:\/\/searchdatacenter.techtarget.com\/news\/column\/0 294698 sid80_gci1148903 00.html"},{"key":"e_1_3_2_1_14_1","unstructured":"Graph isomorphism problem \" http:\/\/en.wikipedia.org\/wiki\/Graph_isomorphism_problem.  Graph isomorphism problem \" http:\/\/en.wikipedia.org\/wiki\/Graph_isomorphism_problem."},{"key":"e_1_3_2_1_15_1","volume-title":"Congressus Numerantium","author":"McKay B. D.","year":"1981","unstructured":"B. D. McKay , \"Practical graph isomorphism,\" in Congressus Numerantium , 1981 . B. D. McKay, \"Practical graph isomorphism,\" in Congressus Numerantium, 1981."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391509"},{"key":"e_1_3_2_1_17_1","volume-title":"FiConn: Using Backup Port for Server Interconnection in Data Centers,\" in Infocom","author":"Li D.","year":"2009","unstructured":"D. Li , C. Guo , H. Wu , K. Tan , Y. Zhang , and S. Lu , \" FiConn: Using Backup Port for Server Interconnection in Data Centers,\" in Infocom , 2009 . D. Li, C. Guo, H. Wu, K. Tan, Y. Zhang, and S. Lu, \"FiConn: Using Backup Port for Server Interconnection in Data Centers,\" in Infocom, 2009."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"E. M. Luks \"Isomorphism of graphs of bounded valence can be tested in polynomial time \" in Journal of Computer and System Sciences 1982.  E. M. Luks \"Isomorphism of graphs of bounded valence can be tested in polynomial time \" in Journal of Computer and System Sciences 1982.","DOI":"10.1016\/0022-0000(82)90009-5"},{"key":"e_1_3_2_1_19_1","unstructured":"Graph automorphism \" http:\/\/en.wikipedia.org\/wiki\/Graph_automorphism.  Graph automorphism \" http:\/\/en.wikipedia.org\/wiki\/Graph_automorphism."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996712"},{"key":"e_1_3_2_1_21_1","unstructured":"Data Center Network Overview \" Extreme Networks 2009.  Data Center Network Overview \" Extreme Networks 2009."},{"key":"e_1_3_2_1_22_1","unstructured":"Maximum common subgraph problem \" http:\/\/en.wikipedia.org\/wiki\/Maximum_common_subgraph_isomorphism_problem.  Maximum common subgraph problem \" http:\/\/en.wikipedia.org\/wiki\/Maximum_common_subgraph_isomorphism_problem."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"V. Kann \"On the approximability of the maximum common subgraph problem \" Annual Symposium on Theoretical Aspects of Computer Science 1992.   V. Kann \"On the approximability of the maximum common subgraph problem \" Annual Symposium on Theoretical Aspects of Computer Science 1992.","DOI":"10.1007\/3-540-55210-3_198"},{"key":"e_1_3_2_1_24_1","unstructured":"Personal communications with opeartor of a large enterprise data center \" 2009.  Personal communications with opeartor of a large enterprise data center \" 2009."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347546"},{"key":"e_1_3_2_1_26_1","volume-title":"Rethinking the service model: scaling Ethernet to a million nodes,\" in HotNets","author":"Myers A.","year":"2004","unstructured":"A. Myers , E. Ng , and H. Zhang , \" Rethinking the service model: scaling Ethernet to a million nodes,\" in HotNets , 2004 . A. Myers, E. Ng, and H. Zhang, \"Rethinking the service model: scaling Ethernet to a million nodes,\" in HotNets, 2004."},{"key":"e_1_3_2_1_27_1","volume-title":"Transparent routing,\" in Infocom","author":"Perlman R.","year":"2004","unstructured":"R. Perlman , \"Rbridges : Transparent routing,\" in Infocom , 2004 . R. Perlman, \"Rbridges: Transparent routing,\" in Infocom, 2004."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402961"},{"key":"e_1_3_2_1_29_1","volume-title":"December","author":"Thomson S.","year":"1998","unstructured":"S. Thomson and T. Narten , \" IPv6 Stateless Address Autoconfiguration,\" Expired Internet Draft , December 1998 . S. Thomson and T. Narten, \"IPv6 Stateless Address Autoconfiguration,\" Expired Internet Draft, December 1998."},{"key":"e_1_3_2_1_30_1","volume-title":"Dynamic configuration of IPv4 link-local addresses,\" IETF Draft","author":"Cheshire S.","year":"2003","unstructured":"S. Cheshire , B. Aboba , and E. Guttman , \" Dynamic configuration of IPv4 link-local addresses,\" IETF Draft , 2003 . S. Cheshire, B. Aboba, and E. Guttman, \"Dynamic configuration of IPv4 link-local addresses,\" IETF Draft, 2003."}],"event":{"name":"SIGCOMM '10: ACM SIGCOMM 2010 Conference","location":"New Delhi India","acronym":"SIGCOMM '10","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2010 conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1851182.1851190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:08:50Z","timestamp":1750234130000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1851182.1851190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,8,30]]},"references-count":30,"alternative-id":["10.1145\/1851182.1851190","10.1145\/1851182"],"URL":"https:\/\/doi.org\/10.1145\/1851182.1851190","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1851275.1851190","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2010,8,30]]},"assertion":[{"value":"2010-08-30","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}