Network computer modeling

Abstract

Network computers are becoming a reality in the seventies. While systems such as the ARPA network, Carnegie Mellon's PLN, the Collins C-System, CDC's Cybernet, and GE's Time Share Net are coming to fruition, even more grandiose systems are being discussed. These networks all offer the designer the potential of combining the advantages of data base sharing, resource sharing, and load leveling with those of message switching. From a postulation of the essential characteristics of a network computer currently under development, we formulate a queueing theory model for a multiserver system with a finite length priority queue. Then, under the assumptions of Poisson input and exponentially distributed processing times, we use this idealized mathematical model to investigate the steady state stochastic behavior of Jobs in the network. We are particularly interested in the efficiency of computer utilization and the average waiting time for Jobs of different priority classes.