Información del autor
Documentos disponibles escritos por este autor (84)
Añadir el resultado a su cesta Hacer una sugerencia Refinar búsqueda
texto impreso
texto impreso
In this work, we present a bibliography on retrial queues which updates the bibliography published in this journal in Artalejo (1999) [7]. The bibliography is focused on the progress made during the last decade 2000–2009. For the sake of complet[...]texto impreso
texto impreso
In this paper, we consider a discrete-time queue of Geo/Geo/c type with geometric repeated attempts. It is known that its continuous counterpart, namely the M/M/c queue with exponential retrials, is analytically intractable due to the spatial he[...]texto impreso
In this paper the distribution of the maximum number of customers in a retrial orbit for a single server queue with Markovian arrival process and phase type services is studied. Efficient algorithm for computing the probability distribution and [...]texto impreso
Two-dimensional continuous-time Markov chains (CTMCs) are useful tools for studying stochastic models such as queueing, inventory, and production systems. Of particular interest in this paper is the distribution of the maximal level visited in a[...]texto impreso
This paper deals with the maximum number of customers in orbit (and in the system) during a busy period for the M/M/c retrial queue. Determining the distribution for the maximum number of customers in orbit is reduced to computation of certain a[...]texto impreso
In this paper we deal with the main multiserver retrialqueue of M/M/c type with exponential repeated attempts. This model is known to be analytically intractable due to the spatial heterogeneity of the underlying Markov chain, caused by the retr[...]texto impreso
We consider an M/G/1 queue with repeated attempts in which the server operates under a general exhaustive service vacation policy. We develop a comprehensive analysis of the system including ergodicity, limiting behaviour, stochastic decompositi[...]texto impreso
This paper deals with a service system in which the processor must serve two types of impatient units. In the case of blocking, the first type units leave the system whereas the second type units enter a pool and wait to be processed later. We d[...]texto impreso
Negative arrivals are used as a control mechanism in many telecommunication and computer networks. In the paper we analyze multiserver retrial queues; i.e., any customer finding all servers busy upon arrival must leave the service area and re-ap[...]texto impreso
This paper deals with the analysis of an M/M/c queueing system with setup times. This queueing model captures the major characteristics of phenomena occurring in production when the system consists in a set of machines monitored by a single oper[...]texto impreso
We consider multiserver retrial queues in which the time between two successive repeated attempts is independent of the number of customers applying for service. We study a Markovian model where each arriving customer finding any free server eit[...]texto impreso
A stochastic clearing system is characterized by the existence of an output mechanism that instantaneously clears the system, i.e. removes all work currently present. In this paper we study the stochastic behavior of a single server clearing que[...]texto impreso
This paper presents an algorithmic analysis of the busy period for the M/M/c queueing system. By setting the busy period equal to the time interval during which at least one server is busy, we develop a first step analysis which gives the Laplac[...]
