{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T12:27:48Z","timestamp":1756384068182,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T00:00:00Z","timestamp":1668384000000},"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":[[2022,11,14]]},"DOI":"10.1145\/3563766.3564102","type":"proceedings-article","created":{"date-parts":[[2022,11,14]],"date-time":"2022-11-14T16:29:31Z","timestamp":1668443371000},"page":"138-144","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Minding the gap between fast heuristics and their optimal counterparts"],"prefix":"10.1145","author":[{"given":"Pooria","family":"Namyar","sequence":"first","affiliation":[{"name":"Microsoft"}]},{"given":"Behnaz","family":"Arzani","sequence":"additional","affiliation":[{"name":"Microsoft"}]},{"given":"Ryan","family":"Beckett","sequence":"additional","affiliation":[{"name":"Microsoft"}]},{"given":"Santiago","family":"Segarra","sequence":"additional","affiliation":[{"name":"Microsoft"}]},{"given":"Himanshu","family":"Raj","sequence":"additional","affiliation":[{"name":"Microsoft"}]},{"given":"Srikanth","family":"Kandula","sequence":"additional","affiliation":[{"name":"Microsoft"}]}],"member":"320","published-online":{"date-parts":[[2022,11,14]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Firas Abuzaid Srikanth Kandula Behnaz Arzani Ishai Menache Matei Zaharia and Peter Bailis. 2021. Contracting Wide-area Network Topologies to Solve Flow Problems Quickly. In NSDI.  Firas Abuzaid Srikanth Kandula Behnaz Arzani Ishai Menache Matei Zaharia and Peter Bailis. 2021. Contracting Wide-area Network Topologies to Solve Flow Problems Quickly. In NSDI."},{"key":"e_1_3_2_1_2_1","unstructured":"Satyajeet Singh Ahuja Varun Gupta Vinayak Dangui Soshant Bali Abishek Gopalan Hao Zhong Petr Lapukhov Yiting Xia and Ying Zhang. 2021. Capacity-efficient and uncertainty-resilient backbone network planning with hose. In SIGCOMM.  Satyajeet Singh Ahuja Varun Gupta Vinayak Dangui Soshant Bali Abishek Gopalan Hao Zhong Petr Lapukhov Yiting Xia and Ying Zhang. 2021. Capacity-efficient and uncertainty-resilient backbone network planning with hose. In SIGCOMM."},{"key":"e_1_3_2_1_3_1","volume-title":"Hedera: Dynamic Flow Scheduling for Datacenter Networks. In NSDI.","author":"Al-Fares Mohammad","year":"2010","unstructured":"Mohammad Al-Fares , Sivasankar Radhakrishnan , Barath Raghavan , Nelson Huang , and Amin Vahdat . 2010 . Hedera: Dynamic Flow Scheduling for Datacenter Networks. In NSDI. Mohammad Al-Fares, Sivasankar Radhakrishnan, Barath Raghavan, Nelson Huang, and Amin Vahdat. 2010. Hedera: Dynamic Flow Scheduling for Datacenter Networks. In NSDI."},{"key":"e_1_3_2_1_4_1","unstructured":"Bryan Arguello Richard L. Chen William E. Hart John D. Siirola and Jean-Paul Watson. [n. d.]. Modeling Bilevel Program in Pyomo. https:\/\/www.osti.gov\/servlets\/purl\/1526125. ([n. d.]).  Bryan Arguello Richard L. Chen William E. Hart John D. Siirola and Jean-Paul Watson. [n. d.]. Modeling Bilevel Program in Pyomo. https:\/\/www.osti.gov\/servlets\/purl\/1526125. ([n. d.])."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Jeremy Bogle et al. 2019. TEAVAR: striking the right utilization-availability balance in WAN traffic engineering. In SIGCOMM.  Jeremy Bogle et al. 2019. TEAVAR: striking the right utilization-availability balance in WAN traffic engineering. In SIGCOMM.","DOI":"10.1145\/3341302.3342069"},{"volume-title":"Convex Optimization","author":"Boyd Stephen","key":"e_1_3_2_1_6_1","unstructured":"Stephen Boyd and Lieven Vandenberghe . 2004. Convex Optimization . Cambridge University Press . Stephen Boyd and Lieven Vandenberghe. 2004. Convex Optimization. Cambridge University Press."},{"key":"e_1_3_2_1_7_1","volume-title":"Bilevel programming: A survey. 4OR","author":"Colson Beno\u00eet","year":"2005","unstructured":"Beno\u00eet Colson , Patrice Marcotte , and Gilles Savard . 2005. Bilevel programming: A survey. 4OR ( 2005 ). Beno\u00eet Colson, Patrice Marcotte, and Gilles Savard. 2005. Bilevel programming: A survey. 4OR (2005)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10479-007-0176-2"},{"volume-title":"Introduction to algorithms","author":"Cormen Thomas H","key":"e_1_3_2_1_9_1","unstructured":"Thomas H Cormen , Charles E Leiserson , Ronald L Rivest , and Clifford Stein . 2022. Introduction to algorithms . MIT press . Thomas H Cormen, Charles E Leiserson, Ronald L Rivest, and Clifford Stein. 2022. Introduction to algorithms. MIT press."},{"key":"e_1_3_2_1_10_1","volume-title":"A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems. Journal of AI Research","author":"Corso Anthony","year":"2021","unstructured":"Anthony Corso , Robert Moss , Mark Koren , Ritchie Lee , and Mykel Kochenderfer . 2021. A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems. Journal of AI Research ( 2021 ). Anthony Corso, Robert Moss, Mark Koren, Ritchie Lee, and Mykel Kochenderfer. 2021. A Survey of Algorithms for Black-Box Safety Validation of Cyber-Physical Systems. Journal of AI Research (2021)."},{"key":"e_1_3_2_1_11_1","volume-title":"Proc. Intl. Conf. Genetic Algorithm","author":"Davis L.","year":"1991","unstructured":"L. Davis . 1991 . Bit-climbing, representational bias, and test suit design . Proc. Intl. Conf. Genetic Algorithm (1991), 18--23. L. Davis. 1991. Bit-climbing, representational bias, and test suit design. Proc. Intl. Conf. Genetic Algorithm (1991), 18--23."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.compchemeng.2015.12.007"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Tomer Gilad Nathan H. Jay Michael Shnaiderman Brighten Godfrey and Michael Schapira. 2019. Robustifying Network Protocols with Adversarial Examples. In HotNets. ACM.  Tomer Gilad Nathan H. Jay Michael Shnaiderman Brighten Godfrey and Michael Schapira. 2019. Robustifying Network Protocols with Adversarial Examples. In HotNets. ACM.","DOI":"10.1145\/3365609.3365862"},{"key":"e_1_3_2_1_14_1","unstructured":"Gurobi Optimization LLC. 2022. Gurobi Optimizer Reference Manual. (2022). https:\/\/www.gurobi.com  Gurobi Optimization LLC. 2022. Gurobi Optimizer Reference Manual. (2022). https:\/\/www.gurobi.com"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"Chi-Yao Hong Srikanth Kandula Ratul Mahajan Ming Zhang Vijay Gill Mohan Nanduri and Roger Wattenhofer. 2013. Achieving high utilization with software-driven WAN. In SIGCOMM.  Chi-Yao Hong Srikanth Kandula Ratul Mahajan Ming Zhang Vijay Gill Mohan Nanduri and Roger Wattenhofer. 2013. Achieving high utilization with software-driven WAN. In SIGCOMM.","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"Sushant Jain Alok Kumar Subhasree Mandal Joon Ong Leon Poutievski Arjun Singh Subbaiah Venkata Jim Wanderer Junlan Zhou and Min Zhu. 2013. B4: Experience with a globally-deployed software defined WAN. In SIGCOMM.  Sushant Jain Alok Kumar Subhasree Mandal Joon Ong Leon Poutievski Arjun Singh Subbaiah Venkata Jim Wanderer Junlan Zhou and Min Zhu. 2013. B4: Experience with a globally-deployed software defined WAN. In SIGCOMM.","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"crossref","unstructured":"Virajith Jalaparti Ivan Bliznets Srikanth Kandula Brendan Lucier and Ishai Menache. 2016. Dynamic pricing and traffic engineering for timely inter-datacenter transfers. In SIGCOMM.  Virajith Jalaparti Ivan Bliznets Srikanth Kandula Brendan Lucier and Ishai Menache. 2016. Dynamic pricing and traffic engineering for timely inter-datacenter transfers. In SIGCOMM.","DOI":"10.1145\/2934872.2934893"},{"key":"e_1_3_2_1_18_1","volume-title":"Software model checking. ACM Comput. Surv. 41","author":"Jhala Ranjit","year":"2009","unstructured":"Ranjit Jhala and Rupak Majumdar . 2009. Software model checking. ACM Comput. Surv. 41 ( 2009 ), 21:1--21:54. Ranjit Jhala and Rupak Majumdar. 2009. Software model checking. ACM Comput. Surv. 41 (2009), 21:1--21:54."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Qiao Kang Jiarong Xing Yiming Qiu and Ang Chen. 2021. Probabilistic Profiling of Stateful Data Planes for Adversarial Testing. In ASPLOS. ACM.  Qiao Kang Jiarong Xing Yiming Qiu and Ang Chen. 2021. Probabilistic Profiling of Stateful Data Planes for Adversarial Testing. In ASPLOS. ACM.","DOI":"10.1145\/3445814.3446764"},{"key":"e_1_3_2_1_20_1","volume-title":"C Daniel Gelatt Jr, and Mario P Vecchi","author":"Kirkpatrick Scott","year":"1983","unstructured":"Scott Kirkpatrick , C Daniel Gelatt Jr, and Mario P Vecchi . 1983 . Optimization by simulated annealing. Science 220, 4598 (1983), 671--680. Scott Kirkpatrick, C Daniel Gelatt Jr, and Mario P Vecchi. 1983. Optimization by simulated annealing. Science 220, 4598 (1983), 671--680."},{"key":"e_1_3_2_1_21_1","unstructured":"Umesh Krishnaswamy Rachee Singh Nikolaj Bj\u00f8rner and Himanshu Raj. 2022. Decentralized cloud wide-area network traffic engineering with BLASTSHIELD. In NSDI.  Umesh Krishnaswamy Rachee Singh Nikolaj Bj\u00f8rner and Himanshu Raj. 2022. Decentralized cloud wide-area network traffic engineering with BLASTSHIELD. In NSDI."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Alok Kumar et al. 2015. BwE: Flexible Hierarchical Bandwidth Allocation for WAN Distributed Computing. In SIGCOMM.  Alok Kumar et al. 2015. BwE: Flexible Hierarchical Bandwidth Allocation for WAN Distributed Computing. In SIGCOMM.","DOI":"10.1145\/2785956.2787478"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.3934\/dcdsb.2017007"},{"key":"e_1_3_2_1_24_1","unstructured":"Hongqiang Harry Liu Srikanth Kandula Ratul Mahajan Ming Zhang and David Gelernter. 2014. Traffic engineering with forward fault correction. In SIGCOMM.  Hongqiang Harry Liu Srikanth Kandula Ratul Mahajan Ming Zhang and David Gelernter. 2014. Traffic engineering with forward fault correction. In SIGCOMM."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"crossref","unstructured":"Roland Meier Thomas Holterbach Stephan Keck Matthias St\u00e4hli Vincent Lenders Ankit Singla and Laurent Vanbever. 2019. (Self) Driving Under the Influence: Intoxicating Adversarial Network Inputs. In HotNets. ACM.  Roland Meier Thomas Holterbach Stephan Keck Matthias St\u00e4hli Vincent Lenders Ankit Singla and Laurent Vanbever. 2019. (Self) Driving Under the Influence: Intoxicating Adversarial Network Inputs. In HotNets. ACM.","DOI":"10.1145\/3365609.3365850"},{"volume-title":"Randomized algorithms","author":"Motwani Rajeev","key":"e_1_3_2_1_26_1","unstructured":"Rajeev Motwani and Prabhakar Raghavan . 1995. Randomized algorithms . Cambridge university press . Rajeev Motwani and Prabhakar Raghavan. 1995. Randomized algorithms. Cambridge university press."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Pooria Namyar Behnaz Arzani Ryan Beckett Santiago Segarra Himanshu Raj and Srikanth Kandula. 2022. Minding the gap between Fast Heuristics and their Optimal Counterparts: Extended Version. https:\/\/github.com\/AdversInputHeuristics\/Adversarial-Input-For-Heuristics  Pooria Namyar Behnaz Arzani Ryan Beckett Santiago Segarra Himanshu Raj and Srikanth Kandula. 2022. Minding the gap between Fast Heuristics and their Optimal Counterparts: Extended Version. https:\/\/github.com\/AdversInputHeuristics\/Adversarial-Input-For-Heuristics","DOI":"10.1145\/3563766.3564102"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Pooria Namyar Sucha Supittayapornpong Mingyang Zhang Minlan Yu and Ramesh Govindan. 2021. A Throughput-Centric View of the Performance of Datacenter Topologies. In SIGCOMM.  Pooria Namyar Sucha Supittayapornpong Mingyang Zhang Minlan Yu and Ramesh Govindan. 2021. A Throughput-Centric View of the Performance of Datacenter Topologies. In SIGCOMM.","DOI":"10.1145\/3452296.3472913"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Deepak Narayanan Fiodar Kazhamiaka Firas Abuzaid Peter Kraft Akshay Agrawal Srikanth Kandula Stephen Boyd and Matei Zaharia. 2021. Solving Large-Scale Granular Resource Allocation Problems Efficiently with POP. In SOSP.  Deepak Narayanan Fiodar Kazhamiaka Firas Abuzaid Peter Kraft Akshay Agrawal Srikanth Kandula Stephen Boyd and Matei Zaharia. 2021. Solving Large-Scale Granular Resource Allocation Problems Efficiently with POP. In SOSP.","DOI":"10.1145\/3477132.3483588"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"crossref","unstructured":"Luis Pedrosa Rishabh Iyer Arseniy Zaostrovnykh Jonas Fietz and Katerina Argyraki. 2018. Automated Synthesis of Adversarial Workloads for Network Functions. In SIGCOMM. ACM.  Luis Pedrosa Rishabh Iyer Arseniy Zaostrovnykh Jonas Fietz and Katerina Argyraki. 2018. Automated Synthesis of Adversarial Workloads for Network Functions. In SIGCOMM. ACM.","DOI":"10.1145\/3230543.3230573"},{"key":"e_1_3_2_1_32_1","volume-title":"Breaking Cuckoo Hash: Black Box Attacks","author":"Reviriego Pedro","year":"2021","unstructured":"Pedro Reviriego and Daniel Ting . 2021. Breaking Cuckoo Hash: Black Box Attacks . IEEE Transactions on Dependable and Secure Computing ( 2021 ). Pedro Reviriego and Daniel Ting. 2021. Breaking Cuckoo Hash: Black Box Attacks. IEEE Transactions on Dependable and Secure Computing (2021)."},{"key":"e_1_3_2_1_33_1","unstructured":"Thomas Sauerwald. [n. d.]. Sorting Networks. https:\/\/www.cl.cam.ac.uk\/teaching\/1415\/AdvAlgo\/advalg.pdf. ([n. d.]).  Thomas Sauerwald. [n. d.]. Sorting Networks. https:\/\/www.cl.cam.ac.uk\/teaching\/1415\/AdvAlgo\/advalg.pdf. ([n. d.])."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"crossref","unstructured":"Rachee Singh Nikolaj Bjorner Sharon Shoham Yawei Yin John Arnold and Jamie Gaudette. 2021. Cost-effective capacity provisioning in wide area networks with Shoofly. In SIGCOMM.  Rachee Singh Nikolaj Bjorner Sharon Shoham Yawei Yin John Arnold and Jamie Gaudette. 2021. Cost-effective capacity provisioning in wide area networks with Shoofly. In SIGCOMM.","DOI":"10.1145\/3452296.3472895"},{"key":"e_1_3_2_1_35_1","unstructured":"Stanford University IT. 2015. Abilene Core Topology. (2015). https:\/\/uit.stanford.edu\/service\/network\/internet2\/abilene  Stanford University IT. 2015. Abilene Core Topology. (2015). https:\/\/uit.stanford.edu\/service\/network\/internet2\/abilene"},{"volume-title":"Automated Machine Learning","author":"Steinruecken Christian","key":"e_1_3_2_1_36_1","unstructured":"Christian Steinruecken , Emma Smith , David Janz , James Lloyd , and Zoubin Ghahramani . 2019. The automatic statistician . In Automated Machine Learning . Springer , Cham . Christian Steinruecken, Emma Smith, David Janz, James Lloyd, and Zoubin Ghahramani. 2019. The automatic statistician. In Automated Machine Learning. Springer, Cham."},{"key":"e_1_3_2_1_37_1","first-page":"434","article-title":"FLAML: A fast and lightweight autoML library","volume":"3","author":"Wang Chi","year":"2021","unstructured":"Chi Wang , Qingyun Wu , Markus Weimer , and Erkang Zhu . 2021 . FLAML: A fast and lightweight autoML library . Proceedings of Machine Learning and Systems 3 (2021), 434 -- 447 . Chi Wang, Qingyun Wu, Markus Weimer, and Erkang Zhu. 2021. FLAML: A fast and lightweight autoML library. Proceedings of Machine Learning and Systems 3 (2021), 434--447.","journal-title":"Proceedings of Machine Learning and Systems"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472921"}],"event":{"name":"HotNets '22: The 21st ACM Workshop on Hot Topics in Networks","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"],"location":"Austin Texas","acronym":"HotNets '22"},"container-title":["Proceedings of the 21st ACM Workshop on Hot Topics in Networks"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563766.3564102","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3563766.3564102","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:07Z","timestamp":1750186807000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3563766.3564102"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,14]]},"references-count":38,"alternative-id":["10.1145\/3563766.3564102","10.1145\/3563766"],"URL":"https:\/\/doi.org\/10.1145\/3563766.3564102","relation":{},"subject":[],"published":{"date-parts":[[2022,11,14]]},"assertion":[{"value":"2022-11-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}