{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:01:17Z","timestamp":1780502477398,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T00:00:00Z","timestamp":1628467200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,9]]},"DOI":"10.1145\/3452296.3472918","type":"proceedings-article","created":{"date-parts":[[2021,8,9]],"date-time":"2021-08-09T18:13:15Z","timestamp":1628532795000},"page":"547-559","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":35,"title":["Capacity-efficient and uncertainty-resilient backbone network planning with hose"],"prefix":"10.1145","author":[{"given":"Satyajeet Singh","family":"Ahuja","sequence":"first","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Varun","family":"Gupta","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vinayak","family":"Dangui","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Soshant","family":"Bali","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Abishek","family":"Gopalan","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hao","family":"Zhong","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Petr","family":"Lapukhov","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yiting","family":"Xia","sequence":"additional","affiliation":[{"name":"Max Planck Institute for Informatics"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"Facebook Inc."}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,8,9]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n. d.]. FICO Xpress Optimization. ([n. d.]). https:\/\/www.fico.com\/en\/products\/fico-xpress-optimization  [n. d.]. FICO Xpress Optimization. ([n. d.]). https:\/\/www.fico.com\/en\/products\/fico-xpress-optimization"},{"key":"e_1_3_2_2_2_1","unstructured":"[n. d.]. TAO: The power of the graph. ([n. d.]). https:\/\/engineering.fb.com\/2013\/06\/25\/core-data\/tao-the-power-of-the-graph\/  [n. d.]. TAO: The power of the graph. ([n. d.]). https:\/\/engineering.fb.com\/2013\/06\/25\/core-data\/tao-the-power-of-the-graph\/"},{"key":"e_1_3_2_2_3_1","unstructured":"R. Andersen F. Chung A. Sen and G. Xue. 2004. On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. IEEE INFOCOM (2004).  R. Andersen F. Chung A. Sen and G. Xue. 2004. On Disjoint Path Pairs with Wavelength Continuity Constraint in WDM Networks. IEEE INFOCOM (2004)."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018465"},{"key":"e_1_3_2_2_5_1","volume-title":"Capacity Planning for the Google Backbone Network. In ISMP 2015 (International Symposium on Mathematical Programming).","author":"Bangla Ajay Kumar","year":"2015","unstructured":"Ajay Kumar Bangla , Alireza Ghaffarkhah , Ben Preskill , Bikash Koley , Christoph Albrecht , Emilie Danna , Joe Jiang , and Xiaoxue Zhao . 2015 . Capacity Planning for the Google Backbone Network. In ISMP 2015 (International Symposium on Mathematical Programming). Ajay Kumar Bangla, Alireza Ghaffarkhah, Ben Preskill, Bikash Koley, Christoph Albrecht, Emilie Danna, Joe Jiang, and Xiaoxue Zhao. 2015. Capacity Planning for the Google Backbone Network. In ISMP 2015 (International Symposium on Mathematical Programming)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/235815.235821"},{"key":"e_1_3_2_2_7_1","first-page":"18","article-title":"Extensions to P2MP RSVP-TE for VPN-specific State Provisioning with Fair Resource","volume":"30","author":"Byun Haesun","year":"2007","unstructured":"Haesun Byun and Meejeong Lee . 2007 . Extensions to P2MP RSVP-TE for VPN-specific State Provisioning with Fair Resource Sharing. Comput. Commun. 30 , 18 (Dec. 2007), 3736--3745. 0140-3664 Haesun Byun and Meejeong Lee. 2007. Extensions to P2MP RSVP-TE for VPN-specific State Provisioning with Fair Resource Sharing. Comput. Commun. 30, 18 (Dec. 2007), 3736--3745. 0140-3664","journal-title":"Sharing. Comput. Commun."},{"key":"e_1_3_2_2_8_1","volume-title":"Efficient Coflow Scheduling with Varys. 44, 4","author":"Chowdhury Mosharaf","year":"2014","unstructured":"Mosharaf Chowdhury , Yuan Zhong , and Ion Stoica . 2014. Efficient Coflow Scheduling with Varys. 44, 4 ( 2014 ). Mosharaf Chowdhury, Yuan Zhong, and Ion Stoica. 2014. Efficient Coflow Scheduling with Varys. 44, 4 (2014)."},{"key":"e_1_3_2_2_9_1","volume-title":"A Flexible Model for Resource Management in Virtual Private Networks. ACM Sigcomm","author":"Duffield N. G.","year":"1999","unstructured":"N. G. Duffield , P. Goyal , A. Greenberg , P. Mishra , K. K. Ramakrishnan , and J. E. V. der Merwe . 1999. A Flexible Model for Resource Management in Virtual Private Networks. ACM Sigcomm , San Diego , California, USA ( 1999 ). N. G. Duffield, P. Goyal, A. Greenberg, P. Mishra, K. K. Ramakrishnan, and J. E. V. der Merwe. 1999. A Flexible Model for Resource Management in Virtual Private Networks. ACM Sigcomm, San Diego, California, USA (1999)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11758471_13"},{"key":"e_1_3_2_2_11_1","volume-title":"On The Complexity of Time Table and Multi-commodity Flow Problems. In 16th Annual Symposium on Foundations of Computer Science (sfcs","author":"Even Shimon","year":"1975","unstructured":"Shimon Even , Alon Itai , and Adi Shamir . 1975 . On The Complexity of Time Table and Multi-commodity Flow Problems. In 16th Annual Symposium on Foundations of Computer Science (sfcs 1975). IEEE, 184--193. Shimon Even, Alon Itai, and Adi Shamir. 1975. On The Complexity of Time Table and Multi-commodity Flow Problems. In 16th Annual Symposium on Foundations of Computer Science (sfcs 1975). IEEE, 184--193."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1997.0866"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1592568.1592576"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380830"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1061\/(ASCE)0733-9429(1998)124:11(1115)"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/3098822.3098836"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2377677.2377717"},{"key":"e_1_3_2_2_19_1","volume-title":"Proceedings of the 3rd Conference on I\/O Virtualization. USENIX Association, USA.","author":"Rodrigues Henrique","year":"2011","unstructured":"Henrique Rodrigues , Jose Renato Santos , Yoshio Turner , Paolo Soares , and Dorgival Guedes . 2011 . Gatekeeper: Supporting Bandwidth Guarantees for Multi-Tenant Datacenter Networks . In Proceedings of the 3rd Conference on I\/O Virtualization. USENIX Association, USA. Henrique Rodrigues, Jose Renato Santos, Yoshio Turner, Paolo Soares, and Dorgival Guedes. 2011. Gatekeeper: Supporting Bandwidth Guarantees for Multi-Tenant Datacenter Networks. In Proceedings of the 3rd Conference on I\/O Virtualization. USENIX Association, USA."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03685-9_25"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/JLT.2018.2830973"},{"key":"e_1_3_2_2_22_1","volume-title":"13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18)","author":"Veeraraghavan Kaushik","year":"2018","unstructured":"Kaushik Veeraraghavan , Justin Meza , Scott Michelson , Sankaralingam Panneerselvam , Alex Gyori , David Chou , Sonia Margulis , Daniel Obenshain , Shruti Padmanabha , Ashish Shah , Yee Jiun Song , and Tianyin Xu . 2018 . Maelstrom: Mitigating Datacenter-level Disasters by Draining Interdependent Traffic Safely and Efficiently . In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18) . USENIX Association, Carlsbad, CA, 373--389. Kaushik Veeraraghavan, Justin Meza, Scott Michelson, Sankaralingam Panneerselvam, Alex Gyori, David Chou, Sonia Margulis, Daniel Obenshain, Shruti Padmanabha, Ashish Shah, Yee Jiun Song, and Tianyin Xu. 2018. Maelstrom: Mitigating Datacenter-level Disasters by Draining Interdependent Traffic Safely and Efficiently. In 13th USENIX Symposium on Operating Systems Design and Implementation (OSDI 18). USENIX Association, Carlsbad, CA, 373--389."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.5555\/2040416.2040431"},{"key":"e_1_3_2_2_24_1","volume-title":"Finding Critical Traffic Matrices. In 2005 International Conference on Dependable Systems and Networks (DSN'05)","author":"Zhang Y.","unstructured":"Y. Zhang and Z. Ge . 2005 . Finding Critical Traffic Matrices. In 2005 International Conference on Dependable Systems and Networks (DSN'05) . 188--197. Y. Zhang and Z. Ge. 2005. Finding Critical Traffic Matrices. In 2005 International Conference on Dependable Systems and Networks (DSN'05). 188--197."}],"event":{"name":"SIGCOMM '21: ACM SIGCOMM 2021 Conference","location":"Virtual Event USA","acronym":"SIGCOMM '21","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the 2021 ACM SIGCOMM 2021 Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472918","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3452296.3472918","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:40Z","timestamp":1750191460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3452296.3472918"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,9]]},"references-count":24,"alternative-id":["10.1145\/3452296.3472918","10.1145\/3452296"],"URL":"https:\/\/doi.org\/10.1145\/3452296.3472918","relation":{},"subject":[],"published":{"date-parts":[[2021,8,9]]},"assertion":[{"value":"2021-08-09","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}