<?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">procyber</journal-id><journal-title-group><journal-title xml:lang="ru">Вестник кибернетики</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings in Cybernetics</trans-title></trans-title-group></journal-title-group><issn pub-type="epub">1999-7604</issn><publisher><publisher-name>Бюджетное учреждение высшего образования Ханты-Мансийского автономного округа – Югры «Сургутский государственный университет»</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">procyber-154</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>Physics and Mathematics</subject></subj-group></article-categories><title-group><article-title>Ускоренный метод расчета вероятностей потерь в фрактальных системах с очередями</article-title><trans-title-group xml:lang="en"><trans-title>Rapid Method for Calculation of Loss Probabilities in Fractal Queueing Systems</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Задорожный</surname><given-names>В. Н.</given-names></name><name name-style="western" xml:lang="en"><surname>Zadorozhnyi</surname><given-names>V. N.</given-names></name></name-alternatives><email xlink:type="simple">zwn2015@yandex.ru</email><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Захаренкова</surname><given-names>Т. Р.</given-names></name><name name-style="western" xml:lang="en"><surname>Zakharenkova</surname><given-names>T. R.</given-names></name></name-alternatives><email xlink:type="simple">ZakharenkovaTatiana@gmail.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Омский государственный технический университет</institution><country>Россия</country></aff><aff xml:lang="en"><institution>Omsk State Technical University</institution><country>Russian Federation</country></aff></aff-alternatives><pub-date pub-type="collection"><year>2018</year></pub-date><pub-date pub-type="epub"><day>25</day><month>03</month><year>2020</year></pub-date><volume>0</volume><issue>3 (31)</issue><fpage>102</fpage><lpage>112</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">Zadorozhnyi V.N., Zakharenkova T.R.</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.vestcyber.ru/jour/article/view/154">https://www.vestcyber.ru/jour/article/view/154</self-uri><abstract><p>Разработан эффективный метод расчета вероятностей потерь в системах с очередями, выполнен анализ точности метода и достигаемого по сравнению с непосредственным моделированием ускорения. Метод используется для анализа систем со степенными распределениями, распространенных в качестве моделей сетевых устройств современных компьютерных сетей. Установлен вид зависимости в этих системах вероятности потерь от размера буфера. Исследуется влияние на эту зависимость, оказываемое тяжестью хвостов степенных распределений и числом каналов в системах. На практике полученные результаты могут использоваться для решения инженерных задач анализа и проектирования современных компьютерных сетей, функционирующих в условиях фрактального трафика.</p></abstract><trans-abstract xml:lang="en"><p>An effective method for loss probabilities calculation in queuing systems is developed. An analysis of accuracy and acceleration achieved in comparison with direct simulation is made. The method is used to analyze the queueing systems with power-series distributions which are widely used as models of network devices of modern computer networks. A dependence of loss probability on a buffer capacity in considered systems is established. The influence on this dependence by the heaviness of tails of power-series distributions and by the channel number is investigated. The obtained results can be used for solving engineering problems of analysis and design of modern computer networks operating under the fractal traffic.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>системы с очередями</kwd><kwd>фрактальный трафик</kwd><kwd>регенеративное моделирование</kwd><kwd>ускоренные методы Монте-Карло</kwd></kwd-group><kwd-group xml:lang="en"><kwd>queueing systems</kwd><kwd>fractal traffic</kwd><kwd>regenerative modeling</kwd><kwd>rapid Monte Carlo methods</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">Leland W. E., Taqqu M. S., Willinger W., Wilson D.V. On the Self-Similar Nature of Ethernet Traffic // IEEE/ACM transactions on networking. 1994. V. 2. № 1. February. P. 1–15.</mixed-citation><mixed-citation xml:lang="en">Leland W. E., Taqqu M. S., Willinger W., Wilson D.V. On the Self-Similar Nature of Ethernet Traffic // IEEE/ACM transactions on networking. 1994. V. 2. № 1. February. P. 1–15.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Crovella M. E., Taqqu M., Bestavros A. Heavy Tailed-Probability distributions in the World Wide Web // A Practical Guide to Heavy Tails: Statistical techniques and Applications, 1998. P. 3–25.</mixed-citation><mixed-citation xml:lang="en">Crovella M. E., Taqqu M., Bestavros A. Heavy Tailed-Probability distributions in the World Wide Web // A Practical Guide to Heavy Tails: Statistical techniques and Applications, 1998. P. 3–25.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Kleinrock L. Queueing Systems. Computer Applications. New York : Wiley Interscience, 1976. V. II. 576 p.</mixed-citation><mixed-citation xml:lang="en">Kleinrock L. Queueing Systems. Computer Applications. New York : Wiley Interscience, 1976. V. II. 576 p.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Zwart A. P. Queueing Systems with Heavy Tails. Eindhoven University of Technology, 2001. 227 p.</mixed-citation><mixed-citation xml:lang="en">Zwart A. P. Queueing Systems with Heavy Tails. Eindhoven University of Technology, 2001. 227 p.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Mandelbrot B. The fractal geometry of nature. New York : W. H. Freeman and Co., 1982. 480 p.</mixed-citation><mixed-citation xml:lang="en">Mandelbrot B. The fractal geometry of nature. New York : W. H. Freeman and Co., 1982. 480 p.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Zadorozhnyi V. N. Cascade Method of Realization of Heavy-Tailed Distributions // Data Network Modelling, International Siberian Conference on Control and Communications (SIBCON) : conference proceeding, 21–23 May 2015, Omsk State Technical University. Omsk, ; IEEE Inc., 2015. P. 1–4.</mixed-citation><mixed-citation xml:lang="en">Zadorozhnyi V. N. Cascade Method of Realization of Heavy-Tailed Distributions // Data Network Modelling, International Siberian Conference on Control and Communications (SIBCON) : conference proceeding, 21–23 May 2015, Omsk State Technical University. Omsk, ; IEEE Inc., 2015. P. 1–4.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Zadorozhnyi V. N. Peculiarities and Methods of Fractal Queues Simulation // International Siberian Conference on Control and Communications (SIBCON) : conference proceeding, 12–14 May 2016, Moscow, Russia, 2016. IEEE Inc., 2016. P. 1–5.</mixed-citation><mixed-citation xml:lang="en">Zadorozhnyi V. N. Peculiarities and Methods of Fractal Queues Simulation // International Siberian Conference on Control and Communications (SIBCON) : conference proceeding, 12–14 May 2016, Moscow, Russia, 2016. IEEE Inc., 2016. P. 1–5.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Zadorozhnyi V. N., Zakharenkova T. R. Methods of Simulation Queueing Systems with Heavy Tails // Communications in Computer and Information Science. 2016. V. 638. P. 382–396.</mixed-citation><mixed-citation xml:lang="en">Zadorozhnyi V. N., Zakharenkova T. R. Methods of Simulation Queueing Systems with Heavy Tails // Communications in Computer and Information Science. 2016. V. 638. P. 382–396.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Glynn P. W., Iglehart D. L. Conditions for the applicability of the regenerative method // Management Science. 1993. V. 39. P. 1108–1111.</mixed-citation><mixed-citation xml:lang="en">Glynn P. W., Iglehart D. L. Conditions for the applicability of the regenerative method // Management Science. 1993. V. 39. P. 1108–1111.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Bratley P., Fox B. L. A guide to simulation. New York : Springer-Verlag, 1987.</mixed-citation><mixed-citation xml:lang="en">Bratley P., Fox B. L. A guide to simulation. New York : Springer-Verlag, 1987.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Morozov E. Weak regeneration in modeling of queueing processes // Queueing Systems. 2004. № 46. P. 295–315.</mixed-citation><mixed-citation xml:lang="en">Morozov E. Weak regeneration in modeling of queueing processes // Queueing Systems. 2004. № 46. P. 295–315.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Кутузов О. И., Задорожный В. Н., Олзоева С. И. Имитационное моделирование сетей массового обслуживания. Улан-Удэ : Изд-во ВСГТУ, 2001. 228 с.</mixed-citation><mixed-citation xml:lang="en">Кутузов О. И., Задорожный В. Н., Олзоева С. И. Имитационное моделирование сетей массового обслуживания. Улан-Удэ : Изд-во ВСГТУ, 2001. 228 с.</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>
