You are not currently logged in.
Access your personal account or get JSTOR access through your library or other institution:
If You Use a Screen ReaderThis content is available through Read Online (Free) program, which relies on page scans. Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Queues with Non-Stationary Input Stream: Ross's Conjecture
Advances in Applied Probability
Vol. 13, No. 3 (Sep., 1981), pp. 603-618
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/1426787
Page Count: 16
Since scans are not currently available to screen readers, please contact JSTOR User Support for access. We'll provide a PDF copy for your screen reader.
Preview not available
Characteristics of queues with non-stationary input streams are difficult to evaluate, therefore their bounds are of importance. First we define what we understand by the stationary delay and find out the stability conditions of single-server queues with non-stationary inputs. For this purpose we introduce the notion of an ergodically stable sequence of random variables. The theory worked out is applied to single-server queues with stationary doubly stochastic Poisson arrivals. Then the interarrival times do not form a stationary sequence ('time stationary' does not imply 'customer stationary'). We show that the average customer delay in the queue is greater than in a standard M/G/1 queue with the same average input rate and service times. This result is used in examples which show that the assumption of stationarity of the input point process is non-essential.
Advances in Applied Probability © 1981 Applied Probability Trust