• 文献检索
  • 文档翻译
  • 深度研究
  • 学术资讯
  • 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分钟生成高质量综述,智能提取关键信息,辅助科研写作。

立即免费体验

大规模网络的高速路径探测方法。

High-Speed Path Probing Method for Large-Scale Network.

机构信息

College of Electronic Engineering, National University of Defense Technology, Hefei 230037, China.

Cyberspace Security Situation Awareness and Evaluation Key Laboratory of Anhui Province, Hefei 230037, China.

出版信息

Sensors (Basel). 2022 Jul 28;22(15):5650. doi: 10.3390/s22155650.

DOI:10.3390/s22155650
PMID:35957205
原文链接:https://pmc.ncbi.nlm.nih.gov/articles/PMC9370962/
Abstract

In large-scale network topology discovery, due to the complex network structure and dynamic change characteristics, it is always the focus of network topology measurement to obtain as many network paths as possible in a short time. In this paper, we propose a large-scale network path probing approach in order to solve the problems of low probing efficiency and high probing redundancy commonly found in current research. By improving the packet delivery order and the update strategy of time-to-live field values, we redesigned and implemented an efficient large-scale network path probing tool. The experimental results show that the method-derived tool can complete path probing for a sample of 12 million/24 network address segments worldwide within 1 hour, which greatly improves the efficiency of network path probing. Meanwhile, compared to existing methods, the proposed method can reduce the number of packets sent by about 10% with the same number of network addresses found, which effectively reduces probing redundancy and alleviates the network load.

摘要

在大规模网络拓扑发现中,由于网络结构复杂和动态变化的特点,如何在短时间内尽可能多地获取网络路径一直是网络拓扑测量的重点。本文针对当前研究中普遍存在的探测效率低、探测冗余度高的问题,提出了一种大规模网络路径探测方法。通过改进数据包的投递顺序和生存时间字段值的更新策略,重新设计并实现了一种高效的大规模网络路径探测工具。实验结果表明,该方法设计的工具可以在 1 小时内完成对全球 1200 万个/24 个网络地址段的路径探测,大大提高了网络路径探测的效率。同时,与现有方法相比,该方法在相同数量的网络地址发现中可以减少约 10%的数据包发送量,有效地减少了探测冗余,减轻了网络负载。

https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/f214737f4728/sensors-22-05650-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/8da4420117e9/sensors-22-05650-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/372bf7257026/sensors-22-05650-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/81d12630b2a2/sensors-22-05650-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/23b1357ce955/sensors-22-05650-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/0fb1b33c1004/sensors-22-05650-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/340e4dab93c9/sensors-22-05650-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/6095011d1083/sensors-22-05650-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/be23d8f6073f/sensors-22-05650-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/d7215d862df9/sensors-22-05650-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/53b36653ce41/sensors-22-05650-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/2af315b9c6f3/sensors-22-05650-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/eb7893c355f7/sensors-22-05650-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/f214737f4728/sensors-22-05650-g013.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/8da4420117e9/sensors-22-05650-g001.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/372bf7257026/sensors-22-05650-g002.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/81d12630b2a2/sensors-22-05650-g003.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/23b1357ce955/sensors-22-05650-g004.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/0fb1b33c1004/sensors-22-05650-g005.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/340e4dab93c9/sensors-22-05650-g006.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/6095011d1083/sensors-22-05650-g007.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/be23d8f6073f/sensors-22-05650-g008.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/d7215d862df9/sensors-22-05650-g009.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/53b36653ce41/sensors-22-05650-g010.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/2af315b9c6f3/sensors-22-05650-g011.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/eb7893c355f7/sensors-22-05650-g012.jpg
https://cdn.ncbi.nlm.nih.gov/pmc/blobs/2a51/9370962/f214737f4728/sensors-22-05650-g013.jpg

相似文献

1
High-Speed Path Probing Method for Large-Scale Network.大规模网络的高速路径探测方法。
Sensors (Basel). 2022 Jul 28;22(15):5650. doi: 10.3390/s22155650.
2
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.
3
An algorithm for discovering vital nodes in regional networks based on stable path analysis.一种基于稳定路径分析的区域网络关键节点发现算法。
Sci Rep. 2023 Sep 16;13(1):15395. doi: 10.1038/s41598-023-39174-7.
4
A lightweight path consistency verification based on INT in SDN.基于软件定义网络中INT的轻量级路径一致性验证
Math Biosci Eng. 2023 Oct 20;20(11):19468-19484. doi: 10.3934/mbe.2023862.
5
An Efficient Topology Discovery Protocol with Node ID Assignment Based on Layered Model for Underwater Acoustic Networks.一种基于分层模型的水下声通信网络节点ID分配的高效拓扑发现协议
Sensors (Basel). 2020 Nov 18;20(22):6601. doi: 10.3390/s20226601.
6
Hierarchical trie packet classification algorithm based on expectation-maximization clustering.基于期望最大化聚类的层次化前缀树分组分类算法
PLoS One. 2017 Jul 13;12(7):e0181049. doi: 10.1371/journal.pone.0181049. eCollection 2017.
7
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.
8
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.
9
Genetic algorithms for route discovery.用于路径发现的遗传算法。
IEEE Trans Syst Man Cybern B Cybern. 2006 Dec;36(6):1247-54. doi: 10.1109/tsmcb.2006.873213.
10
Dynamic cooperative clustering based power assignment: network capacity and lifetime efficient topology control in cooperative ad hoc networks.基于动态协作聚类的功率分配:协作式自组织网络中的网络容量与寿命高效拓扑控制
ScientificWorldJournal. 2014 Mar 16;2014:219210. doi: 10.1155/2014/219210. eCollection 2014.

本文引用的文献

1
An Efficient 5G Data Plan Approach Based on Partially Distributed Mobility Architecture.基于部分分布式移动性架构的高效 5G 数据计划方法。
Sensors (Basel). 2022 Jan 4;22(1):349. doi: 10.3390/s22010349.