Chao Wang;Jiuzhen Zeng;Laurence T. Yang;Xiangli Yang;Xianjun Deng;Hao Wang
{"title":"基于Hankel张量空间的网络层析恢复Web 3.0 OD流量图","authors":"Chao Wang;Jiuzhen Zeng;Laurence T. Yang;Xiangli Yang;Xianjun Deng;Hao Wang","doi":"10.1109/TNSE.2025.3542603","DOIUrl":null,"url":null,"abstract":"In the emerging Web 3.0, origin-destination (OD) traffic maps play a crucial role in network maintenance and management. However, increasing network size and complexity, as well as insufficient or invalid NetFlow protocol-based measurements pose numerous challenges to recovering traffic maps for Web 3.0. This paper therefore proposes RNT-HTT, a robust Network Tomography model based on Hankel time-structured tensor, to accurately recover OD traffic maps with link loads and a fraction of NetFlow counts in Hankel tensor space. More specifically, we propose to Hankelize both OD traffic and link load matrices to three-way tensors along time direction, which fully exploits time-structured correlations concealed in network data. OD pairs-mode product is also designed to model the relation between the Hankelized OD traffic and link load tensors. On the basis of these, RNT-HTT formulates the recovery problem as a convex optimization program with tensor nuclear and <inline-formula><tex-math>${{\\ell }_{1}}$</tex-math></inline-formula>-norms to respectively effect traffic low-rank and noise sparsity characteristics. In addition, the block-iteration alternating direction method of multipliers (ADMM) and bidirectional pre-sampling schemes are developed to solve RNT-HTT reliably and efficiently. Extensive experiments on three real-world datasets verify effectiveness of RNT-HTT, and corroborate its superior performance over state-of-the-art methods in terms of the recovery accuracy.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"1981-1993"},"PeriodicalIF":6.7000,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"OD Traffic Maps Recovery for Web 3.0 by Network Tomography in Hankel Tensor Space\",\"authors\":\"Chao Wang;Jiuzhen Zeng;Laurence T. Yang;Xiangli Yang;Xianjun Deng;Hao Wang\",\"doi\":\"10.1109/TNSE.2025.3542603\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the emerging Web 3.0, origin-destination (OD) traffic maps play a crucial role in network maintenance and management. However, increasing network size and complexity, as well as insufficient or invalid NetFlow protocol-based measurements pose numerous challenges to recovering traffic maps for Web 3.0. This paper therefore proposes RNT-HTT, a robust Network Tomography model based on Hankel time-structured tensor, to accurately recover OD traffic maps with link loads and a fraction of NetFlow counts in Hankel tensor space. More specifically, we propose to Hankelize both OD traffic and link load matrices to three-way tensors along time direction, which fully exploits time-structured correlations concealed in network data. OD pairs-mode product is also designed to model the relation between the Hankelized OD traffic and link load tensors. On the basis of these, RNT-HTT formulates the recovery problem as a convex optimization program with tensor nuclear and <inline-formula><tex-math>${{\\\\ell }_{1}}$</tex-math></inline-formula>-norms to respectively effect traffic low-rank and noise sparsity characteristics. In addition, the block-iteration alternating direction method of multipliers (ADMM) and bidirectional pre-sampling schemes are developed to solve RNT-HTT reliably and efficiently. Extensive experiments on three real-world datasets verify effectiveness of RNT-HTT, and corroborate its superior performance over state-of-the-art methods in terms of the recovery accuracy.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 3\",\"pages\":\"1981-1993\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-02-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network Science and Engineering\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10902418/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"ENGINEERING, MULTIDISCIPLINARY\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network Science and Engineering","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10902418/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
引用次数: 0
摘要
在新兴的 Web 3.0 中,起源-目的地(OD)流量地图在网络维护和管理中发挥着至关重要的作用。然而,日益增长的网络规模和复杂性,以及基于 NetFlow 协议的测量不足或无效,给 Web 3.0 的流量地图恢复带来了诸多挑战。因此,本文提出了基于 Hankel 时间结构张量的鲁棒网络断层摄影模型 RNT-HTT,以在 Hankel 张量空间中利用链路负载和部分 NetFlow 计数准确恢复 OD 流量图。更具体地说,我们建议将 OD 流量和链路负载矩阵沿时间方向汉克尔化为三向张量,从而充分利用网络数据中隐藏的时间结构相关性。此外,还设计了 OD 成对模式乘积来模拟 Hankel 化的 OD 流量和链路负载张量之间的关系。在此基础上,RNT-HTT 将恢复问题表述为一个凸优化程序,其张量核和 ${{\ell }_{1}}$ 矩分别影响流量低秩和噪声稀疏特性。此外,还开发了分块迭代交替方向乘法(ADMM)和双向预采样方案,以可靠、高效地求解 RNT-HTT。在三个真实世界数据集上进行的广泛实验验证了 RNT-HTT 的有效性,并证实其在恢复精度方面优于最先进的方法。
OD Traffic Maps Recovery for Web 3.0 by Network Tomography in Hankel Tensor Space
In the emerging Web 3.0, origin-destination (OD) traffic maps play a crucial role in network maintenance and management. However, increasing network size and complexity, as well as insufficient or invalid NetFlow protocol-based measurements pose numerous challenges to recovering traffic maps for Web 3.0. This paper therefore proposes RNT-HTT, a robust Network Tomography model based on Hankel time-structured tensor, to accurately recover OD traffic maps with link loads and a fraction of NetFlow counts in Hankel tensor space. More specifically, we propose to Hankelize both OD traffic and link load matrices to three-way tensors along time direction, which fully exploits time-structured correlations concealed in network data. OD pairs-mode product is also designed to model the relation between the Hankelized OD traffic and link load tensors. On the basis of these, RNT-HTT formulates the recovery problem as a convex optimization program with tensor nuclear and ${{\ell }_{1}}$-norms to respectively effect traffic low-rank and noise sparsity characteristics. In addition, the block-iteration alternating direction method of multipliers (ADMM) and bidirectional pre-sampling schemes are developed to solve RNT-HTT reliably and efficiently. Extensive experiments on three real-world datasets verify effectiveness of RNT-HTT, and corroborate its superior performance over state-of-the-art methods in terms of the recovery accuracy.
期刊介绍:
The proposed journal, called the IEEE Transactions on Network Science and Engineering (TNSE), is committed to timely publishing of peer-reviewed technical articles that deal with the theory and applications of network science and the interconnections among the elements in a system that form a network. In particular, the IEEE Transactions on Network Science and Engineering publishes articles on understanding, prediction, and control of structures and behaviors of networks at the fundamental level. The types of networks covered include physical or engineered networks, information networks, biological networks, semantic networks, economic networks, social networks, and ecological networks. Aimed at discovering common principles that govern network structures, network functionalities and behaviors of networks, the journal seeks articles on understanding, prediction, and control of structures and behaviors of networks. Another trans-disciplinary focus of the IEEE Transactions on Network Science and Engineering is the interactions between and co-evolution of different genres of networks.