On the rearrangeability of multistage networks employing uniform connection pattern

Abstract

In this paper, the rearrangeability of (2s -1)-stage networks is proved. This result is used to prove that (2 log(n)N-1)-stage nonsymmetric networks employing uniform connection pattern, two passes through s-stage networks with the same kth and (s-k+1)st stages, and 2 log(n)N-1 circulations through single-stage networks are rearrangeable.