A self-routing permutation network
Journal of Parallel and Distributed Computing
On Self-Routing in Benes and Shuffle-Exchange Networks
IEEE Transactions on Computers
A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks
IEEE Transactions on Parallel and Distributed Systems
Parallel Algorithms to Set Up the Benes Permutation Network
IEEE Transactions on Computers
A Self-Routing Benes Network and Parallel Permutation Algorithms
IEEE Transactions on Computers
Concurrent round-robin-based dispatching schemes for Clos-network switches
IEEE/ACM Transactions on Networking (TON)
A "Single-Box" Re-routing Architecture for a 3-Stage Rearrangeable CLOS Interconnection Networks
PARA '02 Proceedings of the 6th International Conference on Applied Parallel Computing Advanced Scientific Computing
Dispatching schemes for Clos-network switches
Computer Networks: The International Journal of Computer and Telecommunications Networking
Captured-frame matching schemes for scalable input-queued packet switches
Computer Communications
| Hi-index | 0.00 |
A new parallel algorithm for route assignment in Benes-Clos network is studied an this paper. In packet switching systems, swatch fabrics must be able to provide internally conflict-free paths simultaneously and to accommodate packets requesting for connections in real-time as they arrive at the inputs. Most known sequential route assignment algorithms, such as the looping algorithm for Benes networks or Clos networks, are designed for circuit switching systems where switching configuration can be rearranged at relatively low speed. Most existing parallel routing algorithms are not practical for packet switching because they either assume the set of connection requests is a full permutation or fail to deal with output contentions among the set of input packets. In this paper, we develop a parallel routing algorithm by solving a set of Boolean equations which are derived from the connection requests and the symmetric structure of the Benes network. Our approach can handle both the partial permutations and the output contention problem easily. The time complexity of our algorithm is O(log2N), where N is the network size. Furthermore, we extend the algorithm and show that it can be applied to the Clos network if the number of central modules is a power of two.