Routing heuristics for Cayley graph topologies
Martin Hitz, Thomas A. Mueck · 2002
In general, a routing algorithm has to map virtual paths to sequences of physical data transfer operations. The number of physical transmission steps needed to transfer a particular data volume is proportional to the resulting transmission time. In the context of a corresponding optimization process, the Cayley graph model is used to generate and evaluate a large number of different interconnection topologies. Candidates are further evaluated with respect to fast and efficient routing heuristics using A* traversals. Simulated annealing techniques are used to find accurate traversal heuristics for each candidate. The results justify the application of these techniques to a large extent. In fact, the resulting heuristics provide a significant reduction in the number of expanded search nodes during the path-finding process at run-time.>