Computer Engineering and Applications ›› 2008, Vol. 44 ›› Issue (3): 154-156.

• 网络、通信与安全 • Previous Articles     Next Articles

Routing algorithms on interconnection networks RCP(n

LIU Hong-ying1,2,GAO Tai-ping1,3   

  1. 1.School of Computer and Information Technology,Shanxi University,Taiyuan 030006,China
    2.School of Mathematics and Computer Science,Shanxi Datong University,Datong,Shanxi 037009,China
    3.Key Laboratory of Ministry of Education for Computation Intelligence & Chinese Information Processing,School of Computer & Information Technology,Shanxi University,Taiyuan 030006,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2008-01-21 Published:2008-01-21
  • Contact: LIU Hong-ying

互联网络RCP(n)的路由算法

刘宏英1,2,高太平1,3

  

  1. 1.山西大学 计算机科学与信息技术学院,太原 030006
    2.山西大同大学 数学与计算机科学学院,山西 大同 037009
    3.山西大学 省部共建教育部重点实验室,太原 030006
  • 通讯作者: 刘宏英

Abstract: The new interconnection network RCP(n) have been studied and is proved that RCP(n) is not only of regularity and good extensibility,but also of shorter diameter and smaller construction costs than those previously well-known interconnection networks such as Qn,HP(n) and RHP(n).In this paper,on the basis of its characteristics,the unicast and broadcast algorithms are designed on RCP(n),whose communication efficiency are proved to be better than that of Qn,HP(n) and RHP(n).

Key words: crossed cube, routing, routing algorithm

摘要: 在对互联网络RCP(Ringed Crossed cube Petersen)拓扑结构研究的基础上,利用RCP(n)网络具有正则性,良好的可扩展性,以及具有比Qn、HP(n)、RHP(n)网络更短的直径和更小的构造开销这些特性,给出了RCP(n)的单播路由算法和广播路由算法,并证明了RCP(n)比Qn、HP(n)、RHP(n)网络具有更好的路由性能。

关键词: 交叉立方体, 路由, 路由算法