TITLE: Implementation for hypercycle-based interconnection networks AUTHORS: Radvan, D., N.J. Dimopoulos and R. Sivakumar IN: Proceedings of the Canadian Conference on Electrical and Computer Engineering,, Ottawa, pp. 67.2.1-67.2.4, Sep. 1990 ABSTRACT In this work, we present details of the implementation of a Hypercycle-based router with a backtrack-to-the-origin- and-retry routing. Hypercycles, is 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. In a backtrack-to-the-origin-and-retry routing, 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. The router can be used in constructing concurrent computer systems with varying topologies.