引用本文
  •    [点击复制]
  •    [点击复制]
【打印本页】 【下载PDF全文】 查看/发表评论下载PDF阅读器关闭

←前一篇|后一篇→

过刊浏览    高级检索

本文已被:浏览 362次   下载 527 本文二维码信息
码上扫一扫!
一种自适应的网络拓扑自动发现算法
0
()
摘要:
针对现有网络拓扑发现算法的不足,提出并实现了一种自适应网络拓扑自动发现算法——RANTAD(Robust and Adaptive Network Topology Auto Discovery)。BANTAD算法以TCP/IP网络管理体系结构为依托,将现有的各协议和发现技术进行有机地整合,在发现过程的每个阶段,能根据网络的实际情况对所采用的协议和技术进行自适应调整。模拟实验表明RANTAD算法能快速有效地自动发现网络拓扑信息,并且具有很好的健壮性。
关键词:  网络拓扑 自动发现算法 BANTAD算法 管理体系 自适应性
DOI:10.11841/j.issn.1007-4333.2003.02.042
修订日期:2002-03-28
基金项目:
A robust and adaptive algorithm for automatic discovery of the network topology
Abstract:
Aiming at the disadvantages of traditional network topology discovery algorithms, a new approach - RANTAD was presented. Based on TCP/IP network management architecture, RANTAD algorithm integrates multi networks protocols with exiting discovery techniques. In the actual discovery process, RANTAD algorithm can adopt with protocols and techniques adaptively according to the network situations. The algorithm was implemented with Microsoft Visual C++. The experiment showed that RANTAD algorithm can discover network topology information more efficiently and adaptively than traditional algorithms.
Key words:  network management,topology discovery,SNMP