Search

This paper considers the primary distributed-type switching network which serves as the prototype for the distributed switching network. A method is shown to determine the route with the minimum number of tandem stages from the originator to the destination nodes in the network (called shortest route). The shortest route is given either by the straight path directly connecting the originator and the destination switching nodes, or, if such does not exist, by the following path. Consider the parallelogram that directly connects the originator and the destination switching nodes. Then the route is obtained from the originator switching node to the destination switching node by connecting arbitrarily the unit links on the border and the inside of the parallelogram, in the same direction as that of the edges of the parallelogram from the originator switching node to the destination switching node. The number of shortest routes between the originator and the destination switching nodes increases following the exponential function of the distance between the originator and the destination switching nodes. The number of tandem stages in the shortest route increases linearly with the distance. If a honeycomb-type network is employed, the number of tandem stages in the shortest mute can be reduced by approximately 15 percent at the maximum, compared to the grid-type network. When a failure such as blocking is produced between the originator and the destination, there exist three kinds of shortest mutes depending on the point of generation. [ABSTRACT FROM AUTHOR]