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

@article{Dimopoulos1989BacktrackTT,
  title={Backtrack to the origin and retry routing for hypercycle-based interconnection networks},
  author={Nikitas J. Dimopoulos and Don Radvan and Kuining Li},
  journal={Conference Proceeding IEEE Pacific Rim Conference on Communications, Computers and Signal Processing},
  year={1989},
  pages={173-177}
}
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… CONTINUE READING

Similar Papers

Loading similar papers…