Cayley graphs and interconnection networks
Cayley graphs and interconnection networks
复制标题
DOI：
10.1007/978-94-015-8937-6_5
复制
发表时间：
1997
影响因子：
2.9
通讯作者：
M. Heydemann
中科院分区：
文献类型：
--
作者：
M. Heydemann
由于并行和分布式计算的最新发展，各种互连网络的设计和分析在过去几年中一直是研究的主要课题，并且仍然受到诸如光纤的通信网络的新技术的刺激。用Cayley（di）图作为互连网络的模型有许多优点。这项工作首先调查了几类凯莱图，以及研究互连网络的模型。结果和问题有关的路由网络，然后提出，重点是负载的节点和链路的路由。
Due to recent developments of parallel and distributed computing, the design and analysis of various interconnection networks has been a main topic of research for the past few years and is still stimulated by the new technologies of communication networks such as optic fibers. There are many advantages in using Cayley {di) graphs as models for interconnection networks. This work first surveys some classes of Cayley graphs which are well studied as models of interconnection networks. Results and problems related to routings in networks are then presented, with emphasis on loads of nodes and links in routings.