scholarly journals Retrial BMAP/PH/N Queueing System with a Threshold-Dependent Inter-Retrial Time Distribution

Mathematics ◽  
2022 ◽  
Vol 10 (2) ◽  
pp. 269
Author(s):  
Valentina I. Klimenok ◽  
Alexander N. Dudin ◽  
Vladimir M. Vishnevsky ◽  
Olga V. Semenova

In this paper, we study a multi-server queueing system with retrials and an infinite orbit. The arrival of primary customers is described by a batch Markovian arrival process (BMAP), and the service times have a phase-type (PH) distribution. Previously, in the literature, such a system was mainly considered under the strict assumption that the intervals between the repeated attempts from the orbit have an exponential distribution. Only a few publications dealt with retrial queueing systems with non-exponential inter-retrial times. These publications assumed either the rate of retrials is constant regardless of the number of customers in the orbit or this rate is constant when the number of orbital customers exceeds a certain threshold. Such assumptions essentially simplify the mathematical analysis of the system, but do not reflect the nature of the majority of real-life retrial processes. The main feature of the model under study is that we considered the classical retrial strategy under which the retrial rate is proportional to the number of orbital customers. However, in this case, the assumption of the non-exponential distribution of inter-retrial times leads to insurmountable computational difficulties. To overcome these difficulties, we supposed that inter-retrial times have a phase-type distribution if the number of customers in the orbit is less than or equal to some non-negative integer (threshold) and have an exponential distribution in the contrary case. By appropriately choosing the threshold, one can obtain a sufficiently accurate approximation of the system with a PH distribution of the inter-retrial times. Thus, the model under study takes into account the realistic nature of the retrial process and, at the same time, does not resort to restrictions such as a constant retrial rate or to rough truncation methods often applied to the analysis of retrial queueing systems with an infinite orbit. We describe the behavior of the system by a multi-dimensional Markov chain, derive the stability condition, and calculate the steady-state distribution and the main performance indicators of the system. We made sure numerically that there was a reasonable value of the threshold under which our model can be served as a good approximation of the BMAP/PH/N queueing system with the PH distribution of inter-retrial times. We also numerically compared the system under consideration with the corresponding queueing system having exponentially distributed inter-retrial times and saw that the latter is a poor approximation of the system with the PH distribution of inter-retrial times. We present a number of illustrative numerical examples to analyze the behavior of the system performance indicators depending on the system parameters, the variance of inter-retrial times, and the correlation in the input flow.

1995 ◽  
Vol 8 (2) ◽  
pp. 151-176 ◽  
Author(s):  
Attahiru Sule Alfa ◽  
K. Laurie Dolhun ◽  
S. Chakravarthy

We consider a single-server discrete queueing system in which arrivals occur according to a Markovian arrival process. Service is provided in groups of size no more than M customers. The service times are assumed to follow a discrete phase type distribution, whose representation may depend on the group size. Under a probabilistic service rule, which depends on the number of customers waiting in the queue, this system is studied as a Markov process. This type of queueing system is encountered in the operations of an automatic storage retrieval system. The steady-state probability vector is shown to be of (modified) matrix-geometric type. Efficient algorithmic procedures for the computation of the rate matrix, steady-state probability vector, and some important system performance measures are developed. The steady-state waiting time distribution is derived explicitly. Some numerical examples are presented.


2018 ◽  
Vol 7 (4.10) ◽  
pp. 758
Author(s):  
P. Rajadurai ◽  
R. Santhoshi ◽  
G. Pavithra ◽  
S. Usharani ◽  
S. B. Shylaja

A multi phase retrial queue with optional re-service and multiple working vacations is considered. The Probability Generating Function (PGF) of number of customers in the system is obtained by supplementary variable technique. Various system performance measures are discussed. 


2016 ◽  
Vol 53 (4) ◽  
pp. 1098-1110 ◽  
Author(s):  
Tuǧrul Dayar ◽  
M. Can Orhan

Abstract A multiclass c-server retrial queueing system in which customers arrive according to a class-dependent Markovian arrival process (MAP) is considered. Service and retrial times follow class-dependent phase-type (PH) distributions with the further assumption that PH distributions of retrial times are acyclic. A necessary and sufficient condition for ergodicity is obtained from criteria based on drifts. The infinite state space of the model is truncated with an appropriately chosen Lyapunov function. The truncated model is described as a multidimensional Markov chain, and a Kronecker representation of its generator matrix is numerically analyzed.


2007 ◽  
Vol 48 (3) ◽  
pp. 297-314
Author(s):  
Vyacheslav M. Abramov

AbstractThe interest in retrial queueing systems mainly lies in their application to telephone systems. This paper studies multiserver retrial queueing systems withnservers. The arrival process is a quite general point process. An arriving customer occupies one of the free servers. If upon arrival all servers are busy, then the customer waits for his service in orbit, and after a random time retries in order to occupy a server. The orbit has one waiting space only, and an arriving customer, who finds all servers busy and the waiting space occupied, is lost from the system. Time intervals between possible retrials are assumed to have arbitrary distribution (the retrial scheme is explained more precisely in the paper). The paper provides analysis of this system. Specifically the paper studies the optimal number of servers to decrease the loss proportion to a given value. The representation obtained for the loss proportion enables us to solve the problem numerically. The algorithm for numerical solution includes effective simulation, which meets the challenge of a rare events problem in simulation.


1990 ◽  
Vol 22 (03) ◽  
pp. 764-767 ◽  
Author(s):  
Ludolf E. Meester ◽  
J. George Shanthikumar

We consider a tandem queueing system with m stages and finite intermediate buffer storage spaces. Each stage has a single server and the service times are independent and exponentially distributed. There is an unlimited supply of customers in front of the first stage. For this system we show that the number of customers departing from each of the m stages during the time interval [0, t] for any t ≧ 0 is strongly stochastically increasing and concave in the buffer storage capacities. Consequently the throughput of this tandem queueing system is an increasing and concave function of the buffer storage capacities. We establish this result using a sample path recursion for the departure processes from the m stages of the tandem queueing system, that may be of independent interest. The concavity of the throughput is used along with the reversibility property of tandem queues to obtain the optimal buffer space allocation that maximizes the throughput for a three-stage tandem queue.


Sign in / Sign up

Export Citation Format

Share Document