Queueing systems with vacations—a survey
Queueing Systems: Theory and Applications
Introduction to queueing theory (2nd ed)
Introduction to queueing theory (2nd ed)
Analysis of an M/G/1 queue with constant repeated attempts and server vacations
Computers and Operations Research
On the single server retrial queue subject to breakdowns
Queueing Systems: Theory and Applications
Impact of paging channel overloads or attacks on a cellular network
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Dynamic power control in a fading downlink channel subject to an energy constraint
Queueing Systems: Theory and Applications
| Hi-index | 0.00 |
In this note, we present some results about the M^X/G/1 retrial queue with vacations. Retrial times are governed by an arbitrary probability law which is independent of the number of customers in the retrial group. We consider an energetic interpretation in the sense that the service of a customer requires not only a random time, but also a random amount of energy with arbitrarily probability distribution. The server is turned off and takes a vacation when the system becomes empty. The random energy required for each vacation is also arbitrary distributed. We derive a stochastically recursive relation which can be used as a discrete-event simulation algorithm for our queue. Next, we give an explicit formula for the generating function of the number of customers in orbit in steady state and exhibit explicit forms of stochastic decomposition property. Finally, we show how to obtain performance measures of interest and optimal control parameters for vacation and retrial policies.