BASED INTERCONNECTION NETWORKS? BACKTRACK TO THE ORIGIN AND RETRY ROUTING FOR HYPERCYCLE-
N.J. Dimopoulos, D. Radvan, Kin F. Li, D C. Canada · 1989
In this work. we present the Hypcrcycles, a class of multidimensional graphs, which are generalizations of the n-cube. 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 chose among a number of alternative size graphs. These graphs can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application. We are also presenting a back-track-to-the-originand-retry routing, whereupon paths that block at intermediate nodes are abandonned, 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 also presented.