基于链路负载采样的网络流量矩阵估算

IF 6.7 2区 计算机科学 Q1 ENGINEERING, MULTIDISCIPLINARY
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}
引用次数: 0

摘要

流量矩阵TM (Traffic Matrix)表示网络中所有OD (Origin-Destination)节点对之间的流量,在网络管理中起着至关重要的作用。虽然获取TM的方法通常需要扩展网络中的每个链路负载,但随着链路数量随节点数量呈指数增长,测量成本会急剧上升。为了解决这个问题,同时实现符合各种网络管理要求的可接受精度的TM,本文提出了两种新方法。首先是基于最大熵的不完全测量TM估计(ME-TMEIM)方法,这是一种有效的方法,但精度可接受。第二种是D-TMEIM (Dynamic TMEIM)方法。与ME-TMEIM方法相比,D-TMEIM方法以TM的获取精度为代价换取了效率。在此基础上,利用CS-OMP (Compressed Sensing-Orthogonal Matching Pursuit,压缩感知-正交匹配追踪)算法生成TM。利用公开的Abilene和GÉANT网络进行的实验结果表明,本文提出的方法不仅提高了TM的获取效率,而且与通过穷举链路测量获取TM的方法保持了几乎相同的精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
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.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network Science and Engineering
IEEE Transactions on Network Science and Engineering Engineering-Control and Systems Engineering
CiteScore
12.60
自引率
9.10%
发文量
393
期刊介绍: 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.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信