<?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">16204</article-id><article-id pub-id-type="doi">10.22363/2312-9735-2017-25-3-209-216</article-id><article-categories><subj-group subj-group-type="toc-heading" xml:lang="en"><subject>Mathematical Teletraffic Theory and Telecommunication Networks</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">About Probability Characteristics Evaluation in Queuing System with Limited Resources and Random Requirements</article-title><trans-title-group xml:lang="ru"><trans-title>К вычислению вероятностных характеристик СМО ограниченной ёмкости со случайными требованиями к ресурсам</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author"><name-alternatives><name xml:lang="en"><surname>Vikhrova</surname><given-names>O G</given-names></name><name xml:lang="ru"><surname>Вихрова</surname><given-names>Ольга Геннадиевна</given-names></name></name-alternatives><bio xml:lang="en"><p>Department of Applied Probability and Informatics</p></bio><bio xml:lang="ru"><p>Кафедра прикладной информатики и теории вероятностей</p></bio><email>vikhrova_og@rudn.university</email><xref ref-type="aff" rid="aff1"/></contrib></contrib-group><aff-alternatives id="aff1"><aff><institution xml:lang="en">Peoples’ Friendship University of Russia (RUDN University)</institution></aff><aff><institution xml:lang="ru">Российский университет дружбы народов</institution></aff></aff-alternatives><pub-date date-type="pub" iso-8601-date="2017-12-15" publication-format="electronic"><day>15</day><month>12</month><year>2017</year></pub-date><volume>25</volume><issue>3</issue><issue-title xml:lang="en">VOL 25, NO3 (2017)</issue-title><issue-title xml:lang="ru">ТОМ 25, №3 (2017)</issue-title><fpage>209</fpage><lpage>216</lpage><history><date date-type="received" iso-8601-date="2017-06-06"><day>06</day><month>06</month><year>2017</year></date></history><permissions><copyright-statement xml:lang="en">Copyright ©; 2017, Vikhrova O.G.</copyright-statement><copyright-statement xml:lang="ru">Copyright ©; 2017, Вихрова О.Г.</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="en">Vikhrova O.G.</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/">http://creativecommons.org/licenses/by/4.0</ali:license_ref></license></permissions><self-uri xlink:href="https://journals.rudn.ru/miph/article/view/16204">https://journals.rudn.ru/miph/article/view/16204</self-uri><abstract xml:lang="en"><p>Mobile data traffic increases on everyday basis for the last decade and is going to keep this trend in the near future. Exponential growth of data traffic in wireless networks accelerates the development of new technologies and the transition to 5G networks. The ongoing improvements will allow to increase the channels throughput and will allow devices to simultaneously support both cellular and Wi-Fi networks, and even allow direct device-to-device (D2D) connection without any base station involved. Evolving heterogeneous networks promise more efficient radio resources usage by a macro cell traffic offloading to the small cells and uplink and downlink decoupling (DUDe). A resource-sharing model in heterogeneous networks is for the first time proposed to be analyzed in terms of queuing system with random requirements. We suggest a multiserver queuing network with limited resources where each class of customers requires a random vector of resources to be served. It has been proved that stationary probabilities of the system with aggregated flow of customers with mean-weighted requirement are equal to the stationary probabilities of the suggested system. The analytical method for the key probability characteristics evaluation requires calculating all k-fold convolutions for each set of vectors requirements. We propose a recurrent computation algorithm for normalization constant evaluation and efficient formulas for blocking probability, mean volume and variance of the occupied resources.</p></abstract><trans-abstract xml:lang="ru"><p>Для современных сетей связи характерен высокий уровень роста мобильного трафика данных. Устойчивые тенденции роста нагрузки в беспроводных сетях ускоряют развитие технологий и переход к сетям нового поколения (5G). Планируемые улучшения позволят в несколько раз увеличить пропускную способность каналов связи и позволят устройствам одновременно поддерживать как соединения сотой связи, так и, например, подключение к Wi-Fi сетям, возможна передача данных от устройства к устройству напрямую (device-to-device, D2D). В условиях вынужденной гетерогенности сетей связи предлагается отказаться от традиционной «парной» ассоциации восходящего (ВК) и нисходящего (НК) каналов и разделять их при условии гарантии необходимого уровня качества. Разделение ресурсов в современных гетерогенных сетях предлагается моделировать в виде системы массового обслуживания (СМО) со случайными требованиями. Подобные модели к анализу показателей качества в беспроводных сетях ранее не применялись. Исследуется многолинейная СМО с различными классами заявок, где каждой поступившей заявке выделяется некоторый вектор случайных требований к ресурсам. Было доказано, что при объединении потоков заявок различных классов в один поток со средневзвешенным требованием стационарные вероятности не зависят от порядка поступления заявок, а зависят от их общего числа в системе и объёма занимаемых ресурсов. Получен более простой вид формул для вероятности блокировки и среднего объёма занятых ресурсов, однако аналитические формулы требуют вычисления n-кратных свёрток для всех возможных наборов векторов занимаемых ресурсов, где n - количество заявок в системе. Был разработан эффективный алгоритм вычисления нормировочной константы, с помощью которой получены рекуррентные формулы для стационарных вероятностей и основных вероятностных характеристик СМО.</p></trans-abstract><kwd-group xml:lang="en"><kwd>queuing system with limited resources</kwd><kwd>random requirements</kwd><kwd>recurrent algorithm</kwd><kwd>probability characteristics</kwd><kwd>normalization constant</kwd><kwd>heterogeneous networks</kwd></kwd-group><kwd-group xml:lang="ru"><kwd>ресурсная СМО</kwd><kwd>ограниченная ёмкость</kwd><kwd>требования случайного объёма</kwd><kwd>нормировочная константа</kwd><kwd>вероятностные характеристики</kwd><kwd>рекуррентный алгоритм</kwd><kwd>гетерогенная сеть</kwd></kwd-group><funding-group/></article-meta></front><body></body><back><ref-list><ref id="B1"><label>1.</label><citation-alternatives><mixed-citation xml:lang="en">Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2016-2021 (2017). URL http://www.cisco.com/c/en/us/solutions/collateral/service-provider/visual-networking-index-vni/mobile-white-paper-c11-520862.html</mixed-citation><mixed-citation xml:lang="ru">Cisco Visual Networking Index: Global Mobile Data Traffic Forecast Update, 2016-2021. - 2017. http://www.cisco.com/c/en/us/ solutions/collateral/service-provider/visual-networking-index-vni/mobile-white-paper-c11-520862.html.</mixed-citation></citation-alternatives></ref><ref id="B2"><label>2.</label><citation-alternatives><mixed-citation xml:lang="en">J. Andrews, H. Claussen, M. Dohler, S. Rangan, Femtocells: Past, Present, and Future, IEEE JSAC 30 (3) (2012) 497–508.</mixed-citation><mixed-citation xml:lang="ru">Femtocells: Past, Present, and Future / J. Andrews, H. Claussen, M. Dohler, S. Rangan // IEEE JSAC. 2012. Vol. 30, No 3. Pp. 497-508.</mixed-citation></citation-alternatives></ref><ref id="B3"><label>3.</label><citation-alternatives><mixed-citation xml:lang="en">G. Fodor, S. Parkvall, S. Sorrentino, P. Wallentin, Q.Lu, N. Brahmi, Device-to-Device Communications for National Security and Public Safety, IEEE Access 2 (1) (2014) 1510–1520.</mixed-citation><mixed-citation xml:lang="ru">Device-to-Device Communications for National Security and Public Safety / G. Fodor, S. Parkvall, S. Sorrentino, P. Wallentin, Q. Lu, N. Brahmi // IEEE Access. 2014. Vol. 2, No 1. Pp. 1510-1520.</mixed-citation></citation-alternatives></ref><ref id="B4"><label>4.</label><citation-alternatives><mixed-citation xml:lang="en">F. Boccardi, J. Andrews, H. Elshaer, M. Dohler, S. Parkvall, P. Popovski, S. Singh, Why to Decouple the Uplink and Downlink in Cellular Networks and How To Do It, IEEE Communications Magazine 54 (3) (2016) 110–117.</mixed-citation><mixed-citation xml:lang="ru">Why to Decouple the Uplink and Downlink in Cellular Networks and How To Do It / F. Boccardi, J. Andrews, H. Elshaer, M. Dohler, S. Parkvall, P. Popovski, S. Singh // IEEE Communications Magazine. 2016. Vol. 54, No 3. Pp. 110-117.</mixed-citation></citation-alternatives></ref><ref id="B5"><label>5.</label><citation-alternatives><mixed-citation xml:lang="en">S. Singh, X. Zhang, J. Andrews, Joint Rate and SINR Coverage Analysis for Decoupled Up-link-Downlink Biased Cell Associations in HetNets, IEEE Transactions on Wireless Communication 14 (10) (2015) 5360–5373.</mixed-citation><mixed-citation xml:lang="ru">Singh S., Zhang X., Andrews J. Joint Rate and SINR Coverage Analysis for Decoupled Up-link-Downlink Biased Cell Associations in HetNets // IEEE Transactions on Wireless Communication. 2015. Vol. 14, No 10. Pp. 5360-5373.</mixed-citation></citation-alternatives></ref><ref id="B6"><label>6.</label><citation-alternatives><mixed-citation xml:lang="en">H. Elshaer, F. Boccardi, M. Dohler, R. Irmer, Downlink and Uplink Decoupling: A Disruptive Architectural Design for 5G Networks, Global Communications Conference (GLOBECOM) (2014) 1798–1803.</mixed-citation><mixed-citation xml:lang="ru">Downlink and Uplink Decoupling: A Disruptive Architectural Design for 5G Networks / H. Elshaer, F. Boccardi, M. Dohler, R. Irmer // Global Communications Conference (GLOBECOM). 2014. Pp. 1798-1803.</mixed-citation></citation-alternatives></ref><ref id="B7"><label>7.</label><citation-alternatives><mixed-citation xml:lang="en">V. Naumov, K. Samouylov, E. Sopin, N. Yarkina, S. Andreev, A. Samuylov, LTE Performance Analysis Using Queuing Systems with Finite Resources and Random Requirements, in: 7th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 6–8 Oct. 2015, IEEE, 2015, pp. 100–103. doi:10.1109/ICUMT.2015.7382412.</mixed-citation><mixed-citation xml:lang="ru">LTE Performance Analysis Using Queuing Systems with Finite Resources and Random Requirements / V. Naumov, K. Samouylov, E. Sopin, N. Yarkina, S. Andreev, Samuylov // 7th International Congress on Ultra Modern Telecommunications and Control Systems and Workshops, 6-8 Oct. 2015. IEEE, 2015. Pp. 100-103.</mixed-citation></citation-alternatives></ref><ref id="B8"><label>8.</label><citation-alternatives><mixed-citation xml:lang="en">O.M. Tikhonenko, Destricted Capacity Queueing Systems: Determination of their Characteristics, Automation and Remote Control 58 (1997) 969–973.</mixed-citation><mixed-citation xml:lang="ru">Тихоненко О.М. Определение характеристик систем обслуживания с ограниченной памятью // Автоматика и телемеханика. 1997. Вып. 6. С. 105-110.</mixed-citation></citation-alternatives></ref><ref id="B9"><label>9.</label><citation-alternatives><mixed-citation xml:lang="en">O.M. Tikhonenko, Generalized Erlang Problem for Service Systems with Finite Total Capacity, Problems of Information Transmission 41 (2005) 243–253.</mixed-citation><mixed-citation xml:lang="ru">Тихоненко O.M. Обобщенная задача Эрланга для систем обслуживания с ограниченным суммарным объемом // Проблемы передачи информации. 2005. Т. 41, вып. 3. С. 64-75.</mixed-citation></citation-alternatives></ref><ref id="B10"><label>10.</label><citation-alternatives><mixed-citation xml:lang="en">V.A. Naumov, K.E. Samouylov, On the Modeling of Queuing Systems with Multiple Resources, Bulletin of Peoples’ Friendship University of Russia. Series: Mathematics. Information Sciences. Physics (3) (2014) 58–62.</mixed-citation><mixed-citation xml:lang="ru">Наумов В.А., Самуйлов К.Е. О моделировании систем массового обслуживания с множественными ресурсами // Вестник РУДН. Серия: Математика. Информатика. Физика. 2014. № 3. С. 58-62.</mixed-citation></citation-alternatives></ref><ref id="B11"><label>11.</label><citation-alternatives><mixed-citation xml:lang="en">V.A. Naumov, K.E. Samouylov, A.K. Samouylov, On the Total Amount of Resources Occupied by Serviced Customers, Automation and Remote Control 77 (2016) 1419–1427.</mixed-citation><mixed-citation xml:lang="ru">Наумов В.А., Самуйлов К.Е., Самуйлов А.К. О суммарном объеме ресурсов, занимаемых обслуживаемыми заявками // Актоматика и телемеханика. 2016. Вып. 8. С. 125-135.</mixed-citation></citation-alternatives></ref><ref id="B12"><label>12.</label><citation-alternatives><mixed-citation xml:lang="en">V. Naumov, K. Samuoylov, E. Sopin, S. Andreev, Two Approaches to Analysis of Queuing Systems with Limited Resources, in: Ultra Modern Telecommunications and Control Systems and Workshops, 6–8 Oct. 2014, IEEE, 2014, pp. 485–488. doi:10.1109/ICUMT.2014.7002149.</mixed-citation><mixed-citation xml:lang="ru">Two Approaches to Analysis of Queuing Systems with Limited Resources / V. Naumov, K. Samuoylov, E. Sopin, S. Andreev // Ultra Modern Telecommunications and Control Systems and Workshops, 6-8 Oct. 2014. IEEE, 2014. Pp. 485-488.</mixed-citation></citation-alternatives></ref><ref id="B13"><label>13.</label><citation-alternatives><mixed-citation xml:lang="en">K. Samouylov, E. Sopin, O. Vikhrova, Analyzing Blocking Probability in LTE Wireless Network via Queuing System with Finite Amount of Resources, Communications in Computer and Information Science 564 (2015) 393–403.</mixed-citation><mixed-citation xml:lang="ru">Samouylov K., Sopin E., Vikhrova O. Analyzing Blocking Probability in LTE Wireless Network via Queuing System with Finite Amount of Resources // Communications in Computer and Information Science. 2015. Vol. 564. Pp. 393-403.</mixed-citation></citation-alternatives></ref><ref id="B14"><label>14.</label><citation-alternatives><mixed-citation xml:lang="en">K. Samouylov, E. Sopin, O. Vikhrova, On Design of Efficient Algorithm for Blocking Probability Calculation in Queuing System with Random Requirements, in: Information technologies and mathematical modelling (ITMM–2016): XV International Scientific Conference named after A. F. Terpugov, Vol. 1, Tomsk State University, 2016, pp. 192–197.</mixed-citation><mixed-citation xml:lang="ru">Самуйлов K., Сопин Э., Вихрова О. К разработке эффективных вычислительных алгоритмов нахождения вероятности блокировки для системы со случайными требованиями // Информационные технологии и математическое моделирование (ИТММ-2016): 15-я Международная конференция имени А. Ф. Терпугова. Т. 1. Изд-во Том. ун-та, 2016. С. 192-197.</mixed-citation></citation-alternatives></ref><ref id="B15"><label>15.</label><citation-alternatives><mixed-citation xml:lang="en">J.P. Buzen, Computational Algorithms for Closed Queueing Networks with Exponential Servers, Communications of the ACM 19 (9) (1973) 527–531.</mixed-citation><mixed-citation xml:lang="ru">Buzen J.P. Computational Algorithms for Closed Queueing Networks with Exponential Servers // Communications of the ACM. 1973. Vol. 19, No 9. Pp. 527-531.</mixed-citation></citation-alternatives></ref></ref-list></back></article>
