Abstract
Networks of queues with finite and infinite source customers have been used to study the interaction between the batch jobs and interactive jobs in computer systems. Earlier Kaufman ([1], PP-345-348) developed accurate approximations for a simple nonproduct form network of this type. In this paper we offer exact solutions for the same model with one finite source customer. We study both FIFO and LIFO disciplines at the contention node. The results are derived for the case where the finite source think time and service time distributions are generalized hyperexponential.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
J.S. Kaufman, Finite and infinite source interactions, in:Performance '84, ed. Gelenbe (North-Holland, Amsterdam, 1984).
W.S. Wong, Queues with generalized hyperexponential distributions, unpublished work.
N.T.J. Bailey,Elements of Stochastic Processes with Applications to Natural Sciences (Wiley, New York, 1964).
R. Wolff, Poisson arrivals see time averages, Opns. Res. 30, (1982) 223–231.
O.J. Boxma, A queueing model of finite and infinite source interaction, to appear.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Doshi, B., Wong, W.S. Exact solution of a simple finite infinite source interaction model. Queueing Syst 2, 67–82 (1987). https://doi.org/10.1007/BF01182934
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01182934