Mathematical Modelling Issues in Future Telecommunications and Multiservice Networks

A special issue of Mathematics (ISSN 2227-7390). This special issue belongs to the section "Network Science".

Deadline for manuscript submissions: closed (1 February 2021) | Viewed by 11404

Special Issue Editors


E-Mail Website
Guest Editor
Applied Mathematics and Communications Technology Institute, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St., 117198 Moscow, Russia
Interests: 5G; mobile communication; unmanned aerial vehicles; QoS; сomputer networks; wireless networks
Special Issues, Collections and Topics in MDPI journals

E-Mail Website
Co-Guest Editor
1. Department of Applied Mathematics and Computer Science, Belarusian State University, 4, Nezavisimosti Ave., 220030 Minsk, Belarus
2. Applied Mathematics and Communications Technology Institute, Peoples’ Friendship University of Russia (RUDN University), 6 Miklukho-Maklaya St., 117198 Moscow, Russia
Interests: queueing theory; applied probability
Special Issues, Collections and Topics in MDPI journals

E-Mail
Co-Guest Editor
Department of Electronics and Communications Engineering, Tampere University, Tampere, Finland
Interests: performance modeling of communications systems/networks

Special Issue Information

Dear Colleagues,

Over the past few years, there has been an increasing level of research activities worldwide into the design and performance analysis of future wired and wireless telecommunications. Traditionally, the problem is how to share the finite amount of network resources among users of a, from the point of view of technologies and services, heterogeneous telecommunication network, taking into account the huge number of restrictions imposed by the features of technologies and QoS requirements. The problem shows how relevant research is in the area of creating mathematical models and methods of their analysis for evaluating the performance measures of next-generation multiservice networks. There are a number of other problem statements that attract the attention of mathematicians due to their originality and the ability to create new analytical, algorithmic, and numerical methods for analyzing corresponding mathematical models.

We propose in this Special issue to focus on those mathematical models and methods that reflect the specific features of future multiservice networks that differ in essence from past and present ones. We may consider different mathematical approaches based on stochastic processes, queueing theory, statistics, stochastic geometry, and others, if necessary.

Prof. Konstantin Samouylov
Prof. Alexander Dudin
Dr. Dmitri Moltchanov
Guest Editors

Short Bio: Konstantin Samouylov received his PhD in probability theory from the Moscow State University, in 1985, and a Full Doctor of Sciences degree in telecommunications from the Moscow Technical University of Communications and Informatics, in 2005. In 1985–1996, he held several positions at the Faculty of Science of the Peoples' Friendship University of Russia (RUDN University), where he became a head of Telecommunications System Department in 1996. Since 2014, he has been the head of the Applied Probability and Informatics Department, and since 2017, he has also held the position of Director of Applied Mathematics and Communications Technology Institute (IAM&CT) at the RUDN University. He was visiting professor/professor-research at Lappeenranta University of Technology and Helsinki University of Technology (Aalto), Finland; Moscow Technical University of Telecommunications and Informatics, Russia; Moscow International Higher Business School (Mirbis), Russia; and University of Pisa, Italy. He was a member of the ITU-T SG11 and IFIP TC6 WG 6.7. He has worked in a number of R&D projects within different frameworks, e.g., COST IRACON, projects of Russian Foundation for Basic Research (RFBR), TEKES (Finland) and companies including Nokia, Telecom Finland, VTT, Rostelecom, etc. He is a member of editorial boards and reviewer of several scientific magazines, and he is co-chair and TPC member of several international conferences. His current research interests include applied aspects of probability theory and stochastic processes, queuing and teletraffic theory, performance analysis of 5G/5G+ networks, resource allocation in heterogeneous wireless networks, social networks, and big data analysis. He has authored and co-authored over 150 scientific and conference papers and six books. Prof. Samouylov’s honors include the 2018 IEEE GLOBECOM Conference Best Paper Award.

Manuscript Submission Information

Manuscripts should be submitted online at www.mdpi.com by registering and logging in to this website. Once you are registered, click here to go to the submission form. Manuscripts can be submitted until the deadline. All submissions that pass pre-check are peer-reviewed. Accepted papers will be published continuously in the journal (as soon as accepted) and will be listed together on the special issue website. Research articles, review articles as well as short communications are invited. For planned papers, a title and short abstract (about 100 words) can be sent to the Editorial Office for announcement on this website.

Submitted manuscripts should not have been published previously, nor be under consideration for publication elsewhere (except conference proceedings papers). All manuscripts are thoroughly refereed through a single-blind peer-review process. A guide for authors and other relevant information for submission of manuscripts is available on the Instructions for Authors page. Mathematics is an international peer-reviewed open access semimonthly journal published by MDPI.

Please visit the Instructions for Authors page before submitting a manuscript. The Article Processing Charge (APC) for publication in this open access journal is 2600 CHF (Swiss Francs). Submitted papers should be well formatted and use good English. Authors may use MDPI's English editing service prior to publication or during author revisions.

Published Papers (4 papers)

Order results
Result details
Select all
Export citation of selected articles as:

Research

19 pages, 491 KiB  
Article
An Analytical Model for 5G Network Resource Sharing with Flexible SLA-Oriented Slice Isolation
by Natalia Yarkina, Yuliya Gaidamaka, Luis M. Correia and Konstantin Samouylov
Mathematics 2020, 8(7), 1177; https://doi.org/10.3390/math8071177 - 17 Jul 2020
Cited by 21 | Viewed by 3566
Abstract
Network slicing is a novel key technology in 5G networks which permits to provide a multitude of heterogeneous communication services over a common network infrastructure while satisfying strict Quality of Service (QoS) requirements. Since radio spectrum resources are inherently scarce, the slicing of [...] Read more.
Network slicing is a novel key technology in 5G networks which permits to provide a multitude of heterogeneous communication services over a common network infrastructure while satisfying strict Quality of Service (QoS) requirements. Since radio spectrum resources are inherently scarce, the slicing of the radio access network should rely on a flexible resource sharing policy that provides efficient resource usage, fairness and slice isolation. In this article, we propose such a policy for bandwidth-greedy communication services. The policy implies a convex programming problem and is formalized to allow for session-level stochastic modeling. We developed a multi-class service system with service rates obtained as a solution to the optimization problem, a Markovian Arrival Process and state-dependent preemptive priorities. We use matrix-analytic methods to find the steady state distribution of the resulting continuous-time Markov chain and the expressions for important performance metrics, such as data rates. Numerical analysis illustrates the efficiency of the proposed slicing scheme compared to the complete sharing and complete partitioning policies, showing that our approach leads to a data rate about the double of that obtained under complete partitioning for the analyzed scenario. Full article
Show Figures

Figure 1

17 pages, 636 KiB  
Article
Improvement of the Fairness of Non-Preemptive Priorities in the Transmission of Heterogeneous Traffic
by Sergei Dudin, Olga Dudina, Konstantin Samouylov and Alexander Dudin
Mathematics 2020, 8(6), 929; https://doi.org/10.3390/math8060929 - 07 Jun 2020
Cited by 9 | Viewed by 1566
Abstract
A new flexible discipline for providing priority to one of two types of customers in a single-server queue is proposed. This discipline assumes the use of additional finite storages for each type of arriving customer. During the stay in a storage, a customer [...] Read more.
A new flexible discipline for providing priority to one of two types of customers in a single-server queue is proposed. This discipline assumes the use of additional finite storages for each type of arriving customer. During the stay in a storage, a customer can leave the system or transfer to the main infinite buffer. Preference to priority customers is provided via the proper choice of the rates of a customer transfer from the storages to the buffer. Analysis of this discipline is implemented under quite general assumptions about the arrival and service processes. The advantage of the proposed discipline over the classical non-preemptive discipline is numerically demonstrated. Full article
Show Figures

Figure 1

25 pages, 1526 KiB  
Article
Queuing System with Two Types of Customers and Dynamic Change of a Priority
by Valentina Klimenok, Alexander Dudin, Olga Dudina and Irina Kochetkova
Mathematics 2020, 8(5), 824; https://doi.org/10.3390/math8050824 - 19 May 2020
Cited by 18 | Viewed by 3738
Abstract
The use of priorities allows us to improve the quality of service of inhomogeneous customers in telecommunication networks, inventory and health-care systems. An important modern direction of research is to analyze systems in which priority of a customer can be changed during his/her [...] Read more.
The use of priorities allows us to improve the quality of service of inhomogeneous customers in telecommunication networks, inventory and health-care systems. An important modern direction of research is to analyze systems in which priority of a customer can be changed during his/her stay in the system. We considered a single-server queuing system with a finite buffer, where two types of customers arrive according to a batch marked Markov arrival process. Type 1 customers have non-preemptive priority over type 2 customers. Low priority customers are able to receive high priority after the random amount of time. For each non-priority customer accepted into the buffer, a timer, which counts a random time having a phase type distribution, is switched-on. When the timer expires, the customer with some probability leaves the system unserved and with the complimentary probability gains the high priority. Such a type of queues is typical in many health-care systems, contact centers, perishable inventory, etc. We describe the behavior of the system by a multi-dimensional continuous-time Markov chain and calculate a number of the stationary performance measures of the system including the various loss probabilities as well as the distribution function of the waiting time of priority customers. The illustrative numerical examples giving insights into the system behavior are presented. Full article
Show Figures

Figure 1

13 pages, 1199 KiB  
Article
Queuing System with Unreliable Servers and Inhomogeneous Intensities for Analyzing the Impact of Non-Stationarity to Performance Measures of Wireless Network under Licensed Shared Access
by Ekaterina Markova, Yacov Satin, Irina Kochetkova, Alexander Zeifman and Anna Sinitcina
Mathematics 2020, 8(5), 800; https://doi.org/10.3390/math8050800 - 14 May 2020
Cited by 8 | Viewed by 1668
Abstract
Given the limited frequency band resources and increasing volume of data traffic in modern multiservice networks, finding new and more efficient radio resource management (RRM) mechanisms is becoming indispensable. One of the implemented technologies to solve this problem is the licensed shared access [...] Read more.
Given the limited frequency band resources and increasing volume of data traffic in modern multiservice networks, finding new and more efficient radio resource management (RRM) mechanisms is becoming indispensable. One of the implemented technologies to solve this problem is the licensed shared access (LSA) technology. LSA allows the spectrum that has been licensed to an owner, who has absolute priority on its utilization, to be used by other participants (i.e., tenants). Owner priority impacts negatively on the quality of service (QoS) by reducing the data bit rate and interrupting user services. In this paper, we propose a wireless multiservice network scheme model described as a queuing system with unreliable servers and a finite buffer within the LSA framework. The aim of this work is to analyze main system performance measures: blocking probability, average number of requests in queue, and average queue length depending on LSA frequencies’ availability. Full article
Show Figures

Figure 1

Back to TopTop