一种基于多节点递归的内网路由拓扑发现方法及实现  

A Method and Implementation of Intranet Routing Topology Discovery Based on Multi Node Recursion

作　　者：申秋 刘泽忠[1] 邓杨凡 SHEN Qiu;LIU Zezhong;DENG Yangfan(No.30 Institute of CETC,Chengdu Sichuan 610041,China)

机构地区：[1]中国电子科技集团公司第三十研究所,四川成都610041

出　　处：《信息与电脑》2023年第11期11-14,共4页Information & Computer

摘　　要：网络资产探查等需求背景下,对未知内网进行路由拓扑探查是获取内网资产数据的重要手段之一。按常规方法,由于未知内网网际互连协议(Internet Protocol,IP)地址分配情况,需要遍历海量的内网IP地址,不仅会导致探测时间过长,而且持续的探测流量可能引起网络拥塞。为了尽可能减少探测次数和流量,文章提出一种基于多节点递归的内网路由拓扑发现方法,能够在提供同等效果的前提下,有效减少探测次数和流量。In the context of network asset exploration and other requirements,routing topology exploration of unknown internal networks is one of the important means to obtain internal network asset data.According to conventional methods,due to the unknown allocation of Internet Protocol(IP)addresses in the internal network,it is necessary to traverse a large number of internal IP addresses,which can lead to long detection time and sustained detection traffic,which may cause network congestion risk.In order to minimize the number of detections and traffic as much as possible,the article proposes an internal network routing topology discovery method based on multi node recursion,which can effectively reduce the number of detections and traffic while providing equal results.

关 键 词：多节点递归 拓扑发现 网络扫描 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]