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

The authors consider a single server at which customers of several classes arrive according to a stochastic point process and the server may take vacations arbitrarily. They 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 wth server vacations is given as an example for non-Poisson arrivals.