用双曲几何建模互联网路由,提升延迟预测精度
Temporal Hyperbolic Graph Representation Learning for Scale-Free Internet Routing and Delay Prediction

- 在双曲空间中构建时序图神经网络,捕捉路由的层级结构
- 相比基线模型,延迟预测均方根误差降低6%,重尾样本误差更小
- 适合网络优化、QoS保障等需要高精度延迟预测的场景
预测互联网往返时间(RTT)对路由优化、服务质量(QoS)保障和流量工程至关重要,但受长期时序依赖、动态路由变化和重尾延迟分布影响,仍具挑战性。现有时序图神经网络多在欧氏空间运行,难以刻画互联网路由图的层级与无标度特性。双曲几何更具表现力。我们提出HERMIT(Hyperbolic Edge-aware RTT Modeling via Integrated Topology),结合双曲保持型时序GNN与随机森林回归器,联合实现链路预测与RTT预测。基于HMPTGN,HERMIT引入感知延迟的边特征与可学习边编码器,增强对演化链路状态与路由行为的建模能力。最终的双曲节点表示与历史RTT统计量融合,实现鲁棒延迟预测。在覆盖2015-2024年的大规模真实互联网数据集上评估,HERMIT持续优于仅使用历史RTT统计量的强基线随机森林模型,RMSE降低6%,重尾样本大误差显著减少;同时超越先前双曲TGNN模型(如HMPTGN、HTGN),在链路预测任务上表现更优。结果表明,将双曲时序图学习与树模型回归结合,为真实互联网拓扑中的RTT预测提供了一种可扩展的解决方案。
原文摘要 · Abstract (English)
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.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。