基于互相干优化的网络监控路径选择

IF 4.7 2区 计算机科学 Q1 COMPUTER SCIENCE, INFORMATION SYSTEMS
XiaoBo Fan
{"title":"基于互相干优化的网络监控路径选择","authors":"XiaoBo Fan","doi":"10.1109/TNSM.2025.3532343","DOIUrl":null,"url":null,"abstract":"Periodically monitoring the state of internal links is important for network diagnosis. One of the major problems in tomography-based network monitoring is to select which paths to measure. In this paper, we propose a new path selection scheme by means of optimizing the mutual coherence of the routing matrix. The proposed scheme exploits the sparse characteristic of link status and follows the matrix design methods in sparse signal theory. By picking the paths with the minimum average mutual coherence, we can recover a sparse vector more accurately. The effectiveness of the proposed algorithms is analyzed theoretically. We conduct simulation experiments of delay estimation on both synthetic and real topologies. The results demonstrate that our scheme can select the most useful paths for network tomography with lowest cost in an acceptable time.","PeriodicalId":13423,"journal":{"name":"IEEE Transactions on Network and Service Management","volume":"22 2","pages":"1461-1472"},"PeriodicalIF":4.7000,"publicationDate":"2025-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Path Selection via Mutual Coherence Optimization in Network Monitoring\",\"authors\":\"XiaoBo Fan\",\"doi\":\"10.1109/TNSM.2025.3532343\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Periodically monitoring the state of internal links is important for network diagnosis. One of the major problems in tomography-based network monitoring is to select which paths to measure. In this paper, we propose a new path selection scheme by means of optimizing the mutual coherence of the routing matrix. The proposed scheme exploits the sparse characteristic of link status and follows the matrix design methods in sparse signal theory. By picking the paths with the minimum average mutual coherence, we can recover a sparse vector more accurately. The effectiveness of the proposed algorithms is analyzed theoretically. We conduct simulation experiments of delay estimation on both synthetic and real topologies. The results demonstrate that our scheme can select the most useful paths for network tomography with lowest cost in an acceptable time.\",\"PeriodicalId\":13423,\"journal\":{\"name\":\"IEEE Transactions on Network and Service Management\",\"volume\":\"22 2\",\"pages\":\"1461-1472\"},\"PeriodicalIF\":4.7000,\"publicationDate\":\"2025-01-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IEEE Transactions on Network and Service Management\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://ieeexplore.ieee.org/document/10848149/\",\"RegionNum\":2,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q1\",\"JCRName\":\"COMPUTER SCIENCE, INFORMATION SYSTEMS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IEEE Transactions on Network and Service Management","FirstCategoryId":"94","ListUrlMain":"https://ieeexplore.ieee.org/document/10848149/","RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

摘要

定期监测内部链路的状态对网络诊断具有重要意义。在基于层析成像的网络监测中,选择测量路径是一个主要问题。本文提出了一种新的路径选择方案,通过优化路由矩阵的相互相干性。该方案利用链路状态的稀疏特性,遵循稀疏信号理论中的矩阵设计方法。通过选取平均相互相干最小的路径,可以更准确地恢复稀疏向量。从理论上分析了所提算法的有效性。我们分别在合成拓扑和真实拓扑上进行了时延估计的仿真实验。结果表明,该方案可以在可接受的时间内以最低的成本选择最有用的网络断层扫描路径。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Path Selection via Mutual Coherence Optimization in Network Monitoring
Periodically monitoring the state of internal links is important for network diagnosis. One of the major problems in tomography-based network monitoring is to select which paths to measure. In this paper, we propose a new path selection scheme by means of optimizing the mutual coherence of the routing matrix. The proposed scheme exploits the sparse characteristic of link status and follows the matrix design methods in sparse signal theory. By picking the paths with the minimum average mutual coherence, we can recover a sparse vector more accurately. The effectiveness of the proposed algorithms is analyzed theoretically. We conduct simulation experiments of delay estimation on both synthetic and real topologies. The results demonstrate that our scheme can select the most useful paths for network tomography with lowest cost in an acceptable time.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
IEEE Transactions on Network and Service Management
IEEE Transactions on Network and Service Management Computer Science-Computer Networks and Communications
CiteScore
9.30
自引率
15.10%
发文量
325
期刊介绍: IEEE Transactions on Network and Service Management will publish (online only) peerreviewed archival quality papers that advance the state-of-the-art and practical applications of network and service management. Theoretical research contributions (presenting new concepts and techniques) and applied contributions (reporting on experiences and experiments with actual systems) will be encouraged. These transactions will focus on the key technical issues related to: Management Models, Architectures and Frameworks; Service Provisioning, Reliability and Quality Assurance; Management Functions; Enabling Technologies; Information and Communication Models; Policies; Applications and Case Studies; Emerging Technologies and Standards.
×
引用
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学术官方微信