
O(logm¯.logN) routing algorithm for (2logN−1)(2logN−1)-stage switching networks and beyond
Keywords: Rearrangeable networks; Permutation; Interconnection networks; Routing tags; Complexity