Table of Contents Author Guidelines Submit a Manuscript
Journal of Applied Mathematics
Volume 2012 (2012), Article ID 186761, 18 pages
http://dx.doi.org/10.1155/2012/186761
Research Article

Efficient Method to Approximately Solve Retrial Systems with Impatience

1Departamento Automatica, Universidad de Alcalá, Alcalá de Henares, 28871 Madrid, Spain
2Departamento Comunicaciones, Universitat Politècnica de València, 46022 Valencia, Spain

Received 30 June 2011; Accepted 18 October 2011

Academic Editor: Nicola Guglielmi

Copyright © 2012 Jose Manuel Gimenez-Guzman et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. P. Tran-Gia and M. Mandjes, “Modeling of customer retrial phenomenon in cellular mobile networks,” IEEE Journal on Selected Areas in Communications, vol. 15, no. 8, pp. 1406–1414, 1997. View at Publisher · View at Google Scholar · View at Scopus
  2. J. M. Gimenez-Guzman, M. J. Domenech-Benlloch, J. Martinez-Bauset, V. Pla, and V. Casares-Giner, “Analysis of a handover procedure with queueing, retrials and impatient customers,” in Proceedings of the 3rd International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks (HET-NETs '05), 2005. View at Publisher · View at Google Scholar
  3. J. M. Gimenez-Guzman, M. J. Domenech-Benlloch, V. Pla, V. Casares-Giner, and J. Martinez-Bauset, “Guaranteeing seamless mobility with user redials and automatic handover retrials,” Journal of Universal Computer Science, vol. 14, no. 10, pp. 1597–1624, 2008. View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  4. J. R. Artalejo, “Accessible bibliography on retrial queues: progress in 2000–2009,” Mathematical and Computer Modelling, vol. 51, no. 9-10, pp. 1071–1081, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  5. M. F. Neuts, Matrix-Geometric Solutions in Stochastic Models: an Algorithmic Approach, vol. 2 of Johns Hopkins Series in the Mathematical Sciences, Johns Hopkins University Press, Baltimore, Md, USA, 1981.
  6. J. R. Artalejo and M. Pozo, “Numerical calculation of the stationary distribution of the main multiserver retrial queue,” Annals of Operations Research, vol. 116, no. 1–4, pp. 41–56, 2002. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  7. M. A. Marsan, G. De Carolis, E. Leonardi, R. Lo Cigno, and M. Meo, “Efficient estimation of call blocking probabilities in cellular mobile telephony networks with customer retrials,” IEEE Journal on Selected Areas in Communications, vol. 19, no. 2, pp. 332–346, 2001. View at Publisher · View at Google Scholar · View at Scopus
  8. M. J. Doménech-Benlloch, J. M. Giménez-Guzmán, J. Martínez-Bauset, and V. Casares-Giner, “Efficient and accurate methodology for solving multiserver retrial systems,” Electronics Letters, vol. 41, no. 17, pp. 967–969, 2005. View at Publisher · View at Google Scholar
  9. M. J. Domenech-Benlloch, J. M. Gimenez-Guzman, V. Pla, J. Martinez-Bauset, and V. Casares-Giner, “Generalized truncated methods for an efficient solution of retrial systems,” Mathematical Problems in Engineering, vol. 2008, Article ID 183089, 15 pages, 2008. View at Google Scholar · View at Zentralblatt MATH
  10. G. I. Falin, “Calculation of probability characteristics of a multiline system with repeat calls,” Moscow University Computational Mathematics and Cybernetics, no. 1, pp. 43–49, 1983. View at Google Scholar · View at Scopus
  11. M. F. Neuts and B. M. Rao, “Numerical investigation of a multiserver retrial model,” Queueing Systems, vol. 7, no. 2, pp. 169–190, 1990. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at Scopus
  12. J. Leino, A. Penttinen, and J. Virtamo, “Flow level performance analysis of wireless data networks: a case study,” in Proceedings of the IEEE International Conference on Communications, (ICC '06), vol. 3, pp. 961–966, July 2006. View at Publisher · View at Google Scholar · View at Scopus
  13. J. Leino and J. Virtamo, “An approximative method for calculating performance measures of markov processes,” in Proceedings of the 1st International Conference on Performance Evaluation methodolgies and tools, Pisa, Italy, 2006.
  14. J. Leino and J. Virtamo, “Determining the moments of queue-length distribution of discriminatory processor-sharing systems with phase-type service requirements,” in Proceedings of the 3rd EuroNGI Conference on Next Generation Internet Networks, pp. 205–208, Trondheim, Norway, 2007. View at Publisher · View at Google Scholar
  15. R. A. Howard, Dynamic Programming and Markov Processes, The Technology Press of MIT, Cambridge, Mass, USA, 1960.
  16. D. P. Gaver, P. A. Jacobs, and G. Latouche, “Finite birth-and-death models in randomly changing environments,” Advances in Applied Probability, vol. 16, no. 4, pp. 715–731, 1984. View at Publisher · View at Google Scholar · View at Zentralblatt MATH