{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:25:41Z","timestamp":1750307141038,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,10,26]],"date-time":"2011-10-26T00:00:00Z","timestamp":1319587200000},"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":[[2011,10,26]]},"DOI":"10.1145\/2038916.2038922","type":"proceedings-article","created":{"date-parts":[[2011,10,27]],"date-time":"2011-10-27T13:17:33Z","timestamp":1319721453000},"page":"1-14","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["ALIAS"],"prefix":"10.1145","author":[{"given":"Meg","family":"Walraed-Sullivan","sequence":"first","affiliation":[{"name":"UC San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Radhika Niranjan","family":"Mysore","sequence":"additional","affiliation":[{"name":"UC San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malveeka","family":"Tewari","sequence":"additional","affiliation":[{"name":"UC San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"Ericsson Research"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Keith","family":"Marzullo","sequence":"additional","affiliation":[{"name":"UC San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amin","family":"Vahdat","sequence":"additional","affiliation":[{"name":"UC San Diego"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,10,26]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Cisco data center infrastructure 2.5 design guide. http:\/\/tinyurl.com\/23486bs.  Cisco data center infrastructure 2.5 design guide. http:\/\/tinyurl.com\/23486bs."},{"key":"e_1_3_2_1_2_1","unstructured":"Openflow. www.openflowswitch.org.  Openflow. www.openflowswitch.org."},{"volume-title":"http:\/\/tinyurl.com\/dbzhn2","year":"2007","key":"e_1_3_2_1_3_1","unstructured":"Human errors most common reason for data center outages. http:\/\/tinyurl.com\/dbzhn2 , 2007 . Human errors most common reason for data center outages. http:\/\/tinyurl.com\/dbzhn2, 2007."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1654059.1654101"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402967"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676437"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851190"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00722-4_8"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592577"},{"key":"e_1_3_2_1_11_1","unstructured":"J. N. Hoover. Inside microsoft's $550 million mega data centers. http:\/\/tinyurl.com\/5cq4n6 2008.  J. N. Hoover. Inside microsoft's $550 million mega data centers. http:\/\/tinyurl.com\/5cq4n6 2008."},{"key":"e_1_3_2_1_12_1","volume-title":"Analysis of an equal-cost multi-path algorithm","author":"Hopps C.","year":"2000","unstructured":"C. Hopps . Analysis of an equal-cost multi-path algorithm , 2000 . C. Hopps. Analysis of an equal-cost multi-path algorithm, 2000."},{"volume-title":"May","year":"2008","key":"e_1_3_2_1_13_1","unstructured":"Juniper. What is behind network downtime? http:\/\/tinyurl.com\/6k23ay6 , May 2008 . Juniper. What is behind network downtime? http:\/\/tinyurl.com\/6k23ay6, May 2008."},{"key":"e_1_3_2_1_14_1","unstructured":"Z. Kerravala. As the value of enterprise networks escalates so does the need for configuration management. http:\/\/tinyurl.com\/6a2xox6 January 2004.  Z. Kerravala. As the value of enterprise networks escalates so does the need for configuration management. http:\/\/tinyurl.com\/6a2xox6 January 2004."},{"key":"e_1_3_2_1_15_1","first-page":"18","volume-title":"Proceedings of the 4th USENIX conference on Networked systems design & implementation, NSDI'07","author":"Killian C.","year":"2007","unstructured":"C. Killian , J. W. Anderson , R. Jhala , and A. Vahdat . Life, death, and the critical transition: finding liveness bugs in systems code . In Proceedings of the 4th USENIX conference on Networked systems design & implementation, NSDI'07 , pages 18 -- 18 , Berkeley, CA, USA , 2007 . USENIX Association. C. Killian, J. W. Anderson, R. Jhala, and A. Vahdat. Life, death, and the critical transition: finding liveness bugs in systems code. In Proceedings of the 4th USENIX conference on Networked systems design & implementation, NSDI'07, pages 18--18, Berkeley, CA, USA, 2007. USENIX Association."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250755"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1402958.1402961"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.5555\/4492.4495"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSE.2007.69"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592575"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/90.793032"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/319056.319004"},{"key":"e_1_3_2_1_23_1","first-page":"1211","volume-title":"INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies","volume":"2","author":"Perlman R.","year":"2004","unstructured":"R. Perlman . Rbridges : transparent routing . In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies , volume 2 , pages 1211 -- 1218 vol.2, March 2004 . R. Perlman. Rbridges: transparent routing. In INFOCOM 2004. Twenty-third AnnualJoint Conference of the IEEE Computer and Communications Societies, volume 2, pages 1211--1218 vol.2, March 2004."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/347059.347546"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/49.105178"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/99.537098"},{"key":"e_1_3_2_1_27_1","volume-title":"RFC","author":"Touch J.","year":"2009","unstructured":"J. Touch and R. Perlman . Transparent interconnection of lots of links (TRILL): Problem and applicability statement , RFC 5556, May 2009 . J. Touch and R. Perlman. Transparent interconnection of lots of links (TRILL): Problem and applicability statement, RFC 5556, May 2009."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/52324.52329"},{"key":"e_1_3_2_1_29_1","volume-title":"Proceedings of the 25th International Symposium on DIStributed Computing, DISC '11","author":"WalraedSullivan M.","year":"2011","unstructured":"M. WalraedSullivan , R. Niranjan Mysore , K. Marzullo , and A. Vahdat . Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic Networks . In Proceedings of the 25th International Symposium on DIStributed Computing, DISC '11 , 2011 . M. WalraedSullivan, R. Niranjan Mysore, K. Marzullo, and A. Vahdat. Brief Announcement: A Randomized Algorithm for Label Assignment in Dynamic Networks. In Proceedings of the 25th International Symposium on DIStributed Computing, DISC '11, 2011."}],"event":{"name":"SOCC '11: ACM Symposium on Cloud Computing in conjunction with SOSP 2011","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGOPS ACM Special Interest Group on Operating Systems"],"location":"Cascais Portugal","acronym":"SOCC '11"},"container-title":["Proceedings of the 2nd ACM Symposium on Cloud Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038916.2038922","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2038916.2038922","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T09:48:53Z","timestamp":1750240133000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2038916.2038922"}},"subtitle":["scalable, decentralized label assignment for data centers"],"short-title":[],"issued":{"date-parts":[[2011,10,26]]},"references-count":29,"alternative-id":["10.1145\/2038916.2038922","10.1145\/2038916"],"URL":"https:\/\/doi.org\/10.1145\/2038916.2038922","relation":{},"subject":[],"published":{"date-parts":[[2011,10,26]]},"assertion":[{"value":"2011-10-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}