SOURCE-LINKED INTELLIGENCE

GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization

arXiv · AI, language, vision and robotics · article · Aug 24, 2026 · UTC

Common shortest-path algorithms, such as Dijkstra's (SPF), that OSPF uses, provide exact routing solutions but must be recomputed for each network topology, limiting scalability in dynamic or large-scale networks. This paper proposes the GATNextHop model to determine whether a Graph Neural Network, namely the Graph Attention Network, can approximate shortest paths and generalize across topologies. By training on synthetic graphs and evaluating on real-world Internet Service Provider networks from the Internet Topology Zoo, we aim to benchmark our model's ability to learn routing heuristics tha

Read original source ↗ Open in workspace

recordType

paper

region

Global