The Problem of Rerouting Connecting Paths in Switching Systems

The unblocking of switching systems by the reswitching of previously established connections to new connecting paths is considered. Algorithms are given for the unblocking of blocked connections which enable one to minimize the number of reroutings in switching systems in which the interruption of a connection at the instant of rerouting is allowed, and in switching systems without breaking the connection. Estimates are given of the limiting number of reroutings for the case of heaviest blocking.