DocumentCode
245789
Title
Connectivity Results of Hierarchical Cubic Networks as Associated with Linearly Many Faults
Author
Cheng, Eddie ; Ke Qiu ; Zhizhang Shen
Author_Institution
Dept. of Math. & Stat., Oakland Univ., Rochester, MI, USA
fYear
2014
fDate
19-21 Dec. 2014
Firstpage
1213
Lastpage
1220
Abstract
We establish a general fault-tolerance property for the interesting hierarchical cubic networks, when a linear number of vertices are removed from such a network. As its application, we discuss and derive several connectivity results of its underlying graph, including its restricted connectivity, cyclic vertex-connectivity, component connectivity, and conditional diagnosability. These results demonstrate several fault-tolerance properties of the hierarchical cubic networks.
Keywords
fault tolerant computing; graph theory; hierarchical systems; component connectivity; conditional diagnosability; cyclic vertex-connectivity; fault-tolerance property; hierarchical cubic networks; linearly many faults; underlying graph; Computer science; Educational institutions; Electronic mail; Fault tolerance; Fault tolerant systems; Hypercubes; Routing; Hierarchical cubic network; fault-tolerance property; graph connectivity; parallel and distributed computing;
fLanguage
English
Publisher
ieee
Conference_Titel
Computational Science and Engineering (CSE), 2014 IEEE 17th International Conference on
Conference_Location
Chengdu
Print_ISBN
978-1-4799-7980-6
Type
conf
DOI
10.1109/CSE.2014.235
Filename
7023745
Link To Document