Routing of telephone traffic to minimize network blocking

The problem of optimum routing of telephone traffic to minimize network blocking is formulated for a class of routing schemes. The necessary conditions for minimum-blocking routing are shown to be analogous to conditions for minimum-delay routing in a store-and-forward data network. A method is described for calculating an optimum routing on the basis of centralized computational for the network. Owing to its computational complexity, however, the method is more useful for off-line studies than for real-time adaptive routing.