Analysis and optimization of Guard Channel Policy in cellular mobile networks with account of retrials

Authors:
Chesoong Kim;V. I. Klimenok;A. N. Dudin
Affiliations:
-;-;-
Venue:
Computers and Operations Research
Year:
2014

Citing 8
Cited 0

On optimal call admission control in cellular networks

Wireless Networks
A Retrial BMAP/PH/N System

Queueing Systems: Theory and Applications
Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory

Queueing Systems: Theory and Applications
Multi-class Markovian arrival processes and their parameter fitting

Performance Evaluation
PCS networks with correlated arrival process and retrial phenomenon

IEEE Transactions on Wireless Communications
MAP1, MAP2/M/c retrial queue with the retrial group of finite capacity and geometric loss

Mathematical and Computer Modelling: An International Journal
Solution for a retrial queueing problem in cellular networks with the Fractional Guard Channel policy

Mathematical and Computer Modelling: An International Journal
Optimization of the (MAP1, MAP2)/(PH1, PH 2)/N retrial queue model of wireless cellular networks with channel allocation

Computers and Electrical Engineering

Quantified Score

Hi-index	0.01

Visualization

Abstract

A multi-server retrial queue with two types of calls (handover and new calls) is analyzed. This queue models the operation of a cell of a mobile communication network. Calls of two types arrive at the system according to the Marked Markovian Arrival Process. Service times of both types of the calls are exponentially distributed with different service rates. Handover calls have priority over new calls. Priority is provided by means of reservation of several servers of the system exclusively for service of handover calls. A handover call is dropped and leaves the system if all servers are busy at the arrival epoch. A new call is blocked if all servers available to new calls are busy. Such a call has options to balk (to leave the system without getting the service) or to retry later on. The behavior of the system is described by the four-dimensional Markov chain belonging to the class of the asymptotically quasi-Toeplitz Markov chains (AQTMC). In the paper, a constructive ergodicity condition for this chain is derived and the effective algorithm for computing the stationary distribution is presented. Based on this distribution, formulas for various performance measures of the system are obtained. Results of numerical experiments illustrating the behavior of key performance measures of the system depending on the number of the reserved servers under the different shares of the handover and the new calls are presented. An optimization problem is considered and high positive effect of server's reservation is demonstrated.