{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,9]],"date-time":"2026-04-09T14:34:20Z","timestamp":1775745260787,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":56,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,8,19]],"date-time":"2019-08-19T00:00:00Z","timestamp":1566172800000},"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":[[2019,8,19]]},"DOI":"10.1145\/3341302.3342069","type":"proceedings-article","created":{"date-parts":[[2019,8,14]],"date-time":"2019-08-14T19:32:36Z","timestamp":1565811156000},"page":"29-43","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":86,"title":["TEAVAR"],"prefix":"10.1145","author":[{"given":"Jeremy","family":"Bogle","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Nikhil","family":"Bhatia","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Manya","family":"Ghobadi","sequence":"additional","affiliation":[{"name":"Massachusetts Institute of Technology"}]},{"given":"Ishai","family":"Menache","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Nikolaj","family":"Bj\u00f8rner","sequence":"additional","affiliation":[{"name":"Microsoft Research"}]},{"given":"Asaf","family":"Valadarsky","sequence":"additional","affiliation":[{"name":"Hebrew University"}]},{"given":"Michael","family":"Schapira","sequence":"additional","affiliation":[{"name":"Hebrew University"}]}],"member":"320","published-online":{"date-parts":[[2019,8,19]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comnet.2014.06.002"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626316"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00011399"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"e_1_3_2_2_5_1","volume-title":"ISMP","author":"Bangla Ajay Kumar","year":"2015","unstructured":"Ajay Kumar Bangla , Alireza Ghaffarkhah , Ben Preskill , Bikash Koley , Christopher Albrecht , Emilie Danna , Joe Jiang , and Xiaoxue Zhao . 2015. Capacity planning for the Google backbone network . In ISMP ( 2015 ). Ajay Kumar Bangla, Alireza Ghaffarkhah, Ben Preskill, Bikash Koley, Christopher Albrecht, Emilie Danna, Joe Jiang, and Xiaoxue Zhao. 2015. Capacity planning for the Google backbone network. In ISMP (2015)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.893884"},{"key":"e_1_3_2_2_7_1","volume-title":"Vance","author":"Barnhart Cynthia","year":"2009","unstructured":"Cynthia Barnhart , Niranjan Krishnan , and Pamela H . Vance . 2009 . Multicommodity Flow Problems. In Encyclopedia of Optimization. Springer , 2354--2362. Cynthia Barnhart, Niranjan Krishnan, and Pamela H. Vance. 2009. Multicommodity Flow Problems. In Encyclopedia of Optimization. Springer, 2354--2362."},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2079296.2079304"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0396-4"},{"key":"e_1_3_2_2_10_1","volume-title":"Julia: A Fast Dynamic Language for Technical Computing. CoRR abs\/1209.5145","author":"Bezanson Jeff","year":"2012","unstructured":"Jeff Bezanson , Stefan Karpinski , Viral B. Shah , and Alan Edelman . 2012 . Julia: A Fast Dynamic Language for Technical Computing. CoRR abs\/1209.5145 (2012). Jeff Bezanson, Stefan Karpinski, Viral B. Shah, and Alan Edelman. 2012. Julia: A Fast Dynamic Language for Technical Computing. CoRR abs\/1209.5145 (2012)."},{"key":"e_1_3_2_2_11_1","volume-title":"CISS","author":"Bi Yingjie","year":"2019","unstructured":"Yingjie Bi and Ao Tang . 2019. Uncertainty-Aware optimization for Network Provisioning and Routing . In CISS ( 2019 ). Yingjie Bi and Ao Tang. 2019. Uncertainty-Aware optimization for Network Provisioning and Routing. In CISS (2019)."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-009-0125-x"},{"key":"e_1_3_2_2_13_1","volume-title":"Robust Validation of Network Designs under Uncertain Demands and Failures. USENIX NSDI","author":"Chang Yiyang","year":"2017","unstructured":"Yiyang Chang , Sanjay Rao , and Mohit Tawarmalani . 2017. Robust Validation of Network Designs under Uncertain Demands and Failures. USENIX NSDI ( 2017 ). Yiyang Chang, Sanjay Rao, and Mohit Tawarmalani. 2017. Robust Validation of Network Designs under Uncertain Demands and Failures. USENIX NSDI (2017)."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Antonio J. Conejo Miguel Carri\u00f3n Juan M. Morales etal 2010. Decision making under uncertainty in electricity markets. Vol. 1. Springer.  Antonio J. Conejo Miguel Carri\u00f3n Juan M. Morales et al. 2010. Decision making under uncertainty in electricity markets . Vol. 1. Springer.","DOI":"10.1007\/978-1-4419-7421-1_1"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/2770547.2770562"},{"key":"e_1_3_2_2_16_1","volume-title":"A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering","author":"Danna Emilie","year":"2012","unstructured":"Emilie Danna , Subhasree Mandal , and Arjun Singh . 2012. A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering . In IEEE INFOCOM ( 2012 ). Emilie Danna, Subhasree Mandal, and Arjun Singh. 2012. A practical algorithm for balancing the max-min fairness and throughput objectives in traffic engineering. In IEEE INFOCOM (2012)."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/LCOMM.2012.060112.120353"},{"key":"e_1_3_2_2_18_1","volume-title":"Online Bandwidth Calendaring: On-the-fly admission, scheduling, and path computation","author":"Dufour Maxime","year":"2017","unstructured":"Maxime Dufour , Stefano Paris , Jeremie Leguay , and Moez Draief . 2017. Online Bandwidth Calendaring: On-the-fly admission, scheduling, and path computation . In IEEE ICC ( 2017 ). Maxime Dufour, Stefano Paris, Jeremie Leguay, and Moez Draief. 2017. Online Bandwidth Calendaring: On-the-fly admission, scheduling, and path computation. In IEEE ICC (2017)."},{"key":"e_1_3_2_2_19_1","volume-title":"MATE: MPLS adaptive traffic engineering","author":"Elwalid Anwar","year":"2001","unstructured":"Anwar Elwalid , Cheng Jin , Steven H. Low , and Indra Widjaja . 2001 . MATE: MPLS adaptive traffic engineering . In IEEE INFOCOM ( 2001). Anwar Elwalid, Cheng Jin, Steven H. Low, and Indra Widjaja. 2001. MATE: MPLS adaptive traffic engineering. In IEEE INFOCOM (2001)."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCOM.2002.1039866"},{"key":"e_1_3_2_2_21_1","volume-title":"Internet traffic engineering by optimizing OSPF weights","author":"Fortz Bernard","year":"2000","unstructured":"Bernard Fortz and Mikkel Thorup . 2000. Internet traffic engineering by optimizing OSPF weights . In IEEE INFOCOM ( 2000 ). Bernard Fortz and Mikkel Thorup. 2000. Internet traffic engineering by optimizing OSPF weights. In IEEE INFOCOM (2000)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1003042"},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2987443.2987483"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1011233219223"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934891"},{"key":"e_1_3_2_2_26_1","volume-title":"Version 5.0","author":"Gu Zonghao","year":"2012","unstructured":"Zonghao Gu , Edward Rothberg , and Robert Bixby . 2012. Gurobi Optimizer Reference Manual , Version 5.0 . Gurobi Optimization Inc., Houston, USA ( 2012 ). Zonghao Gu, Edward Rothberg, and Robert Bixby. 2012. Gurobi Optimizer Reference Manual, Version 5.0. Gurobi Optimization Inc., Houston, USA (2012)."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230545"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486019"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934893"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2492101.1555377"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934904"},{"key":"e_1_3_2_2_33_1","volume-title":"Value at Risk: The New Benchmark for Managing Financial Risk","author":"Jorion Philippe","unstructured":"Philippe Jorion . 2001. Value at Risk: The New Benchmark for Managing Financial Risk . McGraw-Hill . https:\/\/books.google.com\/books?id=S2SsFblvUdMC Philippe Jorion. 2001. Value at Risk: The New Benchmark for Managing Financial Risk. McGraw-Hill. https:\/\/books.google.com\/books?id=S2SsFblvUdMC"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626336"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.5402\/2012\/932456"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2785956.2787478"},{"key":"e_1_3_2_2_38_1","volume-title":"USENIX NSDI","author":"Kumar Praveen","year":"2018","unstructured":"Praveen Kumar , Yang Yuan , Chris Yu , Nate Foster , Robert Kleinberg , Petr Lapukhov , Ciun L. Lim , and Robert Soul\u00e9 . 2018. Semi-Oblivious Traffic Engineering: The Road Not Taken . In USENIX NSDI ( 2018 ). Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, Petr Lapukhov, Ciun L. Lim, and Robert Soul\u00e9. 2018. Semi-Oblivious Traffic Engineering: The Road Not Taken. In USENIX NSDI (2018)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018446"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2010.2050490"},{"key":"e_1_3_2_2_41_1","volume-title":"ICC","author":"Lee Youngseok","year":"2002","unstructured":"Youngseok Lee , Yongho Seok , Yanghee Choi , and Changhoon Kim . 2002. A constrained multipath traffic engineering scheme for MPLS networks . In ICC ( 2002 ). IEEE , 2431--2436. Youngseok Lee, Yongho Seok, Yanghee Choi, and Changhoon Kim. 2002. A constrained multipath traffic engineering scheme for MPLS networks. In ICC (2002). IEEE, 2431--2436."},{"key":"e_1_3_2_2_42_1","unstructured":"George Leopold. 2017. Building Express Backbone: Facebook's new long-haul network. http:\/\/code.facebook.com\/posts\/1782709872057497\/. (2017).  George Leopold. 2017. Building Express Backbone: Facebook's new long-haul network. http:\/\/code.facebook.com\/posts\/1782709872057497\/. (2017)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/2070562.2070586"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2005.845527"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3102980.3102983"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/SURV.2008.080403"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.21314\/JOR.2000.038"},{"key":"e_1_3_2_2_51_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-4266(02)00271-6"},{"key":"e_1_3_2_2_52_1","doi-asserted-by":"crossref","unstructured":"Sergey Sarykalin Gaia Serraino and Stan Uryasev. 2008. Value-at-Risk vs. Conditional Value-at-Risk in Risk Management and Optimization.  Sergey Sarykalin Gaia Serraino and Stan Uryasev. 2008. Value-at-Risk vs. Conditional Value-at-Risk in Risk Management and Optimization.","DOI":"10.1287\/educ.1080.0052"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/77600.77620"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993744.1993756"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2639066"},{"key":"e_1_3_2_2_56_1","volume-title":"Dynamic risk-aware routing for OSPF networks","author":"Vidalenc Bruno","year":"2013","unstructured":"Bruno Vidalenc , Laurent Ciavaglia , Ludovic Noirie , and Eric Renault . 2013. Dynamic risk-aware routing for OSPF networks . In IFIP\/IEEE IM ( 2013 ). 226--234. Bruno Vidalenc, Laurent Ciavaglia, Ludovic Noirie, and Eric Renault. 2013. Dynamic risk-aware routing for OSPF networks. In IFIP\/IEEE IM (2013). 226--234."},{"key":"e_1_3_2_2_57_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2594235"}],"event":{"name":"SIGCOMM '19: ACM SIGCOMM 2019 Conference","location":"Beijing China","acronym":"SIGCOMM '19","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM Special Interest Group on Data Communication"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341302.3342069","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3341302.3342069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:12:56Z","timestamp":1750201976000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3341302.3342069"}},"subtitle":["striking the right utilization-availability balance in WAN traffic engineering"],"short-title":[],"issued":{"date-parts":[[2019,8,19]]},"references-count":56,"alternative-id":["10.1145\/3341302.3342069","10.1145\/3341302"],"URL":"https:\/\/doi.org\/10.1145\/3341302.3342069","relation":{},"subject":[],"published":{"date-parts":[[2019,8,19]]},"assertion":[{"value":"2019-08-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}