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 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.

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 Finite Buffer GI/M(n)/1 Queue with Bernoulli-Schedule Vacation Interruption under N-Policy

2014 ◽  
Vol 2014 ◽  
pp. 1-8
Author(s):  
P. Vijaya Laxmi ◽  
V. Suchitra
Keyword(s):  
Performance Measures ◽  
Finite Buffer ◽  
Supplementary Variable ◽  
Working Vacation ◽  
Variable Technique ◽  
Special Cases ◽  
Vacation Interruption ◽  
System Length ◽  
Vacation Period ◽  
Bernoulli Schedule

We study a finite buffer N-policy GI/M(n)/1 queue with Bernoulli-schedule vacation interruption. The server works with a slower rate during vacation period. At a service completion epoch during working vacation, if there are at least N customers present in the queue, the server interrupts vacation and otherwise continues the vacation. Using the supplementary variable technique and recursive method, we obtain the steady state system length distributions at prearrival and arbitrary epochs. Some special cases of the model, various performance measures, and cost analysis are discussed. Finally, parameter effect on the performance measures of the model is presented through numerical computations.

DISCRETE-TIME GIX/GEO/1/N QUEUE WITH WORKING VACATIONS AND VACATION INTERRUPTION

2014 ◽  
Vol 31 (01) ◽  
pp. 1450003 ◽  
Author(s):  
SHAN GAO ◽  
ZAIMING LIU ◽  
QIWEN DU
Keyword(s):  
Discrete Time ◽  
Finite Buffer ◽  
Waiting Time Distribution ◽  
Service Period ◽  
Imbedded Markov Chain ◽  
Working Vacations ◽  
Vacation Interruption ◽  
Service Times ◽  
System Length ◽  
Vacation Period

In this paper, we study a discrete-time finite buffer batch arrival queue with multiple geometric working vacations and vacation interruption: the server serves the customers at the lower rate rather than completely stopping during the vacation period and can come back to the normal working level once there are customers after a service completion during the vacation period, i.e., a vacation interruption happens. The service times during a service period, service times during a vacation period and vacation times are geometrically distributed. The queue is analyzed using the supplementary variable and the imbedded Markov-chain techniques. We obtain steady-state system length distributions at pre-arrival, arbitrary and outside observer's observation epochs. We also present probability generation function (p.g.f.) of actual waiting-time distribution in the system and some performance measures.

scholarly journals Performance of an M/M/1 Retrial Queue with Working Vacation Interruption and Classical Retrial Policy

2016 ◽  
Vol 2016 ◽  
pp. 1-9 ◽  
Author(s):  
Tao Li ◽  
Liyuan Zhang ◽  
Shan Gao
Keyword(s):  
Generating Functions ◽  
System Performance ◽  
Cost Optimization ◽  
Retrial Queue ◽  
Stable Condition ◽  
Working Vacation ◽  
Optimization Analysis ◽  
Vacation Interruption ◽  
Number Of Customers ◽  
Vacation Period

An M/M/1 retrial queue with working vacation interruption is considered. Upon the arrival of a customer, if the server is busy, it would join the orbit of infinite size. The customers in the orbit will try for service one by one when the server is idle under the classical retrial policy with retrial ratenα, wherenis the size of the orbit. During a working vacation period, if there are customers in the system at a service completion instant, the vacation will be interrupted. Under the stable condition, the probability generating functions of the number of customers in the orbit are obtained. Various system performance measures are also developed. Finally, some numerical examples and cost optimization analysis are presented.

scholarly journals Analysis of Impatient Customers in Queues with Bernoulli Schedule Working Vacations and Vacation Interruption

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Veena Goswami
Keyword(s):  
Performance Measures ◽  
System Size ◽  
Stochastic Decomposition ◽  
Model Parameters ◽  
The Mean ◽  
Working Vacations ◽  
Vacation Interruption ◽  
The Impact ◽  
Vacation Period ◽  
Bernoulli Schedule

This paper analyzes customers’ impatience in Markovian queueing system with multiple working vacations and Bernoulli schedule vacation interruption, where customers’ impatience is due to the servers’ vacation. During the working vacation period, if there are customers in the queue, the vacation can be interrupted at a service completion instant and the server begins a regular busy period with probability 1-q or continues the vacation with probability q. We obtain the probability generating functions of the stationary state probabilities and deduce the explicit expressions of the system sizes when the server is in a normal service period and in a Bernoulli schedule vacation interruption, respectively. Various performance measures such as the mean system size, the proportion of customers served, the rate of abandonment due to impatience, and the mean sojourn time of a customer served are derived. We obtain the stochastic decomposition structures of the queue length and waiting time. Finally, some numerical results to show the impact of model parameters on performance measures of the system are presented.

scholarly journals Semigroup Methods for the M/G/1 Queueing Model with Working Vacation and Vacation Interruption

2016 ◽  
Vol 8 (5) ◽  
pp. 56 ◽  
Author(s):  
Ehmet Kasim
Keyword(s):  
Semigroup Theory ◽  
Steady State Solution ◽  
Linear Operators ◽  
Time Dependent ◽  
Queueing Model ◽  
Working Vacation ◽  
Positive Time ◽  
Vacation Interruption ◽  
Vacation Period ◽  
Time Dependent Solution

By using the strong continuous semigroup theory of linear operators we prove that the M/G/1 queueing model with working vacation and vacation interruption has a unique positive time dependent solution which satisfies probability conditions. When the both service completion rate in a working vacation period and in a regular busy period are constant, by investigating the spectral properties of an operator corresponding to the model we obtain that the time-dependent solution of the model strongly converges to its steady-state solution.

scholarly journals Performance Characteristics of Discrete-Time Queue With Variant Working Vacations

2020 ◽  
Vol 11 (2) ◽  
pp. 1-21
Author(s):  
P. Vijaya Laxmi ◽  
Rajesh P.
Keyword(s):  
Discrete Time ◽  
Cost Model ◽  
Probability Generating Function ◽  
System Size ◽  
Service Rate ◽  
Single Server ◽  
Working Vacation ◽  
Optimal Service ◽  
Working Vacations ◽  
Vacation Period

This article analyzes an infinite buffer discrete-time single server queueing system with variant working vacations in which customers arrive according to a geometric process. As soon as the system becomes empty, the server takes working vacations. The server will take a maximum number K of working vacations until either he finds at least on customer in the queue or the server has exhaustively taken all the vacations. The service times during regular busy period, working vacation period and vacation times are assumed to be geometrically distributed. The probability generating function of the steady-state probabilities and the closed form expressions of the system size when the server is in different states have been derived. In addition, some other performance measures, their monotonicity with respect to K and a cost model are presented to determine the optimal service rate during working vacation.

scholarly journals Phase-Type Arrivals and Impatient Customers in Multiserver Queue with Multiple Working Vacations

2016 ◽  
Vol 2016 ◽  
pp. 1-17 ◽  
Author(s):  
Cosmika Goswami ◽  
N. Selvaraju
Keyword(s):  
Blocking Probability ◽  
Death Process ◽  
Impatient Customers ◽  
Working Vacation ◽  
Multiple Working Vacations ◽  
Phase Type ◽  
Working Vacations ◽  
The One ◽  
Vacation Period ◽  
Stationary Probability Vector

We consider a PH/M/c queue with multiple working vacations where the customers waiting in queue for service are impatient. The working vacation policy is the one in which the servers serve at a lower rate during the vacation period rather than completely ceasing the service. Customer’s impatience is due to its arrival during the period where all the servers are in working vacations and the arriving customer has to join the queue. We formulate the system as a nonhomogeneous quasi-birth-death process and use finite truncation method to find the stationary probability vector. Various performance measures like the average number of busy servers in the system during a vacation as well as during a nonvacation period, server availability, blocking probability, and average number of lost customers are given. Numerical examples are provided to illustrate the effects of various parameters and interarrival distributions on system performance.

Sign in / Sign up

Export Citation Format

Share Document