Skip to Main Content
A computer system can usually be interpreted as a closed network with two different types of servers. It is then possible to convert the network into a single server system with state-dependent arrivals. This paper investigates the stationary behavior of a single server queue with different classes of jobs. It is assumed that the input process has state-dependent exponential inter-arrival times and preemptions at the server are not allowed. The exact solution is obtained by finding the relationship between the time average probability distribution and the departure average probability distribution. The latter can be derived, based upon an imbedded Markov Chain.
Note: The Institute of Electrical and Electronics Engineers, Incorporated is distributing this Article with permission of the International Business Machines Corporation (IBM) who is the exclusive owner. The recipient of this Article may not assign, sublicense, lease, rent or otherwise transfer, reproduce, prepare derivative works, publicly display or perform, or distribute the Article.