CAJ | 학술논문

准确、及时的网络拓扑信息对网络管理、协议设计和网络安全等领域工作具有重要意义。针对包含哑设备的大型、异构多子网拓扑发现问题，提出一种基于子树交汇点的物理拓扑发现算法。算法通过围绕子树交汇点，利用改进的连接信息扩展规则进行连接判定与信息推理补完，自顶向下的进行拓扑发现。理论分析与实验结果表明，该算法能够利用不完整的地址转发表构建出整个网络拓扑结构，在发现效率和准确性等方面都有了较大提高。
준학、급시적망락탁복신식대망락관리、협의설계화망락안전등영역공작구유중요의의。침대포함아설비적대형、이구다자망탁복발현문제，제출일충기우자수교회점적물리탁복발현산법。산법통과위요자수교회점，이용개진적련접신식확전규칙진행련접판정여신식추리보완，자정향하적진행탁복발현。이론분석여실험결과표명，해산법능구이용불완정적지지전발표구건출정개망락탁복결구，재발현효솔화준학성등방면도유료교대제고。
Accurate and up-to-date network topology information plays a crucial role in network management, protocol design and network security, etc.To discover the problems targeting at the large and heterogeneous multiple subnets that may include dumb network elements, we propose a new multi-subtree intersection-based physical topological discovery algorithm.Around the intersection of multi-subtree, the algorithm uses the improved connection information extension rules to carry out the connection discriminant and the reasoning and finishing up of information, as well as the top-down topology discovery.It is demonstrated by theoretical analysis and experimental results that this algorithm can construct an entire network topology with the incomplete AFTs, and improves a great deal in both discovery efficiency and accuracy.