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
![]()
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[...]![]()
texto impreso
This paper deals with the distribution of the maximum queue length in two-dimensional Markov models. In this framework, two typical assumptions are: (1) the stationary regime, and (2) the system homogeneity (i.e., homogeneity of the underlying i[...]![]()
texto impreso
Queueing models including the effects of repeated attempts have wide practical use in designing communication systems. The model studied in this paper not only takes into account retrials due to congestion but also considers the effects of balki[...]![]()
texto impreso
Many of the Currently used cellular networks have been constructed on the premise trial me retrial phenomenon is negligible and the operating environment is static. However. a proper modeling of the mobile cellular network cannot ignore the exis[...]![]()
texto impreso
New developments in mobile communication technology lead to substantial increases in the retrial phenomenon and its effect on the quality of service (QoS). One aspect of this problem is considered in this paper, where we investigate the distribu[...]![]()
texto impreso
We consider a multi-server retrial queueing model in which arrivals occur according to a Markovian arrival process. Using continuous-time Markov chain with absorbing states, we determine the distribution of the maximum number of customers in a r[...]![]()
texto impreso
This paper analyses adiscrete-timeGeo/G/1retrialqueue with batch arrivals in which individual arriving customers have acontrol of admission. We study the underlying Markov chain at the epochs immediately after the slot boundaries making emphasis[...]![]()
texto impreso
![]()
texto impreso
In this paper, information theoretic methodology for system modeling is applied to investigate the probability density function of the busy period in M/G/1 vacation models operating under the N-, T- and D-policies. The information about the dens[...]![]()
texto impreso
Artalejo, Jesús R. ; Economou, A. ; Lopez-Herrero, M. J. | Amer Inst Mathematical Sciences | 2007-11Populations are often subject to the effect of catastrophic events that cause mass removal. In particular, metapopulation models, epidemics, and migratory flows provide practical examples of populations subject to disasters (e.g., habitat destru[...]![]()
texto impreso
In this paper we study the M/H2/1 queue with returning customers. We obtain explicit formulae for the steady-state distribution and the expected quality characteristics of the system. In addition, a simple recursion scheme for computing the 'orb[...]