A new family of cayley graph interconnection networks of constant degree four

被引：30
|
作者：
Vadapalli, P [1 ]
Srimani, PK [1 ]
机构：
[1] COLORADO STATE UNIV,DEPT COMP SCI,FT COLLINS,CO 80523
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1996年 / 7卷 / 01期
关键词：
interconnection network; Cayley graph; constant degree; fault tolerance; generators; simple routing; optimal routing;
D O I：
10.1109/71.481595
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
We propose a new family of interconnection networks that are Cayley graphs with constant node degree 4. These graphs are regular, have logarithmic diameter, and are maximally fault tolerant. We investigate different algebraic properties of these networks (including fault tolerance) and propose optimal routing algorithms. As far as we know, this is the first family of Cayley graphs of constant degree 4.
引用
收藏
页码：26 / 32
页数：7
相关论文
共 50 条
12345