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

Computer Engineering and Applications ›› 2013, Vol. 49 ›› Issue (5): 81-83.

Previous Articles Next Articles

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

WEI Baoya1, LIU Rihua2, CHEN Baoxing1

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网络直径公式及最优路由算法

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

1.漳州师范学院计算机科学与工程系，福建漳州 363000
2.江西教育学院数学与计算机科学系，南昌 330032

Abstract

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

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

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

WEI Baoya1, LIU Rihua2, CHEN Baoxing1. Diameter formula and optimal routing algorithm for double-loops Petersen networks[J]. Computer Engineering and Applications, 2013, 49(5): 81-83.

魏葆雅1，刘日华2，陈宝兴1. 双环Petersen网络直径公式及最优路由算法[J]. 计算机工程与应用, 2013, 49(5): 81-83.

[1]	YANG Xiaowen, CAO Shanhai, HAN Xie. Three-Dimensional Model Segmentation Based on Boundary Features [J]. Computer Engineering and Applications, 2019, 55(4): 214-218.
[2]	LI Daoquan, WEI Yanting, ZHANG Yuxia, LIU Wenjing. Energy Balanced Routing Algorithm for Wireless Sensor Networks Based on Ant Colony Optimization [J]. Computer Engineering and Applications, 2019, 55(17): 117-124.
[3]	ZHONG Wei1，2, LIU Rihua3, CHEN Baoxing1，2. Diameter Formula for a Special 3D Hexagonal Torus [J]. Computer Engineering and Applications, 2019, 55(13): 119-122.
[4]	ZHANG Guozhen. Sufficient conditions for networks to be maximally restricted edge-connected [J]. Computer Engineering and Applications, 2017, 53(8): 19-22.
[5]	ZHOU Houqing1，XU Youzhuan2. Algebraic connectivity of trees based on network topology [J]. Computer Engineering and Applications, 2017, 53(3): 106-109.
[6]	ZHANG Guozhen. Unidirectional [k]-ary [n]-cube networks [J]. Computer Engineering and Applications, 2015, 51(20): 1-4.
[7]	ZHONG Wei, CHEN Baoxing. Fast algorithm of calculating diameter for Bi-Cayley graph with 4 degrees on cyclic group [J]. Computer Engineering and Applications, 2015, 51(14): 67-71.
[8]	ZHANG Shurong, WANG Shiying, DONG Cao. Hyper hamiltonian laceability of k-ary n-cubes with edge faults [J]. Computer Engineering and Applications, 2014, 50(21): 39-43.
[9]	ZHANG Guozhen. Reliability of [k-ary] [n-cube] networks [J]. Computer Engineering and Applications, 2013, 49(22): 3-6.
[10]	ZHAO Yuanqing1, JIN Xianhua2. 3-restricted edge connectivity of star graph networks [J]. Computer Engineering and Applications, 2012, 48(7): 81-83.
[11]	LV Jianhua, ZHOU Huachun, QIU Luwei, ZHANG Hongke. Implementation of authentication and authorization of proxy mobile IPv6 [J]. Computer Engineering and Applications, 2012, 48(22): 109-116.
[12]	YU Gang, LIU Gang. Spatial fussy query on shape cognition of 2D objects [J]. Computer Engineering and Applications, 2012, 48(16): 185-189.
[13]	ZHAO Yuanqing1, JIN Xianhua2. The 4-restricted edge connectivity of star networks [J]. Computer Engineering and Applications, 2012, 48(13): 71-74.
[14]	DAI Haipeng，TANG Houjun. Improved algorithm for computing diameter of convex polygons [J]. Computer Engineering and Applications, 2011, 47(3): 44-46.
[15]	YANG Yuxing1，3，WANG Shiying2. Conditional vertex connectivity measures for bubble-sort networks [J]. Computer Engineering and Applications, 2011, 47(22): 13-16.

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

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

PDF

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 15

Recommended Articles

Metrics