计算机工程与应用 ›› 2013, Vol. 49 ›› Issue (5): 81-83.

• 网络、通信、安全 • 上一篇    下一篇

双环Petersen网络直径公式及最优路由算法

魏葆雅1,刘日华2,陈宝兴1   

  1. 1.漳州师范学院 计算机科学与工程系,福建 漳州 363000
    2.江西教育学院 数学与计算机科学系,南昌 330032
  • 出版日期:2013-03-01 发布日期:2013-03-14

Diameter formula and optimal routing algorithm for double-loops Petersen networks

WEI Baoya1, LIU Rihua2, CHEN Baoxing1   

  1. 1.Department of Computer Science and Engineering, Zhangzhou Normal University, Zhangzhou, Fujian 363000, China
    2.Department of Mathematics and Computer Science, Jiangxi Institute of Education, Nanchang 330032, China
  • Online:2013-03-01 Published:2013-03-14

摘要: 双环Petersen图互联网络DLCPG(k)是双环网络与Petersen图的笛卡尔积,它具有良好的可扩展性、较短的网络直径和简单的拓扑结构等特性。通过研究其拓扑结构,得到了DLCPG(k)直径的显式公式,并给出了该网络的最优单播路由算法。

关键词: 互联网络, 直径, 双环Petersen图, 最优路由

Abstract: The Double-Loops Connected Petersen Graph network DLCPG(k) is Cartesian product of a double-loop network and the Petersen graph. It has good extensibility, short diameter and simple topology structure. By studying its topology structure, the diameter formula of DLCPG(k) is obtained, and a simple and optimal routing algorithm for the DLCPG(k) is given.

Key words: interconnection networks, diameter, double-loops connected Petersen graph, optimal routing