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.
Work-Modulated Queues with Applications to Storage Processes
Sid Browne and Karl Sigman
Journal of Applied Probability
Vol. 29, No. 3 (Sep., 1992), pp. 699-712
Published by: Applied Probability Trust
Stable URL: http://www.jstor.org/stable/3214906
Page Count: 14
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
We study two FIFO single-server queueing models in which both the arrival and service processes are modulated by the amount of work in the system. In the first model, the nth customer's service time, Sn, depends upon their delay, Dn, in a general Markovian way and the arrival process is a non-stationary Poisson process (NSPP) modulated by work, that is, with an intensity that is a general deterministic function g of work in system V(t). Some examples are provided. In our second model, the arrivals once again form a work-modulated NSPP, but, each customer brings a job consisting of an amount of work to be processed that is i.i.d. and the service rate is a general deterministic function r of work. This model can be viewed as a storage (dam) model (Brockwell et al. (1982)), but, unlike previous related literature, (where the input is assumed work-independent and stationary), we allow a work-modulated NSPP. Our approach involves an elementary use of Foster's criterion (via Tweedie (1976)) and in addition to obtaining new results, we obtain new and simplified proofs of stability for some known models. Using further criteria of Tweedie, we establish sufficient conditions for the steady-state distribution of customer delay and sojourn time to have finite moments.
Journal of Applied Probability © 1992 Applied Probability Trust