Customizing A* Heuristics for Network Routing
Martin Hitz, T. A. Mueck · Industrial and Engineering Applications of Artificial Intelligence and Expert Systems · 2022
For a given network topology approach built upon the Cayley graph model, A* based routing heuristics are customized to achive fast and fault tolerant routing schemes using network degradation information and path caching. In particular, the characteristic properties of a given network topology are used to optimize traversal heuristics representing the core parts of the routing algorithm. The configuration phase during network setup is controlled by simulated annealing. At runtime of the routing procedure, i.e., during network operation, the resulting heuristics are part of an A*-path finding algorithm which is executed on demand, e.g., if a standard network path is no longer operational or congested.