Dynamic Path Selection Algorithm for Beneš Networks

The Beneš network is a long established method to connect large switching networks. This network has the characteristic of providing multiple paths for same output request. In this paper, we present a new routing algorithm that can route data from given input to the desired output. Our method uses one of the available paths for
Input/Output
request dynamically from each input to each output, and thus requires a complex routing algorithm. Deterministic algorithms can provide (rearrangeably) nonblocking performance for unicast switch, but are computationally complex. Faster algorithms select paths at random but achieve poor blocking performance. We describe a new routing algorithm featuring dynamic path selection that has low computational complexity and good blocking probabilities.