Skip to main content
CenXiv.org
This website is in trial operation, support us!
We gratefully acknowledge support from all contributors.
Contribute
Donate
cenxiv logo > cs > arXiv:2509.15072

Help | Advanced Search

Computer Science > Machine Learning

arXiv:2509.15072 (cs)
[Submitted on 18 Sep 2025 ]

Title: Improving Internet Traffic Matrix Prediction via Time Series Clustering

Title: 通过时间序列聚类改进互联网流量矩阵预测

Authors:Martha Cash, Alexander Wyglinski
Abstract: We present a novel framework that leverages time series clustering to improve internet traffic matrix (TM) prediction using deep learning (DL) models. Traffic flows within a TM often exhibit diverse temporal behaviors, which can hinder prediction accuracy when training a single model across all flows. To address this, we propose two clustering strategies, source clustering and histogram clustering, that group flows with similar temporal patterns prior to model training. Clustering creates more homogeneous data subsets, enabling models to capture underlying patterns more effectively and generalize better than global prediction approaches that fit a single model to the entire TM. Compared to existing TM prediction methods, our method reduces RMSE by up to 92\% for Abilene and 75\% for G\'EANT. In routing scenarios, our clustered predictions also reduce maximum link utilization (MLU) bias by 18\% and 21\%, respectively, demonstrating the practical benefits of clustering when TMs are used for network optimization.
Abstract: 我们提出了一种新的框架,利用时间序列聚类来改进使用深度学习(DL)模型的互联网流量矩阵(TM)预测。 TM中的流量通常表现出多样的时间行为,这在跨所有流量训练单一模型时可能会影响预测准确性。 为了解决这个问题,我们提出了两种聚类策略,源聚类和直方图聚类,在模型训练之前将具有相似时间模式的流量分组。 聚类创建了更同质的数据子集,使模型能够更有效地捕捉潜在模式,并比全局预测方法表现得更好,这些方法将单一模型拟合到整个TM。 与现有的TM预测方法相比,我们的方法将Abilene的RMSE降低了高达92%,将GÉANT的RMSE降低了高达75%。 在路由场景中,我们的聚类预测分别将最大链路利用率(MLU)偏差减少了18%和21%,证明了在TM用于网络优化时聚类的实际优势。
Comments: Accepted to ICMLA 2025
Subjects: Machine Learning (cs.LG)
Cite as: arXiv:2509.15072 [cs.LG]
  (or arXiv:2509.15072v1 [cs.LG] for this version)
  https://doi.org/10.48550/arXiv.2509.15072
arXiv-issued DOI via DataCite

Submission history

From: Martha Cash [view email]
[v1] Thu, 18 Sep 2025 15:33:33 UTC (308 KB)
Full-text links:

Access Paper:

    View a PDF of the paper titled
  • View Chinese PDF
  • View PDF
  • HTML (experimental)
  • TeX Source
license icon view license
Current browse context:
cs.LG
< prev   |   next >
new | recent | 2025-09
Change to browse by:
cs

References & Citations

  • NASA ADS
  • Google Scholar
  • Semantic Scholar
a export BibTeX citation Loading...

BibTeX formatted citation

×
Data provided by:

Bookmark

BibSonomy logo Reddit logo

Bibliographic and Citation Tools

Bibliographic Explorer (What is the Explorer?)
Connected Papers (What is Connected Papers?)
Litmaps (What is Litmaps?)
scite Smart Citations (What are Smart Citations?)

Code, Data and Media Associated with this Article

alphaXiv (What is alphaXiv?)
CatalyzeX Code Finder for Papers (What is CatalyzeX?)
DagsHub (What is DagsHub?)
Gotit.pub (What is GotitPub?)
Hugging Face (What is Huggingface?)
Papers with Code (What is Papers with Code?)
ScienceCast (What is ScienceCast?)

Demos

Replicate (What is Replicate?)
Hugging Face Spaces (What is Spaces?)
TXYZ.AI (What is TXYZ.AI?)

Recommenders and Search Tools

Influence Flower (What are Influence Flowers?)
CORE Recommender (What is CORE?)
IArxiv Recommender (What is IArxiv?)
  • Author
  • Venue
  • Institution
  • Topic

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)
  • About
  • Help
  • contact arXivClick here to contact arXiv Contact
  • subscribe to arXiv mailingsClick here to subscribe Subscribe
  • Copyright
  • Privacy Policy
  • Web Accessibility Assistance
  • arXiv Operational Status
    Get status notifications via email or slack

京ICP备2025123034号