Quasi-reversibility of Jackson's networks with exponential constraint on the sojourn time of claims

Outbound flows are investigated using the reveresе time procedure for an exponential queuing network containing knots of two types – single-line and multi-line. The sojourn time at the knots of network is limited by an exponential random variable for a fixed number of claims in the knot. The quasi-reversibility of the Markov network process is established.