证明环的递归立方体网络(Recursive Cube of Rings network)(简称RCR网络)也是Cayley图,它有很多良好的拓扑性质.采用有限群导出Cayley图的方法,先定义了一个新的群,然后重新证明了RCR网络是一类Cayley 图,并更改了RCR中节点的表示方法.
Abstract
Recursive Cube of Rings(RCR) is proven to be the Cayley graph
known as a quite suitable interconnected network which possesses many good topological properties. The Cayley graph is obtained from the finite group. Firstly
a new group was defined. Then
RCR was proved to be the Cayley graph. Finally
necessary modifications to the way of marking the nodes in RCR were made accordingly.
关键词
Keywords
references
徐俊明.组合网络理论[M].北京:科学出版社,2007.
Sun Y,Cheung P,Lin X.Recursive cube of Rings:A new topology for interconnection networks[J].IEEE.Parallel Dist.Syst,2000,11(3):275-286.
Hu H,Gu N,Cao J.A note on recursive cube of rings network[J].IEEE Trans Parallel and Dist Syst,2005,16(10):1007-1008.
Choi D,Lee O,Chung I.A parallel routing a-lg-orithm on recursive cube of rings networks employing Hamiltonian circuit Latin square[J].Inf Sci,2008,178:1533-1541.