3DDPS:一种基于三维扩散后验抽样的交通矩阵估计方法

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, HARDWARE & ARCHITECTURE Computer Networks Pub Date : 2025-02-01 Epub Date: 2024-12-26 DOI:10.1016/j.comnet.2024.111007
Minyue Li , Yan Qiao , Rongyao Hu , Pei Zhao , Junjie Wang , Zhenchun Wei , Xuesen Ma , Wenjing Li
{"title":"3DDPS:一种基于三维扩散后验抽样的交通矩阵估计方法","authors":"Minyue Li ,&nbsp;Yan Qiao ,&nbsp;Rongyao Hu ,&nbsp;Pei Zhao ,&nbsp;Junjie Wang ,&nbsp;Zhenchun Wei ,&nbsp;Xuesen Ma ,&nbsp;Wenjing Li","doi":"10.1016/j.comnet.2024.111007","DOIUrl":null,"url":null,"abstract":"<div><div>Traffic matrix (TM) estimation is an essential but high-cost task for network management. A rational way is to estimate the TMs from the low-cost link load measurements by solving a group of linear equations. However, one open challenge is these linear equations are severely ill-posed in most cases. Fortunately, the emerging deep generative models offer new advanced ways to well address the ill-posed problem. In this paper, we leverage the powerful ability of diffusion models to propose a novel TM estimation framework (named 3DDPS-TME). Different from existing generative-based TM estimation methods, our new method reconstructs the raw TM data into 3D-tensor samples and modifies the typical diffusion framework to 3D-UNet to learn the spatio-temporal correlations of TMs. Furthermore, we adopt diffusion posterior sampling (DPS) for conditional sampling to produce an unbiased TM through a single sampling process. Through extensive experiments and comprehensive comparisons with four state-of-the-art baselines, the experimental results demonstrate that our method exhibits a significant superiority in both estimation accuracy and time consumption. Particularly, using only 0.03%<span><math><mo>∼</mo></math></span>10.43% computational cost of the baseline methods, our method makes an improvement of 27%<span><math><mo>∼</mo></math></span>68% in terms of estimation accuracy. The codes of the experiments with the proposed methods are available at <span><span>https://github.com/depositoryL/3DDPS-TME.git</span><svg><path></path></svg></span>.</div></div>","PeriodicalId":50637,"journal":{"name":"Computer Networks","volume":"257 ","pages":"Article 111007"},"PeriodicalIF":4.7000,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"3DDPS: A traffic matrix estimation method based on three-dimensional diffusion posterior sampling\",\"authors\":\"Minyue Li ,&nbsp;Yan Qiao ,&nbsp;Rongyao Hu ,&nbsp;Pei Zhao ,&nbsp;Junjie Wang ,&nbsp;Zhenchun Wei ,&nbsp;Xuesen Ma ,&nbsp;Wenjing Li\",\"doi\":\"10.1016/j.comnet.2024.111007\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><div>Traffic matrix (TM) estimation is an essential but high-cost task for network management. A rational way is to estimate the TMs from the low-cost link load measurements by solving a group of linear equations. However, one open challenge is these linear equations are severely ill-posed in most cases. Fortunately, the emerging deep generative models offer new advanced ways to well address the ill-posed problem. In this paper, we leverage the powerful ability of diffusion models to propose a novel TM estimation framework (named 3DDPS-TME). Different from existing generative-based TM estimation methods, our new method reconstructs the raw TM data into 3D-tensor samples and modifies the typical diffusion framework to 3D-UNet to learn the spatio-temporal correlations of TMs. Furthermore, we adopt diffusion posterior sampling (DPS) for conditional sampling to produce an unbiased TM through a single sampling process. Through extensive experiments and comprehensive comparisons with four state-of-the-art baselines, the experimental results demonstrate that our method exhibits a significant superiority in both estimation accuracy and time consumption. Particularly, using only 0.03%<span><math><mo>∼</mo></math></span>10.43% computational cost of the baseline methods, our method makes an improvement of 27%<span><math><mo>∼</mo></math></span>68% in terms of estimation accuracy. The codes of the experiments with the proposed methods are available at <span><span>https://github.com/depositoryL/3DDPS-TME.git</span><svg><path></path></svg></span>.</div></div>\",\"PeriodicalId\":50637,\"journal\":{\"name\":\"Computer Networks\",\"volume\":\"257 \",\"pages\":\"Article 111007\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2025-02-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computer Networks\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S1389128624008399\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"2024/12/26 0:00:00\",\"PubModel\":\"Epub\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computer Networks","FirstCategoryId":"94","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S1389128624008399","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2024/12/26 0:00:00","PubModel":"Epub","JCR":"Q1","JCRName":"COMPUTER SCIENCE, HARDWARE & ARCHITECTURE","Score":null,"Total":0}
引用次数: 0

摘要

流量矩阵估计是网络管理中一项重要但成本较高的任务。一种合理的方法是通过求解一组线性方程,从低成本链路负荷测量中估计TMs。然而,一个开放的挑战是这些线性方程在大多数情况下是严重不适定的。幸运的是,新兴的深度生成模型提供了新的先进方法来很好地解决不适定问题。在本文中,我们利用扩散模型的强大能力,提出了一个新的TM估计框架(命名为3DDPS-TME)。与现有的基于生成的TM估计方法不同,该方法将原始TM数据重构为3d张量样本,并将典型扩散框架修改为3D-UNet来学习TM的时空相关性。此外,我们采用扩散后验抽样(DPS)进行条件抽样,通过单次抽样过程产生无偏TM。通过广泛的实验和与四个最先进的基线的综合比较,实验结果表明,我们的方法在估计精度和时间消耗方面都具有显着的优势。特别是,仅使用基准方法的0.03% ~ 10.43%的计算成本,我们的方法在估计精度方面提高了27% ~ 68%。用所提出的方法进行实验的代码可在https://github.com/depositoryL/3DDPS-TME.git上找到。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
3DDPS: A traffic matrix estimation method based on three-dimensional diffusion posterior sampling
Traffic matrix (TM) estimation is an essential but high-cost task for network management. A rational way is to estimate the TMs from the low-cost link load measurements by solving a group of linear equations. However, one open challenge is these linear equations are severely ill-posed in most cases. Fortunately, the emerging deep generative models offer new advanced ways to well address the ill-posed problem. In this paper, we leverage the powerful ability of diffusion models to propose a novel TM estimation framework (named 3DDPS-TME). Different from existing generative-based TM estimation methods, our new method reconstructs the raw TM data into 3D-tensor samples and modifies the typical diffusion framework to 3D-UNet to learn the spatio-temporal correlations of TMs. Furthermore, we adopt diffusion posterior sampling (DPS) for conditional sampling to produce an unbiased TM through a single sampling process. Through extensive experiments and comprehensive comparisons with four state-of-the-art baselines, the experimental results demonstrate that our method exhibits a significant superiority in both estimation accuracy and time consumption. Particularly, using only 0.03%10.43% computational cost of the baseline methods, our method makes an improvement of 27%68% in terms of estimation accuracy. The codes of the experiments with the proposed methods are available at https://github.com/depositoryL/3DDPS-TME.git.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Computer Networks
Computer Networks 工程技术-电信学
CiteScore
10.80
自引率
3.60%
发文量
434
审稿时长
8.6 months
期刊介绍: Computer Networks is an international, archival journal providing a publication vehicle for complete coverage of all topics of interest to those involved in the computer communications networking area. The audience includes researchers, managers and operators of networks as well as designers and implementors. The Editorial Board will consider any material for publication that is of interest to those groups.
期刊最新文献
Zero-trust based flexible grayscale adaptive security protection system for power networks with edge intelligence and federated learning Real-time exact solution for Steiner Tree Problem in HAPS networks Risk-aware age-energy trade-off in grant-free NOMA IoT networks via multi-agent deep reinforcement learning Adaptive traffic optimization through multi-scale planning and parallel flow allocation in satellite–terrestrial integrated networks AoI-aware privacy-preserving computation offloading in the internet of vehicles using GRPO
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1