<?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">mais</journal-id><journal-title-group><journal-title xml:lang="ru">Моделирование и анализ информационных систем</journal-title><trans-title-group xml:lang="en"><trans-title>Modeling and Analysis of Information Systems</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1818-1015</issn><issn pub-type="epub">2313-5417</issn><publisher><publisher-name>Yaroslavl State University</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="doi">10.18255/1818-1015-2020-1-6-21</article-id><article-id custom-type="elpub" pub-id-type="custom">mais-1284</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>Computer System Organization</subject></subj-group></article-categories><title-group><article-title>К вопросу об оценках распределения длин путей между узлами в глобальной сети</article-title><trans-title-group xml:lang="en"><trans-title>Estimation of Length of Node-to-Node Paths Distribution in the Global Network</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-4178-3828</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>Kononova</surname><given-names>Alexandra I.</given-names></name></name-alternatives><bio xml:lang="ru"><p>канд. техн. наук, доцент</p></bio><bio xml:lang="en"><p>PhD.</p></bio><email xlink:type="simple">illinc@bk.ru</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-0003-2887-8547</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>Gorodilov</surname><given-names>Alexey V.</given-names></name></name-alternatives><bio xml:lang="ru"><p>канд. техн. наук, доцент</p></bio><bio xml:lang="en"><p>PhD.</p></bio><email xlink:type="simple">kaverina@mail.ru</email><xref ref-type="aff" rid="aff-2"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Федеральное государственное автономное образовательное учреждение высшего образования «Национальный исследовательский университет «Московский институт электронной техники»</institution><country>Россия</country></aff><aff xml:lang="en"><institution>National Research University of Electronic Technology</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>Russkaya Moda (Russian fashion)</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2020</year></pub-date><pub-date pub-type="epub"><day>19</day><month>03</month><year>2020</year></pub-date><volume>27</volume><issue>1</issue><fpage>6</fpage><lpage>21</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Кононова А.И., Городилов А.В., 2020</copyright-statement><copyright-year>2020</copyright-year><copyright-holder xml:lang="ru">Кононова А.И., Городилов А.В.</copyright-holder><copyright-holder xml:lang="en">Kononova A.I., Gorodilov A.V.</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://www.mais-journal.ru/jour/article/view/1284">https://www.mais-journal.ru/jour/article/view/1284</self-uri><abstract><p>Описан эксперимент по оцениванию распределения длин путей между узлами в глобальной сети и его характеристик. В частности, показана методика измерения длины пути при помощи утилиты GNU/Linux traceroute и ограничения выбора узлов, налагаемые этим инструментом. Приведены результаты измерений, отмечены высокие значения асимметрии и эксцесса для всех полученных распределений. Описана имитационная модель эксперимента, разработанная для проверки корректности полученных оценок распределения длин путей между узлами в глобальной сети. Приведены результаты моделирования измерений. Показано, что высокие значения асимметрии и эксцесса измеренных распределений не обусловлены только методикой измерения, таким образом, глобальная сеть не описывается моделью Барабаши—Альберт. Перечислены основные гипотезы о причинах отличия асимметрии и эксцесса полученных экспериментально оценок распределения длин путей между узлами в глобальной сети от значений, соответствующих модели Барабаши—Альберт. Описаны результаты моделирования различных гипотез. Показано, что наиболее правдоподобной из них является предположение об определяющем влиянии квазипредфрактальной структуры глобальной сети на асимметрию и эксцесс оценок распределения длин путей между узлами.</p></abstract><trans-abstract xml:lang="en"><p>The experiment aimed at finding a distribution of path lengths between nodes in the global network and an estimation of parameters of that distribution is described.In particular, the method of measurement of path length with traceroute utility of the GNU/Linux system and limitations on the selection of nodes imposed by traceroute are described. e measurement results are provided and high values of skewness and kurtosis for all resulting distributions are noted. Simulation model of this experiment was developed to test the experiment validity in the determination of distribution parameters in the global network. This model is also described. It is shown that high values of skewness and kurtosis of the measured distributions are not the result of the measurement technique, therefore the global network could not be described by the Barabasi–Albert ´ model. Several most viable hypotheses explaining diffierences in skewness and kurtosis of experimentally obtained pathlength distribution estimations and values derived from the Barabasi–Albert model are listed. Results of diffierent hypotheses ´ simulations are provided. It is shown that the most fitting hypothesis is that definitive influence on skewness and kurtosis of path-length distribution estimations is caused by the quasi pre-fractal structure of the global network.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>глобальная сеть</kwd><kwd>маршрутизация</kwd><kwd>распределение длин путей</kwd><kwd>исследование структуры</kwd><kwd>безмасштабная модель Барабаши—Альберт</kwd></kwd-group><kwd-group xml:lang="en"><kwd>global network</kwd><kwd>routing</kwd><kwd>node-to-node distance distribution</kwd><kwd>experiment</kwd><kwd>Baraba´si–Albert model</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">A. Gorodilov, A. Kononova, and V. Shangin, “Osobennosti peredachi dannyh v decentralizovannyh piringovyh setyah”, Proceedings of Universities. Electronics, vol. 98, no. 6, pp. 95–97, 2012.</mixed-citation><mixed-citation xml:lang="en">A. Gorodilov, A. Kononova, and V. Shangin, “Osobennosti peredachi dannyh v decentralizovannyh piringovyh setyah”, Proceedings of Universities. Electronics, vol. 98, no. 6, pp. 95–97, 2012.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">A. P. Shiryaev, A. V. Dorofeev, A. R. Fedorov, L. G. Gagarina, and V. V. Zaycev, “LDA models for finding trends in technical knowledge domain”, in 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus), IEEE, 2017, pp. 551–554.</mixed-citation><mixed-citation xml:lang="en">A. P. Shiryaev, A. V. Dorofeev, A. R. Fedorov, L. G. Gagarina, and V. V. Zaycev, “LDA models for finding trends in technical knowledge domain”, in 2017 IEEE Conference of Russian Young Researchers in Electrical and Electronic Engineering (EIConRus), IEEE, 2017, pp. 551–554.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, 2010.</mixed-citation><mixed-citation xml:lang="en">D. Easley and J. Kleinberg, Networks, Crowds, and Markets: Reasoning about a Highly Connected World. Cambridge University Press, 2010.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">A. Fronczak, P. Fronczak, and J. A. Hołyst, “Average path length in random networks”, Physical Review E, vol. 70, no. 5, p. 056 110, 2004.</mixed-citation><mixed-citation xml:lang="en">A. Fronczak, P. Fronczak, and J. A. Hołyst, “Average path length in random networks”, Physical Review E, vol. 70, no. 5, p. 056 110, 2004.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">R. Sedgewick, Algorithms in C, Part 5: Graph Algorithms, 2002.</mixed-citation><mixed-citation xml:lang="en">R. Sedgewick, Algorithms in C, Part 5: Graph Algorithms, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">H. Jeong, B. Tombor, Z. N. Albert R.and Oltvai, and A.-L. Barabasi, “The large-scale organization of ´ metabolic networks”, Nature, vol. 407, no. 6804, pp. 651–654, 2000.</mixed-citation><mixed-citation xml:lang="en">H. Jeong, B. Tombor, Z. N. Albert R.and Oltvai, and A.-L. Barabasi, “The large-scale organization of ´ metabolic networks”, Nature, vol. 407, no. 6804, pp. 651–654, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">R. Albert and A.-L. Barabasi, “Statistical mechanics of complex networks”, ´ Reviews of modern physics, vol. 74, no. 1, pp. 47–97, 2002.</mixed-citation><mixed-citation xml:lang="en">R. Albert and A.-L. Barabasi, “Statistical mechanics of complex networks”, ´ Reviews of modern physics, vol. 74, no. 1, pp. 47–97, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">A. Gorodilov A.V.and Kononova, “Simulation as tool of error assessment of experimental measurement of path-lengths distribution in global network”, Sistemy komp’yuternoj matematiki i ih prilozheniya: materialy XX Mezhdunarodnoj nauchnoj konferencii, vol. 1, pp. 34–41, 2019.</mixed-citation><mixed-citation xml:lang="en">A. Gorodilov A.V.and Kononova, “Simulation as tool of error assessment of experimental measurement of path-lengths distribution in global network”, Sistemy komp’yuternoj matematiki i ih prilozheniya: materialy XX Mezhdunarodnoj nauchnoj konferencii, vol. 1, pp. 34–41, 2019.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">R. A. Kochkarov, D. A. Pavlov, and D. A.-Z. Hubieva, “Fractal and preefactal graphs, basic definitions and symbols”, Scientific journal of KubSAU (Polythematic online scientific journal of Kuban State Agrarian University), no. 134, pp. 174–188, 2017.</mixed-citation><mixed-citation xml:lang="en">R. A. Kochkarov, D. A. Pavlov, and D. A.-Z. Hubieva, “Fractal and preefactal graphs, basic definitions and symbols”, Scientific journal of KubSAU (Polythematic online scientific journal of Kuban State Agrarian University), no. 134, pp. 174–188, 2017.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru"></mixed-citation><mixed-citation xml:lang="en"></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>
