A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately

Abstract

Abstract. This paper proposes an approximate methodology for solving Markov models that compete for limited resources and retry when access fails, like those arising in mobile cellular networks. We limit the number of levels that define the system by aggregating all levels beyond a given one in order to manage curse of dimensionality issue. The developed methodology allows to balance accuracy and computational cost. We determine the relative error of different typical performance parameters when using the approximate model as well as the computational savings. Results show that high accuracy and cost savings can be obtained by deploying the proposed methodology.

Performance analysis of a cellular mobile network with retrials and guard channels using waiting and first passage time measures

“…We do not proceed further in the stationary analysis of the system, as our focus is on the waiting and first-passage time measures that we present in the next sections. For implementation details of the corresponding algorithms, we point to the papers of Servi [18] and Domenech-Benlloch et al [19] who carry out the stationary analysis of similar models.…”