The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network based on K-bounded Permutations

Abstract

The Benes network has been used as a rearrangeable network for over 30 years for applications in circuit switching and packet routing. However the O(N logN) control complexity of the Benes is not optimal for many permutations. In this paper, we present a novel rearrangeable network that is permutation-specific control-optimal, i.e., it has the lowest… (More)

Topics

8 Figures and Tables

Cite this paper

@inproceedings{Kannan2003TheKN, title={The KR-Benes Network: A Control-Optimal Rearrangeable Permutation Network based on K-bounded Permutations}, author={Rajgopal Kannan}, year={2003} }