Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Cayley graph connected cycles: A new class of fixed-degree interconnection networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
4 Author(s)
Ohring, S.R. ; Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA ; Sarkar, F. ; Das, S.K. ; Hohndei, D.H.

We introduce a new class of fixed-degree interconnection networks, called the Cayley graph connected cycles, which includes the well known cube-connected cycles as a special case. This class of networks is shown to be vertex-symmetric and maximally fault tolerant (if the given Cayley graph is maximally fault tolerant). We propose simple routing and broadcasting algorithms for these networks in general, and improve them for special types of Cayley graph connected cycles having abelian generator-sets. Furthermore, the average distance in these networks is analyzed

Published in:

System Sciences, 1995. Proceedings of the Twenty-Eighth Hawaii International Conference on  (Volume:2 )

Date of Conference:

3-6 Jan 1995