Modeling of high-dimentional communication networks
Abstract
Full Text:
PDF (Russian)References
R. Saracco. Digital twins: Bridging physical space and cyber-space. Computer, vol. 52, no. 12, p. 58-64, 2019. doi: https://doi.org/10.1109/MC.2019.2942803
A. M. Madni, C. C. Madni, S. D. Lucero. Leveraging digital twin technology in model-based systems engineering. Systems, vol. 7, issue 1, p. 7, 2019. doi: https://doi.org/10.3390/systems7010007
B. R. Barricelli, E. Casiraghi, D. Fogli. A survey on digital twin: Definitions, characteristics, applications, and design implications. IEEE Access, vol. 7, p. 167653-167671, 2019. doi: https://doi.org/10.1109/ACCESS.2019.2953499
Yu. Yu. Terentyeva. Some theoretical issues related to the description of practical algorithms for constructing spanning trees. International Journal of Open Information Technologies, vol. 9, no. 3, p. 13-27, 2021. (In Russ., abstract in Eng.) EDN: KRVLTR
Yu. Yu. Terentyeva. Method of calculating of large-scale net-works reliability estimation allowing for dependent routes. Informatization and communication, no. 1, p. 122-128, 2017. (In Russ., abstract in Eng.) EDN: YMHEPR
B. F. Melnikov, P. P. Starikov, Yu. Yu. Terentyeva. On one task of analyzing the topology of communication networks. International Journal of Open Information Technologies, vol. 10, no. 6, p. 1-8, 2022. (In Russ., abstract in Eng.) EDN: YMHEPR
Yu. Yu. Terentyeva. Determination of the Maximum Set Independent Simple Paths between the Vertices of the Graph. Modern Information Technologies and IT-Education, vol. 17, no. 2, p. 308-314, 2021. (In Russ., abstract in Eng.) doi: https://doi.org/10.25559/SITI-TO.17.202102.308-314
T. Cormen, et al. Algorithms: construction and analysis. 2nd ed. Moscow: Williams; 2006. p. 1296.
Yu. Yu. Terentyeva. Maximum set shortest vertex-independent paths. International Journal of Open Information Technologies, vol. 11, no. 11, p. 58-63, 2023. (In Russ., abstract in Eng.) EDN: TYDQUL
Refbacks
- There are currently no refbacks.
Abava Кибербезопасность IT Congress 2024
ISSN: 2307-8162