Probabilistic models of computer systems--Part I (exact results)

摘要: This paper is a survey of certain known results concerning networks queues. The choice the topics presented has been made with special emphasis on mathematical which can be applied to analysis and synthesis or simulation models complex computer systems in an ensemble resources shared among set user programs. subjects covered include Jackson, Gordon Newell theorems; work-rate theorems Chang, Lavenberg Traiger; Baskett, Chandy, Muntz, Palacios results. We also discuss unified manner problems related Poisson processes queueing networks. Companion papers (Parts II, III) will present approximations some their applications system performance evaluation.