Low time complexity algorithms for path computation in Cayley Graphs
No Thumbnail Available
We study the problem of path computation in Cayley Graphs (CG) from an approach of word processing in groups. This approach consists in encoding the topological structure of CG in an automaton called , then techniques of word processing are applied for computing the shortest paths. We present algorithms for computing the -shortest paths, the shortest disjoint paths and the shortest path avoiding a set of nodes and edges. For any CG with diameter , the time complexity of the proposed algorithms is , where denotes the size of . We show that our proposal outperforms the state of art of topology-agnostic algorithms for disjoint shortest paths and stays competitive with respect to proposals for specific families of CG. Therefore, the proposed algorithms set a base in the design of adaptive and low-complexity routing schemes for networks whose interconnections are defined by CG.
Cayley Graphs, Path computation, K-shortest paths, Interconnection networks