ASTA implies an M/G/1-like load decomposition for a server with vacations

Authors:
Zvi Rosberg;H.Richard Gail
Affiliations:
IBM Israel, Haifa 32000, Israel;IBM T.J. Watson Research Center, Yorktown Heights, NY 10598, USA
Venue:
Operations Research Letters
Year:
1991

Citing 3
Cited 0

Queueing systems with vacations—a survey

Queueing Systems: Theory and Applications
On arrivals that see time averages

Operations Research
Workloads and waiting times in single-server systems with multiple customer classes

Proceedings of the workshop held at the Mathematical Sciences Institute Cornell University on Mathematical theory of queueing systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider a single server at which customers of several classes arrive according to a stochastic point process and the server may take vacations arbitrarily. We show that under stationary conditions, the ASTA property (Arrivals See Time Averages) implies an M/G/1-like load decomposition property. A network of quasi-reversible symmetric queues with server vacations is given as an example for non-Poisson arrivals.