Retrial queue

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

Regenerative Analysis of Two-Way Communication Orbit-Queue with General Service Time

Abstract: In this paper, we apply a regenerative approach to reprove some recent steady-state results [1, 8, 9] for an orbit-queue (also known as retrial queue with a constant retrial rate) with outgoing calls. Stability conditions are discussed as well. Moreover, some generalizations of the model are also considered.

A retrial queue with server interruptions, resumption and restart of service

Abstract: This paper analyses a single server retrial queuing model with service interruptions, resumption/restart of interrupted service. The service is assumed to get interrupted according to a Poisson process. The interrupted service is either resumed or restarted according to the realization of two competing independent, non-identically distributed random variables, the realization times of which follow exponential distributions. Arrival of primary customers constitutes a Poisson process. On arrival if a customer finds an idle server, he is immediately taken for service. If the server is busy when a customer arrives, this customer goes to an orbit of infinite capacity from where he makes repeated attempts for service according to a Poisson process with parameter β. After an unsuccessful retrial he rejoins the orbit with probability p and leaves the system without waiting for service with probability q = 1 − p. The service time durations follow PH distribution with representation (α, S) of order m, when there is no interruption. The system is found to be always stable if q > 0. The case q = 0 is also analyzed. Using Matrix analytic method, expressions for important system characteristics such as expected service time, expected number of interruptions are obtained. System performance measures are numerically explored and the effect of service interruptions in a retrial set up is studied.

An m/g/1 retrial queue with second multi-optional service, feedback and unreliable server

Abstract: 有二阶段的服务和反馈的一个 M/G/1 再审队列在这篇论文被学习，在服务者在服务期间服从于开始的失败和故障的地方。Primarycustomers 根据泊松进程得到系统在里面，并且如果服务器在到达之上是可得到的，他们将立即收到服务。否则，他们将进入一条再审轨道并且根据 first-come-first-served (FCFS ) 在轨道被排队纪律。Customersare 允许在特别时间畏缩不前并且背信。所有顾客要求第一种“必要”的服务，而仅仅他们的一些要求第二种“多可选”的服务。再审时间，服务时间和服务者的修理时间都是任意地分布式的，这被假定。为系统稳定性的 Thenecessary 和足够的状况被导出。用一个增补可变方法，一些排队和系统的可靠性措施的不变的解决方案被获得。

Maximum Entropy Analysis of Queueing Network Models

Abstract: The principle of Maximum Entropy (ME) provides a consistent method of inference for estimating the form of an unknown discrete-state probability distribution, based on information expressed in terms of true expected values. In this tutorial paper entropy maximisation is used to characterise product-form approximations and resolution algorithms for arbitrary continuous-time and discrete-time Queueing Network Models (QNMs) at equilibrium under Repetitive-Service (RS) blocking and Arrivals First (AF) or Departures First (DF) buffer management policies. An ME application to the performance modelling of a shared-buffer Asynchronous Transfer Mode (ATM) switch architecture is also presented. The ME solutions are implemented subject to Generalised Exponential (GE) and Generalised Geometric (GGeo) queueing theoretic mean value constraints, as appropriate. In this context, single server GE and GGeo type queues in conjunction with associated effective flow streams (departure, splitting, merging) are used as building blocks in the solution process. Physical interpretations of the results are given and extensions to the quantitative analysis of more complex queueing networks are discussed.