有向超方体的损坏直径Fault Diameter for Uni-directional Hypercube(国外英文资料).doc

有向超方体的损坏直径Fault Diameter for Uni-directional Hypercube(国外英文资料) Collected by oneself Mistakes are unavoidable For reference only In case of error Please correct me! Thanks Damage diameter of directed hyper square Fault, Diameter, for, Uni-directional, Hypercube Zheng Fei Lin Chong Hua Huang Wenzeng * Fei-Wen, Zheng, Chuang-Hua, Lin, Wen-Tzeng, Huang Department of electronic engineering, national Taipei University of science and technology abstract Directed n-dimensional hyper square (expressed in UQn) A variant of the n-dimensional hypercube (represented by Qn) This paper mainly deals with the damage diameter of UQn (fault, diameter) In UQn (n is even) We prove that the damage diameter of UQn is n+2 First In the undamaged UQn We propose a shortest path routing algorithm The shortest path routing algorithm is used Find the n/2 mutex that exists between the starting node and the destination node (disjoint, paths) Then find out the mutex paths between all two nodes The length of the longest path is the damaged diameter Keywords: Hyper square, directed hypercube, corrupted diameter, mutually exclusive path, shortest path Submission time: 89 years, October 17th review time: 89 years, December 18th ABSTRACT An n-dimensional uni-directional hypercube, UQn is, a variation from hypercube. In this paper, we demonstrate that the fault diameter of UQn is (n+2), where n is even. First, we propose a shortest path routing algorithm in this topology. To use this algorithm, we find that there are n/2 disjoint paths between the source node and destination node in UQn, where n is even. Then, the longest path of these disjoint paths is the fault diameter of UQn, where n is even. Keywords:hypercube Uni-directional Hypercube Fault diameter Disjoint, path, shortest, path. I. Introduction Distributed and parallel processing systems have become a hot research topic in computer systems The construction of distributed parallel processing system has many kinds of undirected graph structures Due