Topic
Retrial queue
About: Retrial queue is a research topic. Over the lifetime, 784 publications have been published within this topic receiving 12354 citations.
Papers published on a yearly basis
Papers
More filters
TL;DR: It is shown that if the hazard rate function of the retrial time distribution is decreasing, then stochastically longer service time or less servers will result in more customers in the system.
12 citations
01 Jan 2009
TL;DR: In this paper, the steady state behaviour of an M/G/1 retrial queue with nonpersistent customers and two phases of heterogeneous service and different vacation policies is studied.
Abstract: This paper studies the steady state behaviour of an M/G/1 retrial queue with non-persistent customers and two phases of heterogeneous service and different vacation policies. If the primary call, on arrival finds the server busy, it becomes impatient and leaves the system with probability (1- α ) and with probabilityα , it enters into an orbit. The server provides preliminary first essential service (FES) and followed by second essential service (SES) to primary arriving calls or calls from the retrial group. On completion of SES the server may go for i th (i=1,2,3,…,M) type of vacation with
12 citations
TL;DR: The general theory of stochastic orderings is used to investigate the monotonicity properties of the system relative to the strong Stochastic ordering, convex ordering and Laplace ordering and results imply simple insensitive bounds for the stationary distribution of the number of customers in the system and the mean number ofcustomers served during a busy period.
12 citations
24 Jul 2010
TL;DR: The distributions of the successful primary arrivals and retrials during a busy period are studied and the transient behavior of these performance descriptors is investigated.
Abstract: This paper deals with a multiservice retrial queue with finite population, where the input process is characterized by the fact that each idle source generates arrivals independently and with the same exponentially distributed inter-arrival time of rate a. As a consequence of the retrial feature, the flow of repeated attempts is superimposed on the stream of primary arrivals, so both type of events become undistinguished. In this paper some aspects of this problem are considered. The distributions of the successful primary arrivals and retrials during a busy period are studied. Then, the transient behavior of these performance descriptors is investigated.
12 citations
01 May 1998
TL;DR: An algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form is presented and the numerical results suggest that the method is superior to the ordinary finite-truncation method.
Abstract: We present an algorithm to find an approximation for the stationary distribution for the general ergodic spatially-inhomogeneous block-partitioned upper Hessenberg form. Our approximation makes use of an associated upper block-Hessenberg matrix which is spatially homogeneous except for a finite number of blocks. We treat theMAP/G/1 retrial queue and the retrial queue with two types of customer as specific instances and give some numerical examples. The numerical results suggest that our method is superior to the ordinary finite-truncation method.
12 citations