- -

Efficient Method to Approximately Solve Retrial Systems with Impatience

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

  • Estadisticas de Uso

Efficient Method to Approximately Solve Retrial Systems with Impatience

Show simple item record

Files in this item

dc.contributor.author Giménez Guzmán, José Manuel es_ES
dc.contributor.author Doménech Benlloch, María José es_ES
dc.contributor.author Pla, Vicent es_ES
dc.contributor.author Martínez Bauset, Jorge es_ES
dc.contributor.author Casares Giner, Vicente es_ES
dc.date.accessioned 2015-10-28T09:05:57Z
dc.date.available 2015-10-28T09:05:57Z
dc.date.issued 2012
dc.identifier.issn 1110-757X
dc.identifier.uri http://hdl.handle.net/10251/56624
dc.description.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 technique does not rely on the numerical solution of the steady-state Kolmogorov equations of the Continuous Time Markov Chain as it is common for this kind of systems but it considers the system in its Markov Decision Process setting. This technique, known as value extrapolation, truncates the infinite state space using a polynomial extrapolation method to approach the states outside the truncated state space. A numerical evaluation is carried out to evaluate this technique and to compare its performance with previous techniques. The obtained results show that value extrapolation greatly outperforms the previous approaches appeared in the literature not only in terms of accuracy but also in terms of computational cost. es_ES
dc.description.sponsorship 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. en_EN
dc.language Inglés es_ES
dc.publisher Hindawi Publishing Corporation es_ES
dc.relation.ispartof Journal of Applied Mathematics es_ES
dc.rights Reconocimiento (by) es_ES
dc.subject Networks es_ES
dc.subject.classification INGENIERIA TELEMATICA es_ES
dc.title Efficient Method to Approximately Solve Retrial Systems with Impatience es_ES
dc.type Artículo es_ES
dc.identifier.doi 10.1155/2012/186761
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//TIN2010-21378-C02-02/ES/COOPERACION Y OPORTUNISMO EN REDES DE ACCESO INALAMBRICAS Y HETEROGENEAS/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/MICINN//TIN2008-06739-C04-02/ES/ADMISSION CONTROL IN MOBILE NETWORKS WITH RATE-ADAPTIVE STREAMS AND HIERARCHICAL ARCHITECTURE/ es_ES
dc.relation.projectID info:eu-repo/grantAgreement/CAM//S2009%2FTIC-1468/ES/Integración de servicios multimedia de siguiente generación en la internet del futuro/ es_ES
dc.rights.accessRights Abierto es_ES
dc.contributor.affiliation Universitat Politècnica de València. Departamento de Comunicaciones - Departament de Comunicacions es_ES
dc.description.bibliographicCitation 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 es_ES
dc.description.accrualMethod S es_ES
dc.relation.publisherversion http://dx.doi.org/10.1155/2012/186761 es_ES
dc.description.upvformatpinicio 1 es_ES
dc.description.upvformatpfin 18 es_ES
dc.type.version info:eu-repo/semantics/publishedVersion es_ES
dc.description.volume 2012 es_ES
dc.description.issue 1 es_ES
dc.relation.senia 212916 es_ES
dc.identifier.eissn 1687-0042
dc.contributor.funder Ministerio de Ciencia e Innovación es_ES
dc.contributor.funder Comunidad de Madrid es_ES
dc.description.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 es_ES
dc.description.references 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 es_ES
dc.description.references Artalejo, J. R., & Pozo, M. (2002). Annals of Operations Research, 116(1/4), 41-56. doi:10.1023/a:1021359709489 es_ES
dc.description.references 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 es_ES
dc.description.references 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 es_ES
dc.description.references Neuts, M. F., & Rao, B. M. (1990). Numerical investigation of a multiserver retrial model. Queueing Systems, 7(2), 169-189. doi:10.1007/bf01158473 es_ES
dc.description.references 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 es_ES


This item appears in the following Collection(s)

Show simple item record