Technical Report CS0538

TR#:CS0538
Class:CS
Title: ASTA Implies an M/G/1-Like Load Decomposition for a Server With Vacations
Authors: Z. Rosberg and H.R. Gail
PDFCS0538.pdf
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 shbw 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 Pisson arrivals.

Keywords: ASTA, stochastic decomposition, point processes, vacation models, queues, quasi-reversibility.

CopyrightThe above paper is copyright by the Technion, Author(s), or others. Please contact the author(s) for more information

Remark: Any link to this technical report should be to this page (http://www.cs.technion.ac.il/users/wwwb/cgi-bin/tr-info.cgi/1989/CS/CS0538), rather than to the URL of the PDF files directly. The latter URLs may change without notice.

To the list of the CS technical reports of 1989
To the main CS technical reports page

Computer science department, Technion
admin