- -

Efficient Method to Approximately Solve Retrial Systems with Impatience

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Efficient Method to Approximately Solve Retrial Systems with Impatience

Show full item record

Giménez Guzmán, JM.; Doménech Benlloch, MJ.; Pla, V.; Martínez Bauset, J.; Casares Giner, V. (2012). Efficient Method to Approximately Solve Retrial Systems with Impatience. Journal of Applied Mathematics. 2012(1):1-18. https://doi.org/10.1155/2012/186761

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/56624

Files in this item

Item Metadata

Title: Efficient Method to Approximately Solve Retrial Systems with Impatience
Author: Giménez Guzmán, José Manuel Doménech Benlloch, María José Pla, Vicent Martínez Bauset, Jorge Casares Giner, Vicente
UPV Unit: Universitat Politècnica de València. Departamento de Comunicaciones - Departament de Comunicacions
Issued date:
Abstract:
We present a novel technique to solve multiserver retrial systems with impatience. Unfortunately these systems do not present an exact analytic solution, so it is mandatory to resort to approximate techniques. This novel ...[+]
Subjects: Networks
Copyrigths: Reconocimiento (by)
Source:
Journal of Applied Mathematics. (issn: 1110-757X ) (eissn: 1687-0042 )
DOI: 10.1155/2012/186761
Publisher:
Hindawi Publishing Corporation
Publisher version: http://dx.doi.org/10.1155/2012/186761
Project ID:
info:eu-repo/grantAgreement/MICINN//TIN2010-21378-C02-02/ES/COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEAS/
info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-02/ES/ADMISSION CONTROL IN MOBILE NETWORKS WITH RATE-ADAPTIVE STREAMS AND HIERARCHICAL ARCHITECTURE/
info:eu-repo/grantAgreement/CAM//S2009%2FTIC-1468/ES/Integración de servicios multimedia de siguiente generación en la internet del futuro/
Thanks:
This work has been supported by the Spanish government under Projects TIN2010-21378-C02-02 and TIN2008-06739-C04-02/TSI and by Comunidad de Madrid through Project S-2009/TIC-1468.
Type: Artículo

References

Tran-Gia, P., & Mandjes, M. (1997). Modeling of customer retrial phenomenon in cellular mobile networks. IEEE Journal on Selected Areas in Communications, 15(8), 1406-1414. doi:10.1109/49.634781

Artalejo, J. R. (2010). Accessible bibliography on retrial queues: Progress in 2000–2009. Mathematical and Computer Modelling, 51(9-10), 1071-1081. doi:10.1016/j.mcm.2009.12.011

Artalejo, J. R., & Pozo, M. (2002). Annals of Operations Research, 116(1/4), 41-56. doi:10.1023/a:1021359709489 [+]
Tran-Gia, P., & Mandjes, M. (1997). Modeling of customer retrial phenomenon in cellular mobile networks. IEEE Journal on Selected Areas in Communications, 15(8), 1406-1414. doi:10.1109/49.634781

Artalejo, J. R. (2010). Accessible bibliography on retrial queues: Progress in 2000–2009. Mathematical and Computer Modelling, 51(9-10), 1071-1081. doi:10.1016/j.mcm.2009.12.011

Artalejo, J. R., & Pozo, M. (2002). Annals of Operations Research, 116(1/4), 41-56. doi:10.1023/a:1021359709489

Marsan, M. A., de Carolis, G., Leonardi, E., Lo Cigno, R., & Meo, M. (2001). 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. doi:10.1109/49.914511

Doménech-Benlloch, M. J., Giménez-Guzmán, J. M., Martínez-Bauset, J., & Casares-Giner, V. (2005). Efficient and accurate methodology for solving multiserver retrial systems. Electronics Letters, 41(17), 967. doi:10.1049/el:20051982

Neuts, M. F., & Rao, B. M. (1990). Numerical investigation of a multiserver retrial model. Queueing Systems, 7(2), 169-189. doi:10.1007/bf01158473

Gaver, D. P., Jacobs, P. A., & Latouche, G. (1984). Finite birth-and-death models in randomly changing environments. Advances in Applied Probability, 16(4), 715-731. doi:10.2307/1427338

[-]

recommendations

 

This item appears in the following Collection(s)

Show full item record