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.
In this paper, an approach to the one sided maximal function in the spirit of the Christ-Fefferman proof for the strong type weighted estimates of the maximal function is provided. As applications of that approach, we provide an alternative proof of the sharp weighted estimate for the one sided maximal function that was settled by one of us and de la Torre, a one sided two weight bumps counterpart of a result of Pérez and Rela, and also one sided counterparts of some very recent mixed weak type results due to Sweeting.