Skip to Main Content
This paper introduces a unified queueing model of store-and-forward computer communication networks with random routing and a finite number of buffers at each node. This model has been based on a two-level classification of messages passing through the network. Using it we can analyze a wide class of local flow control mechanisms which have been proposed or used in practice. Some examples illustrate the usefulness of the presented approach. Numerical results are also given.
Date of Publication: Dec 1984