摘要
介绍了一种基于广度优先的网络拓扑发现算法.实践证明,该算法发现速度快,生成的拓扑能很好地满足实际管理需求.
A network topology discovery algorithm based on breadth-first is introduced. Practice proves that the algorithm is fast to creat network topology and meet practical management demand better.
出处
《烟台师范学院学报(自然科学版)》
2005年第3期186-188,共3页
Yantai Teachers University journal(Natural Science Edition)
关键词
广度优先
拓扑
算法
MIB
breadth-first
topology
algorithm
MIB