Wenyue Sun;Qian Chen;Xuehua Song;Elisa Bertino;Changda Wang
{"title":"基于链路负载采样的网络流量矩阵估算","authors":"Wenyue Sun;Qian Chen;Xuehua Song;Elisa Bertino;Changda Wang","doi":"10.1109/TNSE.2025.3533745","DOIUrl":null,"url":null,"abstract":"Traffic Matrix (TM) represents traffic between all Origin-Destination (OD) node pairs in a network, playing a crucial role in network management. While the methods for TM acquisition typically require scaling each link load in a network, measurement costs arise drastically as the number of links grows exponentially with the number of nodes. To address this issue while achieving TM with acceptable accuracy aligned with various network management requirements, the paper proposes two novel methods. The first is the ME-TMEIM (TM Estimation with Incomplete Measurement Based on Maximum Entropy) method, an efficient approach with yet acceptable accuracy. The second is the D-TMEIM (Dynamic TMEIM) method. Compared to the ME-TMEIM method, the D-TMEIM method trades the TM's acquisition accuracy for efficiency. It adds temporal constraints on network traffic to improve the precision of the obtained missing link loads, based on which the TM is generated using the CS-OMP (Compressed Sensing-Orthogonal Matching Pursuit) algorithm. Experimental results using publicly available Abilene and GÉANT networks demonstrate that the proposed methods not only enhance TM acquisition efficiency but also maintain nearly the same accuracy as the known methods that acquire TM through exhaustive links measurement.","PeriodicalId":54229,"journal":{"name":"IEEE Transactions on Network Science and Engineering","volume":"12 3","pages":"1524-1539"},"PeriodicalIF":6.7000,"publicationDate":"2025-01-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Network Traffic Matrix Estimation Based on Link Loads Sampling\",\"authors\":\"Wenyue Sun;Qian Chen;Xuehua Song;Elisa Bertino;Changda Wang\",\"doi\":\"10.1109/TNSE.2025.3533745\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic Matrix (TM) represents traffic between all Origin-Destination (OD) node pairs in a network, playing a crucial role in network management. While the methods for TM acquisition typically require scaling each link load in a network, measurement costs arise drastically as the number of links grows exponentially with the number of nodes. To address this issue while achieving TM with acceptable accuracy aligned with various network management requirements, the paper proposes two novel methods. The first is the ME-TMEIM (TM Estimation with Incomplete Measurement Based on Maximum Entropy) method, an efficient approach with yet acceptable accuracy. The second is the D-TMEIM (Dynamic TMEIM) method. Compared to the ME-TMEIM method, the D-TMEIM method trades the TM's acquisition accuracy for efficiency. It adds temporal constraints on network traffic to improve the precision of the obtained missing link loads, based on which the TM is generated using the CS-OMP (Compressed Sensing-Orthogonal Matching Pursuit) algorithm. Experimental results using publicly available Abilene and GÉANT networks demonstrate that the proposed methods not only enhance TM acquisition efficiency but also maintain nearly the same accuracy as the known methods that acquire TM through exhaustive links measurement.\",\"PeriodicalId\":54229,\"journal\":{\"name\":\"IEEE Transactions on Network Science and Engineering\",\"volume\":\"12 3\",\"pages\":\"1524-1539\"},\"PeriodicalIF\":6.7000,\"publicationDate\":\"2025-01-28\",\"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/10856392/\",\"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/10856392/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"ENGINEERING, MULTIDISCIPLINARY","Score":null,"Total":0}
Network Traffic Matrix Estimation Based on Link Loads Sampling
Traffic Matrix (TM) represents traffic between all Origin-Destination (OD) node pairs in a network, playing a crucial role in network management. While the methods for TM acquisition typically require scaling each link load in a network, measurement costs arise drastically as the number of links grows exponentially with the number of nodes. To address this issue while achieving TM with acceptable accuracy aligned with various network management requirements, the paper proposes two novel methods. The first is the ME-TMEIM (TM Estimation with Incomplete Measurement Based on Maximum Entropy) method, an efficient approach with yet acceptable accuracy. The second is the D-TMEIM (Dynamic TMEIM) method. Compared to the ME-TMEIM method, the D-TMEIM method trades the TM's acquisition accuracy for efficiency. It adds temporal constraints on network traffic to improve the precision of the obtained missing link loads, based on which the TM is generated using the CS-OMP (Compressed Sensing-Orthogonal Matching Pursuit) algorithm. Experimental results using publicly available Abilene and GÉANT networks demonstrate that the proposed methods not only enhance TM acquisition efficiency but also maintain nearly the same accuracy as the known methods that acquire TM through exhaustive links measurement.
期刊介绍:
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.