About cookies on this site Our websites require some cookies to function properly (required). In addition, other cookies may be used with your consent to analyze site usage, improve the user experience and for advertising. For more information, please review your options. By visiting our website, you agree to our processing of information as described in IBM’sprivacy statement. To provide a smooth navigation, your cookie preferences will be shared across the IBM web domains listed here.
Paper
ASTA implies an M/G/1-like load decomposition for a server with vacations
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. © 1991.