{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:36Z","timestamp":1772164056324,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":34,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,8,17]],"date-time":"2014-08-17T00:00:00Z","timestamp":1408233600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["MRC-007692-001"],"award-info":[{"award-number":["MRC-007692-001"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["TC-1111520"],"award-info":[{"award-number":["TC-1111520"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,8,17]]},"DOI":"10.1145\/2619239.2626307","type":"proceedings-article","created":{"date-parts":[[2014,8,12]],"date-time":"2014-08-12T09:53:50Z","timestamp":1407837230000},"page":"539-550","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":172,"title":["Dynamic scheduling of network updates"],"prefix":"10.1145","author":[{"given":"Xin","family":"Jin","sequence":"first","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Hongqiang Harry","family":"Liu","sequence":"additional","affiliation":[{"name":"Yale University, New Haven, CT, USA"}]},{"given":"Rohan","family":"Gandhi","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}]},{"given":"Srikanth","family":"Kandula","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Ratul","family":"Mahajan","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Ming","family":"Zhang","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA, USA"}]},{"given":"Jennifer","family":"Rexford","sequence":"additional","affiliation":[{"name":"Princeton University, Princeton, NJ, USA"}]},{"given":"Roger","family":"Wattenhofer","sequence":"additional","affiliation":[{"name":"ETH Zurich, Zurich, Switzerland"}]}],"member":"320","published-online":{"date-parts":[[2014,8,17]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"M. Caesar D. Caldwell N. Feamster J. Rexford A. Shaikh and J. van der Merwe \"Design and implementation of a routing control platform \" in USENIX NSDI 2005.   M. Caesar D. Caldwell N. Feamster J. Rexford A. Shaikh and J. van der Merwe \"Design and implementation of a routing control platform \" in USENIX NSDI 2005."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1096536.1096541"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2026415"},{"key":"e_1_3_2_1_4_1","volume-title":"Saving energy in data center networks.,\" in USENIX NSDI","author":"Heller B.","year":"2010","unstructured":"B. Heller , S. Seetharaman , P. Mahadevan , Y. Yiakoumis , P. Sharma , S. Banerjee , and N. McKeown , \"ElasticTree : Saving energy in data center networks.,\" in USENIX NSDI , 2010 . B. Heller, S. Seetharaman, P. Mahadevan, Y. Yiakoumis, P. Sharma, S. Banerjee, and N. McKeown, \"ElasticTree: Saving energy in data center networks.,\" in USENIX NSDI, 2010."},{"key":"e_1_3_2_1_5_1","volume-title":"Hedera: Dynamic flow scheduling for data center networks.,\" in USENIX NSDI","author":"Al-Fares M.","year":"2010","unstructured":"M. Al-Fares , S. Radhakrishnan , B. Raghavan , N. Huang , and A. Vahdat , \" Hedera: Dynamic flow scheduling for data center networks.,\" in USENIX NSDI , 2010 . M. Al-Fares, S. Radhakrishnan, B. Raghavan, N. Huang, and A. Vahdat, \"Hedera: Dynamic flow scheduling for data center networks.,\" in USENIX NSDI, 2010."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018466"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486005"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342356.2342427"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491185.2491191"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535791"},{"key":"e_1_3_2_1_14_1","volume-title":"Introduction to Algorithms","author":"Leiserson C. E.","year":"2001","unstructured":"C. E. Leiserson , R. L. Rivest , C. Stein , and T. H. Cormen , Introduction to Algorithms . The MIT press , 2001 . C. E. Leiserson, R. L. Rivest, C. Stein, and T. H. Cormen, Introduction to Algorithms. The MIT press, 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-28537-0_9"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486003"},{"key":"e_1_3_2_1_17_1","unstructured":"Nicira \"Network virtualization for cloud data centers.\" http:\/\/tinyurl.com\/c9jbkuu.  Nicira \"Network virtualization for cloud data centers.\" http:\/\/tinyurl.com\/c9jbkuu."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342459"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390239"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0201010"},{"key":"e_1_3_2_1_22_1","volume-title":"Networks: An Introduction","author":"Newman M.","year":"2009","unstructured":"M. Newman , Networks: An Introduction . Oxford University Press , 2009 . M. Newman, Networks: An Introduction. Oxford University Press, 2009."},{"key":"e_1_3_2_1_23_1","unstructured":"Arista \"Arista 7500 series technical specifications.\" http:\/\/tinyurl.com\/lene8sw.  Arista \"Arista 7500 series technical specifications.\" http:\/\/tinyurl.com\/lene8sw."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNSM.2007.021102"},{"key":"e_1_3_2_1_25_1","volume-title":"Consensus routing: The Internet as a distributed system,\" in USENIX NSDI","author":"John J. P.","year":"2008","unstructured":"J. P. John , E. Katz-Bassett , A. Krishnamurthy , T. Anderson , and A. Venkataramani , \" Consensus routing: The Internet as a distributed system,\" in USENIX NSDI , 2008 . J. P. John, E. Katz-Bassett, A. Krishnamurthy, T. Anderson, and A. Venkataramani, \"Consensus routing: The Internet as a distributed system,\" in USENIX NSDI, 2008."},{"key":"e_1_3_2_1_26_1","volume-title":"R-BGP: Staying connected in a connected world,\" in USENIX NSDI","author":"Kushman N.","year":"2007","unstructured":"N. Kushman , S. Kandula , D. Katabi , and B. M. Maggs , \" R-BGP: Staying connected in a connected world,\" in USENIX NSDI , 2007 . N. Kushman, S. Kandula, D. Katabi, and B. M. Maggs, \"R-BGP: Staying connected in a connected world,\" in USENIX NSDI, 2007."},{"key":"e_1_3_2_1_27_1","volume-title":"Disruption free topology reconfiguration in OSPF networks,\" in INFOCOM","author":"Francois P.","year":"2007","unstructured":"P. Francois , M. Shand , and O. Bonaventure , \" Disruption free topology reconfiguration in OSPF networks,\" in INFOCOM , 2007 . P. Francois, M. Shand, and O. Bonaventure, \"Disruption free topology reconfiguration in OSPF networks,\" in INFOCOM, 2007."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902686"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2097604"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2190767"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342454"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2342441.2342455"},{"key":"e_1_3_2_1_33_1","volume-title":"Toward synthesis of network updates,\" in Workshop on Synthesis (SYNT)","author":"Noyes A.","year":"2013","unstructured":"A. Noyes , T. Warszawski , and N. Foster , \" Toward synthesis of network updates,\" in Workshop on Synthesis (SYNT) , 2013 . A. Noyes, T. Warszawski, and N. Foster, \"Toward synthesis of network updates,\" in Workshop on Synthesis (SYNT), 2013."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851218"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"}],"event":{"name":"SIGCOMM'14: ACM SIGCOMM 2014 Conference","location":"Chicago Illinois USA","acronym":"SIGCOMM'14","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2014 ACM conference on SIGCOMM"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2619239.2626307","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2619239.2626307","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:28:15Z","timestamp":1750217295000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2619239.2626307"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,8,17]]},"references-count":34,"alternative-id":["10.1145\/2619239.2626307","10.1145\/2619239"],"URL":"https:\/\/doi.org\/10.1145\/2619239.2626307","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2740070.2626307","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2014,8,17]]},"assertion":[{"value":"2014-08-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}