GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization
This story is from 2026-08-26. It is preserved in the archive; the latest stories are on the live feed.
arXiv:2608.23917v1 Announce Type: new 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 mo…
Read the full story at arXiv cs.LG ↗
Timeline · 1 report
- 2026-08-26 04:00 · arXiv cs.LG
GATNextHop: A GAT for Shortest Path Routing with Cross-Topology Generalization