Abstract
In cellular networks, repeated attempts occur as result of user behavior but also as automatic retries of blocked requests. Both phenomena play an important role in the system performance and therefore should not be ignored in its analysis. On the other hand, an exact Markovian model analysis of such systems has proven to be infeasible and resorting to approximate techniques is mandatory. We propose an approximate methodology which substantially improves the accuracy of existing methods while keeping computation time in a reasonable value. A numerical evaluation of the model is carried out to investigate the impact on performance of the parameters related to the retry phenomena. As a result, some useful guidelines for setting up the automatic retries are provided. Finally, we also show how our model can be used to obtain a tight performance approximation in the case where reattempts have a deterministic nature.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Jonin, G., Sedol, J.: Telephone systems with repeated calls. In: Proceedings of the 6th International Teletraffic Congress ITC’6, pp. 435.1–435.5 (1970)
Onur, E., Deliç, H., Ersoy, C., Çaglayan, M.U.: Measurement-based replanning of cell capacities in GSM networks. Computer Networks 39, 749–767 (2002)
Marsan, M.A., De Carolis, G.M., Leonardi, E., Lo Cigno, R., Meo, M.: Efficient estimation of call blocking probabilities in cellular mobile telephony networks with customer retrials. IEEE Journal on Selected Areas in Communications 19(2), 332–346 (2001)
Tran-Gia, P., Mandjes, M.: Modeling of customer retrial phenomenon. IEEE Journal on Selected Areas in Communications 15(8), 1406–1414 (1997)
Chakravarthy, S.R., Krishnamoorthy, A., Joshua, V.: Analysis of a multi-server retrial queue with search of customers from the orbit. Performance Evaluation 63(8), 776–798 (2006)
Doménech-Benlloch, M.J., Giménez-Guzmán, J.M., Martínez-Bauset, J., Casares-Giner, V.: Efficient and accurate methodology for solving multiserver retrial systems. IEE Electronic Letters 41(17), 967–969 (2005)
Marsan, M.A., Carolis, G.D., Leonardi, E., Cigno, R.L., Meo, M.: How many cells should be considered to accurately predict the performance of cellular networks? In: Proceedings European Wireless (1999)
Pla, V., Casares, V.: Effect of the handoff area sojourn time distribution on the performance of cellular networks. In: Proceedings of IEEE MWCN, pp. 401–405 (2002)
Neuts, M.: Matrix-geometric Solutions in Stochastic Models: An Algorithmic Approach. The Johns Hopkins University Press, Baltimore (1981)
L. Bright, P.G.T.: Calculating the equilibrium distribution of level dependent quasi-birth-and-death processes. Communications in Statistics-Stochastic Models 11(3), 497–525 (1995)
Latouche, G., Ramaswami, V.: Introduction to Matrix Analytic Methods in Stochastic Modeling. ASA-SIAM (1999)
Artalejo, J.R., Pozo, M.: Numerical calculation of the stationary distribution of the main multiserver retrial queue. Annals of Operations Research 116(1-4), 41–56 (2002)
Servi, L.D.: Algorithmic solutions to two-dimensional birth-death processes with application to capacity planning. Telecommunication Systems 21(2-4), 205–212 (2002)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gimenez-Guzman, J.M., Domenech-Benlloch, M.J., Pla, V., Casares-Giner, V., Martinez-Bauset, J. (2007). Analysis of a Cellular Network with User Redials and Automatic Handover Retrials. In: Koucheryavy, Y., Harju, J., Sayenko, A. (eds) Next Generation Teletraffic and Wired/Wireless Advanced Networking. NEW2AN 2007. Lecture Notes in Computer Science, vol 4712. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74833-5_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-74833-5_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74832-8
Online ISBN: 978-3-540-74833-5
eBook Packages: Computer ScienceComputer Science (R0)