Skip to Main Content
This paper presents recursive formulas for calculating the point-to-point congestion in a circuit-switched telecommunication network. This congestion value is derived from the individual blocking probabilities of each link, with or without regard to switch blocking. The approach is valid for alternate routing plans with a fixed sequence of route selection, using a link-by-link call setup procedure. The formulas presented here contrast with conventional procedures in that no probability linear graph is constructed. Rather, all paths connecting any two nodes are generated by a simple recursive relation.