• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • Suppr Zotero 插件Zotero 插件
  • 邀请有礼
  • 套餐&价格
  • 历史记录
应用&插件
Suppr Zotero 插件Zotero 插件浏览器插件Mac 客户端Windows 客户端微信小程序
定价
高级版会员购买积分包购买API积分包
服务
文献检索文档翻译深度研究API 文档MCP 服务
关于我们
关于 Suppr公司介绍联系我们用户协议隐私条款
关注我们

Suppr 超能文献

核心技术专利:CN118964589B侵权必究
粤ICP备2023148730 号-1Suppr @ 2026

文献检索

告别复杂PubMed语法,用中文像聊天一样搜索,搜遍4000万医学文献。AI智能推荐,让科研检索更轻松。

立即免费搜索

文件翻译

保留排版,准确专业,支持PDF/Word/PPT等文件格式,支持 12+语言互译。

免费翻译文档

深度研究

AI帮你快速写综述,25分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

网络层析成像应用中的链路丢失推断的自适应路径选择。

Adaptive Path Selection for Link Loss Inference in Network Tomography Applications.

机构信息

School of Information and Computer Science, Anhui Agricultural University, Hefei, Anhui, China.

State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing, China.

出版信息

PLoS One. 2016 Oct 4;11(10):e0163706. doi: 10.1371/journal.pone.0163706. eCollection 2016.

DOI:10.1371/journal.pone.0163706
PMID:27701447
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC5049780/
Abstract

In this study, we address the problem of selecting the optimal end-to-end paths for link loss inference in order to improve the performance of network tomography applications, which infer the link loss rates from the path loss rates. Measuring the path loss rates using end-to-end probing packets may incur additional traffic overheads for networks, so it is important to select the minimum path set carefully while maximizing their performance. The usual approach is to select the maximum independent paths from the candidates simultaneously, while the other paths can be replaced by linear combinations of them. However, this approach ignores the fact that many paths always exist that do not lose any packets, and thus it is easy to determine that all of the links of these paths also have 0 loss rates. Not considering these good paths will inevitably lead to inefficiency and high probing costs. Thus, we propose an adaptive path selection method that selects paths sequentially based on the loss rates of previously selected paths. We also propose a theorem as well as a graph construction and decomposition approach to efficiently find the most valuable path during each round of selection. Our new method significantly outperforms the classical path selection method based on simulations in terms of the probing cost, number of accurate links determined, and the running speed.

摘要

在这项研究中,我们解决了选择最佳端到端路径进行链路损耗推断的问题,以提高网络层析成像应用的性能,这些应用通过路径损耗率来推断链路损耗率。使用端到端探测数据包测量路径损耗率可能会给网络带来额外的流量开销,因此在选择最小路径集时,仔细选择并最大化其性能非常重要。通常的方法是同时从候选者中选择最大独立路径,而其他路径可以通过它们的线性组合来替代。然而,这种方法忽略了这样一个事实,即许多路径始终存在而不会丢失任何数据包,因此很容易确定这些路径的所有链路也具有 0 损耗率。不考虑这些良好的路径将不可避免地导致效率低下和高探测成本。因此,我们提出了一种自适应路径选择方法,该方法根据先前选择的路径的损耗率顺序选择路径。我们还提出了一个定理以及一种图构造和分解方法,以便在每次选择轮次中有效地找到最有价值的路径。我们的新方法在探测成本、确定的准确链路数量和运行速度方面,通过模拟显著优于基于经典的路径选择方法。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/592078aae60a/pone.0163706.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/2a75b1ae6927/pone.0163706.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/dad2e5ed74c2/pone.0163706.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/6f8002fa1675/pone.0163706.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/3a80a857dc45/pone.0163706.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/279a6f7db069/pone.0163706.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/837841fe4bc7/pone.0163706.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/f4b3fcee24b9/pone.0163706.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/0f3b4a4c7a35/pone.0163706.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/592078aae60a/pone.0163706.g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/2a75b1ae6927/pone.0163706.g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/dad2e5ed74c2/pone.0163706.g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/6f8002fa1675/pone.0163706.g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/3a80a857dc45/pone.0163706.g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/279a6f7db069/pone.0163706.g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/837841fe4bc7/pone.0163706.g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/f4b3fcee24b9/pone.0163706.g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/0f3b4a4c7a35/pone.0163706.g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/27e3/5049780/592078aae60a/pone.0163706.g009.jpg

相似文献

1
Adaptive Path Selection for Link Loss Inference in Network Tomography Applications.网络层析成像应用中的链路丢失推断的自适应路径选择。
PLoS One. 2016 Oct 4;11(10):e0163706. doi: 10.1371/journal.pone.0163706. eCollection 2016.
2
The Edge-Disjoint Path Problem on Random Graphs by Message-Passing.基于消息传递的随机图上的边不相交路径问题
PLoS One. 2015 Dec 28;10(12):e0145222. doi: 10.1371/journal.pone.0145222. eCollection 2015.
3
Similarity index based on local paths for link prediction of complex networks.基于局部路径的相似性指标用于复杂网络的链接预测
Phys Rev E Stat Nonlin Soft Matter Phys. 2009 Oct;80(4 Pt 2):046122. doi: 10.1103/PhysRevE.80.046122. Epub 2009 Oct 26.
4
Efficient path routing strategy for flows with multiple priorities on scale-free networks.无标度网络上具有多个优先级流的高效路径路由策略
PLoS One. 2017 Feb 15;12(2):e0172035. doi: 10.1371/journal.pone.0172035. eCollection 2017.
5
Constraint handling using tournament selection: abductive inference in partly deterministic bayesian networks.使用锦标赛选择的约束处理:部分确定性贝叶斯网络中的溯因推理
Evol Comput. 2009 Spring;17(1):55-88. doi: 10.1162/evco.2009.17.1.55.
6
Self avoiding paths routing algorithm in scale-free networks.无标度网络中的自回避路径路由算法。
Chaos. 2013 Mar;23(1):013114. doi: 10.1063/1.4790864.
7
A dynamic source routing protocol based on path reliability and link monitoring repair.一种基于路径可靠性和链路监测修复的动态源路由协议。
PLoS One. 2021 May 27;16(5):e0251548. doi: 10.1371/journal.pone.0251548. eCollection 2021.
8
Genetic algorithms for route discovery.用于路径发现的遗传算法。
IEEE Trans Syst Man Cybern B Cybern. 2006 Dec;36(6):1247-54. doi: 10.1109/tsmcb.2006.873213.
9
Direct determination of reaction paths and stationary points on potential of mean force surfaces.直接确定平均力势面上的反应路径和驻点。
J Mol Graph Model. 2005 Oct;24(2):82-93. doi: 10.1016/j.jmgm.2005.06.001.
10
Dynamic algorithms for the shortest path routing problem: learning automata-based solutions.最短路径路由问题的动态算法:基于学习自动机的解决方案。
IEEE Trans Syst Man Cybern B Cybern. 2005 Dec;35(6):1179-92. doi: 10.1109/tsmcb.2005.850180.