Backtrack to the origin and retry routing for hypercycle-based interconnection networks

Hypercycles, a class of multidimensional graphs, which are generalizations of the n-cube, are presented. These graphs are obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection strategy. Hypercycles offer simple routing and the ability, given a fixed degree, to choose among a number of alternative size networks for distributed systems tailored specifically to the topology of a particular application. A backtrack-to-the-origin-and-retry routing is also presented, in which paths that block at intermediate nodes are abandoned and a new attempt is made. Intermediate nodes are chosen at random at each point from among the ones that form the shortest paths from a source to a destination. Preliminary simulation results are presented.<>