scholarly journals An M/M/2 Queueing System with Heterogeneous Servers Including One with Working Vacation

2012 ◽  
Vol 2012 ◽  
pp. 1-16 ◽  
Author(s):  
A. Krishnamoorthy ◽  
C. Sreenivasan
Keyword(s):  
Queueing System ◽  
Stationary Regime ◽  
The Other ◽  
Stochastic Decomposition ◽  
Heterogeneous Servers ◽  
Working Vacation ◽  
Matrix Geometric Method ◽  
Mean Waiting Time ◽  
Stationary Queue Length ◽  
Conditional Stochastic Decomposition

This paper analyzes an M/M/2 queueing system with two heterogeneous servers, one of which is always available but the other goes on vacation in the absence of customers waiting for service. The vacationing server, however, returns to serve at a low rate as an arrival finds the other server busy. The system is analyzed in the steady state using matrix geometric method. Busy period of the system is analyzed and mean waiting time in the stationary regime computed. Conditional stochastic decomposition of stationary queue length is obtained. An illustrative example is also provided.

scholarly journals An M/M/1 Queue with Working Vacation and Vacation Interruption Under Bernoulli Schedule

2018 ◽  
Vol 7 (4.10) ◽  
pp. 448
Author(s):  
P. Manoharan ◽  
A. Ashok
Keyword(s):  
Geometric Approach ◽  
Stochastic Decomposition ◽  
Working Vacation ◽  
System Parameters ◽  
Mean Waiting Time ◽  
The Mean ◽  
Vacation Interruption ◽  
Mean Queue Length ◽  
Vacation Period ◽  
Bernoulli Schedule

This work deals with M/M/1 queue with Vacation and Vacation Interruption Under Bernoulli schedule. When there are no customers in the system, the server takes a classical vacation with probability p or a working vacation with probability 1-p, where . At the instants of service completion during the working vacation, either the server is supposed to interrupt the vacation and returns back to the non-vacation period with probability 1-q or the sever will carry on with the vacation with probability q. When the system is non empty after the end of vacation period, a new non vacation period begins. A matrix geometric approach is employed to obtain the stationary distribution for the mean queue length and the mean waiting time and their stochastic decomposition structures. Numerous graphical demonstrations are presented to show the effects of the system parameters on the performance measures.  

scholarly journals M/M/1 Retrial Queue with Working Vacation Interruption and Feedback under N-Policy

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Li Tao ◽  
Liyuan Zhang ◽  
Shan Gao
Keyword(s):  
Retrial Queue ◽  
Stochastic Decomposition ◽  
Service Rate ◽  
Working Vacation ◽  
Stationary Probability Distribution ◽  
The Matrix ◽  
Vacation Interruption ◽  
Necessary And Sufficient ◽  
Vacation Period ◽  
Conditional Stochastic Decomposition

We consider an M/M/1 retrial queue with working vacations, vacation interruption, Bernoulli feedback, and N-policy simultaneously. During the working vacation period, customers can be served at a lower rate. Using the matrix-analytic method, we get the necessary and sufficient condition for the system to be stable. Furthermore, the stationary probability distribution and some performance measures are also derived. Moreover, we prove the conditional stochastic decomposition for the queue length in the orbit. Finally, we present some numerical examples and use the parabolic method to search the optimum value of service rate in working vacation period.

AN M/G/1 RETRIAL QUEUE WITH GENERAL RETRIAL TIMES, WORKING VACATIONS AND VACATION INTERRUPTION

2014 ◽  
Vol 31 (02) ◽  
pp. 1440006 ◽  
Author(s):  
SHAN GAO ◽  
JINTING WANG ◽  
WEI WAYNE LI
Keyword(s):  
Retrial Queue ◽  
Stochastic Decomposition ◽  
Supplementary Variable ◽  
Waiting Time Distribution ◽  
Working Vacation ◽  
Stationary Probability Distribution ◽  
Working Vacations ◽  
Vacation Interruption ◽  
Vacation Period ◽  
Conditional Stochastic Decomposition

We consider an M/G/1 retrial queue with general retrial times, and introduce working vacations and vacation interruption policy into the retrial queue. During the working vacation period, customers can be served at a lower rate. If there are customers in the system at a service completion instant, the vacation will be interrupted and the server will come back to the normal working level. Using supplementary variable method, we obtain the stationary probability distribution and some performance measures. Furthermore, we carry out the waiting time distribution and prove the conditional stochastic decomposition for the queue length in orbit. Finally, some numerical examples are presented.

scholarly journals The Evaluation of M/M/2 Queuing Framework with Two Heterogeneous Servers for Balking and Reneged Customers

2019 ◽  
Vol 9 (1) ◽  
pp. 5402-5408
Keyword(s):  
Quantitative Method ◽  
The Other ◽  
Scientific Models ◽  
Model Parameters ◽  
Heterogeneous Servers ◽  
Working Vacation ◽  
Clump Size ◽  
The Impact ◽  
Vacation Period ◽  
Low Rate

Queuing hypothesis is a quantitative method which comprises in building scientific models of different sorts of lining frameworks. Occupied time of the framework is broke down and mean holding up time in the stationary system processed. At long last, some numerical outcomes are introduced to demonstrate the impact of model parameters on the framework execution measures. The traveling server, nonetheless, comes back to landing which is used to offer at a low rate whereas the other server is occupied. At whatever point the framework ends up and the subsequent server leaves for a working excursion while the principal server stays inert in the framework. These models can be utilized for making expectations about how the framework can change with requests. The framework is examined in the enduring state utilizing lattice geometric strategy. The clients enter the line in the Poisson manner and the time of each bunch size is dared to be circulated exponentially as for mean ward clump size and clients may balk away or renege when the holding up the line of the clients, in general, be exceptionally enormous. This work exhibits the investigation of a recharging input different working excursions line with balking, reneging and heterogeneous servers. Queuing hypothesis manages the investigation of lines and lining conduct. Different execution proportions of the model, for example, anticipated framework length, anticipated balking rate and reneging rate have been talked about. The technique breaks down an M/M/2 lining framework with two heterogeneous servers, one of which is constantly accessible however the different travels without clients sitting tight for service. During a working vacation period, the subsequent server gives administration at a slower rate as opposed to totally ceasing service. The relentless state probabilities of the model are advantageous and recursive strategies.

scholarly journals Impatient customers in Markovian queue with Bernoulli feedback and waiting server under variant working vacation policy

2020 ◽  
Vol 30 (4) ◽  
Author(s):  
Amina Angelika Bouchentouf ◽  
Lahcene Yahiaoui ◽  
Mokhtar Kadi ◽  
Shakir Majid
Keyword(s):  
Queueing System ◽  
Cost Model ◽  
Probability Generating Function ◽  
Steady State Solution ◽  
Stochastic Decomposition ◽  
Single Server ◽  
Working Vacation ◽  
Bernoulli Feedback ◽  
Markovian Queue ◽  
Retention Of Reneged Customers

This paper deals with customers’ impatience behaviour for single server Markovian queueing system under K-variant working vacation policy, waiting server, Bernoulli feedback, balking, reneging, and retention of reneged customers. Using probability generating function (PGF) technique, we obtain the steady-state solution of the system. In addition, we prove the stochastic decomposition properties. Useful performance measures of the considered queueing system are derived. A cost model is developed. Then, the parameter optimisation is carried out numerically, using quadratic fit search method (QFSM). Finally, numerical examples are provided in order to visualize the analytical results.

scholarly journals Analysis of MAP/PH(1), PH(2)/2 Queue with Bernoulli Vacations

2008 ◽  
Vol 2008 ◽  
pp. 1-20 ◽  
Author(s):  
B. Krishna Kumar ◽  
R. Rukmani ◽  
V. Thangaraj
Keyword(s):  
Waiting Time ◽  
Time Distribution ◽  
Queueing System ◽  
Arrival Process ◽  
Waiting Time Distribution ◽  
Steady State Probability ◽  
Matrix Geometric Method ◽  
Mean Waiting Time ◽  
The Mean ◽  
Number Of Customers

We consider a two-heterogeneous-server queueing system with Bernoulli vacation in which customers arrive according to a Markovian arrival process (MAP). Servers returning from vacation immediately take another vacation if no customer is waiting. Using matrix-geometric method, the steady-state probability of the number of customers in the system is investigated. Some important performance measures are obtained. The waiting time distribution and the mean waiting time are also discussed. Finally, some numerical illustrations are provided.

scholarly journals On the Discrete-TimeGeoX/G/1Queues underN-Policy with Single and Multiple Vacations

2013 ◽  
Vol 2013 ◽  
pp. 1-6 ◽  
Author(s):  
Sung J. Kim ◽  
Nam K. Kim ◽  
Hyun-Min Park ◽  
Kyung Chul Chae ◽  
Dae-Eun Lim
Keyword(s):  
Queue Length ◽  
Queueing System ◽  
Threshold Value ◽  
Stochastic Decomposition ◽  
Idle Period ◽  
Multiple Vacations ◽  
Vacation Models ◽  
Single Vacation ◽  
Special Cases ◽  
Stationary Queue Length

We consider the discrete-timeGeoX/G/1queue underN-policy with single and multiple vacations. In this queueing system, the server takes multiple vacations and a single vacation whenever the system becomes empty and begins to serve customers only if the queue length is at least a predetermined threshold valueN. Using the well-known property of stochastic decomposition, we derive the stationary queue-length distributions for both vacation models in a simple and unified manner. In addition, we derive their busy as well as idle-period distributions. Some classical vacation models are considered as special cases.

scholarly journals A queueing model for error control of partial buffer sharing in ATM

1999 ◽  
Vol 5 (4) ◽  
pp. 329-348
Author(s):  
Boo Yong Ahn ◽  
Ho Woo Lee
Keyword(s):  
Error Control ◽  
Approximation Scheme ◽  
Queueing System ◽  
Recursive Method ◽  
Loss Probabilities ◽  
Mean Waiting Time ◽  
System Equations ◽  
The Mean ◽  
Buffer Sharing

We model the error control of the partial buffer sharing of ATM by a queueing systemM1,M2/G/1/K+1with threshold and instantaneous Bernoulli feedback. We first derive the system equations and develop a recursive method to compute the loss probabilities at an arbitrary time epoch. We then build an approximation scheme to compute the mean waiting time of each class of cells. An algorithm is developed for finding the optimal threshold and queue capacity for a given quality of service.

scholarly journals Sojourn Times in A Queueing System with Breakdowns and General Retrial Times

Mathematics ◽  
2021 ◽  
Vol 9 (22) ◽  
pp. 2882
Author(s):  
Ivan Atencia ◽  
José Luis Galán-García
Keyword(s):  
Steady State ◽  
Discrete Time ◽  
Queueing System ◽  
Retrial Queue ◽  
Stochastic Decomposition ◽  
Discrete Time System ◽  
Main Research ◽  
Extensive Analysis ◽  
Complete Study ◽  
Number Of Customers

This paper centers on a discrete-time retrial queue where the server experiences breakdowns and repairs when arriving customers may opt to follow a discipline of a last-come, first-served (LCFS)-type or to join the orbit. We focused on the extensive analysis of the system, and we obtained the stationary distributions of the number of customers in the orbit and in the system by applying the generation function (GF). We provide the stochastic decomposition law and the application bounds for the proximity between the steady-state distributions for the queueing system under consideration and its corresponding standard system. We developed recursive formulae aimed at the calculation of the steady-state of the orbit and the system. We proved that our discrete-time system approximates M/G/1 with breakdowns and repairs. We analyzed the busy period of an auxiliary system, the objective of which was to study the customer’s delay. The stationary distribution of a customer’s sojourn in the orbit and in the system was the object of a thorough and complete study. Finally, we provide numerical examples that outline the effect of the parameters on several performance characteristics and a conclusions section resuming the main research contributions of the paper.

scholarly journals Decomposition of M/M/1 With Unreliable Service and a Working Vacation

2020 ◽  
Vol 9 (1) ◽  
pp. 63
Author(s):  
Joshua Patterson ◽  
Andrzej Korzeniowski
Keyword(s):  
Closed Form ◽  
Failure Rate ◽  
Waiting Time ◽  
Queue Length ◽  
Service Failure ◽  
Working Vacation ◽  
Stationary Queue Length ◽  
Stationary Waiting Time ◽  
Relationship Of ◽  
The Relationship

We use the stationary distribution for the M/M/1 with Unreliable Service and aWorking Vacation (M/M/1/US/WV) given explicitly in (Patterson & Korzeniowski, 2019) to find a decomposition of the stationary queue length N. By applying the distributional form of Little's Law the Laplace-tieltjes Transform of the stationary customer waiting time W is derived. The closed form of the expected value and variance for both N and W is found and the relationship of the expected stationary waiting time as a function of the service failure rate is determined.

Sign in / Sign up

Export Citation Format

Share Document