摘要： 常见的网络拓扑连接定义存在表现能力不足或冗余问题。该文对其进行改进，提出网络层(N，R)拓扑连接，只需访问路由器的IP地址表即可得到拓扑关系。在此定义基础上，对两种常见的网络层拓扑发现算法进行了简化，并分析和比较了两算法性能和搜索范围限定问题。
关键词:
网络管理,
拓扑发现,
网络层(N,R)拓扑连接
Abstract: According to the (N, R) topology of network layer advanced in this paper, router-subnet topology can be directly obtained by retrieving routers IP address tables. Based on this notion, two existing types of algorithms are revised to overcome former shortcomings. Then they are compared in time complexity and designation of search boundaries.
中图分类号:
李可,薛质,铁玲. IP网络拓扑自动发现研究[J]. , 2004, 30(05): 66-.
LI Ke, XUE Zhi, TIE Ling. Research on Automatic Topology Discovery of IP Networks[J]. , 2004, 30(05): 66-.