Key references in distributed computer systems 1959–1989

Computer networks and distributed systems

The present survey reflects the main results obtained through 1982 in the theory of queuing networks and some of its applications to the analysis of the productivity of information-computing systems. Special attention is devoted to as complete a description as possible of models of networks for which there exist closed expressions for the stationary distributions. The characteristic properties of such networks are studied, and effective computing algorithms are given for computing the characteristics. A number of approximate methods are presented which are used in analytic modeling of real information-computing systems — networks of data transmission and networks of computers and their components.

Theory of queuing networks and its applications to the analysis of information-computing systems

This article presents a history of queueing theory done by Canadian researchers prior to 1980 and includes an extensive bibliography.

History of Queueing Theory in Canada Prior to 1980

A periodic network is a queuing network whose steady-state behavior is not constant in time, but repeats itself in a cycle. This behavior may be caused by the introduction of periodic servers, e.g., paging drums. The model presented is a generalization of some other models of queuing networks, and provides a more general definition of steady-state behavior. A theoretical solution is presented. Examples of theoretical and approximate solutions are presented for a well-known queuing network model of a computer system.

G.H. Gonnet

Papers

Analysis of Closed Queuing Networks with Periodic Servers