scholarly journals Single Server Repairable Queueing System With Variable Service Rate and Failure Rate

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 1233-1239
Author(s):  
Shengli Lv ◽  
Lingmin Zhu
Keyword(s):  
Failure Rate ◽  
Queueing System ◽  
Service Rate ◽  
Single Server ◽  
Repairable Queueing System

scholarly journals A Taylor Series Approach for Service-Coupled Queueing Systems with Intermediate Load

2017 ◽  
Vol 2017 ◽  
pp. 1-10 ◽  
Author(s):  
Ekaterina Evdokimova ◽  
Sabine Wittevrongel ◽  
Dieter Fiems
Keyword(s):  
Performance Measures ◽  
Queueing Systems ◽  
Poisson Processes ◽  
Series Expansions ◽  
Service Rate ◽  
Single Server ◽  
Queueing Model ◽  
State Space Explosion ◽  
Finite Queues ◽  
Service Rates

This paper investigates the performance of a queueing model with multiple finite queues and a single server. Departures from the queues are synchronised or coupled which means that a service completion leads to a departure in every queue and that service is temporarily interrupted whenever any of the queues is empty. We focus on the numerical analysis of this queueing model in a Markovian setting: the arrivals in the different queues constitute Poisson processes and the service times are exponentially distributed. Taking into account the state space explosion problem associated with multidimensional Markov processes, we calculate the terms in the series expansion in the service rate of the stationary distribution of the Markov chain as well as various performance measures when the system is (i) overloaded and (ii) under intermediate load. Our numerical results reveal that, by calculating the series expansions of performance measures around a few service rates, we get accurate estimates of various performance measures once the load is above 40% to 50%.

INFORMATION AND UNCERTAINTY IN A QUEUING SYSTEM

2007 ◽  
Vol 21 (3) ◽  
pp. 361-380 ◽  
Author(s):  
Refael Hassin
Keyword(s):  
Service Quality ◽  
Random Variables ◽  
Random Variable ◽  
Queuing System ◽  
Service Rate ◽  
Single Server ◽  
Profit Function

This article deals with the effect of information and uncertainty on profits in an unobservable single-server queuing system. We consider scenarios in which the service rate, the service quality, or the waiting conditions are random variables that are known to the server but not to the customers. We ask whether the server is motivated to reveal these parameters. We investigate the structure of the profit function and its sensitivity to the variance of the random variable. We consider and compare variations of the model according to whether the server can modify the service price after observing the realization of the random variable.

scholarly journals STABILITY ANALYSIS AND SIMULATION OF N-CLASS RETRIAL SYSTEM WITH CONSTANT RETRIAL RATES AND POISSON INPUTS

2014 ◽  
Vol 31 (02) ◽  
pp. 1440002 ◽  
Author(s):  
K. AVRACHENKOV ◽  
E. MOROZOV ◽  
R. NEKRASOVA ◽  
B. STEYAERT
Keyword(s):  
Queueing System ◽  
Stability Domain ◽  
Single Server ◽  
Retrial Queueing System ◽  
Retrial Queueing ◽  
Single Orbit ◽  
Transmission Control Protocols ◽  
Regenerative Approach ◽  
The Stability ◽  
Multi Access

In this paper, we study a new retrial queueing system with N classes of customers, where a class-i blocked customer joins orbit i. Orbit i works like a single-server queueing system with (exponential) constant retrial time (with rate [Formula: see text]) regardless of the orbit size. Such a system is motivated by multiple telecommunication applications, for instance wireless multi-access systems, and transmission control protocols. First, we present a review of some corresponding recent results related to a single-orbit retrial system. Then, using a regenerative approach, we deduce a set of necessary stability conditions for such a system. We will show that these conditions have a very clear probabilistic interpretation. We also performed a number of simulations to show that the obtained conditions delimit the stability domain with a remarkable accuracy, being in fact the (necessary and sufficient) stability criteria, at the very least for the 2-orbit M/M/1/1-type and M/Pareto/1/1-type retrial systems that we focus on.

The single-server queue with service depending on queue size and with the preemptive-resume last-come–first-served queue discipline

1987 ◽  
Vol 24 (03) ◽  
pp. 758-767
Author(s):  
D. Fakinos
Keyword(s):  
Queueing System ◽  
Limiting Distribution ◽  
Single Server ◽  
Queue Size ◽  
Single Server Queue ◽  
Preemptive Resume ◽  
Server Queue ◽  
Queue Discipline ◽  
Service Times

This paper studies theGI/G/1 queueing system assuming that customers have service times depending on the queue size and also that they are served in accordance with the preemptive-resume last-come–first-served queue discipline. Expressions are given for the limiting distribution of the queue size and the remaining durations of the corresponding services, when the system is considered at arrival epochs, at departure epochs and continuously in time. Also these results are applied to some particular cases of the above queueing system.

scholarly journals Large Deviations for the Single-Server Queue and the Reneging Paradox

2021 ◽  
Author(s):  
Rami Atar ◽  
Amarjit Budhiraja ◽  
Paul Dupuis ◽  
Ruoyu Wu
Keyword(s):  
Large Deviations ◽  
Decay Rate ◽  
Sample Path ◽  
Arrival Rate ◽  
Rate Function ◽  
Service Rate ◽  
Single Server ◽  
Large Deviations Principle ◽  
Long Run ◽  
The Individual

For the M/M/1+M model at the law-of-large-numbers scale, the long-run reneging count per unit time does not depend on the individual (i.e., per customer) reneging rate. This paradoxical statement has a simple proof. Less obvious is a large deviations analogue of this fact, stated as follows: the decay rate of the probability that the long-run reneging count per unit time is atypically large or atypically small does not depend on the individual reneging rate. In this paper, the sample path large deviations principle for the model is proved and the rate function is computed. Next, large time asymptotics for the reneging rate are studied for the case when the arrival rate exceeds the service rate. The key ingredient is a calculus of variations analysis of the variational problem associated with atypical reneging. A characterization of the aforementioned decay rate, given explicitly in terms of the arrival and service rate parameters of the model, is provided yielding a precise mathematical description of this paradoxical behavior.

Sign in / Sign up

Export Citation Format

Share Document