| 摘要 |
A marching alogorithm for the selection of middle atage switch elements in a network uses an arbitrary but settled sequence in whioch middle stage switch elements are sampled. The sequence is aqpplied in the forward direction to find an appropriate middle stage switch element during connection and in a reverse direction during disconnection to find an appropriate middle stage switch elem,ent for rearrangement. All of the inputswitch elements use the same marching sequence. The marching alogorithm is applicable to both single rate and multi-rate connections. In the case of multi-rate connections, multiple rearrangements may occur at disconnect to match the capacity of the terminated connection. |
