Advertisement
Published in:
2006 | OriginalPaper | Chapter
A Low Computation Cost Algorithm to Solve Cellular Systems with Retrials Accurately
Authors : Ma. José Doménech-Benlloch, José Manuel Giménez-Guzmán, Jorge Martínez-Bauset, Vicente Casares-Giner
Published in: Wireless Systems and Network Architectures in Next Generation Internet
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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.