DSTFView: Multi-View Cloud-Edge Workload Forecasting with Dual-Input Spatio-Temporal-Frequency Modeling
Summary
DSTFView is a dual-input spatio-temporal-frequency multi-view framework for cloud-edge workload forecasting, jointly modeling closeness and period dependencies with an adaptive fusion mechanism to capture abrupt changes.
View Cached Full Text
Cached at: 07/28/26, 06:24 AM
# DSTFView: Multi-View Cloud-Edge Workload Forecasting with Dual-Input Spatio-Temporal-Frequency Modeling
Source: [https://arxiv.org/html/2607.22565](https://arxiv.org/html/2607.22565)
11institutetext:1Xinjiang Key Laboratory of Intelligent Computing and Smart Applications, School of Software, Xinjiang University, Urumqi, 830017, China
11email:liqingzhong@stu\.xju\.edu\.cn, \{huima, zyj\}@xju\.edu\.cn, \{maqingchang, longzhou\}@stu\.xju\.edu\.cn###### Abstract
With the widespread deployment of edge\-side AI inference, edge platforms are increasingly required to support latency\-sensitive, highly concurrent, and reliability\-critical applications\. However, existing methods often struggle to balance multidimensional feature modeling and forecasting efficiency in collaborative cloud\-edge environments\. To address this issue, we propose DSTFView, a dual\-input spatio\-temporal\-frequency multi\-view workload forecasting framework for collaborative cloud\-edge environments\. It jointly models closeness and period dependencies and extracts spatial, temporal, and frequency\-domain dependencies\. Besides, it designs an adaptive fusion mechanism and adjusts the contribution of each view to capture abrupt changes\. Experimental results on the CPU and TP datasets demonstrate that DSTFView consistently outperforms representative baselines across multiple forecasting horizons and evaluation metrics\.
## 1Introduction
With the ongoing evolution of edge\-cloud infrastructures and the rapid expansion of edge\-side AI inference services, edge platforms are increasingly expected to accommodate latency\-sensitive and highly concurrent applications despite limited resource availability\[[16](https://arxiv.org/html/2607.22565#bib.bib16),[28](https://arxiv.org/html/2607.22565#bib.bib28)\]\. Under such circumstances, edge workload forecasting is important for optimizing resource management, decreasing resource waste and operational expenses while preserving service quality\[[3](https://arxiv.org/html/2607.22565#bib.bib3)\]\.
However, edge workload forecasting remains a challenging task because it is difficult to uniformly characterize and integrate the heterogeneous, multi\-source, and multi\-pattern features in edge workloads\[[14](https://arxiv.org/html/2607.22565#bib.bib14)\]\. Specifically, edge workloads typically exhibit spatial dependencies across sites or virtual machines, temporal dynamics such as burstiness and trend shifts, and frequency\-domain regularities arising from service cycles and recurring usage behaviors\. Meanwhile, edge environments also involve multi\-relational and time\-varying interactions, including geographic proximity, service affinity, and shared\-resource coupling\. However, due to dynamic deployment, user mobility, and other latent factors, these dependency relationships are often only partially observable and inherently uncertain\. As a result, existing methods that focus on temporal dependencies\[[1](https://arxiv.org/html/2607.22565#bib.bib1),[20](https://arxiv.org/html/2607.22565#bib.bib20),[13](https://arxiv.org/html/2607.22565#bib.bib13),[22](https://arxiv.org/html/2607.22565#bib.bib22)\], frequency\-aware patterns\[[2](https://arxiv.org/html/2607.22565#bib.bib2)\], or spatio\-temporal dependencies\[[19](https://arxiv.org/html/2607.22565#bib.bib19)\]from a single or local perspective are difficult to directly apply to edge workload forecasting\. This issue becomes particularly critical in multi\-step forecasting, where the lack of unified modeling for heterogeneous relations and multi\-dimensional features can easily lead to poor prediction performance\.
Another important challenge lies in balancing prediction accuracy and system efficiency in collaborative cloud\-edge forecasting\[[10](https://arxiv.org/html/2607.22565#bib.bib10)\]\. Methods that rely only on edge\-side information may overlook cross\-site dependencies, whereas cloud\-centric solutions often introduce noticeable uplink delay and communication cost\. To alleviate this issue, collaborative cloud\-edge paradigms have been investigated by combining cloud\-side global modeling with edge\-side local refinement\[[11](https://arxiv.org/html/2607.22565#bib.bib11)\]\. However, existing cloud\-edge frameworks perform poorly in multi\-step forecasting, especially when the exchanged representations cannot adequately capture multi\-scale periodic behaviors, or when heterogeneous relations bring in task\-irrelevant or unreliable connections that weaken correlation modeling over extended horizons\.
To address the aforementioned challenges, we propose DSTFView, an edge workload forecasting framework for collaborative cloud\-edge architectures\. DSTFView follows a two\-stage collaborative cloud\-edge forecasting pipeline and introduces a dual\-input spatio\-temporal\-frequency modeling mechanism into both the global and local stages, where the closeness input captures recent dynamics and the period input models recurring temporal patterns\. At the cloud\-side global stage, the framework leverages lightweight aggregated signals to learn site\-level global priors, thereby exploring cross\-site dependencies while controlling communication overhead\. At the edge\-side local stage, it further integrates fine\-grained workload sequences with cloud\-provided global guidance to refine VM\-level multi\-step forecasts\. In addition, DSTFView incorporates an adaptive multi\-view graph fusion mechanism into both stages, enabling the model to dynamically integrate different relational views and enhance dependency modeling\.
The main contributions of this work are summarized as follows\.Firstly, we propose a novel dual\-input spatio\-temporal\-frequency architecture for collaborative cloud\-edge multi\-step forecasting\.Secondly, we design an adaptive multi\-view graph fusion strategy to dynamically integrate different relational views under varying workload patterns\.Thirdly, we build a global\-local collaborative forecasting pipeline and conduct extensive experiments on the CPU and TP datasets\. The results demonstrate that DSTFView consistently outperforms baseline methods\.
## 2Related Work
### 2\.1Time Series Prediction
Recently, cloud\-side time series forecasting can generally be categorized into three main approaches: temporal, spatio\-temporal, and frequency\-aware forecasting methods\[[9](https://arxiv.org/html/2607.22565#bib.bib9)\]\.
Temporal forecasting methods\.Nie et al\.\[[15](https://arxiv.org/html/2607.22565#bib.bib15)\]introduced PatchTST, which divides time series into patches and learns temporal dependencies with a Transformer\-based architecture\. Wu et al\.\[[20](https://arxiv.org/html/2607.22565#bib.bib20)\]proposed TimesNet, which explicitly models multi\-period patterns in long\-range forecasting\. Liu et al\.\[[13](https://arxiv.org/html/2607.22565#bib.bib13)\]developed iTransformer by reformulating the attention mechanism to capture variable\-wise interactions, whereas Zhang et al\.\[[22](https://arxiv.org/html/2607.22565#bib.bib22)\]presented Crossformer to model cross\-scale dependencies through hierarchical feature interactions\.
Spatio\-temporal forecasting methods\.Xie et al\.\[[8](https://arxiv.org/html/2607.22565#bib.bib8)\]proposed MegaCRN, which incorporates memory\-based components to capture dynamic interactions among nodes\. Zhou et al\.\[[26](https://arxiv.org/html/2607.22565#bib.bib26)\]developed a graph\-transformer\-based forecasting model that injects spatio\-temporal structural information into the attention mechanism and employs specialized modules to characterize heterogeneous traffic dynamics\. Zheng and Xie\[[24](https://arxiv.org/html/2607.22565#bib.bib24)\]introduced DST\-SGNN, which combines Stiefel\-manifold\-constrained spectral graph operations with an efficient dynamic graph optimization strategy to learn time\-varying spatial relationships\.
Frequency\-aware forecasting methods\.They emphasize spectral representations for capturing periodicity and multi\-scale patterns\. Zhou et al\.\[[27](https://arxiv.org/html/2607.22565#bib.bib27)\]proposed FEDformer, which utilizes frequency\-domain operators to extract informative spectral components for long\-horizon prediction\. Zhao et al\.\[[23](https://arxiv.org/html/2607.22565#bib.bib23)\]introduced TFEGRU, which incorporates a time\-frequency enhancement module and combines GRU with multi\-head self\-attention for cloud workload forecasting\.
However, existing methods cannot effectively model heterogeneous multi\-source relations and spatio\-temporal\-frequency features, which leads to poor performance in edge workload forecasting\.
### 2\.2Collaborative Cloud–Edge Forecasting
Collaborative forecasting in cloud–edge environments seeks to balance prediction accuracy and system cost by integrating cloud\-level global modeling with edge\-level local adaptation\. Li et al\.\[[11](https://arxiv.org/html/2607.22565#bib.bib11)\]proposed ELASTIC, a two\-stage framework that aggregates VM\-level signals at the edge for cloud\-side global modeling and then refines predictions through edge\-side disaggregation\. Also, they\[[12](https://arxiv.org/html/2607.22565#bib.bib12)\]extended this idea with improved aggregation/disaggregation modules and extra training objectives for stronger cloud–edge collaboration\.
However, existing methods often capture only limited inter\-site relations or use coarse fusion strategies, which makes it difficult to model the complex dependencies in edge environments, particularly when workload periodicity is strong and site correlations are diverse\.
## 3Method
### 3\.1Framework Overview
Figure 1:Structure of DSTFView model\.As shown in Fig\.[1](https://arxiv.org/html/2607.22565#S3.F1),DSTFViewadopts a collaborative two\-stage cloud\-edge forecasting framework\. At the edge side, historical VM\-level workload traces are collected at each site and compressed by a learnable*Aggregation Layer*into lightweight site\-level sequences\. These aggregated representations are then transmitted to the cloud to reduce communication cost\. In the cloud\-side global stage, the uploaded sequences from all participating sites are used to perform global dual\-input spatio\-temporal\-frequency \(STF\) modeling over multi\-view site graphs, producing coarse\-grained site\-level multi\-step forecasts\. The cloud\-side predictions are subsequently returned to each edge site, where a local model carries out dual\-input STF modeling at VM granularity based on intra\-site multi\-view graphs\. Finally, a*Disaggregation Layer*projects the site\-level cloud forecasts back to the VM level and combines them with local predictions, yielding the final VM\-level multi\-step forecasting results\.
### 3\.2Notations and Problem Formulation
We consider a collaborative cloud–edge paradigm withMMedge sites, where sitemmhostsNmN\_\{m\}VMs\. LetCCdenote the number of workload variables andHHthe prediction horizon\. For dual\-input temporal modeling, letPcP\_\{c\}andPpP\_\{p\}denote the lengths of the closeness sequence and the period sequence, respectively\.
At timett, the VM\-level closeness input and period input at sitemmare denoted by𝐗mc∈ℝNm×Pc×C\\mathbf\{X\}\_\{m\}^\{c\}\\in\\mathbb\{R\}^\{N\_\{m\}\\times P\_\{c\}\\times C\}and𝐗mp∈ℝNm×Pp×C\\mathbf\{X\}\_\{m\}^\{p\}\\in\\mathbb\{R\}^\{N\_\{m\}\\times P\_\{p\}\\times C\}, respectively\. The prediction target is denoted by𝐗mt:t\+H−1∈ℝNm×H×C\\mathbf\{X\}\_\{m\}^\{t:t\+H\-1\}\\in\\mathbb\{R\}^\{N\_\{m\}\\times H\\times C\}\. Our goal is to learn a collaborative forecasterℱ\\mathcal\{F\}such that
𝐗^mt:t\+H−1=ℱ\(𝐗mc,𝐗mp\),∀m∈\{1,…,M\}\.\\widehat\{\\mathbf\{X\}\}\_\{m\}^\{t:t\+H\-1\}=\\mathcal\{F\}\\\!\\left\(\\mathbf\{X\}\_\{m\}^\{c\},\\mathbf\{X\}\_\{m\}^\{p\}\\right\),\\quad\\forall m\\in\\\{1,\\dots,M\\\}\.\(1\)
Notation convention\.Scalars are denoted by lowercase symbols \(e\.g\.,Pc,Pp,H,CP\_\{c\},P\_\{p\},H,C\); vectors by bold lowercase symbols; matrices/tensors by bold uppercase symbols \(e\.g\.,𝐗,𝐀\\mathbf\{X\},\\mathbf\{A\}\); and functions/operators by symbols \(e\.g\.,ℱ,fdis,ϕ\\mathcal\{F\},f\_\{\\mathrm\{dis\}\},\\phi\)\.
### 3\.3Global Stage: Aggregation and Cloud\-side STF Forecasting
The global stage consists of an aggregation layer deployed at each edge site and a cloud\-side dual\-input STF predictor\. Its goal is to compress VM\-level traces into lightweight site\-level representations and capture cross\-site dependencies in the cloud\.
For each sitemm, the VM\-level closeness and period inputs are separately compressed into site\-level representations through a learnable aggregation layer, yielding𝐘mc\\mathbf\{Y\}\_\{m\}^\{c\}and𝐘mp\\mathbf\{Y\}\_\{m\}^\{p\}, respectively, where𝐘mc∈ℝ1×Pc×C\\mathbf\{Y\}\_\{m\}^\{c\}\\in\\mathbb\{R\}^\{1\\times P\_\{c\}\\times C\}and𝐘mp∈ℝ1×Pp×C\\mathbf\{Y\}\_\{m\}^\{p\}\\in\\mathbb\{R\}^\{1\\times P\_\{p\}\\times C\}\. By stacking the outputs of all sites, we obtain the cloud\-side dual inputs𝐘c∈ℝM×Pc×C\\mathbf\{Y\}^\{c\}\\in\\mathbb\{R\}^\{M\\times P\_\{c\}\\times C\}and𝐘p∈ℝM×Pp×C\\mathbf\{Y\}^\{p\}\\in\\mathbb\{R\}^\{M\\times P\_\{p\}\\times C\}\.
On the cloud side, we construct an inter\-site multi\-view graph set, denoted as𝒢g=\[𝐀g\(s\),𝐀g\(t\),𝐀g\(a\)\]\\mathcal\{G\}\_\{g\}=\[\{\\mathbf\{A\}\_\{g\}^\{\(s\)\},\\mathbf\{A\}\_\{g\}^\{\(t\)\},\\mathbf\{A\}\_\{g\}^\{\(a\)\}\}\], where𝐀g\(s\)\\mathbf\{A\}\_\{g\}^\{\(s\)\},𝐀g\(t\)\\mathbf\{A\}\_\{g\}^\{\(t\)\}, and𝐀g\(a\)\\mathbf\{A\}\_\{g\}^\{\(a\)\}denote the spatial graph, temporal graph, and Self\-adaptive graph, respectively\.
The global predictor contains a closeness branch and a period branch, which are used to model recent dynamics and recurring patterns, respectively\. For each input branchr∈\{c,p\}r\\in\\\{c,p\\\}, FFT is first employed to extract frequency\-domain features:
𝐅gr=FFT\(𝐘r\)\.\\mathbf\{F\}\_\{g\}^\{r\}=\\operatorname\{FFT\}\(\\mathbf\{Y\}^\{r\}\)\.\(2\)Then, the frequency\-aware representation is fed into the temporal modeling process, where a pair of temporal convolution branches is used to capture temporal dependencies:
𝐓gr=tanh\(TCNa\(𝐅gr\)\)⊙σ\(TCNb\(𝐅gr\)\),\\mathbf\{T\}\_\{g\}^\{r\}=\\tanh\\\!\\big\(\\operatorname\{TCN\}\_\{a\}\(\\mathbf\{F\}\_\{g\}^\{r\}\)\\big\)\\odot\\sigma\\\!\\big\(\\operatorname\{TCN\}\_\{b\}\(\\mathbf\{F\}\_\{g\}^\{r\}\)\\big\),\(3\)where⊙\\odotdenotes element\-wise multiplication\.
In the structural modeling stage, graph convolutions are performed over the three inter\-site graph views, yielding view\-specific representations:
𝐙gr,\(k\)=GCN\(𝐀g\(k\),𝐓gr\),k∈\{s,t,a\}\.\\mathbf\{Z\}\_\{g\}^\{r,\(k\)\}=\\operatorname\{GCN\}\\\!\\left\(\\mathbf\{A\}\_\{g\}^\{\(k\)\},\\mathbf\{T\}\_\{g\}^\{r\}\\right\),\\qquad k\\in\\\{s,t,a\\\}\.\(4\)
To fully exploit the complementary information among different graph views, we introduce an Adaptive Multi\-view Fusion \(AMVF\) module to adaptively reweight the graph representations from the three views\. Specifically, the importance score of thekk\-th view is computed as
egr,\(k\)=ϕg\(𝐙gr,\(k\)\),e\_\{g\}^\{r,\(k\)\}=\\phi\_\{g\}\\\!\\left\(\\mathbf\{Z\}\_\{g\}^\{r,\(k\)\}\\right\),\(5\)whereϕg\(⋅\)\\phi\_\{g\}\(\\cdot\)denotes a learnable scoring function\. The fusion weights are then normalized by a Softmax function:
αgr,\(k\)=exp\(egr,\(k\)\)∑j∈\{s,t,a\}exp\(egr,\(j\)\)\.\\alpha\_\{g\}^\{r,\(k\)\}=\\frac\{\\exp\\\!\\left\(e\_\{g\}^\{r,\(k\)\}\\right\)\}\{\\sum\_\{j\\in\\\{s,t,a\\\}\}\\exp\\\!\\left\(e\_\{g\}^\{r,\(j\)\}\\right\)\}\.\(6\)Accordingly, the fused representation for branchrris given by
𝐙~gr=∑k∈\{s,t,a\}αgr,\(k\)𝐙gr,\(k\)\.\\widetilde\{\\mathbf\{Z\}\}\_\{g\}^\{r\}=\\sum\_\{k\\in\\\{s,t,a\\\}\}\\alpha\_\{g\}^\{r,\(k\)\}\\mathbf\{Z\}\_\{g\}^\{r,\(k\)\}\.\(7\)
After obtaining the fused representations from the closeness and period branches, they are merged and fed into the prediction head to generate the site\-level forecasting result:
𝐘^t:t\+H−1=Headg\(𝐙~gc\+𝐙~gp\)\.\\widehat\{\\mathbf\{Y\}\}^\{t:t\+H\-1\}=\\operatorname\{Head\}\_\{g\}\\\!\\left\(\\widetilde\{\\mathbf\{Z\}\}\_\{g\}^\{c\}\+\\widetilde\{\\mathbf\{Z\}\}\_\{g\}^\{p\}\\right\)\.\(8\)Here,𝐘^t:t\+H−1∈ℝM×H×C\\widehat\{\\mathbf\{Y\}\}^\{t:t\+H\-1\}\\in\\mathbb\{R\}^\{M\\times H\\times C\}denotes the site\-level forecast over the nextHHtime steps\. The forecast corresponding to each edge site is then returned to that site as global guidance\.
### 3\.4Local Stage: Edge\-side STF Forecasting and Refinement
After receiving the cloud\-side forecast, each edge site performs local STF modeling at the VM level and fuses the local prediction with the returned global guidance to generate the final output\.
For each sitemm, we construct an intra\-site multi\-view graph set𝒢m=\[𝐀m\(p\),𝐀m\(l\),𝐀m\(a\)\]\\mathcal\{G\}\_\{m\}=\[\{\\mathbf\{A\}\_\{m\}^\{\(p\)\},\\mathbf\{A\}\_\{m\}^\{\(l\)\},\\mathbf\{A\}\_\{m\}^\{\(a\)\}\}\], where𝐀m\(p\)\\mathbf\{A\}\_\{m\}^\{\(p\)\},𝐀m\(l\)\\mathbf\{A\}\_\{m\}^\{\(l\)\}, and𝐀m\(a\)\\mathbf\{A\}\_\{m\}^\{\(a\)\}denote the physical graph, logical graph, and self\-adaptive graph, respectively, which characterize correlations among VMs from different perspectives\.
Similar to the global predictor, the local predictor also adopts a dual\-input STF architecture\. For each input branchr∈\{c,p\}r\\in\\\{c,p\\\}, frequency\-domain features are first extracted as
𝐅mr=FFT\(𝐗mr\)\.\\mathbf\{F\}\_\{m\}^\{r\}=\\operatorname\{FFT\}\(\\mathbf\{X\}\_\{m\}^\{r\}\)\.\(9\)Temporal dependencies are then modeled by gated temporal convolutions:
𝐓mr=tanh\(TCNa\(𝐅mr\)\)⊙σ\(TCNb\(𝐅mr\)\)\.\\mathbf\{T\}\_\{m\}^\{r\}=\\tanh\\\!\\big\(\\operatorname\{TCN\}\_\{a\}\(\\mathbf\{F\}\_\{m\}^\{r\}\)\\big\)\\odot\\sigma\\\!\\big\(\\operatorname\{TCN\}\_\{b\}\(\\mathbf\{F\}\_\{m\}^\{r\}\)\\big\)\.\(10\)
Next, graph convolutions are conducted over the three intra\-site graph views:
𝐙mr,\(k\)=GCN\(𝐀m\(k\),𝐓mr\),k∈\{p,l,a\}\.\\mathbf\{Z\}\_\{m\}^\{r,\(k\)\}=\\operatorname\{GCN\}\\\!\\left\(\\mathbf\{A\}\_\{m\}^\{\(k\)\},\\mathbf\{T\}\_\{m\}^\{r\}\\right\),\\qquad k\\in\\\{p,l,a\\\}\.\(11\)
Likewise, the local stage also employs AMVF to adaptively fuse the graph representations under different views:
emr,\(k\)=ϕm\(𝐙mr,\(k\)\),e\_\{m\}^\{r,\(k\)\}=\\phi\_\{m\}\\\!\\left\(\\mathbf\{Z\}\_\{m\}^\{r,\(k\)\}\\right\),\(12\)αmr,\(k\)=exp\(emr,\(k\)\)∑j∈\{p,l,a\}exp\(emr,\(j\)\),\\alpha\_\{m\}^\{r,\(k\)\}=\\frac\{\\exp\\\!\\left\(e\_\{m\}^\{r,\(k\)\}\\right\)\}\{\\sum\_\{j\\in\\\{p,l,a\\\}\}\\exp\\\!\\left\(e\_\{m\}^\{r,\(j\)\}\\right\)\},\(13\)𝐙~mr=∑k∈\{p,l,a\}αmr,\(k\)𝐙mr,\(k\)\.\\widetilde\{\\mathbf\{Z\}\}\_\{m\}^\{r\}=\\sum\_\{k\\in\\\{p,l,a\\\}\}\\alpha\_\{m\}^\{r,\(k\)\}\\mathbf\{Z\}\_\{m\}^\{r,\(k\)\}\.\(14\)
Accordingly, the local predictor outputs the VM\-level local forecast:
𝐗^m,localt:t\+H−1=Headl\(𝐙~mc\+𝐙~mp\)\.\\widehat\{\\mathbf\{X\}\}\_\{m,\\mathrm\{local\}\}^\{t:t\+H\-1\}=\\operatorname\{Head\}\_\{l\}\\\!\\left\(\\widetilde\{\\mathbf\{Z\}\}\_\{m\}^\{c\}\+\\widetilde\{\\mathbf\{Z\}\}\_\{m\}^\{p\}\\right\)\.\(15\)
Since the cloud\-side forecast is generated at the site level, it is first mapped back to the VM level through a disaggregation layer, yielding the VM\-aligned global guidance:
𝐗^m,globalt:t\+H−1=fdis\(𝐘^mt:t\+H−1\)\.\\widehat\{\\mathbf\{X\}\}\_\{m,\\mathrm\{global\}\}^\{t:t\+H\-1\}=f\_\{\\mathrm\{dis\}\}\\\!\\left\(\\widehat\{\\mathbf\{Y\}\}\_\{m\}^\{t:t\+H\-1\}\\right\)\.\(16\)
Finally, the VM\-level forecast is obtained by adaptively fusing the local prediction and the disaggregated global guidance:
𝐗^mt:t\+H−1=𝝀m⊙𝐗^m,localt:t\+H−1\+\(1−𝝀m\)⊙𝐗^m,globalt:t\+H−1,\\widehat\{\\mathbf\{X\}\}\_\{m\}^\{t:t\+H\-1\}=\\boldsymbol\{\\lambda\}\_\{m\}\\odot\\widehat\{\\mathbf\{X\}\}\_\{m,\\mathrm\{local\}\}^\{t:t\+H\-1\}\+\(1\-\\boldsymbol\{\\lambda\}\_\{m\}\)\\odot\\widehat\{\\mathbf\{X\}\}\_\{m,\\mathrm\{global\}\}^\{t:t\+H\-1\},\(17\)where𝝀m\\boldsymbol\{\\lambda\}\_\{m\}is a learnable gating tensor\.
## 4Experimental Setup
Table 1:Prediction performance across multiple horizons on CPU dataset\.Table 2:Performance comparison across multiple horizons on TP dataset\.### 4\.1Datasets
To evaluate the effectiveness of*DSTFView*, we conduct experiments on two real\-world datasets collected from Alibaba Cloud\-native Edge Node Service \(ENS\) and the Network Edge Platform \(NEP\)111https://github\.com/xumengwei/EdgeWorkloadsTraces\.\. These datasets represent typical workload patterns in large\-scale cloud–edge environments\.
CPU dataset, collected from Alibaba ENS, it contains CPU utilization traces from 1,728 IaaS virtual machines \(VMs\) across 77 geographically distributed edge sites in China\.TP dataset, collected from Alibaba NEP, it records average network traffic, including uplink and downlink throughput measured inMbpsMbps\. Compared with CPU utilization, network throughput is more sensitive to user mobility and bursty service requests\.
### 4\.2Experimental Details
We adopt Z\-score standardization and divide the dataset into training, validation, and test subsets in chronological order with a ratio of 7:2:1\. All proposed methods are trained with the Adam optimizer, using an initial learning rate of 0\.001 and an ExponentialLR scheduler for decay\. The loss function is mean squared error \(MSE\)\. For both the global and local stages, the batch size is set to 64 and the maximum number of training epochs is 50\. All experiments are executed on a Linux server equipped with four NVIDIA TITAN X \(Pascal\) GPUs, each with 12 GB memory\.
## 5Experimental Results
Table 3:Ablation study of DSTFView under different global graph configurations\.Table 4:Ablation study of DSTFView under different local graph configurations\.### 5\.1Overall Comparison
Tables[1](https://arxiv.org/html/2607.22565#S4.T1)and[2](https://arxiv.org/html/2607.22565#S4.T2)report the forecasting results on the CPU and TP datasets over four prediction horizons \(1/4/8/12\) in terms of MAE, SMAPE, andR2R^\{2\}\. We compare*DSTFView*with representative temporal, spatiotemporal, and collaborative cloud–edge baselines\.
Temporal baselines, such as iTransformer and TimerXer, model each site or VM independently and therefore cannot explicitly capture inter\-entity dependencies\. Spatiotemporal methods, such as OGCGRN and OTSGCCN, consider graph relations, but many rely on a single predefined graph and may not fully reflect the heterogeneous correlations in edge workloads\. ELASTIC and XELASTIC adopt a collaborative cloud–edge pipeline, but they cannot jointly model temporal and frequency patterns or adaptively exploit multiple relational views\.
As shown in Tables[1](https://arxiv.org/html/2607.22565#S4.T1)and[2](https://arxiv.org/html/2607.22565#S4.T2),*DSTFView*consistently achieves the best performance on both datasets\. This advantage mainly comes from two aspects\. Firstly, the proposed dual\-input STF modeling captures recent dynamics, periodic patterns, and spatial correlations in a unified manner\. Also, the adaptive multi\-view fusion mechanism dynamically integrates multiple relational views in both the global and local stages, thereby enabling more effective dependency modeling and improving forecasting accuracy\.
### 5\.2Ablation Study
In this section, we conduct an ablation study to evaluate the contributions of its key components at the*Global Stage*and the*Local Stage*\.
For the global stage, we examine single\-view variants, a dual\-view variant \(*spatial\-temporal*\), and the full model integrating temporal, adaptive, and spatial views\. As reported in Table[3](https://arxiv.org/html/2607.22565#S5.T3), multi\-view combinations generally outperform single\-view settings, and the complete model achieves the best overall results, demonstrating the benefit of jointly modeling temporal, frequency, and spatial information\.
For the local stage, we compare different relation configurations, including Identity, physical\-only, logical\-only, adaptive\-only, and the fused*phy\-log\-adaptive*setting \(AMVF\)\. Table[4](https://arxiv.org/html/2607.22565#S5.T4)shows that adaptive relations consistently improve over the baseline and other single\-view settings, while the fused AMVF configuration achieves the best performance, confirming the effectiveness of combining multiple relation views\.
### 5\.3Visualization Analysis


Figure 2:Visualization results on the CPU and TP dataset\.Fig\.[2](https://arxiv.org/html/2607.22565#S5.F2)presents qualitative forecasting examples for a representative VM under the one\-step\-ahead setting, where subfigure \(a\) corresponds to the CPU dataset and subfigure \(b\) corresponds to the TP dataset\. In the figure, the black curve indicates the ground\-truth series, the red curve denotes*DSTFView*, and the blue curve represents the strongest competing baseline,*XELASTIC*\. As can be observed from Fig\.[2](https://arxiv.org/html/2607.22565#S5.F2),*DSTFView*tracks the target series more closely, especially around peaks, valleys, and local trend reversals, whereas*XELASTIC*exhibits larger deviations in these regions\. This advantage can be attributed to the proposed model’s ability to jointly capture periodic components and short\-term high\-frequency fluctuations through adaptive AMVF\-based fusion, thereby yielding more accurate predictions on both datasets\.
## 6Conclusion
In this study, we propose*DSTFView*, a collaborative cloud–edge framework for workload forecasting\. It uses dual\-input spatio\-temporal\-frequency multi\-view modeling to jointly capture cross\-site dependencies, recent dynamics, and periodic patterns through cloud\-side global forecasting and edge\-side local forecasting\. The adaptive fusion mechanism further highlights informative graph structures\. Experimental results on the CPU and TP datasets demonstrate that*DSTFView*consistently outperforms representative baselines across multiple forecasting horizons\. Future work will focus on dynamic graph construction, continual learning, and integration with resource management tasks such as auto\-scaling and scheduling to improve adaptability and practical value in real edge environments\.
## References
- \[1\]Chen, P\., Zhang, Y\., Cheng, Y\., Shu, Y\., Wang, Y\., Wen, Q\., Yang, B\., Guo, C\.: Pathformer: Multi\-scale transformers with adaptive pathways for time series forecasting\. In: International Conference on Learning Representations \(2024\)
- \[2\]Fan, W\., Zheng, S\., Yi, X\., Cao, W\., Fu, Y\., Bian, J\., Liu, T\.Y\.: DEPTS: Deep expansion learning for periodic time series forecasting\. In: International Conference on Learning Representations \(2022\)
- \[3\]Ghahari\-Bidgoli, M\., Ghobaei\-Arani, M\., Sharif, A\.: An efficient task offloading and auto\-scaling approach for IoT applications in edge computing environment\. Computing107\(5\), 125 \(2025\)
- \[4\]Guo, K\., Hu, Y\., Qian, Z\.S\., Sun, Y\., Gao, J\., Yin, B\.: An optimized temporal\-spatial gated graph convolution network for traffic forecasting\. IEEE Intelligent Transportation Systems Magazine14\(1\), 153–162 \(2022\)
- \[5\]Guo, K\., Hu, Y\., Sun, Y\., Qian, S\., Gao, J\.: Hierarchical graph convolution network for traffic forecasting\. In: Proceedings of the AAAI Conference on Artificial Intelligence\. pp\. 151–159 \(2021\)
- \[6\]Guo, K\., et al\.: Optimized graph convolution recurrent neural network for traffic prediction\. IEEE Transactions on Intelligent Transportation Systems22\(2\), 1138–1149 \(2021\)
- \[7\]Guo, S\., Lin, Y\., Feng, N\., Song, C\.: Attention based spatial\-temporal graph convolutional networks for traffic flow forecasting\. In: Proceedings of the AAAI Conference on Artificial Intelligence\. pp\. 922–929 \(2019\)
- \[8\]Jiang, R\., Wang, X\., Jie, Y\., Chen, C\., Kobayashi, K\., Song, X\., Fukushima, S\., Suzumura, T\.: Spatio\-temporal meta\-graph learning for traffic forecasting\. In: Proceedings of the AAAI Conference on Artificial Intelligence \(2023\)
- \[9\]Kong, X\., Chen, Z\., Liu, W\., Ning, K\., Zhang, L\., Marier, S\.M\., Liu, Y\., Chen, Y\., Xia, F\.: Deep learning for time series forecasting: a survey\. International Journal of Machine Learning and Cybernetics16, 5079–5112 \(2025\)
- \[10\]Kreković, D\., Krivić, P\., Žarko, I\.P\., Kušek, M\., Le\-Phuoc, D\.: Reducing communication overhead in the iot\-edge\-cloud continuum: A survey on protocols and data reduction strategies\. Internet of Things31, 101553 \(2025\)\. https://doi\.org/10\.1016/j\.iot\.2025\.101553
- \[11\]Li, Y\., Yuan, H\., Fu, Z\., Xu, M\., Wang, S\.: ELASTIC: Edge workload forecasting based on collaborative cloud\-edge deep learning\. In: Proceedings of the ACM Web Conference\. pp\. 3056–3066 \(2023\)
- \[12\]Li, Y\., Zhao, P\., Ma, X\., Yuan, H\., Fu, Z\., Xu, M\., Wang, S\.: A collaborative cloud\-edge approach for robust edge workload forecasting\. IEEE Transactions on Mobile Computing24\(4\), 2861–2875 \(2025\)
- \[13\]Liu, Y\., Hu, T\., Zhang, H\., Wu, H\., Wang, S\., Ma, L\., Long, M\.: iTransformer: Inverted transformers are effective for time series forecasting\. arXiv preprint arXiv:2310\.06625 \(2023\)
- \[14\]Ma, X\., Xu, M\., Li, Q\., Li, Y\., Zhou, A\., Wang, S\.: Edge workload prediction based on deep learning\. In: 5G Edge Computing: Technologies, Applications and Future Visions, pp\. 45–61\. Springer, Singapore \(2024\)
- \[15\]Nie, Y\., H\. Nguyen, N\., Sinthong, P\., Kalagnanam, J\.: A time series is worth 64 words: Long\-term forecasting with transformers\. In: International Conference on Learning Representations \(2023\)
- \[16\]Ning, Z\., Hu, H\., Wang, X\., Guo, L\., Guo, S\., Wang, G\., Gao, X\.: Mobile edge computing and machine learning in the Internet of unmanned aerial vehicles: A survey\. ACM Computing Surveys56\(1\), 1–31 \(2023\)
- \[17\]Seo, Y\., Defferrard, M\., Vandergheynst, P\., Bresson, X\.: Structured sequence modeling with graph convolutional recurrent networks\. In: International Conference on Neural Information Processing\. pp\. 362–373\. Springer \(2018\)
- \[18\]Wang, Y\., Wu, H\., Dong, J\., Qin, G\., Zhang, H\., Liu, Y\., Qiu, Y\., Wang, J\., Long, M\.: TimeXer: Empowering transformers for time series forecasting with exogenous variables\. In: Advances in Neural Information Processing Systems\. vol\. 37, pp\. 469–498 \(2024\)
- \[19\]Wang, Z\., Hu, R\., Zhong, B\., Cheng, D\., Feng, J\., Tan, S\.: St\-graphormer: spatio\-temporal graph transformer for end\-to\-end traffic forecasting\. The Journal of Supercomputing81\(896\) \(2025\)
- \[20\]Wu, H\., Hu, T\., Liu, Y\., Zhou, H\., Wang, J\., Long, M\.: TimesNet: Temporal 2D\-Variation modeling for general time series analysis\. In: International Conference on Learning Representations \(2023\)
- \[21\]Wu, H\., Xu, J\., Wang, J\., Long, M\.: Autoformer: Decomposition transformers with auto\-correlation for long\-term series forecasting\. In: Advances in Neural Information Processing Systems\. pp\. 22419–22430 \(2021\)
- \[22\]Zhang, Y\., Yan, J\.: Crossformer: Transformer utilizing cross\-dimension dependency for multivariate time series forecasting\. In: International Conference on Learning Representations \(2023\)
- \[23\]Zhao, F\., Lin, W\., Lin, S\., Zhong, H\., Li, K\.: TFEGRU: Time\-frequency enhanced gated recurrent unit with attention for cloud workload prediction\. IEEE Transactions on Services Computing \(2024\)
- \[24\]Zheng, J\., Xie, L\.: A dynamic stiefel graph neural network for efficient spatio\-temporal time series forecasting\. In: International Joint Conference on Artificial Intelligence \(2025\)
- \[25\]Zhou, H\., Zhang, S\., Peng, J\., Zhang, S\., Li, J\., Xiong, H\., Zhang, W\.: Informer: Beyond efficient transformer for long sequence time\-series forecasting\. In: Proceedings of the AAAI Conference on Artificial Intelligence\. pp\. 11106–11115 \(2021\)
- \[26\]Zhou, J\., Liu, E\., Chen, W\., Zhong, S\., Liang, Y\.: Navigating spatio\-temporal heterogeneity: A graph transformer approach for traffic forecasting\. arXiv preprint arXiv:2408\.10822 \(2024\)
- \[27\]Zhou, T\., Ma, Z\., Wen, Q\., Wang, X\., Sun, L\., Jin, R\.: FEDformer: Frequency enhanced decomposed transformer for long\-term series forecasting\. In: Proceedings of the 39th International Conference on Machine Learning\. vol\. 162, pp\. 27268–27286 \(2022\)
- \[28\]Zhu, G\., Lyu, Z\., Jiao, X\., et al\.: Pushing AI to wireless network edge: An overview on integrated sensing, communication, and computation towards 6G\. Science China Information Sciences66\(3\), 130301 \(2023\)Similar Articles
TSSM: Triaxial State Space Model for Global Station Weather Forecasting with Temporal-Variable-Historical Modeling
This paper proposes TSSM, a triaxial state space model for global station weather forecasting that incorporates historical data aligned by period to improve long-horizon and extreme event prediction. It achieves state-of-the-art performance on the large-scale Weather-5K dataset and demonstrates strong robustness under missing observations.
MV-Forcing: Long Multi-View Video Generation via 4D-Grounded Spatio-Temporal Self-Forcing
MV-Forcing introduces a diffusion framework that combines temporal and view-wise autoregression to generate long, multi-view consistent videos of dynamic scenes, using a 4D geometric bridge and spatio-temporal distillation to enable arbitrary-length generation from a few-step student model.
PESD-TSF: A Period-Aware and Explicit Structured Decomposition Framework for Long-Term Time Series Forecasting
Proposes PESD-TSF, a physics-inspired structured decomposition framework for long-term time series forecasting that addresses periodic perception degradation, trend-noise entanglement, and loss of cross-variable dependencies via multiplicative periodic gating, multi-scale structured encoder, and cross-scale collaborative attention.
Nested Spatio-Temporal Time Series Forecasting
This paper proposes a nested spatiotemporal forecasting framework that uses spectral clustering to construct semantically coherent macro-level regions, which provide top-down guidance for fine-grained micro-level predictions. Experiments on high-dimensional datasets show consistent improvements over state-of-the-art baselines.
MVG-KAN: Multi-View Geo-Wind Guided KAN for PM$_{2.5}$ Forecasting
This paper proposes MVG-KAN, a multi-view model integrating periodic-residual decomposition, a Geo-Wind Graph for wind-aware spatial dependencies, and a temporal KAN head for PM2.5 forecasting, achieving MAE 14.09 on Beijing data.