Exact solution of a simple finite infinite source interaction model
type: Item
instance of: scholarly article
title: Exact solution of a simple finite infinite source interaction model
zbMATH Open document ID: 0648.68047
DOI: 10.1007/BF01182934
author: Wing Shing Wong
author: Bharat T. Doshi
published in: Queueing Systems
publication date: 1987-01-01T00:00:00Z
review text: 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 \textit{J. S. Kaufman} [in ``Performance '84'', North-Holland (1984; Zbl 0572.68006), pp. 345-348], developed accurate approximations for a simple non-product 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.
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 68N99
zbMATH DE Number: 4058855
zbMATH Keywords: batch jobs
zbMATH Keywords: interactive jobs
zbMATH Keywords: computer systems
zbMATH Keywords: non-product form network
zbMATH Keywords: exact solutions
zbMATH Keywords: FIFO
zbMATH Keywords: LIFO
MaRDI profile type: Publication
cites work: Q5332626
cites work: Poisson Arrivals See Time Averages
cites work: A queueing model of finite and infinite source interaction
description: scientific article; zbMATH DE number 4058855