Abstract:
The article describes a model of a unidirectional loop communications network with packet switching, in which all stations can exchange messages; the model is a generalization of a number of models investigated earlier. Formulas are obtained for the basic characteristics of the network for an extensive class of priority distributions between flows entering the network.