A Fast Parallel Algorithm for Routing Unicast Assignments in Benes Networks
IEEE Transactions on Parallel and Distributed Systems
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
On the Correctness of Inside-Out Routing Algorithm
IEEE Transactions on Computers
Work-Efficient Routing Algorithms for Rearrangeable Symmetrical Networks
IEEE Transactions on Parallel and Distributed Systems
On noninterruptive rearrangeable networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
This paper proposes an adaptive unicast routing algorithm for large scale symmetric networks comprising 2 脙聴 2 switch elements such as Bene?s networks. This algorithm trades off the probability of blocking against algorithm execution time. Deterministic algorithms exploit the rearrangeability property of Bene?s networks to ensure a zero blocking probability for unicast connections, at the expense of extensive computation. The authors' algorithm makes its routing decisions depending on the status of each switching element at every stage of the network, hence the name adaptive routing. This method provides a low complexity solution, but with much better blocking performance than random routing algorithms. This paper presents simulation results for various input loads, demonstrating the tradeoffs involved.