Chao Wang;Jiuzhen Zeng;Laurence T. Yang;Xiangli Yang;Xianjun Deng;Hao Wang
{"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}
引用次数: 0
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 ${{\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.