An Algorithm for k-pairwise Cluster-fault-tolerant Disjoint Paths in a Burnt Pancake Graph

被引：1
|
作者：
Tokuda, Masato [1 ]
Hirai, Yuki [1 ]
Kaneko, Keiichi [1 ]
机构：
[1] Tokyo Univ Agr & Technol, Grad Sch Engn, Koganei, Tokyo, Japan
来源：
2015 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND COMPUTATIONAL INTELLIGENCE (CSCI) | 2015年
关键词：
pancake graph; multicomputer; interconnection network; parallel processing;
D O I：
10.1109/CSCI.2015.117
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we focus on the pairwise cluster-fault-tolerant disjoint path routing problem in a burnt pancake graph, and propose an algorithm that solves the problem in a polynomial time of the degree of the graph. That is, in an n-burnt pancake graph with n-2k + 1 faulty-cluster whose diameters are at most 3, the algorithm can construct fault-free disjoint paths between k pairs of nodes. The time complexity of the algorithm is O(kn(3)) and the maximum path length is 2n + 15.
引用
下载
收藏
页码：651 / 655
页数：5
相关论文
共 16 条
12