Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles

Abstract

Extending the very popular tori interconnection networks[1]-[3], Torus-Connected Cycles (TCC) have been proposed as a novel network topology for massively parallel systems [5]. Here, the set-to-set disjoint paths routing problem in a TCC is solved. In a TCC(k,n), it is proved that paths of lengths at most kn²+2n can be selected in O(kn²) time.