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

  • Ma. José Doménech-Benlloch
  • José Manuel Giménez-Guzmán
  • Jorge Martínez-Bauset
  • Vicente Casares-Giner
Conference paper

DOI: 10.1007/11750673_9

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3883)
Cite this paper as:
Doménech-Benlloch M.J., Giménez-Guzmán J.M., Martínez-Bauset J., Casares-Giner V. (2006) A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately. In: Cesana M., Fratta L. (eds) Wireless Systems and Network Architectures in Next Generation Internet. EuroNGI 2005. Lecture Notes in Computer Science, vol 3883. Springer, Berlin, Heidelberg

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Ma. José Doménech-Benlloch
    • 1
  • José Manuel Giménez-Guzmán
    • 1
  • Jorge Martínez-Bauset
    • 1
  • Vicente Casares-Giner
    • 1
  1. 1.Department of CommunicationsUniversitat Politècnica de València, UPV, ETSITValènciaSpain

Personalised recommendations