METHOD FOR FINDING BOTTLENECKS IN COMPLEX NETWORKS TO INCREASE EFFICIENCY OF COMPUTING RESOURCES
DOI:
https://doi.org/10.26906/SUNZ.2025.2.180Keywords:
method, model, computer network, structure, bottlenecks, flowAbstract
In complex networks, there is a problem of finding bottlenecks. There are many areas of application for the bottleneck detection problem, for example, algorithms for detecting communities, understanding group formation, and reducing congestion in transport networks. The goal of the work is to study the bottlenecks search method for complex networks. The relevance of the work lies in the fact that the bottlenecks searching is a wide problem for complex networks. The following tasks were solved in the work: research of methods for finding bottlenecks in the network; searching for bottlenecks in the initial and reduced network; measurement of the time to solve the problem; verification of the preservation of the bottleneck location after network reduction. As a result of the work, methods for finding bottlenecks in the network were investigated; searching for bottlenecks in the initial and reduced network was carried out; measurement of the time to solve the problem was carried out, and verification of the preservation of the location of bottlenecks on the reduced network was carried out. The studies allow us to conclude: searching for bottlenecks was carried out on the initial and reduced network; in the considered examples the time for bottlenecks searching was decreased, and the location of bottlenecks was preserved on the reduced network. Thus, as a result of the reduction of the network, the efficiency of computing resources is increasedDownloads
References
1. Chalupa, D., Hawick, K. A. & Walker, J. A. (2018). Hybrid Bridge-Based Memetic Algorithms for Finding Bottlenecks in Complex Networks. Big Data Research, 14, 68–80. https://doi.org/10.1016/j.bdr.2018.04.001
2. Post, T., Hamann, B. & Aurich, J. (2017). Ensemble Visualization of Bottlenecks in Planar Flow Networks. Applied Mechanics and Materials, 869, 234–243. https://doi.org/10.4028/www.scientific.net/AMM.869.234
3. Costa, L. da F., Rodrigues, F. A., Travieso, G. & Villas Boas, P. R. (2007). Characterization of complex networks: A survey of measurements. Advances in Physics, 56(1), 167–242. https://doi.org/10.1080/00018730601170527
4. Cheng, X. & Scherpen, J. M. A. (2021). Model Reduction Methods for Complex Network Systems. Annual Review of Control, Robotics, and Autonomous Systems, 4, 425–453. https://doi.org/10.1146/annurev-control-061820-083817
5. Barrat, A., Barthelemy, M., Pastor-Satorras, R. & Vespignani, A. (2004). The architecture of complex weighted networks. Proceedings of the National Academy of Sciences, 101(11), 3747–3752. https://doi.org/10.1073/pnas.0400087101
6. Hackl, J. (2017). tikz-network: a LaTeX library for vizualizing complex networks. 6th International Conference on Complex Networks & Their Applications, Lyon, France, 318–319.
7. Newman, M. (2010). Networks: An Introduction. Oxford University Press. https://doi.org/10.1093/acprof:oso/9780199206650.001.0001
8. Arenas, A., Duch, J., Fernandez, A. & Gomez, S. (2008). Size reduction of complex networks preserving modularity. New Journal of Physics, 10(5), 053039. https://doi.org/10.1088/1367-2630/10/5/053039
9. Hirata, H. & Ulanowicz, R. E. (1985). Information Theoretical Analysis of the Aggregation and Hierarchical Structure of Ecological Networks. Journal of Theoretical Biology, 116(3), 321–341. https://doi.org/10.1016/S0022-5193(85)80271-X
10. Shortle, J. F., Mark, B. L. & Gross, D. (2009). Reduction of Closed Queueing Networks for Efficient Simulation. ACM Transactions on Modeling and Computer Simulation, 19(3), 10. https://doi.org/10.1145/1540530.1540531
11. Wang, Y., Zhao, Q. & Zheng, D. (2005). Bottlenecks in production networks: An overview. Journal of Systems Science and Systems Engineering, 14(3), 347–363. https://doi.org/10.1007/s11518-006-0198-3
12. Ros-Giralt, J., Amsel, N., Yellamraju, S., Ezick, J. R., Lethin, R. A., Jiang, Y., Feng, A. & Tassiulas, L. (2022). A quantitative theory of bottleneck structures for data networks. arXiv preprint arXiv:2210.03534. https://arxiv.org/abs/2210.03534
13. Mizgier, K., Jüttner, M., & Wagner, S. (2012). Bottleneck identification in supply chain networks. International Journal of Production Research, 51(1), 1–14. https://doi.org/10.1080/00207543.2012.695878
14. Szabari, B. & Kiss, A. (2020). Performance Evaluation of Betweenness Centrality Using Clustering Methods. Studia Universitatis Babeș-Bolyai Informatica, 65(1), 51. https://doi.org/10.24193/subbi.2020.1.05
15. Denning, P. J. & Buzen, J. P. (1978). The operational analysis of queueing network models. ACM Computing Surveys, 10(3), 225–261. https://doi.org/10.1145/356733.356735
16. Пономаренко, О., Горбачов, В. (2023). Програмна платформа для оцінювання ефективності агрегації структурної моделі складних систем. Сучасний стан наукових досліджень та технологій в промисловості, (3(25), 79–87. https://doi.org/10.30837/ITSSI.2023.25.079
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Olha Ponomarenko, Valeriy Gorbachev
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
