Permutation routing is the message routing problem that all of the source nodes have exactly one destination that is not the same among others. Permutation routing has been the performance measure of circuit-switched networks which exchange messages by physically connecting nodes using switching element. Recursive Circulant is one of the interconnection network topology that is comparable or superior to Hypercube in various measure.
This thesis presents the methods to consider permutation routing on circuit-switched Recursive Circulant. A novel fixed routing rule which constructs edge disjoint path for k-cyclic shift permutation is presented. And the permutation capability of fixed routing rule is compared with shortest-path routing rule by computer simulation. Multistaged Recursive Circulant which is multistage interconnection network version of Recursive Circulant, is constructed and identified in delta network class. Using the rearrangeable property of Benes-like network, the 2-step rearrangeability of Recursive Circulant is also presented.
