Información del autor
Autor Artalejo, Jesús R. |
Documentos disponibles escritos por este autor (84)
![](./images/expand_all.gif)
![](./images/collapse_all.gif)
![Selecciones disponibles](./images/orderby_az.gif)
![]()
texto impreso
The M/G/1 queue with repeated attempts is considered. A customer who finds the server busy, leaves the service area and joins a pool of unsatisfied customers. Each customer in the pool repeats his demand after a random amount of time until he fi[...]![]()
texto impreso
We consider queuing systems where customers are not allowed to queue, instead of that they make repeated attempts, or retrials, in order to enter service after some time. We obtain the distribution of the number of retrials produced by a tagged [...]![]()
texto impreso
This paper deals with the main retrial queue of M/M/c-type with exponential repeated attempts. We refer to a busy period and present a detailed computational analysis of four new performance measures: (i) the successful retrials, (ii) the blocke[...]![]()
texto impreso
The basic reproduction number, R (0), is probably the most important quantity in epidemiology. It is used to measure the transmission potential during the initial phase of an epidemic. In this paper, we are specifically concerned with the quanti[...]![]()
texto impreso
This paper deals with a Markovian multiserver model, where the simultaneous effect of customerbalking, impatience and retrials is evaluated. The study of systems incorporating these features is motivated by the observation of real service system[...]![]()
texto impreso
This paper deals with the M/G/1queue with D-policy, i.e., the server is turned off at the end of a busy period and turned on when the cumulative amount of work firstly exceeds some fixed value D. We first concentrate on the computation of the st[...]![]()
texto impreso
The basic models of infectious disease dynamics (the SIS and SIR models) are considered. Particular attention is paid to the number of infected individuals that recovered and its relationship with the final epidemic size. We investigate this des[...]![]()
texto impreso
In teletraffic applications of retrial queues only the service zone is observable. Another part of a retrial queue, the orbit, which represents the delay before repeated attempts to get service, cannot be observed. Thus, it is very important to [...]![]()
texto impreso
This paper deals with a single server retrial queueing system subject to active and independent breakdowns. The objective is to extend the results given independently by Aissani [1] and Kulkarni and Choi [15]. To this end, we introduce the conce[...]![]()
texto impreso
We are concerned with the M/G/1 retrial queue with balking. The ergodicity condition is first investigated making use Of classical mean drift criteria. The limiting distribution of the number of customers in the system is determined with the hel[...]![]()
texto impreso
This note provides a unified approach to the distribution of the time to extinction from quasi-stationarity for general Markov chains evolving both in discrete and in continuous time. Our results generalize a number of similar derivations which [...]![]()
texto impreso
Multi-server retrial queues are widely used to model stochastically many telephone systems and computer networks. This paper studies the distribution of the time needed to reach a certain level of congestion, i.e., a given number of customers in[...]![]()
texto impreso
We consider a Markov decision process for an MX/M/1 queue that is controlled by batches of negative customers. More specifically, we derive conditions that imply threshold-type optimal policies, under either the total discounted cost criterion o[...]![]()
texto impreso
Discrete-time multiserver queues have been used for many years to investigate the behavior of communication and computer systems in which time is slotted. In this paper, we consider the discrete-time Geo/Geo/cqueue. We first develop an efficient[...]![]()
texto impreso
Performance Analysis of a Block-Structured Discrete-Time Retrial Queue with State-Dependent Arrivals
In this paper, we introduce a new discrete block state-dependent arrival (D-BSDA) distribution which provides fresh insights leading to a successful generalization of the discrete-time Markovian arrival process (D-MAP). The D-BSDA distribution i[...]