Answers are grounded in this paper and cite their sources.
In the classical models of circuit-switching networks it is usually assumed that when a call arrives it is possible to find instantly whether or not a path can be set up between calling and destination nodes. We consider the case of distributed control when the call successively occupies channels on the preassigned route and gets busy signal in the case of some link blocking only at the time of appearance at its entry. Our model includes the possibility of a group catastrophic link failure. For networks without alternate paths we show that the product-form and insensitivity of the steady state distribution hold
No takes yet. Share an insight, caveat, or question.
Falin et al. (1994) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: