Binary Tree Petersen网络性质及算法研究  

THE RESEARCH OF PROPERTIES AND ALGORITHMS ON BINARY TREE PETERSEN NETWORKS

作　　者：纪鸿飞[1] 马英红[1] 

机构地区：[1]山东师范大学管理与经济学院,济南250014

出　　处：《山东师范大学学报（自然科学版）》2010年第1期26-28,38,共4页Journal of Shandong Normal University(Natural Science)

基　　金：山东省自然科学基金资助项目（Z2008G04）;山东省中青年科学家奖励基金资助项目（BS2009DX005）

摘　　要：基于Petersen图，提出了Binary Tree Petersen的网络结构，并对其特性进行了研究，证明了Binary Tree Petersen网络具有正则性以及良好的可扩展性，同时还具有比RP（k）、2-DToms更短的直径和良好的并行能力．另外，还基于Binary Tree Petersen网络分别给出了其上的单播和广播路由算法，证明了通信效率都为2j＋4．Based on the Petersen graph, an innovative interconnection network, Binary Tree Petersen, was proposed, and the characteristics were studied simultaneously. It is proved that Binary Tree Petersen not only is of regularity and good extensibility, also has shorter diameter than some previous well - known interconneetion networks such as RP（ k）, 2 -D Torus and good parallel capacity. In addition, unicasting and broadeasting routing algorithms were designed for Binary Tree Petersen. It is proved that the eommunieation effieieneies of its unieasting and broadcasting routing algorithms are 2j ＋ 4 and 2j ＋ 4 respectively.

关 键 词：PETERSEN图 BINARY TREE Petersen网络 路由算法 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]