A model for the I/O-channel traffic in computer systems.

Abstract

A new model is proposed which is based on the assumption that the actual traffic to be processed by an I/O channel system is generated as the overflow from a fictitious server system having Poisson traffic as the input. The number of servers and the mean arrival rate can be readily adjusted to verify the main value and the variance of the actual traffic to be handled. A closed solution for the stationary probabilities of state is obtained, and the parameters conventionally used to describe the grade of performance of queuing systems (such as mean queue length, mean waiting time, and probability of waiting) are defined.