An Adaptive Heuristic Algorithm with the Probabilistic Safety Vector for Fault-Tolerant Routing on the (n, k)-Star Graph

The (n, k)-star graph is a generalization of the n-star graph. It has better scalability than the n-star graph and holds some good properties compared with the hypercube. This paper focuses on the design of the fault-tolerant routing algorithm for the (n, k)-star graph. We adopt the idea of collecting the limited global information used for routing on the n-star graph to the (n, k)-star graph. In the preliminary version of this paper, we built the probabilistic safety vector (PSV) with modified cycle patterns and developed the routing algorithm to decide the fault-free routing path with the help of PSV. Afterwards, we observed that the routing performance of PSV gets worse as the percentage of fault nodes increases, especially it exceeds 25%. In order to improve the routing performance with more faulty nodes, an adaptive method of threshold assignment for the PSV is also proposed. The performance is judged by the average length of routing paths. Compared with distance first search and safety level, PSV with dynamic threshold gets the best performance in the simulations.

[1]  Wei-Kuo Chiang,et al.  The (n, k)-Star Graph: A Generalized Star Graph , 1995, Inf. Process. Lett..

[2]  Jingli Li,et al.  Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees , 2007, NPC.

[3]  Sheldon B. Akers,et al.  The Star Graph: An Attractive Alternative to the n-Cube , 1994, ICPP.

[4]  Jung-Sheng Fu,et al.  Weak-vertex-pancyclicity of (n, k)-star graphs , 2008, Theor. Comput. Sci..

[5]  Ronald L. Graham,et al.  Concrete mathematics - a foundation for computer science , 1991 .

[6]  Hon-Chan Chen,et al.  Fault-tolerant routing on the star graph with safety vectors , 2002, Proceedings International Symposium on Parallel Architectures, Algorithms and Networks. I-SPAN'02.

[7]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[8]  Wei-Kuo Chiang,et al.  Topological Properties of the (n, k)-Star Graph , 1998, Int. J. Found. Comput. Sci..

[9]  Jie Wu.  Unicasting in Faulty Hypercubes Using Safety Levels , 1995, ICPP.

[10]  Shahram Latifi,et al.  A Routing and Broadcasting Scheme on Faulty Star Graphs , 1993, IEEE Trans. Computers.

[11]  Jimmy J. M. Tan,et al.  Fault Hamiltonicity and fault Hamiltonian connectivity of the (n, k)‐star graphs , 2003, Networks.

[12]  László Lipták,et al.  Linearly Many Faults in (n, k)-Star Graphs , 2011, Int. J. Found. Comput. Sci..

[13]  Dyi-Rong Duh,et al.  Constructing vertex-disjoint paths in (n, k)-star graphs , 2008, Inf. Sci..

[14]  Shietung Peng,et al.  Node-to-Node Cluster Fault Tolerant Routing in Star Graphs , 1995, Inf. Process. Lett..

[15]  Jie Wu.  Reliable Unicasting in Faulty Hypercubes Using Safety Levels , 1997, IEEE Trans. Computers.