论文部分内容阅读
提出了一种基于Petersen图的互联网络RP（k）,研究了该互联网络的性质,它具有良好的连接度、短的直径和简单的拓扑结构.在节点小于300的情况下,RP（k）的直径低于Torus的直径,其最优分组的距离小于Torus最优分组的距离,特别是当分组节点数m满足6≤m≤100时,RP（k）最优分组的距离近似等于Torus最优分组距离的一半.基于Petersen图结构,设计了点点通信、置换路由、广播路由和多对多路由算法,它们的通信效率分别为[k/2]+2,k+5,[k/2]+2和k+5.
A Petersen graph-based Internet RP (k) is proposed to study the properties of the Internet, which has good connectivity, short diameter and simple topological structure. When the number of nodes is less than 300, RP ) Is less than the diameter of Torus, the distance of the optimal packet is less than the distance of the Torus optimal packet, especially when the number of packet nodes m satisfies 6≤m≤100, the distance of the optimal packet of RP (k) is approximately equal to Torus Based on the Petersen graph structure, we designed the algorithms of little point communication, permutation route, broadcast route and many-to-many route with the communication efficiency of [k / 2] +2, k + 5 and [k / 2] +2 and k + 5.