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.

scholarly journals Queuing System with Unreliable Servers and Inhomogeneous Intensities for Analyzing the Impact of Non-Stationarity to Performance Measures of Wireless Network under Licensed Shared Access

Mathematics ◽  
2020 ◽  
Vol 8 (5) ◽  
pp. 800 ◽  
Author(s):  
Ekaterina Markova ◽  
Yacov Satin ◽  
Irina Kochetkova ◽  
Alexander Zeifman ◽  
Anna Sinitcina
Keyword(s):  
Performance Measures ◽  
Blocking Probability ◽  
Radio Resource Management ◽  
Queuing System ◽  
Finite Buffer ◽  
Data Traffic ◽  
Multiservice Networks ◽  
Limited Frequency ◽  
The Impact

Given the limited frequency band resources and increasing volume of data traffic in modern multiservice networks, finding new and more efficient radio resource management (RRM) mechanisms is becoming indispensable. One of the implemented technologies to solve this problem is the licensed shared access (LSA) technology. LSA allows the spectrum that has been licensed to an owner, who has absolute priority on its utilization, to be used by other participants (i.e., tenants). Owner priority impacts negatively on the quality of service (QoS) by reducing the data bit rate and interrupting user services. In this paper, we propose a wireless multiservice network scheme model described as a queuing system with unreliable servers and a finite buffer within the LSA framework. The aim of this work is to analyze main system performance measures: blocking probability, average number of requests in queue, and average queue length depending on LSA frequencies’ availability.

scholarly journals Analysis of Queue-Length Dependent Vacations and P-Limited Service in BMAP/G/1/N Systems: Stationary Distributions and Optimal Control

2013 ◽  
Vol 2013 ◽  
pp. 1-14 ◽  
Author(s):  
A. D. Banik
Keyword(s):  
Queue Length ◽  
Minimum Cost ◽  
Arrival Process ◽  
Service Discipline ◽  
Single Server ◽  
Finite Buffer ◽  
Batch Markovian Arrival Process ◽  
Special Cases ◽  
Number Of Customers ◽  
Limited Service

We consider a finite-buffer single server queueing system with queue-length dependent vacations where arrivals occur according to a batch Markovian arrival process (BMAP). The service discipline is P-limited service, also called E-limited with limit variation (ELV) where the server serves until either the system is emptied or a randomly chosen limit of L customers has been served. Depending on the number of customers present in the system, the server will monitor his vacation times. Queue-length distributions at various epochs such as before, arrival, arbitrary and after, departure have been obtained. Several other service disciplines like Bernoulli scheduling, nonexhaustive service, and E-limited service can be treated as special cases of the P-limited service. Finally, the total expected cost function per unit time is considered to determine locally optimal values N* of N or a maximum limit L^* of L^ as the number of customers served during a service period at a minimum cost.

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.

Optimal Thresholds of an Infinite Buffer Discrete-Time Two-Server System with Triadic Policy

2012 ◽  
pp. 279-293
Author(s):  
Veena Goswami ◽  
G. B. Mund
Keyword(s):  
Performance Measures ◽  
Discrete Time ◽  
Minimum Cost ◽  
Service Rate ◽  
Closed Form Solutions ◽  
Optimal Thresholds ◽  
Optimal Service ◽  
Number Of Customers ◽  
System Operating ◽  
Server System

This paper analyzes a discrete-time infinite-buffer Geo/Geo/2 queue, in which the number of servers can be adjusted depending on the number of customers in the system one at a time at arrival or at service completion epoch. Analytical closed-form solutions of the infinite-buffer Geo/Geo/2 queueing system operating under the triadic (0, Q N, M) policy are derived. The total expected cost function is developed to obtain the optimal operating (0, Q N, M) policy and the optimal service rate at minimum cost using direct search method. Some performance measures and sensitivity analysis have been presented.

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.

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 Elucidating the Short Term Loss Behavior of Markovian-Modulated Batch-Service Queueing Model with Discrete-Time Batch Markovian Arrival Process

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Yung-Chung Wang ◽  
Dong-Liang Cai ◽  
Li-Hsin Chiang ◽  
Cheng-Wei Hu
Keyword(s):  
Discrete Time ◽  
Packet Loss ◽  
Loss Probability ◽  
Markovian Arrival Process ◽  
Arrival Process ◽  
Service Process ◽  
Batch Service ◽  
Temporal Behavior ◽  
Packet Loss Probability ◽  
Batch Markovian Arrival Process

This paper applies a matrix-analytical approach to analyze the temporal behavior of Markovian-modulated batch-service queue with discrete-time batch Markovian arrival process (DBMAP). The service process is correlated and its structure is presented through discrete-time batch Markovian service process (DBMSP). We examine the temporal behavior of packet loss by means of conditional statistics with respect to congested and noncongested periods that occur in an alternating manner. The congested period corresponds to having more than a certain number of packets in the buffer; noncongested period corresponds to the opposite. All of the four related performance measures are derived, including probability distributions of a congested and noncongested periods, the probability that the system stays in a congested period, the packet loss probability during congested period, and the long term packet loss probability. Queueing systems of this type arise in the domain of wireless communications.

scholarly journals Optimization of Balking and Reneging Queue with Vacation Interruption underN-Policy

2013 ◽  
Vol 2013 ◽  
pp. 1-9 ◽  
Author(s):  
P. Vijaya Laxmi ◽  
V. Goswami ◽  
K. Jyothsna
Keyword(s):  
Performance Measures ◽  
Search Method ◽  
Model Parameters ◽  
Finite Buffer ◽  
Working Vacation ◽  
Swarm Optimization ◽  
Multiple Working Vacations ◽  
Working Vacations ◽  
Vacation Interruption ◽  
System Length

This paper analyzes a finite buffer multiple working vacations queue with balking, reneging, and vacation interruption underN-policy. In the working vacation, a customer is served at a lower rate and at the instants of a service completion; if there are at leastNcustomers in the queue, the vacation is interrupted and the server switches to regular busy period otherwise continues the vacation. Using Markov process and recursive technique, we derive the stationary system length distributions at arbitrary epoch. Various performance measures and some special models of the system are presented. Cost analysis is carried out using particle swarm optimization and quadratic fit search method. Finally, some numerical results showing the effect of model parameters on key performance measures of the system are presented.

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.

Sign in / Sign up

Export Citation Format

Share Document