Circuit-switching networks with FIFO plus justifying blockout service on infinite graphs

A class of circuit-switching open queueing networks is discussed. The main result of the paper is that if extra message flows are not “too intensive” and the path distribution is “mainly concentrated” on the paths of (graph) distance 1 (nearest neighbour connections), then the network has a unique stationary working regime, no matter how “large” the configuration graph of the network is. Standard properties of this regime are established such as decay of correlation and continuity.