An approximate design of open-loop nonexponential service networks of finite capacity with losses or interlocks

An approximate method is proposed for analysis of open-loop service systems with constrained buffers in the nodes and interlocks that recognizes the mean values and coefficients of variation of intervals between arrivals of the customers at the nodes and the durations of their service. Mean values are found for the queue length, the queueiling time in the nodes, and other node throughput characteristics. In particular, for a network with losses the probabilities of customer losing in the nodes and for networks with interlocks, the probabilities of node interlocks are determined.