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

H
HICSS
1995
28th Hawaii International Conference on System Sciences (HICSS'95)
Abstract - Cayley graph connected cycles: A new class of fixed-degree interconnection networks

	This Article
	PDF RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by S.R. Ohring Articles by F. Sarkar Articles by S.K. Das Articles by D.H. Hohndei

28th Hawaii International Conference on System Sciences (HICSS'95)

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

Hawaii, USA

January 04-January 07

ISBN: 0-8186-6935-7

	ASCII Text	x
	S.R. Ohring, F. Sarkar, S.K. Das, D.H. Hohndei, "Cayley graph connected cycles: A new class of fixed-degree interconnection networks," Hawaii International Conference on System Sciences, pp. 479, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995.

	BibTex	x
	@article{ 10.1109/HICSS.1995.375509, author = {S.R. Ohring and F. Sarkar and S.K. Das and D.H. Hohndei}, title = {Cayley graph connected cycles: A new class of fixed-degree interconnection networks}, journal ={Hawaii International Conference on System Sciences}, volume = {0}, year = {1995}, issn = {1060-3425}, pages = {479}, doi = {http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375509}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - CONF JO - Hawaii International Conference on System Sciences TI - Cayley graph connected cycles: A new class of fixed-degree interconnection networks SN - 1060-3425 SP EP A1 - S.R. Ohring, A1 - F. Sarkar, A1 - S.K. Das, A1 - D.H. Hohndei, PY - 1995 KW - multiprocessor interconnection networks; graph theory; fault tolerant computing; hypercube networks; network routing; Cayley graph connected cycles; fixed-degree interconnection networks; cube-connected cycles; vertex-symmetric networks; maximally fault tolerant networks; routing algorithms; broadcasting algorithms; abelian generator-sets; average distance VL - 0 JA - Hawaii International Conference on System Sciences ER -

S.R. Ohring, Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

F. Sarkar, Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

S.K. Das, Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

D.H. Hohndei, Dept. of Comput. Sci., North Texas Univ., Denton, TX, USA

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/HICSS.1995.375509

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.

Index Terms:

multiprocessor interconnection networks; graph theory; fault tolerant computing; hypercube networks; network routing; Cayley graph connected cycles; fixed-degree interconnection networks; cube-connected cycles; vertex-symmetric networks; maximally fault tolerant networks; routing algorithms; broadcasting algorithms; abelian generator-sets; average distance

Citation:

S.R. Ohring, F. Sarkar, S.K. Das, D.H. Hohndei, "Cayley graph connected cycles: A new class of fixed-degree interconnection networks," hicss, pp.479, 28th Hawaii International Conference on System Sciences (HICSS'95), 1995

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.