期刊名称：International Journal of Networking and Computing
印刷版ISSN：2185-2847
出版年度：2015
卷号：5
期号：2
页码：329-346
语种：English
出版社：International Journal of Networking and Computing
摘要：The hierarchical dual-net (HDN) is an interconnection network for building ultra-scale parallel systems. The HDN is constructed based on a symmetric product graph (called base network), such as three-dimensional torus and n-dimensional hypercubes. A k-level hierarchical dual-net, HDN(B,k,S), is obtained by applying k-time dual constructions on the base network B. S defines a super-node set that adjusts the scale of the system. The node degree of an HDN(B,k,S) is d0+k where d0 is the node degree of B. The HDN is node and edge symmetric and can contain huge number of nodes with small node degree and short diameter. In this paper, we propose two efficient algorithms for finding a fault-free path on HDN. The first algorithm can always find a fault-free path in O(2kF(B)) time if the number of faulty nodes on HDN is less than d0+k, where F(B) is the time complexity of fault-tolerant routing in the base network. The second algorithm, more practical one, can find a fault-free path on HDN with arbitrary number of faulty nodes. The simulation results show that the second algorithm can find a fault-free path at high probability.
其他摘要：The hierarchical dual-net (HDN) is an interconnection network for building ultra-scale parallel systems. The HDN is constructed based on a symmetric product graph (called base network), such as three-dimensional torus and n -dimensional hypercubes. A k -level hierarchical dual-net, HDN( B , k , S ), is obtained by applying k -time dual constructions on the base network B . S defines a super-node set that adjusts the scale of the system. The node degree of an HDN( B , k , S ) is d 0 + k where d 0 is the node degree of B . The HDN is node and edge symmetric and can contain huge number of nodes with small node degree and short diameter. In this paper, we propose two efficient algorithms for finding a fault-free path on HDN. The first algorithm can always find a fault-free path in O (2 k F ( B )) time if the number of faulty nodes on HDN is less than d 0 + k , where F ( B ) is the time complexity of fault-tolerant routing in the base network. The second algorithm, more practical one, can find a fault-free path on HDN with arbitrary number of faulty nodes. The simulation results show that the second algorithm can find a fault-free path at high probability.
