Interconnection network RP_n(k) and its routing algorithms
Liu Fang-ai · Jisuanji yingyong yanjiu · 2011
Based on these properties of Petersen graph and the simple scalable property of ring,presented a new interconnection network RPn(k) and analyzed the properties of the RPn(k).RPn(k) not only has good regularity and extensibility,but also has shorter diameter,better grouping ability and smaller construction costs than the RP(k) network.Finally,discussed the routing algorithm of RPn(k) and proposed the point-to-point routing on the RPn(k) network.The performances of the algorithm is +2n routing time steps.When the number of nodes is same,the communication efficiency of the routing algorithm on RPn(k) is better than the routing algorithm on RP(k) network.