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

在煎饼图中，我们开发了一对一通信的容错路由算法和集群容错路由算法。作为将这种方法应用于各种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.