A Unifying Conservation Law for Single-Server Queues
نویسندگان
چکیده
منابع مشابه
A Unifying Conservation Law for Single-server Queues
We develop a conservation law for a multi-class GI/GI/1 queue operating under a general work-conserving scheduling discipline. For single-class single-server queues, conservation laws have been obtained for both nonanticipating and anticipating disciplines with general service time distributions. For multi-class single-server queues, conservation laws have been obtained for (i) nonanticipating ...
متن کاملA unifying onservation law for single-server queues
Urtzi Ayesta LAAS-CNRS 7, Avenue Colonel Ro he 31077, Toulouse e-mail: urtzi laas.fr Abstra t We develop a onservation law for a multilass GI/GI/1 queue operating under a general workonserving s heduling dis ipline. For singlelass single-server queues, onservation laws have been obtained for both non-anti ipating and anti ipating dis iplines with general servi e time distributions. For multilas...
متن کاملstationary single-server queues
This paper complements two previous studies (Daley and Rolski, 1984, 199 1) by indicating the extent to which characteristics of a general stationary point process taken as the arrival process of a single-server queue influence light traffic limit theorems for the two essentially distinct schemes of dilation and thinning as routes to the limit. Properties of both the work-load and the waiting-t...
متن کاملSome Inequalities for Single Server Queues
The expected wait in the Gi/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are 1FR or have mean residual life bounded by r-, simple bounds are obtained which A. give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions foi the mo...
متن کاملLaw of Large Numbers Limits for Many-server Queues
Abstract. This work considers a many-server queueing system in which customers with i.i.d., generally distributed service times enter service in the order of arrival. The dynamics of the system are represented in terms of a process that describes the total number of customers in the system, as well as a measure-valued process that keeps track of the ages of customers in service. Under mild assu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Applied Probability
سال: 2007
ISSN: 0021-9002,1475-6072
DOI: 10.1239/jap/1197908826