| 互联网络RCP(n)的组播路由算法 |
| |
| 引用本文： | 刘宏英,高太平.互联网络RCP(n)的组播路由算法[J].雁北师范学院学报,2007(4). |
| |
| 作者姓名： | 刘宏英 高太平 |
| |
| 作者单位： | 山西大学计算机科学与信息技术学院 山西大学计算机科学与信息技术学院 山西太原 山西大同大学数学与计算机科学学院 山西大同 山西太原 |
| |
| 基金项目： | 国家自然科学基金项目[10471081]，山西省自然科学基金项目[20070011042] |
| |
| 摘 要： | 互联网络RCP(Ringed Crossed cube Petersen)拓扑结构被提出后并没有给出组播算法.本文利用RCP(n)网络的正则性、良好的可扩展性,以及比Qn,HP(n),RHP(n)网络直径更短和构造开销更小这些特性,按照构造组播树的方法,给出了RCP(n)网络的组播路由算法,并对该算法作了性能分析.
|
| 关 键 词： | 交叉立方体 互联网络 组播路由算法 |
Study on Multicast Routing Algorithm of RCP(n) Interconnection Networks |
| |
| LIU Hong-ying,GAO Tai-ping.Study on Multicast Routing Algorithm of RCP(n) Interconnection Networks[J].Journal of Yanbei Teachers College,2007(4). |
| |
| Authors: | LIU Hong-ying GAO Tai-ping |
| |
| Institution: | LIU Hong-ying1,2,GAO Tai-ping1 |
| |
| Abstract: | The topological structure on interconnection network RCP(n) has been studied without giving a multicast routing algorithm.It was 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).On the basis of RCP(n)'s characteristics,this paper presents the multicast routing algorithm on RCP(n) by the measure of constructing a multicast tree and analyzes the performance of the algorithm. |
| |
| Keywords: | crossed cube interconnection network multicast routing algorithm |
| 本文献已被 CNKI 维普 等数据库收录！ |
