L Auslander, E Feig, et al.
Advances in Applied Mathematics
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. © 1991.
L Auslander, E Feig, et al.
Advances in Applied Mathematics
A. Grill, B.S. Meyerson, et al.
Proceedings of SPIE 1989
T. Graham, A. Afzali, et al.
Microlithography 2000
Harpreet S. Sawhney
IS&T/SPIE Electronic Imaging 1994