mlsanityData to 7 Oct 2026

Temporal Hyperbolic Graph Representation Learning for Scale-Free Internet Routing and Delay Prediction

arXiv 2605.28155 ↗First posted 27 May 2026cs.LG cs.NIcited by 0

Not on the map. Why?

Abstract (arXiv)

Predicting Internet round-trip time (RTT) is critical for routing optimization, quality-of-service (QoS) provisioning, and traffic engineering, yet remains challenging due to long-term temporal dependencies, evolving routing dynamics, and heavy-tailed latency distributions. While Temporal Graph Neural Networks (TGNNs) can model evolving network topologies, most existing approaches operate in Euclidean space, which poorly captures the hierarchical and scale-free structure of Internet routing graphs. Hyperbolic geometry provides a more suitable representation space. We propose HERMIT (Hyperbolic Edge-aware RTT Modeling via Integrated Topology), a hybrid framework combining a hyperbolic manifold-preserving temporal GNN with a Random Forest regressor for joint link prediction and RTT prediction. Built on HMPTGN, HERMIT introduces RTT-aware edge features and a learnable edge encoder to improve modeling of evolving link states and routing behavior. The resulting hyperbolic node representations are combined with historical RTT statistics for robust latency prediction. We evaluate HERMIT on a large-scale real Internet dataset spanning 2015-2024. HERMIT consistently outperforms a strong Random Forest baseline using only historical RTT statistics, achieving a 6% RMSE improvement while reducing large errors on heavy-tailed samples. It also surpasses prior hyperbolic TGNN models, including HMPTGN and HTGN, in link prediction performance. These results demonstrate that combining hyperbolic temporal graph learning with tree-based regression provides a scalable solution for RTT prediction in real-world Internet topologies.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 14 of its 30 references that are in the map. First posted on arXiv 27 May 2026.

Builds on

14 of 30 references.

References · 14

  1. 2017Inductive Representation Learning on Large Graphscited by 6,284
  2. 2014DeepWalk: Online Learning of Social Representationscited by 1,543
  3. 2017Poincar'e Embeddings for Learning Hierarchical Representationscited by 674
  4. 2020Temporal Graph Networks for Deep Learning on Dynamic Graphscited by 521
  5. 2020Inductive Representation Learning on Temporal Graphscited by 454
  6. 2019EvolveGCN: Evolving Graph Convolutional Networks for Dynamic Graphscited by 443
  7. 2019Hyperbolic Graph Convolutional Neural Networkscited by 400
  8. 2019Representation Learning for Dynamic Graphs: A Surveycited by 260
  9. 2019Hyperbolic Graph Neural Networkscited by 244
  10. 2018Riemannian Adaptive Optimization Methodscited by 187
  11. 2022ROLAND: Graph Learning Framework for Dynamic Graphscited by 131
  12. 2020Foundations and modelling of dynamic networks using Dynamic Graph Neural Networks: A surveycited by 123
2 more
  1. 2021Discrete-time Temporal Network Embedding via Implicit Hierarchical Learning in Hyperbolic Spacecited by 67
  2. 2023Graph Neural Networks for temporal graphs: State of the art, open challenges, and opportunitiescited by 60

Built on by

Not cited yet.