| 基于超立方体的双Petersen图连接的互联网络研究 |
| |
| 引用本文： | 张哲夫,高太平.基于超立方体的双Petersen图连接的互联网络研究[J].广西大学学报(自然科学版),2011,36(5):781-786. |
| |
| 作者姓名： | 张哲夫 高太平 |
| |
| 作者单位： | 1. 山西大学计算机与信息技术学院,山西太原,030006
2. 山西大学计算机与信息技术学院,山西太原030006;山西大学计算智能与中文信息处理教育部重点实验室,山西太原030006 |
| |
| 基金项目： | 国家自然科学基金资助项目(60803034) |
| |
| 摘 要： | 基于Petersen图的短直径与超立方体节点的高可连接性,提出了一种新型的互连网络拓扑结构——基于超立方体的双Petersen图连接的互联网络PHP(n)；并对其拓扑性质进行了研究.研究表明PHP(n)网络具有正则性和良好的可扩展性与容错性.另外,还设计了PHP(n)网络上的单播、广播路由算法,证明了其通信效率均为n+...
|
| 关 键 词： | 互联网络 超立方体 Petersen图 路由算法 |
Research on hypercube and double Petersen graph connected interconnection networks |
| |
| ZHANG Zhe-fu,GAO Tai-ping.Research on hypercube and double Petersen graph connected interconnection networks[J].Journal of Guangxi University(Natural Science Edition),2011,36(5):781-786. |
| |
| Authors: | ZHANG Zhe-fu GAO Tai-ping |
| |
| Institution: | ZHANG Zhe-fu1,GAO Tai-ping1,2(1.School of Computer and Information Technology,Shanxi University,Taiyuan 030006,China,2.Key Laboratory of Computational Intelligence and Chinese Information Processing of Ministry of Education,China) |
| |
| Abstract: | Based on the short diameter of Petersen Graph and high connectivity of hypercube,an innovative interconnection network topological structure,Hypercube and double Petersen Graph Connected Networks(PHP(n)),is proposed,and whose characteristics are studied.It is shown that PHP(n) has regularity,good extensibility and good fault-tolerant ability.In addition,the unicast and broadcast routing algorithms are designed for PHP(n),whose communication efficiency are proved to be n+4. |
| |
| Keywords: | interconnection network hypercube Petersen graph routing algorithms |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
