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.
Highlights
Queuing systems and networks well describe the processes of resource allocation in telecommunication networks and continue to be a topical object of research
We suggest that the handover user that arrives when all the servers are busy is sent to the buffer
In this paper, a model of a queuing system, which describes the operation of a cell of a mobile communication network, is formulated and investigated
Summary
Queuing systems and networks well describe the processes of resource allocation in telecommunication networks and continue to be a topical object of research. Recently, a study on the characteristics of the operation of cells in mobile communication networks, in which the service rate of a user (due to the use of various modulation schemes) depends on the strength of the signal received from the base station, has begun. C. Kim et al.: Mathematical Model of Operation of Cell of Mobile Communication Network the users depending on the current distance from the base station, and (ii) account of handover phenomenon. In contrast to the overwhelming majority of the existing papers, in which usually the arrival processes are assumed to be stationary Poisson, in our model both arrival processes of ordinary and handover users are quite general MMAP and Markov arrival processes (MAP) This allows taking into account the bursty behavior of arrival processes in modern wireless communication networks.
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
