【摘要】 RCP(n)是最近提出的一种新型互联网络拓扑结构,是由环、Petersen图和交叉立方体所组成的,具有短直径、良好的可扩展性和正则性以及较小的构造开销的性质,是一种具有良好拓扑性质的互联网络。针对RCP(n)上节点编码的特点,采用逐步分解编码,依次寻找路径的方法给出了寻找RCP(n)上任意两点间最短路的一个多项式算法,为RCP(n)上作进一步的路由算法、最优分组等通讯性能的研究提供了理论支持,因此具有一定的理论意义和应用价值。更多还原

【Abstract】 RCP(n) which has been proposed recently,consists of ring,Petersen graph and crossing cube.It has shorter diameter,regularity,good extensibility and lest construction costs,so it is a kind of interconnection network having good topological charac-teristics.This paper,by the codes’characteristics of RCP(n),gives the polynomial shortest path algorithm of between discretionary two nodes in RCP(n) adopting disintegrating codes step by step and finding path in turn.This algorithm provides theory support for studying communication capabilities such as route algorithm,optimization grouping,so it has theory significance and application value.更多还原