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: In this paper , a single server retrial queueing structure along with impatience customers and vacation model is discussed, and the performance measures are identified under the busy state, idle and vacation in order to examine the system and to demonstrate the characteristic of the queueing system.
Abstract: In the present study, we discuss about a single server retrial queueing structure along with impatience customers and vacation model. Especially, arrival of customers follows Poisson process. Exponential distribution of this model enhances the service time and retrial times. In the course of busy period, the customer may leave the system without entering the system. Otherwise the customers may join in the waiting room called orbit, in order to retry for their service. It is based on whether the customer will wait in the orbit till the service is rendered or exit the orbit before experiencing the service. Meanwhile when the system finds to be vacant then the server turns inactive and commences vacation. We established the queue size of the steady state equation of birth and death process by recursive approach. The performance measures are identified under the busy state, idle and vacation in order to examine the system and to demonstrate the characteristic of the queueing system.
01 Jan 2023
TL;DR: In this article , the authors studied a multiserver retrial queuing system with negative calls and found a stationary probability distribution of the number of calls in orbit under the condition of a long delay.
Abstract: The paper studies a multiserver retrial queuing system with negative calls. The arrival processes of “positive” and “negative” calls are Poisson. Positive call’s service time is exponential distributed. Unserved calls go to an orbit, where they wait for random time distributed exponentially. Then they turn up to the service block according to the random multiple access protocol. Disasters are caused by negative calls arrivals. When a negative call comes, it resets all servers. All servicing positive calls leave the system. In the paper, a stationary probability distribution of the number of calls in orbit is found by the method of asymptotic analysis under the condition of a long delay. The results of the numerical analysis are presented.
01 Jan 2022
14 Sep 2020
TL;DR: In this article, the concept of orbital search is introduced as a means for accumulating customers in a bulk service retrial queueing system, where customers enter the service facility from a finite buffer and if the buffer is full at the time of arrival of a customer, it enters an orbit from where retrials for entering the buffer has been made.
Abstract: In this paper, we introduce the concept of orbital search as a means for accumulating customers in a bulk service retrial queueing system. In this model, customers enter the service facility from a finite buffer. If the buffer is full at the time of arrival of a customer, it enters an orbit from where retrials for entering the buffer has been made. Here search is done as a means for accumulating customers in the buffer so that optimum level of bulk service can be provided. A service policy considered here is (a, b) bulk service policy with search. Under this policy, search will be initiated when the number of customers in the buffer reaches a and it has been continued until either the search has been done for a random duration of time or the number of customers in the buffer increases to b where \(a
03 Jan 2021