Performance analysis of the discrete-time GI/Geom/1/N queue

1996 ◽  
Vol 33 (1) ◽  
pp. 239-255 ◽  
Author(s):  
M. L. Chaudhry ◽  
U. C. Gupta
Keyword(s):  
Performance Measures ◽  
Discrete Time ◽  
Interarrival Time ◽  
Single Server ◽  
Finite Buffer ◽  
Supplementary Variable ◽  
Time Analysis ◽  
Variable Technique ◽  
Early Arrival ◽  
Finite Buffer Queue

This paper presents an analysis of the single-server discrete-time finite-buffer queue with general interarrival and geometric service time, GI/Geom/1/N. Using the supplementary variable technique, and considering the remaining interarrival time as a supplementary variable, two variations of this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both cases, steady-state distributions for outside observers as well as at random and prearrival epochs have been obtained. The waiting time analysis has also been carried out. Results for the Geom/G/1/N queue with LAS-DA have been obtained from the GI/Geom/1/N queue with EAS. We also give various performance measures. An algorithm for computing state probabilities is given in an appendix.

Performance analysis of the discrete-time GI/Geom/1/N queue

1996 ◽  
Vol 33 (01) ◽  
pp. 239-255 ◽  
Author(s):  
M. L. Chaudhry ◽  
U. C. Gupta
Keyword(s):  
Performance Measures ◽  
Discrete Time ◽  
Interarrival Time ◽  
Single Server ◽  
Finite Buffer ◽  
Supplementary Variable ◽  
Time Analysis ◽  
Variable Technique ◽  
Early Arrival ◽  
Finite Buffer Queue

This paper presents an analysis of the single-server discrete-time finite-buffer queue with general interarrival and geometric service time,GI/Geom/1/N. Using the supplementary variable technique, and considering the remaining interarrival time as a supplementary variable, two variations of this model, namely the late arrival system with delayed access (LAS-DA) and early arrival system (EAS), have been examined. For both cases, steady-state distributions for outside observers as well as at random and prearrival epochs have been obtained. The waiting time analysis has also been carried out. Results for theGeom/G/1/Nqueue with LAS-DA have been obtained from theGI/Geom/1/Nqueue with EAS. We also give various performance measures. An algorithm for computing state probabilities is given in an appendix.

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.

Analysis of a Discrete-Time Geo/G/1 Queue in a Multi-Phase Service Environment with Disasters

2018 ◽  
Vol 6 (4) ◽  
pp. 349-365
Author(s):  
Tao Jiang
Keyword(s):  
Generating Function ◽  
Discrete Time ◽  
Queueing System ◽  
Supplementary Variable ◽  
Variable Technique ◽  
Service Environment ◽  
Stationary Queue Length ◽  
Expected Length ◽  
Multi Phase ◽  
The Relationship

Abstract This paper considers a discrete-time Geo/G/1 queue in a multi-phase service environment, where the system is subject to disastrous breakdowns, causing all present customers to leave the system simultaneously. At a failure epoch, the server abandons the service and the system undergoes a repair period. After the system is repaired, it jumps to operative phase i with probability qi, i = 1, 2 ⋯, n. Using the supplementary variable technique, we obtain the distribution for the stationary queue length at the arbitrary epoch, which are then used for the computation of other performance measures. In addition, we derive the expected length of a cycle time, the generating function of the sojourn time of an arbitrary customer, and the generating function of the server’s working time in a cycle. We also give the relationship between the discrete-time queueing system to its continuous-time counterpart. Finally, some examples and numerical results are presented.

Queuing Scheme with Feedback Service and Discretionary Administration

2019 ◽  
Vol 9 (1S4) ◽  
pp. 706-710 ◽  
Keyword(s):  
Generating Function ◽  
Average Length ◽  
Probability Generating Function ◽  
Function Approach ◽  
Single Server ◽  
Queue Size ◽  
Supplementary Variable ◽  
Variable Technique ◽  
Supplementary Variable Technique ◽  
Central Organization

This article take a gander at a bunch area single server channel Queuing system, where the server gives two sorts of organizations viz., beginning one a central organization and the optional organization is permitted as a second organization. In case in need, the customer settle on the optional organization .We other than anticipate that after the execution of the second time of affiliation, if the structure is unfilled, the server takes a required get-away of general dissemination. Organization thwarts in the midst of principal organization at random. Additionally if the customer isn't satisfied with the primary central organization, an info advantage for the proportionate is given to make a worthy space for the customers in the system. For the above delineated covering issue, the supplementary variable technique and generating function approach are used to derive the probability generating function of the queue size and the average length of the queue.

scholarly journals A Discrete-Time Queue with Balking, Reneging, and Working Vacations

2014 ◽  
Vol 2014 ◽  
pp. 1-8 ◽  
Author(s):  
Veena Goswami
Keyword(s):  
Discrete Time ◽  
Cost Model ◽  
Single Server ◽  
Finite Buffer ◽  
Multiple Working Vacations ◽  
Optimal Service ◽  
Special Cases ◽  
Service Rates ◽  
Working Vacations ◽  
Vacation Period

This paper presents an analysis of balking and reneging in finite-buffer discrete-time single server queue with single and multiple working vacations. An arriving customer may balk with a probability or renege after joining according to a geometric distribution. The server works with different service rates rather than completely stopping the service during a vacation period. The service times during a busy period, vacation period, and vacation times are assumed to be geometrically distributed. We find the explicit expressions for the stationary state probabilities. Various system performance measures and a cost model to determine the optimal service rates are presented. Moreover, some queueing models presented in the literature are derived as special cases of our model. Finally, the influence of various parameters on the performance characteristics is shown numerically.

scholarly journals Modelling customers’ impatience with discouraged arrival and retention of reneging

2021 ◽  
Vol 31 (3) ◽  
Author(s):  
Pallabi Medhi
Keyword(s):  
Sensitivity Analysis ◽  
Steady State ◽  
Performance Measures ◽  
Generating Functions ◽  
Stochastic Modelling ◽  
Steady State Solution ◽  
Single Server ◽  
Finite Buffer ◽  
System Parameters ◽  
Retention Of Reneged Customers

This paper presents stochastic modelling of a single server, finite buffer Markovian queuing system with discouraged arrivals, balking, reneging, and retention of reneged customers. Markov process is used to derive the steady-state solution of the model. Closed form expressions using probability generating functions (PGFs) are derived and presented for both classical and novel performance measures. In addition, a sensitivity analysis is carried out to study the effect of the system parameters on performance measures. A numerical problem is also presented to demonstrate the derived results and some design aspects.

The analysis of a discrete time finite-buffer queue with working vacations under Markovian arrival process and PH-service time

2020 ◽  
Vol 54 (3) ◽  
pp. 675-691
Author(s):  
Qingqing Ye ◽  
Liwei Liu ◽  
Tao Jiang ◽  
Baoxian Chang
Keyword(s):  
Performance Measures ◽  
Discrete Time ◽  
Loss Probability ◽  
Combination Method ◽  
Arrival Process ◽  
Finite Buffer ◽  
The Matrix ◽  
Working Vacations ◽  
The Impact ◽  
Number Of Customers

In this paper, we study the discrete-time MAP/PH/1 queue with multiple working vacations and finite buffer N. Using the Matrix-Geometric Combination method, we obtain the stationary probability vectors of this model, which can be expressed as a linear combination of two matrix-geometric vectors. Furthermore, we obtain some performance measures including the loss probability and give the limit of loss probability as finite buffer N goes to infinite. Waiting time distribution is derived by using the absorbing Markov chain. Moreover, we obtain the number of customers served in the busy period. At last, some numerical examples are presented to verify the results we obtained and show the impact of parameter N on performance measures.

Sign in / Sign up

Export Citation Format

Share Document