<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">ntv</journal-id><journal-title-group><journal-title xml:lang="ru">Научно-технический вестник информационных технологий, механики и оптики</journal-title><trans-title-group xml:lang="en"><trans-title>Scientific and Technical Journal of Information Technologies, Mechanics and Optics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">2226-1494</issn><issn pub-type="epub">2500-0373</issn><publisher><publisher-name>Университет ИТМО</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.17586/2226-1494-2026-26-2-410-419</article-id><article-id custom-type="elpub" pub-id-type="custom">ntv-604</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>МАТЕМАТИЧЕСКОЕ И КОМПЬЮТЕРНОЕ МОДЕЛИРОВАНИЕ</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>MODELING AND SIMULATION</subject></subj-group></article-categories><title-group><article-title>Генерация пространственно-временных рядов сетевой нагрузки в задачах граничных вычислений</article-title><trans-title-group xml:lang="en"><trans-title>Generating spatiotemporal network load series in multi-access edge computing tasks using open data</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0002-0536-2807</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Филянин</surname><given-names>И. В.</given-names></name><name name-style="western" xml:lang="en"><surname>Filianin</surname><given-names>I. V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Филянин Иван Викторович — инженер</p><p>Санкт-Петербург, 197101</p><p>sc 58665582700</p></bio><bio xml:lang="en"><p>Ivan V. Filianin — Engineer</p><p>Saint Petersburg, 197101</p><p>sc 58665582700</p></bio><email xlink:type="simple">adeptvin1@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0000-0001-5517-3038</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Капитонов</surname><given-names>А. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Kapitonov</surname><given-names>A. A.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Капитонов Александр Александрович — кандидат технических наук, доцент, заместитель декана, Новый университет Узбекистана; доцент</p><p>Ташкент, 100000, Узбекистан</p><p>Санкт-Петербург, 197101</p><p>sc 57202255729</p></bio><bio xml:lang="en"><p>Aleksandr A. Kapitonov — Uzbekistan PhD, Associate Professor, Associate Dean; Associate Professor</p><p>Tashkent, 100000, Uzbekistan</p><p>Saint Petersburg, 197101</p><p>sc 57202255729</p></bio><email xlink:type="simple">kap2fox@gmail.com</email><xref ref-type="aff" rid="aff-2"/></contrib><contrib contrib-type="author" corresp="yes"><contrib-id contrib-id-type="orcid">https://orcid.org/0009-0009-8697-7739</contrib-id><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Мартынюк</surname><given-names>А. П.</given-names></name><name name-style="western" xml:lang="en"><surname>Martynyuk</surname><given-names>A. P.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Мартынюк Алексей Петрович — инженер; студент</p><p>Москва, 127287</p><p>Санкт-Петербург, 197101</p></bio><bio xml:lang="en"><p>Alexey P. Martynyuk — Engineer, JSC; Student</p><p>Moscow, 127287</p><p>Saint Petersburg, 197101</p></bio><email xlink:type="simple">martynyukAlexey05@gmail.com</email><xref ref-type="aff" rid="aff-3"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-2"><aff xml:lang="ru"><institution>Новый университет Узбекистана; Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>New University; ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><aff-alternatives id="aff-3"><aff xml:lang="ru"><institution>АО «ТБанк»; Университет ИТМО</institution><country>Россия</country></aff><aff xml:lang="en"><institution>“TBank”; ITMO University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2026</year></pub-date><pub-date pub-type="epub"><day>20</day><month>04</month><year>2026</year></pub-date><volume>26</volume><issue>2</issue><fpage>410</fpage><lpage>419</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Филянин И.В., Капитонов А.А., Мартынюк А.П., 2026</copyright-statement><copyright-year>2026</copyright-year><copyright-holder xml:lang="ru">Филянин И.В., Капитонов А.А., Мартынюк А.П.</copyright-holder><copyright-holder xml:lang="en">Filianin I.V., Kapitonov A.A., Martynyuk A.P.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://ntv.elpub.ru/jour/article/view/604">https://ntv.elpub.ru/jour/article/view/604</self-uri><abstract><p>Введение. Исследование систем принятия решений в задачах граничных вычислений с множественным доступом зачастую основывается на абстрактном представлении сети связи, не имеющей профилей сетевой нагрузки. Целью работы являлась разработка инструментов генерации пространственно-временных данных сетевой нагрузки в зависимости от архитектуры сети связи. Метод. Применены методы стохастической геометрии и статистические данные для формирования профиля возможной нагрузки. Для оценки работы методов стохастической геометрии разработан инструмент генерации и валидации пространственно-временных рядов с поиском паттернов из открытой базы вышек сотовой связи OpenCellID. Основные результаты. Выполнен анализ научных работ и открытых наборов данных расположения и нагрузки вышек сотовой связи. На основе анализа сделан вывод о низком качестве данных в задачах обучения систем принятия решений размещения вычислительных сервисов в геораспределенных узлах обработки данных. Разработан инструмент генерации и валидации пространственно-временных рядов с поиском паттернов из открытой базы вышек сотовой связи OpenCellID. Сравнительный анализ базового и калиброванного алгоритмов Hard-Core Point Process показал существенные различия в характеристиках генерируемых распределений. Для города Санкт-Петербурга калиброванная модель обеспечила увеличение плотности размещения станций в 99 раз, сокращение межстанционных расстояний в 52 раза при эффективной площади покрытия 0,04 км2. В случае города Новосибирска наблюдались аналогичные тенденции с меньшей интенсивностью: увеличение плотности в 12,5 раз, сокращение расстояний в 21 раз при площади покрытия 0,32 км2. Обсуждение. Использование пространственно-временных рядов, полученных с помощью разработанного инструмента генерации, позволит повысить точность алгоритмов размещения вычислительных сервисов и снизить задержки в системах граничных вычислений за счет предобучения на данных коррелирующих с реальным расположением вышек сотовой связи. С помощью предложенного инструмента генерации можно задать координаты местности предполагаемой сети связи, что окажет влияние на паттерны распределения вышек и позволит сгенерировать более точные пространственно-временные ряды.</p></abstract><trans-abstract xml:lang="en"><p>Research into decision-making systems in multi-access edge computing systems is often based on an abstract representation of a communication network without network load profiles. The aim of this work was to develop tools for generating spatio-temporal network load data depending on the communication network architecture. In our work, we used stochastic geometry methods and statistical data to form a profile of possible load. To evaluate the performance of stochastic geometry methods, we developed a tool for generating and validating spatio-temporal series with pattern search from the OpenCellID open database of cell towers. During the work, an analysis of literature and public datasets on the location and load of cell towers was conducted. Based on the analysis, it was concluded that the data quality was low for the purposes of training decision-making systems for the placement of computing services in geographically distributed data processing nodes. A tool was also developed to generate and validate spatio-temporal series with pattern search from the OpenCellID open database of cell towers. A comparative analysis of the basic and calibrated Hard- Core Poisson Process algorithms showed significant differences in the characteristics of the generated distributions. For St. Petersburg, the calibrated model provided a 99-fold increase in station density and a 52-fold reduction in interstation distances with an effective coverage area of 0.04 km2. In the case of Novosibirsk, similar trends were observed with less intensity: a 12.5-fold increase in density and a 21-fold reduction in distances with a coverage area of 0.32 km2. The use of spatio-temporal series obtained with the help of the developed generation tools will improve the quality of training decision-making systems for the placement of computing services through pre-training on data correlated with the actual location of cell towers. In addition, the generation tool allows you to specify the coordinates of the area of the proposed communication network which can also affect the distribution patterns of towers and which in turn will allow you to generate more accurate spatio-temporal series.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>граничные вычисления с множественным доступом</kwd><kwd>стохастическая геометрия</kwd><kwd>OpenCellID</kwd><kwd>пространственно-временные ряды</kwd><kwd>Hard-Core Poisson Process</kwd></kwd-group><kwd-group xml:lang="en"><kwd>multi-access edge computing</kwd><kwd>stochastic geometry</kwd><kwd>OpenCellID</kwd><kwd>spatiotemporal</kwd><kwd>Hard-Core Poisson Process</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Al-Bahri M., Alkishri W., Ahmed F.Y.H., Alshar’e M., Maskari S.A. Enhancing IoT network security through digital object architecturebased approaches // Qubahan Academic Journal. 2024. V. 4. N 1. P. 224–239. https://doi.org/10.48161/qaj.v4n1a413</mixed-citation><mixed-citation xml:lang="en">Al-Bahri M., Alkishri W., Ahmed F.Y.H., Alshar’e M., Maskari S.A. Enhancing IoT network security through digital object architecturebased approaches. Qubahan Academic Journal, 2024, vol. 4, no. 1, pp. 224–239. https://doi.org/10.48161/qaj.v4n1a413</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Li N., Hao W., Zhou F., Chu Z., Yang S., Muta O., Gacanin H. Min– max latency optimization for IRS-aided cell-free mobile edge computing systems // IEEE Internet of Things Journal. 2024. V. 11. N 5. P. 8757–8770. https://doi.org/10.1109/jiot.2023.3322751</mixed-citation><mixed-citation xml:lang="en">Li N., Hao W., Zhou F., Chu Z., Yang S., Muta O., Gacanin H. Min– max latency optimization for IRS-aided cell-free mobile edge computing systems. IEEE Internet of Things Journal, 2024, vol. 11, no. 5, pp. 8757–8770. https://doi.org/10.1109/jiot.2023.3322751</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Hua H., Li Y., Wang T., Dong N., Li W., Cao J. Edge computing with artificial intelligence: a machine learning perspective // ACM Computing Surveys. 2023. V. 55. N 9. P. 1–35. https://doi.org/10.1145/3555802</mixed-citation><mixed-citation xml:lang="en">Hua H., Li Y., Wang T., Dong N., Li W., Cao J. Edge computing with artificial intelligence: a machine learning perspective. ACM Computing Surveys, 2023, vol. 55, no. 9, pp. 1–35. https://doi.org/10.1145/3555802</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Pandey C., Tiwari V., Rathore R.S., Jhaveri R.H., Roy D.S., Selvarajan S. Resource-efficient synthetic data generation for performance evaluation in mobile edge computing over 5G networks // IEEE Open Journal of the Communications Society. 2023. V. 4. P. 1866–1878. https://doi.org/10.1109/OJCOMS.2023.3306039</mixed-citation><mixed-citation xml:lang="en">Pandey C., Tiwari V., Rathore R.S., Jhaveri R.H., Roy D.S., Selvarajan S. Resource-efficient synthetic data generation for performance evaluation in mobile edge computing over 5G networks. IEEE Open Journal of the Communications Society, 2023, vol. 4, pp. 1866–1878. https://doi.org/10.1109/OJCOMS.2023.3306039</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Ismail A.A., Khalifa N.E., El-Khoribi R.A. A survey on resource scheduling approaches in multi-access edge computing environment: a deep reinforcement learning study // Cluster Computing. 2025. V. 28. N 3. P. 184. https://doi.org/10.1007/s10586-024-04893-7</mixed-citation><mixed-citation xml:lang="en">Ismail A.A., Khalifa N.E., El-Khoribi R.A. A survey on resource scheduling approaches in multi-access edge computing environment: a deep reinforcement learning study. Cluster Computing, 2025, vol. 28, no. 3, pp. 184. https://doi.org/10.1007/s10586-024-04893-7</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Talpur A., Gurusamy M. DRLD-SP: A Deep-reinforcement-learningbased dynamic service placement in edge-enabled Internet of vehicles // IEEE Internet of Things Journal. 2022. V. 9. N 8. P. 6239– 6251. https://doi.org/10.1109/jiot.2021.3110913</mixed-citation><mixed-citation xml:lang="en">Talpur A., Gurusamy M. DRLD-SP: A Deep-reinforcement-learningbased dynamic service placement in edge-enabled Internet of vehicles. IEEE Internet of Things Journal, 2022, vol. 9, no. 8, pp. 6239–6251. https://doi.org/10.1109/jiot.2021.3110913</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Kabeer M., Nordin R., Behjati M., Shaharuddin F.Y.B.M. An urban multi-operator QoE-aware dataset for cellular networks in dense environments // arXiv. 2025. arXiv:2506.22484. https://doi.org/10.48550/arXiv.2506.22484</mixed-citation><mixed-citation xml:lang="en">Kabeer M., Nordin R., Behjati M., Shaharuddin F.Y.B.M. An urban multi-operator QoE-aware dataset for cellular networks in dense environments. arXiv, 2025. arXiv:2506.22484. https://doi.org/10.48550/arXiv.2506.22484</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Luo F., Zheng S., Ding W., Fuentes J., Li Y. An edge server placement method based on reinforcement learning // Entropy. 2022. V. 24. N 3. P. 317. https://doi.org/10.3390/e24030317</mixed-citation><mixed-citation xml:lang="en">Luo F., Zheng S., Ding W., Fuentes J., Li Y. An edge server placement method based on reinforcement learning. Entropy, 2022, vol. 24, no. 3, pp. 317. https://doi.org/10.3390/e24030317</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Pandey C., Tiwari V., Rodrigues J.J.P.C., Roy D.S. 5GT-GAN-NET: Internet traffic data forecasting with supervised loss based synthetic data over 5G // IEEE Transactions on Mobile Computing. 2024. V. 23. N 11. P. 10694–10705. https://doi.org/10.1109/TMC.2024.3364655</mixed-citation><mixed-citation xml:lang="en">Pandey C., Tiwari V., Rodrigues J.J.P.C., Roy D.S. 5GT-GAN-NET: Internet traffic data forecasting with supervised loss based synthetic data over 5G. IEEE Transactions on Mobile Computing, 2024, vol. 23, no. 11, pp. 10694–10705. https://doi.org/10.1109/TMC.2024.3364655</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Xiang B., Elias J., Martignon F., Di Nitto E. A dataset for mobile edge computing network topologies // Data in Brief. 2021. V. 39. P. 107557. https://doi.org/10.1016/j.dib.2021.107557</mixed-citation><mixed-citation xml:lang="en">Xiang B., Elias J., Martignon F., Di Nitto E. A dataset for mobile edge computing network topologies. Data in Brief, 2021, vol. 39, pp. 107557. https://doi.org/10.1016/j.dib.2021.107557</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Pasqualini L., Parton M. Pseudo random number generation: a reinforcement learning approach // Procedia Computer Science. 2020. V. 170. P. 1122–1127. https://doi.org/10.1016/j.procs.2020.03.057</mixed-citation><mixed-citation xml:lang="en">Pasqualini L., Parton M. Pseudo random number generation: a reinforcement learning approach. Procedia Computer Science, 2020, vol. 170, pp. 1122–1127. https://doi.org/10.1016/j.procs.2020.03.057</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Liu P., Lei J., Cao H., Garg S., Kaur K., Kaddoum G. A Stochastic geometry model and analysis scheme for SCMA aided mobile edge computing // Proc. of the IEEE Wireless Communications and Networking Conference (WCNC). 2024. P. 1–6. https://doi.org/10.1109/WCNC57260.2024.10570726</mixed-citation><mixed-citation xml:lang="en">Liu P., Lei J., Cao H., Garg S., Kaur K., Kaddoum G. A Stochastic geometry model and analysis scheme for SCMA aided mobile edge computing. Proc. of the IEEE Wireless Communications and Networking Conference (WCNC), 2024, pp. 1–6. https://doi.org/10.1109/WCNC57260.2024.10570726</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Gu Y., Yao Y., Li C., Xia B., Xu D., Zhang C. Modeling and analysis of stochastic mobile-edge computing wireless networks // IEEE Internet of Things Journal. 2021. V. 8. N 18. P. 14051–14065. https://doi.org/10.1109/JIOT.2021.3068382</mixed-citation><mixed-citation xml:lang="en">Gu Y., Yao Y., Li C., Xia B., Xu D., Zhang C. Modeling and analysis of stochastic mobile-edge computing wireless networks. IEEE Internet of Things Journal, 2021, vol. 8, no. 18, pp. 14051–14065. https://doi.org/10.1109/JIOT.2021.3068382</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Facchini C., Holland O., Granelli F., da Fonseca N.L.S., Aghvami H. Dynamic green self-configuration of 3G base stations using fuzzy cognitive maps // Computer Networks. 2013. V. 57. N 7. P. 1597– 1610. https://doi.org/10.1016/j.comnet.2013.02.011</mixed-citation><mixed-citation xml:lang="en">Facchini C., Holland O., Granelli F., da Fonseca N.L.S., Aghvami H. Dynamic green self-configuration of 3G base stations using fuzzy cognitive maps. Computer Networks, 2013, vol. 57, no. 7, pp. 1597– 1610. https://doi.org/10.1016/j.comnet.2013.02.011</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Bufetov A.I. Rigidity of determinantal point processes with the Airy, the Bessel and the Gamma kernel // Bulletin of Mathematical Sciences. 2016. V. 6. N 1. P. 163–172. https://doi.org/10.1007/s13373-015-0080-z</mixed-citation><mixed-citation xml:lang="en">Bufetov A.I. Rigidity of determinantal point processes with the Airy, the Bessel and the Gamma kernel. Bulletin of Mathematical Sciences, 2016, vol. 6, no. 1, pp. 163–172. https://doi.org/10.1007/s13373-015-0080-z</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Deng N., Zhou W., Haenggi M. The Ginibre point process as a model for wireless networks with repulsion // IEEE Transactions on Wireless Communications. 2015. V. 14. N 1. P. 107–121. https://doi.org/10.1109/twc.2014.2332335</mixed-citation><mixed-citation xml:lang="en">Deng N., Zhou W., Haenggi M. The Ginibre point process as a model for wireless networks with repulsion. IEEE Transactions on Wireless Communications, 2015, vol. 14, no. 1, pp. 107–121. https://doi.org/10.1109/twc.2014.2332335</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Teichmann J., Ballani F., van den Boogaart K.G. Generalizations of Matérn’s hard-core point processes // Spatial Statistics. 2013. V. 3. P. 33–53. https://doi.org/10.1016/j.spasta.2013.02.001</mixed-citation><mixed-citation xml:lang="en">Teichmann J., Ballani F., van den Boogaart K.G. Generalizations of Matérn’s hard-core point processes. Spatial Statistics, 2013, vol. 3, pp. 33–53. https://doi.org/10.1016/j.spasta.2013.02.001</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Illian J., Penttinen A., Stoyan H., Stoyan D. Statistical Analysis and Modelling of Spatial Point Patterns. Wiley-Interscience, 2008. 560 p.</mixed-citation><mixed-citation xml:lang="en">Illian J., Penttinen A., Stoyan H., Stoyan D. Statistical Analysis and Modelling of Spatial Point Patterns. Wiley-Interscience, 2008, 560 p.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Stoyan D., Kendall W.S., Mecke J. Stochastic Geometry and its Applications. John Wiley &amp; Sons, 2013. 584 p.</mixed-citation><mixed-citation xml:lang="en">Stoyan D., Kendall W.S., Mecke J. Stochastic Geometry and its Applications. John Wiley &amp; Sons, 2013, 584 p.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">ElSawy H., Hossain E., Haenggi M. Stochastic geometry for modeling, analysis, and design of multi-tier and cognitive cellular wireless networks: a survey // IEEE Communications Surveys and Tutorials. 2013. V. 15. N 3. P. 996–1019. https://doi.org/10.1109/surv.2013.052213.00000</mixed-citation><mixed-citation xml:lang="en">ElSawy H., Hossain E., Haenggi M. Stochastic geometry for modeling, analysis, and design of multi-tier and cognitive cellular wireless networks: a survey. IEEE Communications Surveys and Tutorials, 2013, vol. 15, no. 3, pp. 996–1019. https://doi.org/10.1109/surv.2013.052213.00000</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Ester M., Kriegel H.P., Sander J., Xu X. A density-based algorithm for discovering clusters // Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining. 1996. P. 226–231.</mixed-citation><mixed-citation xml:lang="en">Ester M., Kriegel H.P., Sander J., Xu X. A density-based algorithm for discovering clusters. Proc. of the 2nd International Conference on Knowledge Discovery and Data Mining, 1996, pp. 226–231.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Богатырев В.А., Богатырев С.В., Богатырев А.В. Граничная оценка надежности кластерных систем на основе декомпозиции марковской модели при ограниченном восстановлении узлов с накоплением отказов // Научно-технический вестник информационных технологий, механики и оптики. 2025. Т. 25. № 3. С. 574–583. https://doi.org/10.17586/2226-1494-2025-25-3-574-583</mixed-citation><mixed-citation xml:lang="en">Bogatyrev V.A., Bogatyrev S.V., Bogatyrev A.V. Boundary estimation of the reliability of cluster systems based on the decomposition of the Markov model with limited recovery of nodes with accumulated failures. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2025, vol. 25, no. 3, pp. 574–583. (in Russian). https://doi.org/10.17586/2226-1494-2025-25-3-574-583</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Богатырев В.А., Богатырев С.В., Богатырев А.В. Оценка готовности компьютерной системы к своевременному обслуживанию запросов при его совмещении с информационным восстановлением памяти после отказов // Научно-технический вестник информационных технологий, механики и оптики. 2023. Т. 23. № 3. С. 608–617. https://doi.org/10.17586/2226-1494-2023-23-3-608-617</mixed-citation><mixed-citation xml:lang="en">Bogatyrev V.A., Bogatyrev S.V., Bogatyrev A.V. Assessment of the readiness of a computer system for timely servicing of requests when combined with information recovery of memory after failures. Scientific and Technical Journal of Information Technologies, Mechanics and Optics, 2023, vol. 23, no. 3, pp. 608–617. (in Russian). https://doi.org/10.17586/2226-1494-2023-23-3-608-617</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
