Cluster-fault-tolerant routing in burnt pancake graphs

Authors:
Nagateru Iwasawa;Tatsuro Watanabe;Tatsuya Iwasaki;Keiichi Kaneko
Affiliations:
Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan;Graduate School of Engineering, Tokyo University of Agriculture and Technology, Tokyo, Japan
Venue:
ICA3PP'10 Proceedings of the 10th international conference on Algorithms and Architectures for Parallel Processing - Volume Part II
Year:
2010

Citing 5
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
On the problem of sorting burnt pancakes

Discrete Applied Mathematics
An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs

IEICE - Transactions on Information and Systems
Hamiltonian Cycles and Hamiltonian Paths in Faulty Burnt Pancake Graphs

IEICE - Transactions on Information and Systems
Cluster fault-tolerant routing in pancake graphs

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a routing algorithm in an n-burnt pancake graph Bn, which is a topology for interconnection networks, with at most n−1 faulty clusters whose diameters are at most 3. For an arbitrary pair of non-faulty nodes, the proposed algorithm constructs a fault-free path of length at most 2n+10 between them in O(n2) time complexity.