The Community for Technology Leaders
2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT) (2012)
Kuala Lumpur
Nov. 26, 2012 to Nov. 28, 2012
ISBN: 978-1-4673-5832-3
pp: 105-109
ABSTRACT
A hyper-star graph HS(2n, n) is promising as a generic topology for interconnection networks of parallel processing systems because it has merits of a hypercube and a star graph. This paper proposes an algorithm that constructs a fault-free path between a pair of non-faulty nodes in HS(2n, n) with faulty nodes. In addition, we conduct a computer experiment to show its effectiveness.
INDEX TERMS
computational complexity, fault tolerance, graph theory, hypercube networks, multiprocessing systems, network theory (graphs)
CITATION

Y. Nishiyama, Y. Hirai and K. Kaneko, "Fault-Tolerant Routing Based on Directed Safety Levels in a Hyper-Star Graph," 2012 International Conference on Advanced Computer Science Applications and Technologies (ACSAT), Kuala Lumpur, 2013, pp. 105-109.
doi:10.1109/ACSAT.2012.76
96 ms
(Ver 3.3 (11022016))