Application of Some Rearrangement Algorithms to a T-S-T Network
H.A.H. Abou Steit, David A. Smith · IRE Transactions on Communications Systems · 1983
The degree to which rearrangement reduces blocking, and its cost in time and complexity, depend on the algorithm used. Here we apply two algorithms to a range of time-space-time networks and compare the results obtained with those produced by Akiyama. We note that in one of these algorithms some states can occur which make effective rearrangement impossible, a condition which does not have a parallel in space division networks.