<?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">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-51</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>MATHEMATICAL MODELING</subject></subj-group></article-categories><title-group><article-title>ИССЛЕДОВАНИЕ МНОГОЛИНЕЙНОЙ СИСТЕМЫ МАССОВОГО ОБСЛУЖИВАНИЯ С АБСОЛЮТНЫМ ПРИОРИТЕТОМ И ПОВТОРНЫМИ ВЫЗОВАМИ</article-title><trans-title-group xml:lang="en"><trans-title>ANALYSIS OF MULTI-SERVER QUEUEING SYSTEM WITH PREEMPTIVE PRIORITY AND REPEATED CALLS</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>Dudin</surname><given-names>S. A.</given-names></name></name-alternatives><email xlink:type="simple">dudin85@mail.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>Dudina</surname><given-names>O. S.</given-names></name></name-alternatives><email xlink:type="simple">dudina_olga@email.com</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Белорусский государственный университет</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>29</day><month>09</month><year>2016</year></pub-date><volume>0</volume><issue>3</issue><fpage>51</fpage><lpage>61</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Дудин С.А., Дудина О.С., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Дудин С.А., Дудина О.С.</copyright-holder><copyright-holder xml:lang="en">Dudin S.A., Dudina O.S.</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://inf.grid.by/jour/article/view/51">https://inf.grid.by/jour/article/view/51</self-uri><abstract><p>Исследуется многолинейная система массового обслуживания с повторными вызовами без буфера и двумя типами запросов как модель системы когнитивного радио. Запросы первого типа имеют абсолютный приоритет. Процессы поступления запросов первого и второго типов моделируются марковскими входными потоками. Время обслуживания запроса имеет экспоненциальное распределение с зависимым от типа запроса параметром. Запросы второго типа принимаются на обслуживание, если число занятых каналов меньше заданного порогового значения. Запросы второго типа могут совершать повторные попытки попасть на обслуживание. Находится условие существования стационарного режима. Приводятся формулы для вычисления основных характеристик производительности системы.</p></abstract><trans-abstract xml:lang="en"><p>Multi-server retrial queueing system with no buffer and two types of customers is analyzed as the model of cognitive radio system. Customers of type 1 have a preemptive priority. Customers of both types arrive according to Markovian Arrival Processes. Service times have exponential distribution with parameter depending on the customer type. Type 2 customers are admitted for service only if the number of busy servers is less than the predefined threshold. The rejected type 2 customers retry for the service. Existence condition of the stationary mode of system operation is derived. Formulas for computing key performance measures of the system are presented.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Feasibility analysis of vehicular dynamic spectrum access via queueing theory model / S. Chen [et al.] // IEEE Communications Magazine. – 2011. – Vol. 49. – P. 156–163.</mixed-citation><mixed-citation xml:lang="en">Feasibility analysis of vehicular dynamic spectrum access via queueing theory model / S. Chen [et al.] // IEEE Communications Magazine. – 2011. – Vol. 49. – P. 156–163.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Next generation dynamic spectrum access cognitive radio wireless networks: A survey / I.F. Akyildiz [et al.] // Computer Networks. – 2006. – Vol. 50(13). – P. 2127–2159.</mixed-citation><mixed-citation xml:lang="en">Next generation dynamic spectrum access cognitive radio wireless networks: A survey / I.F. Akyildiz [et al.] // Computer Networks. – 2006. – Vol. 50(13). – P. 2127–2159.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Performance analysis of dynamic spectrum handoff scheme with variable bandwidth demand on secondary users for cognitive radio networks / Y. Konishi [et al.] // Wireless Networks. – 2013. – Vol. 19. – P. 607–617.</mixed-citation><mixed-citation xml:lang="en">Performance analysis of dynamic spectrum handoff scheme with variable bandwidth demand on secondary users for cognitive radio networks / Y. Konishi [et al.] // Wireless Networks. – 2013. – Vol. 19. – P. 607–617.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Zahed, S. Analytical modeling for spectrum handoff decision in cognitive radio networks / S. Zahed, I. Awan, A. Cullen // Simulation modelling practice and theory. – 2013. – Vol. 38. – P. 98– 114.</mixed-citation><mixed-citation xml:lang="en">Zahed, S. Analytical modeling for spectrum handoff decision in cognitive radio networks / S. Zahed, I. Awan, A. Cullen // Simulation modelling practice and theory. – 2013. – Vol. 38. – P. 98– 114.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Graham, A. Kronecker Products and Matrix Calculus with Applications / A. Graham. – Cichester : Ellis Horwood, 1981. – 130 р.</mixed-citation><mixed-citation xml:lang="en">Graham, A. Kronecker Products and Matrix Calculus with Applications / A. Graham. – Cichester : Ellis Horwood, 1981. – 130 р.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Klimenok, V.I. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory / V.I. Klimenok, A.N. Dudin // Queueing Systems. – 2006. – Vol. 54. – P. 245–259.</mixed-citation><mixed-citation xml:lang="en">Klimenok, V.I. Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory / V.I. Klimenok, A.N. Dudin // Queueing Systems. – 2006. – Vol. 54. – P. 245–259.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Dudina, O. Retrial queueing system with Markovian arrival flow and phase-type service time distribution / O. Dudina, Ch. Kim, S. Dudin // Computers and Industrial Engineering. – 2013. – Vol. 66. – P. 360–373.</mixed-citation><mixed-citation xml:lang="en">Dudina, O. Retrial queueing system with Markovian arrival flow and phase-type service time distribution / O. Dudina, Ch. Kim, S. Dudin // Computers and Industrial Engineering. – 2013. – Vol. 66. – P. 360–373.</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>
