互联网络RCP(n)的拓扑结构优化设计

Optimization Design of Topological Structure on Interconnection Networks—RCP(n)

提出一种新的互联网络拓扑结构——基于交叉立方体环连接的Petersen图互联网络RCP(n).研究互联网络RCP(n)的通信特性.通过RCP(n)的单播路由算法、广播路由算法、可分组性算法,证明RCP(n)不仅具有环、彼特森图和交叉立方体本身所具有的性质,同时又具有自身独特的拓扑性质.研究结果表明,RCP(n)是一种具有良好拓扑结构和通信特性的互联网络.在通信效率上的花费只有由超立方体构成的互联网络的1/2,而通信效率却是由超立方体构成的互联网络的一倍.

Proposes a kind of new internet topology——the Petersen network which inter-connects on the overlapping cube link chart, or internet RCP （n）. Studies the internet RCP （n） correspondence characteristics, broadcasts the route and broadcasted route, and its respective grouping. Through RCP（n） broadcast route algorithm, RCP（n） grouping algorithm, it is proved that RCP（n） not only has the nature which the link, Pitt woods chart and overlapping cube itself has, it also has its own unique topological property. It is indicated that, RCP（n） is a kind has of network that has its good topology and correspondence characteristics of the internet but it has the correspondence efficiency twice that of the ultra cube constitution internet, but actually requiring only half the expenditure of time by the ultra cube.