We recently proposed a new algorithm which routes a class of 2log/sub 2/N- or (2log/sub 2/N-1)-stage rearrangeable networks. Although we discussed some of the general rules for proper routing, detailed strategies for resolving possible conflicts were not mentioned. In this paper, we point out additional conditions which enable conflict-free routing in the original algorithm. Cyclic property at the center stages is analyzed in more detail. We also show that the routing problem in the concatenation of two omega networks known as 2log/sub 2/N-stage shuffle network, is in the class of NP-completeness.
展开▼
机译：我们最近提出了一种新的算法，其路由一类2Log / sub 2 / n-或（2log / sub 2 / n-1）-stage可重新排列的网络。虽然我们讨论了一些适当的路线规则，但没有提到解决可能的冲突的详细策略。在本文中，我们指出了在原始算法中实现了无冲突路由的额外条件。中心级的循环性质更详细地分析。我们还表明，两个欧米茄网络称为2Log / sub 2 / n级洗牌网络的串联的路由问题在NP完整性的类中。
展开▼
