cs.LGAug 24, 2026

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

Authors: Chia-Hong Chou, Katerina Potika

Organizations: Department of Computer Science San Jos´e State University San Jos´e, CA

Abstract

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 that transfer across network structures. Performance will be evaluated in terms of accuracy, inference speed, and generalization, comparing the GNN against Dijkstra's algorithm to quantify trade-offs between learned and classical routing approaches.

Figures & tables

Explore similar work

CardsList
  1. Graph Neural Networks are Heuristics

    Jan 19, 2026Yimeng Min, Carla P. GomesTraveling Salesperson ProblemGraph Neural Networks

  2. Learning to Cover Locally: Graph Neural Combinatorial Optimization under a Hard Information Horizon

    Sep 30, 2026Johannes F. Loevenich, Thies Moehlenhof, Laurin Holz +3Graph Neural NetworksApproximation Algorithms