{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,7]],"date-time":"2026-05-07T11:39:57Z","timestamp":1778153997187,"version":"3.51.4"},"reference-count":51,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-2106294,CNS-1946022"],"award-info":[{"award-number":["CNS-2106294,CNS-1946022"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["Proc. ACM Meas. Anal. Comput. Syst."],"published-print":{"date-parts":[[2023,12,7]]},"abstract":"<jats:p>While softwarization and virtualization technologies make modern communication networks appear easier to manage, they also introduce highly complex interactions within the networks that can cause unexpected security threats. In this work, we study a particular security threat due to the sharing of links between high-security paths and low-security paths, which enables a new type of DoS attacks, called cross-path attacks, that indirectly attack a set of targeted high-security paths (target paths) by congesting the shared links through a set of attacker-controlled low-security paths (attack paths). While the feasibility of such attacks has been recently demonstrated in the context of SDN, their potential performance impact has not been characterized. To this end, we develop an approach for designing an optimized cross-path attack under a constrained total attack rate, consisting of (i) novel reconnaissance algorithms that can provide consistent estimates of the locations and parameters of the shared links via network tomography, and (ii) efficient optimization methods to design the optimal allocation of attack rate over the attack paths to maximally degrade the performance of the target paths. The proposed attack has achieved a significantly larger performance impact than its non-optimized counterparts in extensive evaluations based on multiple network settings, signaling the importance of addressing such intelligent attacks in network design.<\/jats:p>","DOI":"10.1145\/3626789","type":"journal-article","created":{"date-parts":[[2023,12,12]],"date-time":"2023-12-12T15:20:29Z","timestamp":1702394429000},"page":"1-30","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["Optimized Cross-Path Attacks via Adversarial Reconnaissance"],"prefix":"10.1145","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1727-6754","authenticated-orcid":false,"given":"Yudi","family":"Huang","sequence":"first","affiliation":[{"name":"Pennsylvania State University, University Park, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9164-3885","authenticated-orcid":false,"given":"Yilei","family":"Lin","sequence":"additional","affiliation":[{"name":"Meta, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1070-7483","authenticated-orcid":false,"given":"Ting","family":"He","sequence":"additional","affiliation":[{"name":"Pennsylvania State University, University Park, PA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,12,12]]},"reference":[{"key":"e_1_2_1_1_1","unstructured":"2017. Preparing for a Cloud AR\/VR Future. Huawei public white paper. https:\/\/www-file.huawei.com\/-\/media\/corporate\/pdf\/x-lab\/cloud_vr_ar_white_paper_en.pdf."},{"key":"e_1_2_1_2_1","volume-title":"Feasibility study on new services and markets technology enablers for network operation","author":"GPP.","unstructured":"3GPP. 2016. Feasibility study on new services and markets technology enablers for network operation; Stage 1. TR 22.864. https:\/\/portal.3gpp.org\/desktopmodules\/Specifications\/SpecificationDetails.aspx'specificationId=3016"},{"key":"e_1_2_1_3_1","unstructured":"3GPP. 2018. NR; Study on integrated access and backhaul. TR 38.874. https:\/\/portal.3gpp.org\/desktopmodules\/Specifications\/SpecificationDetails.aspx'specificationId=3232"},{"key":"e_1_2_1_4_1","volume-title":"Adversarial Network Forensics in Software Defined Networking. In ACM Symposium on SDN Research (SOSR). ACM.","author":"Achleitner Stefan","year":"2017","unstructured":"Stefan Achleitner, Thomas La Porta, Trent Jaeger, and Patrick McDaniel. 2017. Adversarial Network Forensics in Software Defined Networking. In ACM Symposium on SDN Research (SOSR). ACM."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3059542"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11134-009-9150-9"},{"key":"e_1_2_1_7_1","first-page":"1","article-title":"Graph reconstruction from path correlation data","volume":"35","author":"Berkolaiko Gregory","year":"2018","unstructured":"Gregory Berkolaiko, Nick Duffield, Mahmood Ettehad, and Kyriakos Manousakis. 2018. Graph reconstruction from path correlation data. Inverse Problems 35, 1 (November 2018), 015001.","journal-title":"Inverse Problems"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/384268.378440"},{"key":"e_1_2_1_9_1","unstructured":"Jiahao Cao Qi Li Renjie Xie Kun Sun Guofei Gu Mingwei Xu and Yuan Yang. 2019. The CrossPath Attack: Disrupting the SDN Control Channel via Shared Links. In USENIX Security."},{"key":"e_1_2_1_10_1","doi-asserted-by":"crossref","unstructured":"M. Coates R. Castro M. Gadhiok R. King Y. Tsang and R. Nowak. 2002. Maximum Likelihood Network Topology Identification from Edge-based Unicast Measurements. In ACM SIGMETRICS.","DOI":"10.1145\/511335.511337"},{"key":"e_1_2_1_11_1","volume-title":"Vicente","author":"Conn Andrew R.","year":"2009","unstructured":"Andrew R. Conn, Katya Scheinberg, and Luis N. Vicente. 2009. Introduction to Derivative-Free Optimization. Society for Industrial and Applied Mathematics."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.125"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1002\/itl2.118"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.14722\/ndss.2015.23064"},{"key":"e_1_2_1_15_1","volume-title":"Distributions and Fourier transforms","author":"Donoghue William F","unstructured":"William F Donoghue. 2014. Distributions and Fourier transforms. Academic Press."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2001.916660"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737475"},{"key":"e_1_2_1_18_1","volume-title":"Repetita: Repeatable experiments for performance evaluation of traffic-engineering algorithms. arXiv preprint arXiv:1710.08665","author":"Gay Steven","year":"2017","unstructured":"Steven Gay, Pierre Schaus, and Stefano Vissicchio. 2017. Repetita: Repeatable experiments for performance evaluation of traffic-engineering algorithms. arXiv preprint arXiv:1710.08665 (2017)."},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Nikola Gvozdiev Stefano Vissicchio Brad Karp and Mark Handley. 2018. On low-latency-capable topologies and their impact on the design of intra-domain routing. In SIGCOMM. 88--102.","DOI":"10.1145\/3230543.3230575"},{"key":"e_1_2_1_20_1","volume-title":"Patel","author":"Harrison Peter","year":"1992","unstructured":"Peter Harrison and Naresh M. Patel. 1992. Performance Modelling of Communication Networks and Computer Architectures. Addison--Wesley."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1017\/9781108377119"},{"key":"e_1_2_1_22_1","volume-title":"Network simulations with the ns-3 simulator. SIGCOMM demonstration 14, 14","author":"Henderson Thomas R","year":"2008","unstructured":"Thomas R Henderson, Mathieu Lacage, George F Riley, Craig Dowell, and Joseph Kopena. 2008. Network simulations with the ns-3 simulator. SIGCOMM demonstration 14, 14 (2008), 527."},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01589330"},{"key":"e_1_2_1_24_1","doi-asserted-by":"crossref","unstructured":"Hao Jiang and Constantinos Dovrolis. 2005. Why is the internet traffic bursty in short time scales?. In SIGMETRICS. 241--252.","DOI":"10.1145\/1071690.1064240"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/1298306.1298321"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2011.111002"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1186\/s13635-018-0072-0"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2017.3481355"},{"key":"e_1_2_1_29_1","doi-asserted-by":"crossref","unstructured":"Yilei Lin Ting He and Guodong Pang. 2021. Queuing Network Topology Inference Using Passive Measurements.","DOI":"10.23919\/IFIPNetworking52078.2021.9472774"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICC.2019.8761099"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2985908"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.011.1900303"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2009.2022538"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.2997702"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.simpat.2019.101933"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/167088.167286"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2006.884020"},{"key":"e_1_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Henrik Ronkainen Jonas Edstam Anders Ericsson and Christer \u00d6stberg. 2020. Integrated access and backhaul -- a new type of wireless backhaul in 5G. Ericsson Technology Review. https:\/\/www.ericsson.com\/4ac691\/assets\/local\/reports-papers\/ericsson-technology-review\/docs\/2020\/introducing-integrated-access-and-backhaul.pdf","DOI":"10.23919\/ETR.2020.9905510"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0140-3664(02)00215-3"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3281411.3281435"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/CNS.2019.8802852"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2014.2304431"},{"key":"e_1_2_1_43_1","unstructured":"NGMN 5G security group. 2016. 5G security recommendations Package 2: Network Slicing. NGMN Alliance. https:\/\/ngmn.org\/wp-content\/uploads\/Publications\/2016\/160429_NGMN_5G_Security_Network_Slicing_v1_0.pdf"},{"key":"e_1_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2017.8057009"},{"key":"e_1_2_1_45_1","doi-asserted-by":"crossref","unstructured":"S. Shin V. Yegneswaran P. Porras and G. Gu. 2013. AVANT-GUARD: Scalable and vigilant switch flow management in software-defined networks. In ACM CCS.","DOI":"10.1145\/2508859.2516684"},{"key":"e_1_2_1_46_1","volume-title":"Seung Yeob Nam, and Dan Keun Sung","author":"Sohn Kyu-Seek","year":"2006","unstructured":"Kyu-Seek Sohn, Seung Yeob Nam, and Dan Keun Sung. 2006. A distributed LSP scheme to reduce spare bandwidth demand in MPLS networks. IEEE transactions on communications 54, 7 (2006), 1277--1288."},{"key":"e_1_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2015.27"},{"key":"e_1_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/GLOCOM.2002.1189012"},{"key":"e_1_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2012.2204532"},{"key":"e_1_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2021.3099717"},{"key":"e_1_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2019.1800234"}],"container-title":["Proceedings of the ACM on Measurement and Analysis of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626789","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3626789","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T00:14:07Z","timestamp":1755908047000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3626789"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":51,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2023,12,7]]}},"alternative-id":["10.1145\/3626789"],"URL":"https:\/\/doi.org\/10.1145\/3626789","relation":{},"ISSN":["2476-1249"],"issn-type":[{"value":"2476-1249","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"2023-12-12","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}