Abstract
Network vulnerability assessment, in which a communication between nodes is functional if their distance under a given metric is lower than a pre-defined threshold, has received significant attention recently. However, those works only focused on discrete domain while many practical applications require us to investigate in the continuous domain. Motivated by this observation, we study a Length-bounded Paths Interdiction in Continuous Domain (cLPI) problem: given a network \(G=(V,E)\), in which each edge \(e \in E\) is associated with a function \(f_e(x)\) in continuous domain, and a set of target pairs of nodes, find a distribution \(\textbf{x}: E \rightarrow \mathbb {R}^\ge \) with minimum \(\sum _{e \in E} \textbf{x}(e)\) that ensures any path p, connecting a target pair, satisfies \( \sum _{e \in p} f_e(\textbf{x}(e)) \ge T\). We first propose a general framework to solve cLPI by designing two oracles, namely Threshold Blocking (TB) oracle and Critical Path Listing (CPL) oracle, which communicate back and forth to construct a feasible solution with theoretical performance guarantees. Based on this framework, we propose a bicriteria approximation algorithm to cLPI. This bicriteria guarantee allows us to control the solutions’s trade-off between the running time and the performance accuracy.
R. Alharbi and Lan N. Nguyen—Equal contribution.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Priority packet (2019). https://www.sciencedirect.com/topics/computer-science/priority-packet. Accessed 18 July 2019
Andreev, K., Racke, H.: Balanced graph partitioning. Theory Comput. Syst. 39(6), 929–939 (2006)
Birge, J.R., Louveaux, F.V.: A multicut algorithm for two-stage stochastic linear programs. Eur. J. Oper. Res. 34(3), 384–392 (1988)
Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)
Chawla, S., Krauthgamer, R., Kumar, R., Rabani, Y., Sivakumar, D.: On the hardness of approximating multicut and sparsest-cut. Comput. Complex. 15(2), 94–114 (2006)
Checkoway, S., et al.: Comprehensive experimental analyses of automotive attack surfaces. In: USENIX Security Symposium, pp. 77–92, San Francisco (2011)
Chen, Q.A., Yin, Y., Feng, Y., Mao, Z.M., Liu, H.X.: Exposing congestion attack on emerging connected vehicle based traffic signal control. In: Network and Distributed Systems Security (NDSS) Symposium 2018 (2018)
Dinh, T.N., Thai, M.T.: Precise structural vulnerability assessment via mathematical programming. In: 2011-MILCOM 2011 Military Communications Conference, pp. 1351–1356. IEEE (2011)
Dinh, T.N., Thai, M.T.: Assessing attack vulnerability in networks with uncertainty. In: 2015 IEEE Conference on Computer Communications (INFOCOM), pp. 2380–2388. IEEE (2015)
Dinh, T.N., Thai, M.T.: Network under joint node and link attacks: vulnerability assessment methods and analysis. IEEE/ACM Trans. Netw. 23(3), 1001–1011 (2015)
Fanti, G., Viswanath, P.: Deanonymization in the bitcoin p2p network. In: Advances in Neural Information Processing Systems, pp. 1364–1373 (2017)
Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi) cut theorems and their applications. SIAM J. Comput. 25(2), 235–251 (1996)
Garg, N., Vazirani, V.V., Yannakakis, M.: Primal-dual approximation algorithms for integral flow and multicut in trees. Algorithmica 18(1), 3–20 (1997)
Jeske, D.R., Sampath, A.: Signal-to-interference-plus-noise ratio estimation for wireless communication systems: methods and analysis. Naval Res. Logist. (NRL) 51(5), 720–740 (2004)
Johnson, D.S., Aragon, C.R., McGeoch, L.A., Schevon, C.: Optimization by simulated annealing: an experimental evaluation; part i, graph partitioning. Oper. Res. 37(6), 865–892 (1989)
Keiser, G.: Optical fiber communications. Wiley Encyclopedia of Telecommunications (2003)
Kuhnle, A., Crawford, V.G., Thai, M.T.: Network resilience and the length-bounded multicut problem: reaching the dynamic billion-scale with guarantees. Proc. ACM Meas. Anal. Comput. Syst. 2(1), 4 (2018)
Lee, E.: Improved hardness for cut, interdiction, and firefighter problems. arXiv preprint arXiv:1607.05133 (2016)
Nesterov, Y.: Lectures on Convex Optimization. SOIA, vol. 137. Springer, Cham (2018). https://doi.org/10.1007/978-3-319-91578-4
Nguyen, L.N., Thai, M.T.: Network resilience assessment via QoS degradation metrics: an algorithmic approach. Proc. ACM Meas. Anal. Comput. Syst. 3(1), 1 (2019)
Soma, T., Yoshida, Y.: Maximizing monotone submodular functions over the integer lattice. Math. Program. 172(1–2), 539–563 (2018)
Svitkina, Z., Tardos, É.: Min-max multiway cut. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds.) APPROX/RANDOM -2004. LNCS, vol. 3122, pp. 207–218. Springer, Heidelberg (2004). https://doi.org/10.1007/978-3-540-27821-4_19
Acknowledgements
This work was supported in part by NSF CNS-1814614 and NSF IIS-1908594.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Alharbi, R., Nguyen, L.N., Thai, M.T. (2024). Continuous Length-Bounded Paths Interdiction. In: HĂ , M.H., Zhu, X., Thai, M.T. (eds) Computational Data and Social Networks. CSoNet 2023. Lecture Notes in Computer Science, vol 14479. Springer, Singapore. https://doi.org/10.1007/978-981-97-0669-3_15
Download citation
DOI: https://doi.org/10.1007/978-981-97-0669-3_15
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0668-6
Online ISBN: 978-981-97-0669-3
eBook Packages: Computer ScienceComputer Science (R0)