A Discrete-Time Single-Server Retrial Queue with Preemption and Adaptive Retrial Times: Theoretical Analysis and Telecommunication Insights

Loading...
Thumbnail Image

Files

mathematics-13-03361.pdf (294.28 KB)

Description: Versión artículo publicado

Identifiers

Publication date

Reading date

Collaborators

Advisors

Tutors

Editors

Journal Title

Journal ISSN

Volume Title

Publisher

MDPI

Metrics

Google Scholar

Share

Research Projects

Organizational Units

Journal Issue

Department/Institute

Abstract

This paper analyzes a discrete-time single-server retrial queue with preemptive service, Bernoulli arrivals, and adaptive retrial times, tailored to telecommunications systems. In call centers, the model captures caller retries and priority interruptions, while in cellular networks, it represents user channel access attempts with preemption for emergency calls. Using a Markov chain framework, we derive the stationary distribution, establish a stability condition, and compute performance metrics, including the mean number of retrying callers or users and orbit size probabilities. The model incorporates a novel retrial time adaptation probability, reflecting dynamic retry behaviors in telecommunications. Numerical results demonstrate the impact of arrival rates, preemption probabilities, and retrial adaptations on system performance, offering insights for optimizing call center staffing and cellular network protocols. Applications to slotted ALOHA and TDMA systems highlight the model’s practical relevance.

Description

Bibliographic citation

Atencia-Mckillop, I., Galán-García, J. L., Galán-García, M. Á., Padilla-Domínguez, Y., Rodríguez-Cielos, P., & Rodríguez-Padilla, P. (2025). A Discrete-Time Single-Server Retrial Queue with Preemption and Adaptive Retrial Times: Theoretical Analysis and Telecommunication Insights. Mathematics, 13(21), 3361. https://doi.org/10.3390/math13213361

Collections

Endorsement

Review

Supplemented By

Referenced by