{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T22:45:00Z","timestamp":1782945900505,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":64,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T00:00:00Z","timestamp":1722729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1910234"],"award-info":[{"award-number":["CNS-1910234"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2212160"],"award-info":[{"award-number":["CNS-2212160"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1918483"],"award-info":[{"award-number":["CCF-1918483"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CAREER IIS-1943364"],"award-info":[{"award-number":["CAREER IIS-1943364"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA95502210069"],"award-info":[{"award-number":["FA95502210069"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,8,4]]},"DOI":"10.1145\/3651890.3672237","type":"proceedings-article","created":{"date-parts":[[2024,7,31]],"date-time":"2024-07-31T13:11:43Z","timestamp":1722431503000},"page":"86-102","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Transferable Neural WAN TE for Changing Topologies"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-0898-8353","authenticated-orcid":false,"given":"Abd AlRhman","family":"AlQiam","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, Indiana, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-3709-0216","authenticated-orcid":false,"given":"Yuanjun","family":"Yao","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2816-9946","authenticated-orcid":false,"given":"Zhaodong","family":"Wang","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-8907-3859","authenticated-orcid":false,"given":"Satyajeet Singh","family":"Ahuja","sequence":"additional","affiliation":[{"name":"Meta Platforms, Inc, Menlo Park, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2736-5694","authenticated-orcid":false,"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[{"name":"Meta, Menlo Park, California, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4825-4352","authenticated-orcid":false,"given":"Sanjay G.","family":"Rao","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, Indiana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3527-6192","authenticated-orcid":false,"given":"Bruno","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, Indiana, United States of America"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3085-0084","authenticated-orcid":false,"given":"Mohit","family":"Tawarmalani","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, Indiana, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,8,4]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Abilene traffic matrices. http:\/\/www.cs.utexas.edu\/~yzhang\/research\/AbileneTM\/."},{"key":"e_1_3_2_1_2_1","first-page":"175","volume-title":"18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21)","author":"Abuzaid Firas","year":"2021","unstructured":"Firas Abuzaid, Srikanth Kandula, Behnaz Arzani, Ishai Menache, Matei Zaharia, and Peter Bailis. Contracting wide-area network topologies to solve flow problems quickly. In 18th USENIX Symposium on Networked Systems Design and Implementation (NSDI 21), pages 175--200. USENIX Association, April 2021."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/863955.863991"},{"key":"e_1_3_2_1_4_1","volume-title":"Neural Information Processing Systems","author":"Applegate David L.","year":"2021","unstructured":"David L. Applegate, Mateo D'iaz, Oliver Hinder, Haihao Lu, Miles Lubin, Brendan O'Donoghue, and Warren Schudy. Practical large-scale linear programming using primal-dual hybrid gradient. In Neural Information Processing Systems, 2021."},{"key":"e_1_3_2_1_5_1","volume-title":"ICML","author":"Bevilacqua Beatrice","year":"2023","unstructured":"Beatrice Bevilacqua, Kyriacos Nikiforou, Borja Ibarz, Ioana Bica, Michela Paganini, Charles Blundell, Jovana Mitrovic, and Petar Veli\u010dkovi\u0107. Neural algorithmic reasoning with causal regularisation. ICML, 2023."},{"key":"e_1_3_2_1_6_1","volume-title":"International Conference on Machine Learning. PMLR","author":"Bevilacqua Beatrice","year":"2021","unstructured":"Beatrice Bevilacqua, Yangze Zhou, and Bruno Ribeiro. Size-invariant graph representations for graph classification extrapolations. In International Conference on Machine Learning. PMLR, 2021."},{"key":"e_1_3_2_1_7_1","volume-title":"Proceedings of ACM SIGCOMM","author":"Bogle Jeremy","year":"2019","unstructured":"Jeremy Bogle, Nikhil Bhatia, Manya Ghobadi, Ishai Menache, Nikolaj Bjorner, Asaf Valadarsky, and Michael Schapira. Teavar: Striking the right utilization-availability balance in wan traffic engineering. In Proceedings of ACM SIGCOMM, 2019."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366697"},{"key":"e_1_3_2_1_9_1","volume-title":"How many random seeds? statistical power analysis in deep reinforcement learning experiments. arXiv preprint arXiv:1806.08295","author":"Colas C\u00e9dric","year":"2018","unstructured":"C\u00e9dric Colas, Olivier Sigaud, and Pierre-Yves Oudeyer. How many random seeds? statistical power analysis in deep reinforcement learning experiments. arXiv preprint arXiv:1806.08295, 2018."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195833"},{"key":"e_1_3_2_1_11_1","first-page":"30318","article-title":"8-bit matrix multiplication for transformers at scale","volume":"35","author":"Dettmers Tim","year":"2022","unstructured":"Tim Dettmers, Mike Lewis, Younes Belkada, and Luke Zettlemoyer. Gpt3. int8 (): 8-bit matrix multiplication for transformers at scale. Advances in Neural Information Processing Systems, 35:30318--30332, 2022.","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_1_12_1","volume-title":"Choice of solvers and algorithms. https:\/\/developers.google.com\/optimization\/lp\/lp_advanced#choice_of_solvers_and_algorithms\/","author":"Developers Google","year":"2024","unstructured":"Google Developers. Choice of solvers and algorithms. https:\/\/developers.google.com\/optimization\/lp\/lp_advanced#choice_of_solvers_and_algorithms\/, 2024."},{"key":"e_1_3_2_1_13_1","volume-title":"Fast graph representation learning with pytorch geometric. https:\/\/github.com\/pyg-team\/pytorch_geometric, 05","author":"Fey Matthias","year":"2019","unstructured":"Matthias Fey and Jan Eric Lenssen. Fast graph representation learning with pytorch geometric. https:\/\/github.com\/pyg-team\/pytorch_geometric, 05 2019."},{"key":"e_1_3_2_1_14_1","first-page":"225","volume-title":"Proceedings of International Network Optimization Conference","author":"Fortz Bernard","year":"2003","unstructured":"Bernard Fortz and Mikkel Thorup. Robust optimization of OSPF\/IS-IS weights. In Proceedings of International Network Optimization Conference, pages 225--230, 2003."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWQOS52092.2021.9521303"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2013.131208"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2018436.2018477"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2934872.2934891"},{"key":"e_1_3_2_1_19_1","volume-title":"March","author":"Gschwind Michael","year":"2023","unstructured":"Michael Gschwind, Driss Guessous, and Christian Puhrsch. Accelerated pytorch 2 transformers. https:\/\/pytorch.org\/blog\/accelerated-pytorch-2\/, March 2023."},{"key":"e_1_3_2_1_20_1","volume-title":"Gurobi Optimizer Reference Manual","author":"Optimization Gurobi","year":"2023","unstructured":"Gurobi Optimization, LLC. Gurobi Optimizer Reference Manual, 2023."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11694"},{"key":"e_1_3_2_1_22_1","volume-title":"Deep reinforcement learning that matters","author":"Henderson Peter","year":"2019","unstructured":"Peter Henderson, Riashat Islam, Philip Bachman, Joelle Pineau, Doina Precup, and David Meger. Deep reinforcement learning that matters, 2019."},{"key":"e_1_3_2_1_23_1","volume-title":"Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531","author":"Hinton Geoffrey","year":"2015","unstructured":"Geoffrey Hinton, Oriol Vinyals, and Jeff Dean. Distilling the knowledge in a neural network. arXiv preprint arXiv:1503.02531, 2015."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2486001.2486012"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3230543.3230545"},{"key":"e_1_3_2_1_26_1","first-page":"3","volume-title":"Proceedings of ACM SIGCOMM","author":"Jain Sushant","year":"2013","unstructured":"Sushant Jain, Alok Kumar, Subhasree Mandal, Joon Ong, Leon Poutievski, Arjun Singh, Subbaiah Venkata, Jim Wanderer, Junlan Zhou, Min Zhu, Jon Zolla, Urs H\u00f6lzle, Stephen Stuart, and Amin Vahdat. B4: Experience with a globally-deployed software defined wan. In Proceedings of ACM SIGCOMM, pages 3--14, 2013."},{"key":"e_1_3_2_1_27_1","first-page":"110","volume-title":"Mohit Tawarmalani. Flexile: Meeting bandwidth objectives almost always. In Proceedings of the 18th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '22","author":"Jiang Chuan","year":"2022","unstructured":"Chuan Jiang, Zixuan Li, Sanjay Rao, and Mohit Tawarmalani. Flexile: Meeting bandwidth objectives almost always. In Proceedings of the 18th International Conference on Emerging Networking EXperiments and Technologies, CoNEXT '22, page 110--125, New York, NY, USA, 2022. Association for Computing Machinery."},{"key":"e_1_3_2_1_28_1","first-page":"139","volume-title":"Proceedings of ACM SIGCOMM","author":"Jiang Chuan","year":"2020","unstructured":"Chuan Jiang, Sanjay Rao, and Mohit Tawarmalani. Pcf: Provably resilient flexible routing. In Proceedings of ACM SIGCOMM, page 139--153, 2020."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCCN52240.2021.9522222"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080122"},{"key":"e_1_3_2_1_31_1","volume-title":"Kingma and Jimmy Ba. Adam: A method for stochastic optimization","author":"Diederik","year":"2017","unstructured":"Diederik P. Kingma and Jimmy Ba. Adam: A method for stochastic optimization, 2017."},{"key":"e_1_3_2_1_32_1","volume-title":"International Conference on Learning Representations","author":"Thomas","year":"2017","unstructured":"Thomas N. Kipf and Max Welling. Semi-supervised classification with graph convolutional networks. In International Conference on Learning Representations, 2017."},{"issue":"1765","key":"e_1_3_2_1_33_1","first-page":"1775","article-title":"The internet topology zoo","volume":"29","author":"Knight Simon","year":"2011","unstructured":"Simon Knight, Hung Nguyen, Nickolas Falkner, Rhys Bowden, and Matthew Roughan. The internet topology zoo. IEEE Journal on Selected Areas in Communications, 29:1765 -- 1775, October 2011.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"key":"e_1_3_2_1_34_1","volume-title":"Proceedings of ACM SIGCOMM","author":"Kumar Alok","year":"2015","unstructured":"Alok Kumar, Sushant Jain, Uday Naik, Nikhil Kasinadhuni, Enrique Cauich Zermeno, C. Stephen Gunn, Jing Ai, Bj\u00f6rn Carlin, Mihai Amarandei-Stavila, Mathieu Robin, Aspi Siganporia, Stephen Stuart, and Amin Vahdat. Bwe: Flexible, hierarchical bandwidth allocation for wan distributed computing. In Proceedings of ACM SIGCOMM, 2015."},{"key":"e_1_3_2_1_35_1","first-page":"157","volume-title":"15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18)","author":"Kumar Praveen","year":"2018","unstructured":"Praveen Kumar, Yang Yuan, Chris Yu, Nate Foster, Robert Kleinberg, Petr Lapukhov, Chiun Lin Lim, and Robert Soul\u00e9. Semi-oblivious traffic engineering: The road not taken. In 15th USENIX Symposium on Networked Systems Design and Implementation (NSDI 18), pages 157--170, 2018."},{"key":"e_1_3_2_1_36_1","series-title":"Proceedings of Machine Learning Research","first-page":"3744","volume-title":"Proceedings of the 36th International Conference on Machine Learning","author":"Lee Juho","year":"2019","unstructured":"Juho Lee, Yoonho Lee, Jungtaek Kim, Adam Kosiorek, Seungjin Choi, and Yee Whye Teh. Set transformer: A framework for attention-based permutation-invariant neural networks. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 3744--3753. PMLR, 09--15 Jun 2019."},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2619239.2626314"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOMWKSHPS50562.2020.9162994"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData50022.2020.9512748"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2007.902727"},{"key":"e_1_3_2_1_41_1","volume-title":"Pruning convolutional neural networks for resource efficient inference. arXiv preprint arXiv:1611.06440","author":"Molchanov Pavlo","year":"2016","unstructured":"Pavlo Molchanov, Stephen Tyree, Tero Karras, Timo Aila, and Jan Kautz. Pruning convolutional neural networks for resource efficient inference. arXiv preprint arXiv:1611.06440, 2016."},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v33i01.33014602"},{"key":"e_1_3_2_1_43_1","first-page":"1937","volume-title":"21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24)","author":"Namyar Pooria","year":"2024","unstructured":"Pooria Namyar, Behnaz Arzani, Srikanth Kandula, Santiago Segarra, Daniel Crankshaw, Umesh Krishnaswamy, Ramesh Govindan, and Himanshu Raj. Solving Max-Min fair resource allocations quickly on large graphs. In 21st USENIX Symposium on Networked Systems Design and Implementation (NSDI 24), pages 1937--1958, Santa Clara, CA, April 2024. USENIX Association."},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jnca.2016.10.006"},{"key":"e_1_3_2_1_45_1","volume-title":"Proceedings of the 3rd International Network Optimization Conference (INOC 2007","author":"Orlowski S.","year":"2007","unstructured":"S. Orlowski, M. Pi\u00f3ro, A. Tomaszewski, and R. Wess\u00e4ly. SNDlib 1.0--Survivable Network Design Library. In Proceedings of the 3rd International Network Optimization Conference (INOC 2007), Spa, Belgium, April 2007. http:\/\/sndlib.zib.de, extended version accepted in Networks, 2009."},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.5555\/1780374.1780385"},{"key":"e_1_3_2_1_47_1","volume-title":"H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc","author":"Paszke Adam","year":"2019","unstructured":"Adam Paszke, Sam Gross, Francisco Massa, Adam Lerer, James Bradbury, Gregory Chanan, Trevor Killeen, Zeming Lin, Natalia Gimelshein, Luca Antiga, Alban Desmaison, Andreas Kopf, Edward Yang, Zachary DeVito, Martin Raison, Alykhan Tejani, Sasank Chilamkurthy, Benoit Steiner, Lu Fang, Junjie Bai, and Soumith Chintala. Pytorch: An imperative style, high-performance deep learning library. In H. Wallach, H. Larochelle, A. Beygelzimer, F. d'Alch\u00e9-Buc, E. Fox, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 32. Curran Associates, Inc., 2019."},{"key":"e_1_3_2_1_48_1","first-page":"1557","volume-title":"20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23)","author":"Perry Yarin","year":"2023","unstructured":"Yarin Perry, Felipe Vieira Frujeri, Chaim Hoch, Srikanth Kandula, Ishai Menache, Michael Schapira, and Aviv Tamar. DOTE: Rethinking (predictive) WAN traffic engineering. In 20th USENIX Symposium on Networked Systems Design and Implementation (NSDI 23), pages 1557--1581, Boston, MA, April 2023. USENIX Association."},{"key":"e_1_3_2_1_49_1","volume-title":"Flow, and Capacity Design in Communication and Computer Networks","author":"Pi\u00f3ro Michal","year":"2004","unstructured":"Michal Pi\u00f3ro and Deepankar Medhi. Routing, Flow, and Capacity Design in Communication and Computer Networks. Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 2004."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2523616.2523638"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/3314148.3314357"},{"key":"e_1_3_2_1_52_1","volume-title":"Markus Hagenbuchner, and Gabriele Monfardini. The graph neural network model","author":"Scarselli Franco","year":"2008","unstructured":"Franco Scarselli, Marco Gori, Ah Chung Tsoi, Markus Hagenbuchner, and Gabriele Monfardini. The graph neural network model. IEEE transactions on neural networks, 20(1):61--80, 2008."},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/1851182.1851220"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/1111322.1111341"},{"key":"e_1_3_2_1_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3152434.3152441"},{"key":"e_1_3_2_1_56_1","volume-title":"Advances in Neural Information Processing Systems","author":"Vaswani Ashish","year":"2017","unstructured":"Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. Attention is all you need. In I. Guyon, U. Von Luxburg, S. Bengio, H. Wallach, R. Fergus, S. Vishwanathan, and R. Garnett, editors, Advances in Neural Information Processing Systems, volume 30. Curran Associates, Inc., 2017."},{"key":"e_1_3_2_1_57_1","volume-title":"International Conference on Machine Learning","author":"Velivckovi'c Petar","year":"2022","unstructured":"Petar Velivckovi'c, Adri\u00e0 Puigdom\u00e8nech Badia, David Budden, Razvan Pascanu, Andrea Banino, Mikhail Dashevskiy, Raia Hadsell, and Charles Blundell. The clrs algorithmic reasoning benchmark. In International Conference on Machine Learning, 2022."},{"key":"e_1_3_2_1_58_1","first-page":"291","volume-title":"Proceedings of ACM SIGCOMM","author":"Wang Ye","year":"2010","unstructured":"Ye Wang, Hao Wang, Ajay Mahimkar, Richard Alimi, Yin Zhang, Lili Qiu, and Yang Richard Yang. R3: Resilient routing reconfiguration. In Proceedings of ACM SIGCOMM, pages 291--302, 2010."},{"key":"e_1_3_2_1_59_1","volume-title":"ICLR","author":"Xu Keyulu","year":"2019","unstructured":"Keyulu Xu, Weihua Hu, Jure Leskovec, and Stefanie Jegelka. How powerful are graph neural networks? ICLR, 2019."},{"key":"e_1_3_2_1_60_1","doi-asserted-by":"publisher","DOI":"10.1109\/OJCOMS.2021.3062636"},{"key":"e_1_3_2_1_61_1","doi-asserted-by":"publisher","DOI":"10.1145\/3603269.3604857"},{"key":"e_1_3_2_1_62_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2018.8485853"},{"key":"e_1_3_2_1_63_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2020.3000371"},{"key":"e_1_3_2_1_64_1","doi-asserted-by":"publisher","DOI":"10.1145\/3452296.3472902"}],"event":{"name":"ACM SIGCOMM '24: ACM SIGCOMM 2024 Conference","location":"Sydney NSW Australia","acronym":"ACM SIGCOMM '24","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication"]},"container-title":["Proceedings of the ACM SIGCOMM 2024 Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651890.3672237","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3651890.3672237","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3651890.3672237","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3651890.3672237","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T17:49:12Z","timestamp":1750268952000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3651890.3672237"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,4]]},"references-count":64,"alternative-id":["10.1145\/3651890.3672237","10.1145\/3651890"],"URL":"https:\/\/doi.org\/10.1145\/3651890.3672237","relation":{},"subject":[],"published":{"date-parts":[[2024,8,4]]},"assertion":[{"value":"2024-08-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}