Open, closed, and mixed networks of queues with different classes of customers
Digital Systems Laboratory, Stanford University, 1972 - Markov processes - 42 pages
The authors derived the equilibrium distribution of states of a model containing four different types of service centers and R different classes of customers. From this steady state distribution one can compute the moments of the queue sizes for different classes of customers at different service centers, the usage of the service centers, the 'cycle time' or response time for different classes of customers, the 'throughput' of different classes of customers, and other measures of system performance. The model allows different classes of customers to have different arrival rates and different routing probabilities. For open networks some very simple formulas give the marginal distribution of customers at the service centers of the network. Allowing different classes of customers should answer one of the principal objections to queueing models as models of computer systems. The example given indicates how significant different classes of customers can be in the safe levels predicted by model analysis. (Modified author abstract).
What people are saying - Write a review
We haven't found any reviews in the usual places.
Andrews AFB Arlington Army Electronics Command arrival process Baskett Brooks AFB Buzen California Chandy classes of customers Command Fort Monmouth computer systems Copies customer at service customer class customers of class Department Dept different service distributed with mean distributions have rational distributions with rational Eisenhower Avenue Electrical Engineering equilibrium distribution equilibrium state probabilities equivalent customers equivalent model exponentially distributed service FCFS given service center global balance equation Hanscom Field Bedford JSEP L. G. Hanscom Field marginal distribution Massachusetts 01730 mean service model of multiprogramming models of computer networks of queues normalizing constant number of customers Ohio Oizumi Proc processor sharing scheduling product form queueing model queueing theory Range New Mexico rational Laplace Transforms service rate service station service time distribution single server solution SPONSORING MILITARY stage of service Technical Library Technology total number transition probabilities types of service U.S. Army Virginia Walter Reed Army Wright-Patterson AFB York