O(n) routing in rearrangeable networks

In (2n)1)-stage rearrangeable networks, the routing time for any arbitrary permutation is X(n2 ) compared to its propagation delay O(n) only. Here, we attempt to identify the sets of permutations, which are routable in O(n) time in these networks. We de

• Type: Journal
• Year: 2000
• Where: JSA
• Authors: Nabanita Das, Krishnendu Mukhopadhyaya, Jayasree Dattagupta
• Keywords: Benes Network, JSA 2000, Permutations, Rearrangeable Network