Chapter

Wireless Systems and Network Architectures in Next Generation Internet

Volume 3883 of the series Lecture Notes in Computer Science pp 103-114

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

  • Ma. José Doménech-BenllochAffiliated withDepartment of Communications, Universitat Politècnica de València, UPV, ETSIT
  • , José Manuel Giménez-GuzmánAffiliated withDepartment of Communications, Universitat Politècnica de València, UPV, ETSIT
  • , Jorge Martínez-BausetAffiliated withDepartment of Communications, Universitat Politècnica de València, UPV, ETSIT
  • , Vicente Casares-GinerAffiliated withDepartment of Communications, Universitat Politècnica de València, UPV, ETSIT

* Final gross prices may vary according to local VAT.

Get Access

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.