TITLE:   Hypercycles: A Status Report

AUTHORS: N. J. Dimopoulos, R. Sivakumar, V. Dimakopoulos, 
         M. Chowdhury and Don Radvan

IN:      Proceedings of the IEEE Pacific Rim Conference on
         Communications, Computers and Signal Processing, 
         Victoria, B.C., Canada, May 1991, pp. 111 - 114

ABSTRACT

In this work, we present the Hypercycles, 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-origin-and-retry routing, whereupon 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. Simulation results that establish the performance 
of a variety of configurations are presented. In addition our 
initial attempt of constructing a Hypercycle based router is 
discussed.