<?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">8317</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Articles</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">Polling Model of a SIP Server with Exhaustive and Gated Service Disciplines</article-title><trans-title-group xml:lang="ru"><trans-title>Модель SIP-сервера с дисциплинами шлюзового и исчерпывающего обслуживания очередей</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Gaidamaka</surname><given-names>Y V</given-names></name><name xml:lang="ru"><surname>Гайдамака</surname><given-names>Юлия Васильевна</given-names></name></name-alternatives><bio xml:lang="en">Telecommunication System Department</bio><bio xml:lang="ru">Кафедра систем телекоммуникаций</bio><email>ygaidamaka@sci.pfu.edu.ru</email><xref ref-type="aff" rid="aff1"/></contrib><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Zaripova</surname><given-names>E R</given-names></name><name xml:lang="ru"><surname>Зарипова</surname><given-names>Эльвира Ринатовна</given-names></name></name-alternatives><bio xml:lang="en">Telecommunication System Department</bio><bio xml:lang="ru">Кафедра систем телекоммуникаций</bio><email>ezarip@sci.pfu.edu.ru</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="2013-01-15" publication-format="electronic"><day>15</day><month>01</month><year>2013</year></pub-date><issue>1</issue><issue-title xml:lang="en">NO1 (2013)</issue-title><issue-title xml:lang="ru">№1 (2013)</issue-title><fpage>52</fpage><lpage>57</lpage><history><date date-type="received" iso-8601-date="2016-09-08"><day>08</day><month>09</month><year>2016</year></date></history><permissions><copyright-statement xml:lang="ru">Copyright ©; 2013, Гайдамака Ю.В., Зарипова Э.Р.</copyright-statement><copyright-year>2013</copyright-year><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/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/8317">https://journals.rudn.ru/miph/article/view/8317</self-uri><abstract xml:lang="en">This paper investigates characteristics of the polling cycling models with exhaustive and gated service disciplines. We have derived mean queuing delays for suggested models and evaluated results.</abstract><trans-abstract xml:lang="ru">В статье исследуются характеристики СМО как системы поллинга с циклическим порядком опроса очередей, исчерпывающей и шлюзовой дисциплинами обслуживания. Представлены формулы в явном виде, характеризующие среднее время ожидания в очереди. Проведена реализация численного эксперимента.</trans-abstract><kwd-group xml:lang="en"><kwd>polling system</kwd><kwd>SIP-server</kwd><kwd>exhaustive service discipline</kwd><kwd>gated service discipline</kwd><kwd>mathematical model</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>система поллинга</kwd><kwd>SIP-сервер</kwd><kwd>исчерпывающая дисциплина обслуживания</kwd><kwd>шлюзовая дисциплина обслуживания</kwd><kwd>математическая модель</kwd></kwd-group></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><mixed-citation>Rosenberg J., Schulzrinne H., Camarillo G. RFC 3261. SIP: Session Initiation Protocol. — 2002.</mixed-citation></ref><ref id="B2"><label>2.</label><mixed-citation>Rosenberg J. RFC 5390. Requirements for Management of Overload in the SessionInitiation Protocol. — 2008.</mixed-citation></ref><ref id="B3"><label>3.</label><mixed-citation>Shen C., Schulzrinne H., Nahum E. Session Initiation Protocol (SIP) Server Overload Control: Design and Evaluation // Lecture Notes in Computer Science. — Berlin: Springer-Verlag, 2008. — Vol. 5310. — Pp. 149–173.</mixed-citation></ref><ref id="B4"><label>4.</label><mixed-citation>Queueing Strategies for Local Overload Control in SIP Server / R.G. Garroppo, S. Giordano, S. Spagna, S. Niccolini // Global Telecommunications Conference. — Dept. of Inf. Eng., Univ. of Pisa, Pisa, Italy: IEEE, 2009. — 1-6 p.</mixed-citation></ref><ref id="B5"><label>5.</label><mixed-citation>Самуйлов К.Е., Зарипова Э.Р. Модель локального механизма контроля перегрузок SIP-сервера // T-COMM. — 2012. — С. 185–187.</mixed-citation></ref><ref id="B6"><label>6.</label><mixed-citation>Вишневский В.М., Семенова О.В. Системы поллинга: теория и применение в широкополосных беспроводных сетях. — М.: Техносфера, 2007. — 312 с.</mixed-citation></ref><ref id="B7"><label>7.</label><mixed-citation>Simulation of Overload Control in SIP Server Networks / P.O. Abaev, Y.V. Gaidamaka, A.V. Pechinkin et al. // Proc. of the 26th European Conference on Modelling and Simulation ECMS. — Koblenz: 2012. — Pp. 533–539.</mixed-citation></ref><ref id="B8"><label>8.</label><mixed-citation>Abaev P., Gaidamaka Y., Samouylov K. Modeling of Hysteretic Signalling Load Control in Next Generation Networks // Proceedings 12th International Conference, NEW2AN 2012, and 5th Conference, ruSMART 2012. — St. Petersburg: 2012. — Pp. 440–452.</mixed-citation></ref><ref id="B9"><label>9.</label><mixed-citation>Abaev P., Gaidamaka Y., Samouylov K. Queuing Model for Loss-Based Overload Control in a SIP Server Using a Hysteretic Technique // Proceedings 12th International Conference, NEW2AN 2012, and 5th Conference, ruSMART 2012. — St. Petersburg: 2012. — Pp. 371–378.</mixed-citation></ref><ref id="B10"><label>10.</label><mixed-citation>Gaidamaka Y., Samouylov K., Sopin E. Analysis of M|G|1 queue with hysteretic load control // XXX International Seminar on Stability Problems for Stochastic Models, the Autumn Session of the VI International Seminar on Applied Problems of Probability Theory and Mathematical Statistics related to Modeling ofInformation Systems. — Svetlogorsk: 2012. — Pp. 87–89.</mixed-citation></ref><ref id="B11"><label>11.</label><mixed-citation>Basharin G., Gaidamaka Y., Samouylov K. Actual Tasks of Mathematical Theory of Teletraffic // International Seminar "Stochastic Models and Statistical Inference" dedicated to the 100th Anniversary of Boris V. Gnedenko 17–20 October2012. — Riga: 2012. — Pp. 104–105.</mixed-citation></ref></ref-list></back></article>
