2026· Poster Volume 0008 The 2026 Twenty-Second International Conference on Intelligent Computing July 23-26, 2026 Toronto, Canada· pp. 663-672· 0 citations
TL;DR
A deeply fused GraphSAGE-GRU cell that embeds independent inductive GraphSAGE(SAmple and aggreGatE) encoders directly into each GRU gate, enabling simultaneous spatio-temporal feature extraction at every time step while remaining topology-agnostic.
Abstract
Accurate network traffic prediction is essential for resource management and congestion control in data center networks. Existing spatio-temporal graph neural network (STGNN) models predominantly employ transductive spatial encoders, such as GCN or GAT, whose parameters are tied to a fixed graph structure, preventing generalization to unseen topologies without full retraining. In this paper, we propose Adpt-STGIN (Adaptive Spatio-Temporal Graph Inductive Network), a topology-robust traffic prediction framework built on two key contributions. First, we design a deeply fused GraphSAGE-GRU cell that embeds independent inductive GraphSAGE(SAmple and aggreGatE) encoders directly into each GRU gate, enabling simultaneous spatio-temporal feature extraction at every time step while remaining topology-agnostic. Second, we develop a topology-robust transfer learning framework with a frozen encoder strategy that adapts pretrained models to new topologies by fine-tuning only the lightweight decoder. Experiments on four data center topologies demonstrate that Adpt-STGIN achieves R^2 > 0.99 in pretraining and generalizes to unseen topologies in zero-shot mode with R^2 > 0.994, confirming the practical efficiency of the proposed framework.
This framework introduces an adaptive graph learning module that dynamically infers meaningful connectivity relationships among traffic sensors—not relying on fixed geographic or distance-based assumptions—but instead leveraging real-time traffic correlations and node-level embeddings, enabling effective modeling of both localized spatial interactions and multi-scale temporal dependencies across varying prediction horizons.
Zhengxu Luan, Huan Wang, Miaobowen Wang et al.· Computers and artificial int...· 0 citations
Traffic sensors provide real-time measurements of current traffic conditions, whereas traffic management applications require forecasts of future traffic speed or flow. This study considers the incremental expansion of an operating sensor network, in which a pre-trained network-level forecasting model must predict traffic states at sensor locations that were absent during training. Many spatio-temporal graph neural networks rely on sensor-specific embeddings and graph connections learned from data-rich training networks. These representations are undefined for previously unseen locations, limiting the direct application of pre-trained adaptive-graph forecasters during sensor-network expansion. To address this cold-start problem, we propose support-conditioned sensor-adaptive meta-graph learning (SC-SAMG), which derives target-node representations and spatial dependencies from a short support period. The framework combines a support-set encoder, a task-specific graph learner, and first-order meta-learning to adapt the network-level forecaster using one to seven days of target observations. Experiments on four traffic benchmarks evaluate forecasts of speed or flow over the next 15–60 min under a leakage-controlled held-out-node protocol. SC-SAMG consistently outperforms fine-tuned gated recurrent unit (GRU), adaptive graph convolutional recurrent network (AGCRN), and diffusion convolutional recurrent neural network (DCRNN) baselines. It reduces mean absolute error (MAE) by up to 11% relative to the adaptive-graph baseline and by up to 7% relative to the diffusion convolutional baseline. These results demonstrate the potential of support-conditioned graph adaptation for incorporating previously unseen sensor locations into existing network-level traffic forecasting systems.
Can Wang, Zhiyu Wang, Weijie Wang et al.· Italian National Conference...· 0 citations
A spatiotemporal graph Transformer framework that jointly models spatial interactions and temporal dependencies for traffic forecasting in edge computing and leverages Transformer-based self-attention to learn long-range temporal patterns from historical traffic observations is proposed.
Accurate network traffic prediction is important for the autonomy, resilience and resource orchestration of 6G and AI-native communication infrastructures, while also supporting green networking and digital twin network applications. However, existing data-driven prediction models face several limitations: over-reliance on massive labeled data, physically implausible predictions, black-box non-interpretability and over-parameterization that impairs edge deployment. To address these issues, this paper proposes a Physics-Informed Network Traffic Prediction (PINTP) framework for graph topology network traffic prediction, which formalizes network traffic evolution as Graph-based Advection–Diffusion–Reaction (ADR) equations and embeds physical regularization into the neural architecture. The framework adopts a hybrid differentiation paradigm unifying automatic differentiation for temporal dynamics and spectral graph theory-derived operators for discrete spatial topologies, and designs a physics-constrained composite loss function with data-driven collocation to balance data fidelity and physical consistency. Experiments are conducted in two complementary settings: a 100-node synthetic random-graph benchmark that evaluates the full graph-topological formulation, and a topology-unavailable real-world telemetry proxy based on Alibaba Cluster Trace v2018 for evaluating sparse-label physics-informed temporal regularization. Comparative analysis with mainstream baselines, including Multilayer Perceptron (MLP), Spatio-Temporal Graph Convolutional Network (STGCN), Graph WaveNet, Transformer, Temporal Convolutional Network (TCN), and XGBoost, shows that the proposed PINTP/PINN implementation achieves a test R2 of 0.898 and MSE of 0.000723 on the 100-node synthetic graph benchmark, close to the strongest Transformer result (R2=0.900, MSE = 0.000710), while using substantially fewer trainable parameters. PINTP/PINN also outperforms Graph WaveNet, STGCN and TCN in this setting, indicating that physics-informed regularization can remain competitive as graph size increases. On the Alibaba proxy task, PINTP/PINN achieves the strongest result among the evaluated models with a test R2 of 0.963. In an independent Alibaba ablation protocol, physical regularization (e.g., λ=10.0) reduces the mean squared error by 89.15% compared with pure data-driven models and helps mitigate overfitting. This work presents a systematic PINTP framework for graph topology network traffic prediction, achieving competitive prediction accuracy with high parameter efficiency and a degree of physical interpretability. It helps address several limitations of traditional data-driven models, indicates potential for future deployment-oriented studies on real-time network management and resource-constrained edge analytics, and provides an interpretable modeling route for physics-informed network analytics in next-generation communication systems.
Yuhao Zhang, Yuhao Feng, Suyu Zhang et al.· Electronics· 0 citations
A novel adaptive traffic signal control framework by integrating Attention-based Spatio-Temporal Graph Convolutional Networks (ASTGCN) with Multi-Agent Deep Deterministic Policy Gradient (MADDPG) is proposed, providing a scalable and data-driven solution for intelligent traffic signal control in urban traffic networks, supporting the development of smart mobility systems.
Jing Wang, Xiaopeng Wang, Yang Mo et al.· Scientific Reports· 0 citations