<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE root>
<article 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" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" article-type="research-article" dtd-version="1.2" xml:lang="en"><front><journal-meta><journal-id journal-id-type="publisher-id">Discrete and Continuous Models and Applied Computational Science</journal-id><journal-title-group><journal-title xml:lang="en">Discrete and Continuous Models and Applied Computational Science</journal-title><trans-title-group xml:lang="ru"><trans-title>Discrete and Continuous Models and Applied Computational Science</trans-title></trans-title-group></journal-title-group><issn publication-format="print">2658-4670</issn><issn publication-format="electronic">2658-7149</issn><publisher><publisher-name xml:lang="en">Peoples' Friendship University of Russia named after Patrice Lumumba (RUDN University)</publisher-name></publisher></journal-meta><article-meta><article-id pub-id-type="publisher-id">51119</article-id><article-id pub-id-type="edn">JWJLNP</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Computer Science</subject></subj-group><subj-group subj-group-type="toc-heading" xml:lang="ru"><subject>Информатика и вычислительная техника</subject></subj-group><subj-group subj-group-type="article-type"><subject>Research Article</subject></subj-group></article-categories><title-group><article-title xml:lang="en">The Methods of Drop Probability Calculation for  RED Algorithm</article-title><trans-title-group xml:lang="ru"><trans-title>Метод расчета вероятности сброса пакетов в алгоритме RED</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Korolkova</surname><given-names>A. V.</given-names></name><name xml:lang="ru"><surname>Королькова</surname><given-names>А. В.</given-names></name></name-alternatives><email>-</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples' Friendship University of Russia</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2007-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2007</year></pub-date><issue>1-2</issue><issue-title xml:lang="en">NO12 (2007)</issue-title><issue-title xml:lang="ru">№12 (2007)</issue-title><fpage>32</fpage><lpage>37</lpage><history><date date-type="received" iso-8601-date="2026-07-08"><day>08</day><month>07</month><year>2026</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2007, Korolkova A.V.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2007, Королькова А.В.</copyright-statement><copyright-year>2007</copyright-year><copyright-holder xml:lang="en">Korolkova A.V.</copyright-holder><copyright-holder xml:lang="ru">Королькова А.В.</copyright-holder><ali:free_to_read xmlns:ali="http://www.niso.org/schemas/ali/1.0/"/><license><ali:license_ref xmlns:ali="http://www.niso.org/schemas/ali/1.0/">https://creativecommons.org/licenses/by-nc/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/51119">https://journals.rudn.ru/miph/article/view/51119</self-uri><abstract xml:lang="en">The analytic model of the  functioning  of RED algorithm is   examined  in the article. The model is based on the queueing system   $GI_{\lambda(\bar{q})}|M|1|R$ with thresholds for the queue length   average and the income flow rate $\lambda(\bar{q})$, dependent on   queue length average, was developed.</abstract><trans-abstract xml:lang="ru">В статье исследована модель функционирования алгоритма RED~(Random   Early Detection). Построена  аналитическая модель  в виде СМО   $GI_{\lambda(\bar{q})}|M|1|R$ с порогами для значений средней длины   очереди и интенсивностью входящего потока $\lambda(\bar{q})$,   зависящей от средней длины очереди $\bar{q}$.</trans-abstract><kwd-group xml:lang="en"><kwd>RED</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>вложенная цепь Маркова</kwd><kwd>вероятность сброса</kwd><kwd>средняя   длина очереди</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Floyd S., Jacobson V. Random Early Detection Gateways for Congestion Avoidance // IEEE/ACM Transactions on Networking. - No 1(4). - 1993. - Pp. 397-413.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Floyd S. RED: Discussions of Setting Parameters. - 1997. - http://www.aciri.org/floyd/REDparameters.txt.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Reasons not to deploy RED / M. May, J. Bolot, C. Diot, B. Lyles // Proceedingsof IWQoS’99. - 1999. - Pp. 260-262.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>May M., Bonald T., Bolot J.-C. Analytical evaluation of RED performance // Proceedings of IEEE INFOCOM 2000. - 2000.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Бочаров П., Печинкин А. В. Теория массового обслуживания. - М.: Изд-во РУДН, 1995. - С. 529.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Королькова А. В., Кулябов Д. С. Аналитическая модель для расчета вероятности сброса пакетов в алгоритме RED // Труды конференции «Телекоммуникационные и вычислительные системы» / МТУСИ. - М.: 2006. - С. 24.</mixed-citation></ref></ref-list></back></article>
