2,694 research outputs found
Asymptotic behavior of the loss probability for an M/G/1/N queue with vacations
In this paper, asymptotic properties of the loss probability are considered
for an M/G/1/N queue with server vacations and exhaustive service discipline,
denoted by an M/G/1/N -(V, E)-queue. Exact asymptotic rates of the loss
probability are obtained for the cases in which the traffic intensity is
smaller than, equal to and greater than one, respectively. When the vacation
time is zero, the model considered degenerates to the standard M/G/1/N queue.
For this standard queueing model, our analysis provides new or extended
asymptotic results for the loss probability. In terms of the duality
relationship between the M/G/1/N and GI/M/1/N queues, we also provide
asymptotic properties for the standard GI/M/1/N model
Busy period analysis of the level dependent PH/PH/1/K queue
In this paper, we study the transient behavior of a level dependent single server queuing system with a waiting room of finite size during the busy period. The focus is on the level dependent PH/PH/1/K queue. We derive in closed form the joint transform of the length of the busy period, the number of customers served during the busy period, and the number of losses during the busy period. We differentiate between two types of losses: the overflow losses that are due to a full queue and the losses due to an admission controller. For the M/PH/1/K, M/PH/1/K under a threshold policy, and PH/M/1/K queues, we determine simple expressions for their joint transforms
Corrected phase-type approximations of heavy-tailed queueing models in a Markovian environment
Significant correlations between arrivals of load-generating events make the
numerical evaluation of the workload of a system a challenging problem. In this
paper, we construct highly accurate approximations of the workload distribution
of the MAP/G/1 queue that capture the tail behavior of the exact workload
distribution and provide a bounded relative error. Motivated by statistical
analysis, we consider the service times as a mixture of a phase-type and a
heavy-tailed distribution. With the aid of perturbation analysis, we derive our
approximations as a sum of the workload distribution of the MAP/PH/1 queue and
a heavy-tailed component that depends on the perturbation parameter. We refer
to our approximations as corrected phase-type approximations, and we exhibit
their performance with a numerical study.Comment: Received the Marcel Neuts Student Paper Award at the 8th
International Conference on Matrix Analytic Methods in Stochastic Models 201
The NxD-BMAP/G/1 queueing model : queue contents and delay analysis
We consider a single-server discrete-time queueing system with N sources, where each source is modelled as a correlated Markovian customer arrival process, and the customer service times are generally distributed. We focus on the analysis of the number of customers in the queue, the amount of work in the queue, and the customer delay. For each of these quantities, we will derive an expression for their steady-state probability generating function, and from these results, we derive closed-form expressions for key performance measures such as their mean value, variance, and tail distribution. A lot of emphasis is put on finding closed-form expressions for these quantities that reduce all numerical calculations to an absolute minimum
Transient analysis of a two-heterogeneous servers queue with impatient behavior
AbstractRecently, [1] have obtained the transient solution of multi-server queue with balking and reneging. In this paper, a similar technique is used to drive a new elegant explicit solution for a two heterogeneous servers queue with impatient behavior. In addition, steady-state probabilities of the system size are studied and some important performance measures are discussed for the considered system
- …