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[...]![]()
texto impreso
This paper deals with a single-server retrial queue with a finite number of sources. Our analysis extends previous work on this topic and includes the analysis of the arriving customer's distribution, the busy period and the waiting time process[...]![]()
texto impreso
G-networks (or queueingnetworks with negative customers, signals, triggers, etc.) are characterized by the following feature: in contrast with the normal positive customers, negative customers arriving to a non-empty queue remove an amount of wo[...]![]()
texto impreso
We consider the stochastic behaviour of a Markovian bivariate process {(C(t), N(t)), t greater than or equal to 0} whose state-space is a semi-strip S = {0, 1} x N. The intensity matrix of the process is taken to get a limit distribution P-ij = [...]![]()
texto impreso
In this paper, information theoretic inference methodology for system modeling is applied to estimate the stationary distribution for the number of customers in single server queueing systems with service capacity utilized by a finite population[...]![]()
texto impreso
In this paper we present information theoretic approximations for theM/G/1 queue with retrials. Various approximations for this model are obtained according to the available information about the service time probability density and the steady-s[...]![]()
texto impreso
![]()
texto impreso
We consider a multiserver queueing system where customers may become impatient and then retry for service after some random time. The study of this queueing model is motivated by the existence of exchange distributed operating systems with a tim[...]![]()
texto impreso
Artalejo, Jesús R. ; Gómez-Corral, Antonio ; Qi-Ming, He | Institut d'Estadística de Catalunya (Idescat) | 2010-07This paper aims to provide a comprehensive review on Markovian arrival processes (MAPs), which constitute a rich class of point processes used extensively in stochastic modelling. Our starting point is the versatile process introduced by Neuts ([...]![]()
texto impreso
We study Markovian queueing systems in which the service rate varies whenever the queue length changes. More specifically we consider controllable queues operating under the so-called hysteretic policy which provides a rather versatile class of [...]![]()
texto impreso
In this paper, we first consider single server retrial queues with two way communication. Ingoing calls arrive at the server according to a Poisson process. Service times of these calls follow an exponential distribution. If the server is idle, [...]![]()
texto impreso
![]()
texto impreso
Mean value analysis is an elegant tool for determining mean performance measures in queueing models. In this paper we show how mean value analysis can be applied to retrial queues. First, we illustrate the technique for the standard M/G/1 retria[...]![]()
texto impreso
The aim of this paper is to contribute to the connection between computer viruses spreading and epidemiological models. To this end, the block-structured state-dependent event (BSDE) approach is used to study the number of cases of infection in [...]![]()
texto impreso
Artalejo, Jesús R. ; Gómez-Corral, Antonio | IEEE-Inst Electrical Electronics Engineers Inc | 2007-12The retrial phenomenon and its significant effect on network performance have been taking into account in the literature (e.g., random access protocols in computer networks, cellular mobile telephony). Most studies assume exponential distributio[...]![]()
texto impreso
This paper deals with a multi-server retrial queueing model in which the number of active servers depends on the number of customers in the system. To this end, the servers are switched on and off according to a multithreshold strategy. For a fi[...]![]()
texto impreso
We consider an M/G/1 retrial queue with finite capacity of the retrial group. We derive the Laplace transform of the busy period using the catastrophe method. This is the key point for the numerical inversion of the density function and the comp[...]![]()
texto impreso
This note considers the N- and D-policies for the M/G/1queue. We concentrate on the true relationship between the optimal N- and D-policies when the cost function is based on the expected number of customers in the system.![]()
texto impreso
This paper deals with a continuous review (s, S) inventory system where arriving demands finding the system out of stock, leave the service area and repeat their request after some random time. This assumption introduces a natural alternative to[...]![]()
texto impreso
We are concerned with the main multiserver retrial queue of M/M/c type with exponential repeated attempts. It is known that an analytical solution of this queueing model is difficult and does not lead to numerical implementation. Based on approp[...]![]()
texto impreso
There is a growing interest in queueing systems with negative arrivals; i.e. where the arrival of a negative customer has the effect of deleting some customer in the queue. Recently, Hanison and Pitel (1996) investigated the queue length distrib[...]![]()
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[...]