Title :
The Wide Diameter of Folded Hypercube
Author_Institution :
Coll. of Sci., Three Gorges Univ., Yichang, China
Abstract :
The n-dimensional Folded hypercube FQn is a very popular topological structure of multi-computer networks because of many excellent features. But further exploring of its properties regarding robustness are needed to establish sound foundation of its applications to important networks requiring high reliability. In this paper, the one-to-one parallel routes in FQn for n ≥ 2 are concerned. For any two distinct nodes with Hamming distance r, the n + 1 internal vertex-disjoint paths joining these two nodes have been constructed. Meanwhile it is found that there are r paths of length r and n + 1 - r paths of length r + 2 when 1 ≤ r ≤ [n/2], or r paths of length n - r + 3 and n - r + 1 paths of length n - r + 1 when [n/2] <; r <; n. These results conclude that the n + 1-wide diameter of FQn is no more than [n/2] + 2. The n + 1 internal vertex-disjoint paths form an n + 1-container of FQn, which implies that the fault-tolerant diameter is no more than [n/2] + 2. These properties show that interconnection networks modeled by FQn are extremely robust. They have very good fault tolerance and reliability as a topological structure of multi-computer network.
Keywords :
fault tolerance; hypercube networks; multiprocessor interconnection networks; network topology; Hamming distance; fault-tolerant diameter; interconnection networks; internal vertex-disjoint paths; multicomputer networks; n-dimensional Folded hypercube; one-to-one parallel routes; reliability; robustness; topological structure; wide diameter; Binary trees; Computer networks; Educational institutions; Fault tolerance; Hypercubes; Joining processes; Multiprocessor interconnection networks; Network topology; Robustness; Routing; Disjoint paths; Fault-tolerant diameter; Folded hypercube networks; Wide-diameter;
Conference_Titel :
Computational Science and Optimization (CSO), 2010 Third International Joint Conference on
Conference_Location :
Huangshan, Anhui
Print_ISBN :
978-1-4244-6812-6
Electronic_ISBN :
978-1-4244-6813-3
DOI :
10.1109/CSO.2010.133