Retrial queue

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

Queueing Systems with Customer Abandonments and Retrials

Abstract: Author(s): DENG, SONG | Advisor(s): Chen, Ying-Ju; Shen, Zuo-Jun (Max) | Abstract: In queueing theory, the phenomenon that customers get impatient and renege from the system when the waiting time exceeds their tolerance is called customer abandonments. For those abandoning customers, they may go back to the service system after some time. This is called customer retrials. In the modern design of service systems, the impact of customer abandonments and retrials on the system performance and queueing dynamics has been realized. In this thesis, we aim to characterize the stationary properties for queueing systems with both customer abandonments and retrials. We also apply some of those properties in a revenue management problem for queueing systems with customer abandonments.First, we study a multi-server queueing system with both customer abandonments and retrials. By using RTA (retrials see time average) approximation, we characterize the stationary properties of such a queueing system. We also justify the appropriateness of RTA approximation in this model both theoretically and numerically.Then, we extend the study to incorporate negative customers and unreliable servers. Two different models are considered. One is a multi-server retrial queueing system with both regular customers and negative customers. The other is a single-server retrial queuewith negative customers and server interruptions. Closed-form expressions of some relevant performance measurements for both models are obtained.For the last, we apply some of our findings in queues with abandonments and retrials to a revenue management problem for a queueing system with customer abandonments. By using a mechanism design framework, we identify the optimal price-lead time manus and scheduling policies for different scenarios.

GI/G G/1 Retrial Queues with Time-controlled Vacation Policies

Abstract: A discrete-time GI/G/1 retrial queue with Bernoulli retrials and time-controlled vacation policies is investigated in this paper. By representing the inter-arrival, service and vacation times using a Markov-based approach, we are able to analyze this model as a level-dependent quasi-birth-and-death (LDQBD) process which makes the model algorithmically tractable. Several performance measures such as the stationary probability distribution and the expected number of customers in the orbit have been discussed with two different policies: deterministic time-controlled system and random time-controlled system. To give a comparison with the known vacation policy in the literature, we present the exhaustive vacation policy as a contrast between these policies under the early arrival system (EAS) and the late arrival system with delayed access (LAS-DA). Significant difference between EAS and LAS-DA is illustrated by some numerical examples.

Output Process of Retrial Queue with Two-Way Communication Under Low Rate of Retrials Limit Condition

Abstract: In this paper, we consider retrial queue with MAP input and two-way communication. Upon arriving, an incoming call makes the server busy for an exponentially distributed time if it’s idle at the moment. Otherwise, the incoming call goes to the orbit and repeat its request for service after random delay. In its idle time the server also makes an outgoing calls. We use asymptotic analysis method under low rate of retrials limit condition to derive characteristic function of the number of calls in the output flow of the system

Performance analysis of the pending interest table in the cellular network with reservation and retrials

Abstract: To solve the inefficient use of internet protocol (IP) addresses in the current host-centric internet, the content-centric networking (CCN) replaces the IP address with the content name and the cache memory is used to store data temporarily on each router. One of the key components in CCN is the pending interest table (PIT). When an interest arrives at a CCN node, the node searches the PIT entries for the same request. If no, the node searches the PIT for an idle entry and a request is sent. If there is no idle entry, the request is blocked. If yes, the aggregation mechanism is performed. To prevent the request from becoming out-of-date, the timeout mechanism is adopted. In this work, the authors focus on the performance analysis of PIT in the cellular network with two classes of interests, new and handoff interests. To provide service differentiation, a reservation mechanism is adopted. Furthermore, interests may enter the retrial queue and wait to retry later. First, the authors derived the analytical model for the system considered. Second, the impact of various system parameters on the performance measures is studied. Last but not least, computer simulation is written to verify the accuracy of the analytical results.