The Markovian Queue with Bounded Waiting time
The single-server queueing system is studied where arrivals are rejected if their waiting plus service times would exceed a fixed amount K. Applications of this model include equipment repair facilities and buffered communication devices with constant discharge rate receiving messages from a high-speed data channel. A procedure for computing the equilibrium behavior is described for the case of random arrivals and arbitrary service time requirements. Detailed analytic results and graphs are given for the case of exponentially distributed service time requirements, including the server utilization, rejection probability, mean time in system, mean server busy period, and the mean and probability density function of the virtual waiting time.
Year of publication: |
1977
|
---|---|
Authors: | Gavish, Bezalel ; Schweitzer, Paul J. |
Published in: |
Management Science. - Institute for Operations Research and the Management Sciences - INFORMS, ISSN 0025-1909. - Vol. 23.1977, 12, p. 1349-1357
|
Publisher: |
Institute for Operations Research and the Management Sciences - INFORMS |
Saved in:
Saved in favorites
Similar items by person
-
The Markovian queue with bounded waiting time
Gavish, Bezalel, (1977)
-
Pertubation theory and undiscounted Markov renewal programming
Schweitzer, Paul J., (1969)
-
Communication to the editor : an equilibrium property of finite-population queues
Schweitzer, Paul J., (1968)
- More ...