Routing in Chordal Ring Networks
by Alison Thomson
Abstract: Chordal rings are a family of graphs obtained by adding chords to a cycle in a regular manner, and this symmetry makes them good models for interconnection networks. Furthermore, chordal rings can be represented geometrically as tessellations of the plane. These properties can be used to construct shortest path routing schemes, which are important for practical applications (such as parallel computing). In particular, we discuss the load on edges for such routings.
For More Information: Mark Fackrell firstname.lastname@example.org