Mathematical Model of Operation of a Cell of a Mobile Communication Network With Adaptive Modulation Schemes and Handover of Mobile Users

Abstract

A model of a cell of a communication network, divided into zones, with the dependence of the users' service time on the zone, in which they are located, is considered. The arrival flow of users is defined by a marked Markovian process. The number of users that can receive service in a cell simultaneously is finite. If the number of users reached the limit, then new users are lost, except the users that come to the cell already during the service (handover users). For the short-term storage of such users, there is a buffer of a finite capacity. Cell operation is modeled by a multi-server queueing system. The behavior of this system is described by a multi-dimensional Markov chain. The algorithms for calculating the stationary distribution of this chain and the main characteristics of the quality of service have been developed.

Admission Control in Priority Queueing System With Servers Reservation and Temporal Blocking Admission of Low Priority Users

“…• phase type distribution of service times (using the approach by Ramaswami and Lucantoni [37] and results from [25] and [28]);…”

“…The associate editor coordinating the review of this manuscript and approving it for publication was Ding Xu . [11], [12], [23], [25], [29], [30], [31], [32], [34], [40], [42], [44], [45], [47]. There are many different possible variants of information transmission in CRN s which require consideration of different queueing systems as their descriptors, see, e.g., [36].…”

Randomized Threshold Strategy for Providing Flexible Priority in Multi-Server Queueing System with a Marked Markov Arrival Process and Phase-Type Distribution of Service Time

“…Note that the recursive algorithms for the computation of the matrices A i , L i , ∆ i , i = 1, N, and P i (β 1 ), P i (β 2 ), i = 0, N − 1, are available in paper [55] and represent the advanced modification of the algorithms earlier presented in [53,54] and used, e.g., in [62][63][64].…”

“…Formulas for computation of these matrices for the value n of the number of currently busy servers (among N available servers), n = 1, N, depend on both n and N. This is not convenient, especially when it is required to make computations for several values of N, e.g., in the process of computing the minimum required number N of servers to guarantee the fixed values of the service quality indicators. In [55], the formulas derived in [53,54] are modified to eliminate the use of the value of N in recursive computations.…”

Priority queueing system with many types of requests and restricted processor sharing

“…If s l > 0 for some l, M ≥ l > m and m * is the maximum of such values l, then element 1 is placed in the column corresponding to the state In this case, a type m * request has the lowest priority, and an arriving type m request displaces any type m * request, which leaves the system (is lost). A more detailed description of these matrices and the algorithms elaborated to calculate them are presented, for example, in (Kim et al 2013) and (Kim et al 2021).…”