Development of Cluster-Fault-Tolerant Routing Algorithms in Cayley Graphs

在Pancake图中，我们提出了一种用于一对一通信的容错路由算法和一种簇容错路由算法。作为将该方法应用于各种Cayley图的初步步骤，我们在完全分层超立方体和分层立方体网络中开发了一对多通信的不相交路径路由算法。此外，我们还提出了一种子串反转图中的内部不相交路径路由算法。我们还针对完美层次超立方体中的多对多通信提出了一种不相交路径路由算法。

In pancake graphs, we have developed a fault-tolerant routing algorithm and a cluster-fault-tolerant routing algorithm for one-to-one communication. As a preliminary step for applying this approach to various Cayley graphs, we have developed in perfect hierarchical hypercubes and hierarchical cubic networks disjoint-path routing algorithms for one-to-many communication. In addition, we have developed an internally disjoint paths routing algorithm in substring reversal graphs. We have also developed a disjoint paths routing algorithm for many-to-many communication in perfect hierarchical hypercubes.