Retrial queue

About: Retrial queue is a research topic. Over the lifetime, 784 publications have been published within this topic receiving 12354 citations.

Single Vacation Policy for Discrete-Time Retrial Queue with Two Types of Customers

Abstract: This analysis is devoted to model retrial queue with, Bernoulli feedback, preferred as well as impatient customers or units in discrete environment. Here, server follows state-dependent policy and may leave for single vacation whenever it is idle. This investigation is motivated by the increasing impact of discrete-time retrial queues in real-world scenarios. For instance, it is widely used in multiplexing of voice data, digital communication (ATMs, BISDN), switching modules and networks, etc. In such types of queueing system, time is a random variable of discrete type, and we calculate it in equally sized data units. We have considered a system with early arrival pattern and studied the Markov’s chain underlying this model. Along with this, the marginal generating function (mgf) for the total units present in the orbit depends on the server state. Few performance measures like average units in the orbit are also calculated by applying probability generating function method. Further, a practical example is numerically illustrated as well as sensitivity analysis is provided.

Evaluation of Unreliable Retrial G-queue Using Fuzzy ARAS Method

Abstract: A Regular busy server crashes due to negative customer traffic, and holiday interruption is being considered. If the orbit empties at the end of a positive customer service, the server worked Going on vacation. A working vacation (WV) server at a low service rate works. If there are clients on the computer at the end of each holiday, the server the probability that a new visitor is inactive and on vacation is p (single WV) or with probability q (multiple WVs). Substantial variable technique, constant state probability for the system and its orbit we found the generating function. System performance measures, reliability measures and random decay law are discussed. Finally, Some numerical examples and cost optimization analysis provided. Alternative: Single-Server Review G- Sequence, Incredible Review G-Series, Volume Visit Review G-Series. Evaluation Preference: Working vacation, Bernoulli feedback, Random vacations, single vacation. Unreliable retrial G-queue, Batch arrival Retrial G-queue, single server iteration is taken as a G-sequence alternative and working vacations, random vacations, single vacation, and Bernoulli vacation is taken evaluation parameters. In this from analysis Fuzzy ARAS method the best solution determines the solution with the shortest distance and the longest distance from the negative-best solution, but comparison of these distances is not considered significant. As a result it seems unreliable retrial G-queue got the first rank where as is the Batch arrival Retrial G-queue is having the lowest rank.

Equilibrium balking strategies in the repairable m/m/1 g-retrial queue with complete removals

Abstract: We consider an M/M/1 retrial queue subject to negative customers (called as G-retrial queue). The arrival of a negative customer forces all positive customers to leave the system and causes the server to fail. At a failure instant, the server is sent to be repaired immediately. Based on a natural reward-cost structure, all arriving positive customers decide whether to join the orbit or balk when they find the server is busy. All positive customers are selfish and want to maximize their own net benefit. Therefore, this system can be modeled as a symmetric noncooperative game among positive customers and the fundamental problem is to identify the Nash equilibrium balking strategy, which is a stable strategy in the sense that if all positive customers agree to follow it no one can benefit by deviating from it, that is, it is a strategy that is the best response against itself. In this paper, by using queueing theory and game theory, the Nash equilibrium mixed strategy in unobservable case and the Nash equilibrium pure strategy in observable case are considered. We also present some numerical examples to demonstrate the effect of the information together with some parameters on the equilibrium behaviors.

Markovian Model of Unreliable Server Retrial Queue with Discouragement

Abstract: In this paper, we present the performance analysis of Markovian retrial queue with unreliable server by incorporating the features of balking and reneging. The customers may abandon the queue at the moment of busy server or at the departure epoch from the orbit zone. When the customers notice the server in busy state, they will join to the orbit zone and wait there to avail the service. After a random period, the customers from the orbit either may try for the re-attempts for the service or may renege from the system without getting the service. Markov model is developed by considering the inter-arrival, retrial and service times governed by the exponential distributions. The probabilities of the system states are determined by implementing recursive approach to solve the governing Chapman–Kolmogorov equations. The cost function is constructed which is further used to find the total expected cost and associated optimal service rate of the system. A numerical illustration is provided to explore the system metrics with respect to various system descriptors.