{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:35:02Z","timestamp":1750221302158,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":21,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,28]],"date-time":"2017-11-28T00:00:00Z","timestamp":1511827200000},"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":[[2017,11,28]]},"DOI":"10.1145\/3143361.3143397","type":"proceedings-article","created":{"date-parts":[[2017,11,22]],"date-time":"2017-11-22T16:30:38Z","timestamp":1511368238000},"page":"276-282","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":11,"title":["Catalyst"],"prefix":"10.1145","author":[{"given":"Rohan","family":"Gandhi","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Microsoft"}]},{"given":"Ori","family":"Rottenstreich","sequence":"additional","affiliation":[{"name":"Princeton University"}]},{"given":"Xin","family":"Jin","sequence":"additional","affiliation":[{"name":"Johns Hopkins University"}]}],"member":"320","published-online":{"date-parts":[[2017,11,28]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"IBM CPLEX LP Solver. http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/.  IBM CPLEX LP Solver. http:\/\/www-01.ibm.com\/software\/commerce\/optimization\/cplex-optimizer\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Max cover problem. https:\/\/en.wikipedia.org\/wiki\/Maximum_coverage_problem.  Max cover problem. https:\/\/en.wikipedia.org\/wiki\/Maximum_coverage_problem."},{"key":"e_1_3_2_1_3_1","volume-title":"USENIX HotCloud","author":"Ananthanarayanan Ganesh","year":"2012","unstructured":"Ganesh Ananthanarayanan , Ali Ghodsi , Scott Shenker , and Ion Stoica . Why Let Resources Idle? Aggressive Cloning of Jobs with Dolly . In USENIX HotCloud 2012 . Ganesh Ananthanarayanan, Ali Ghodsi, Scott Shenker, and Ion Stoica. Why Let Resources Idle? Aggressive Cloning of Jobs with Dolly. In USENIX HotCloud 2012."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879141.1879175"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2026415"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934911"},{"key":"e_1_3_2_1_7_1","volume-title":"Nick McKeown. ElasticTree: Saving Energy in Data Center Networks. In USENIX NSDI","author":"Heller Brandon","year":"2010","unstructured":"Brandon Heller , Srini Seetharaman , Priya Mahadevan , Yiannis Yiakoumis , Puneet Sharma , Sujata Banerjee , and Nick McKeown. ElasticTree: Saving Energy in Data Center Networks. In USENIX NSDI 2010 . Brandon Heller, Srini Seetharaman, Priya Mahadevan, Yiannis Yiakoumis, Puneet Sharma, Sujata Banerjee, and Nick McKeown. ElasticTree: Saving Energy in Data Center Networks. In USENIX NSDI 2010."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626307"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2716281.2836091"},{"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\/2619239.2626314"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486005"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535771.2535791"},{"key":"e_1_3_2_1_16_1","volume-title":"HotSDN","author":"Pere\u00edni Peter","year":"2014","unstructured":"Peter Pere\u00edni , Maciej Kuzniar , Marco Canini , and Dejan Kosti\u0107 . ESPRES: transparent SDN update scheduling . In HotSDN 2014 . Peter Pere\u00edni, Maciej Kuzniar, Marco Canini, and Dejan Kosti\u0107. ESPRES: transparent SDN update scheduling. In HotSDN 2014."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070569"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787472"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2535372.2535392"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2390231.2390234"},{"key":"e_1_3_2_1_21_1","volume-title":"Brighten Godfrey. Enforcing Customizable Consistency Properties in Software-defined Networks. In USENIX NSDI","author":"Zhou Wenxuan","year":"2015","unstructured":"Wenxuan Zhou , Dong Jin , Jason Croft , Matthew Caesar , and Brighten Godfrey. Enforcing Customizable Consistency Properties in Software-defined Networks. In USENIX NSDI 2015 . Wenxuan Zhou, Dong Jin, Jason Croft, Matthew Caesar, and Brighten Godfrey. Enforcing Customizable Consistency Properties in Software-defined Networks. In USENIX NSDI 2015."}],"event":{"name":"CoNEXT '17: The 13th International Conference on emerging Networking EXperiments and Technologies","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Incheon Republic of Korea","acronym":"CoNEXT '17"},"container-title":["Proceedings of the 13th International Conference on emerging Networking EXperiments and Technologies"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3143361.3143397","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3143361.3143397","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:21Z","timestamp":1750212801000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3143361.3143397"}},"subtitle":["Unlocking the Power of Choice to Speed up Network Updates"],"short-title":[],"issued":{"date-parts":[[2017,11,28]]},"references-count":21,"alternative-id":["10.1145\/3143361.3143397","10.1145\/3143361"],"URL":"https:\/\/doi.org\/10.1145\/3143361.3143397","relation":{},"subject":[],"published":{"date-parts":[[2017,11,28]]},"assertion":[{"value":"2017-11-28","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}