A method originating from statistical mechanics (low-density and hightemperature expansions) is used to prove the existence and uniqueness of a stationary regime for switching networks on finite or infinite graphs. The main assumption is that the message (customer) flows circulating through the network are 'localized' in the sense that, for any message, the probability of having a long path is rapidly decreasing (and, moreover, a path of a 'typical' message consists of one line). The switching rule combines message-switching and circuit-switching principles. The stationary regime for the network under consideration may be treated as a 'small perturbation' of the 'idealized' regime in the totally decoupled network where all the messages have single line paths.
[1]
F. Kelly.
One-Dimensional Circuit-Switched Networks
,
1987
.
[2]
F. Kelly.
Blocking probabilities in large circuit-switched networks
,
1986,
Advances in Applied Probability.
[3]
Ward Whitt,et al.
Comparison methods for queues and other stochastic models
,
1986
.
[4]
A. N. Rybko,et al.
On Jackson Networks on Denumerable Graphs
,
1989
.
[5]
R. M. Loynes,et al.
The stability of a queue with non-independent inter-arrival and service times
,
1962,
Mathematical Proceedings of the Cambridge Philosophical Society.