【摘要】 提出了一种三维六度环面Cayley图网络模型.针对该网络模型,给出了一种简单的三维节点编址方案,并利用该编址方案得到了任意两个节点间的最短距离公式;开发了一种简单的分布式最优路由算法,该算法可以运行于网络中的任意节点,可以建立任意两点之间的最短路由路径;基于陪集图(coset graph)理论,给出了一种新型的广播通信算法,并对该算法的效率进行了分析;给出了三维六度环绕网络模型直径的界限值.更多还原

【Abstract】 The 3D hexagonal torus is presented as a natural extension of the hexagonal torus.Hexagonal tori are proved to be a type of Cayley graph.This paper develops a new type of 3D hexagonal torus based on Cayley graph.An addressing scheme for this type of network is developed.Based on this addressing scheme,the distance formula between any two nodes is derived.Then,a distributed optimal routing algorithm is developed.This distributed routing algorithm is optimal,which means it can be executed on any node in the network to construct a shortest path between any pair of nodes.A broadcasting algorithm is also presented according to the coset graph theory.The upper bound and lower bound of the diameter are also proposed in this paper.更多还原