而用于发现网络中的主干拓扑，反映网络的整体状况，可选用基于SNMP协议网络拓扑搜索；
And is used for finding that the backbone in the network is topological, reflect the whole state of the network, can select for use and search for topologically on the basis of SNMP agreement network;
适应当前国内管理和国际上网络信息安全的需要，研究高效的网络拓扑搜索方法，对开发具有自主知识产权的网管产品，保证网络运行有效、安全具有重要的意义。
With the demands of native network management and international network security, it is of great significance for a copyright to research effective tool of network topology discovery.
结合图论理论和电网的特点，实现了一种基于元件邻接关系和广度优先搜索算法的网络拓扑分析方法。
A topology analysis method based on adjacent relation of elements in the network and Breadth first search is realized combined with Graph theory and the characteristics of power grid.
ERAMC算法利用预先计算来简化网络拓扑，然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。
Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.
分析了当前比较典型的P 2 P搜索技术，指出这些搜索方法都是由三种基本方法：洪泛、哈希和索引，结合一定的网络拓扑组合而成的。
Analyzed some typical P2P based search method and found they were composed by specific architecture and three basic methods: flooding, indexing and hashing.
该仿真网可以隐藏真正网络拓扑结构，扩大IP地址搜索空间，再利用伪装网络服务使黑客在仿真网上花费大量的时间和精力；
The simulation network may hide the true network topology, enlarge IP address room and spend hacker's massive time and energy using giving camouflage network service.
本文详细地阐述了网络拓扑分析中两种常用的分析方法：邻接矩阵法和树搜索法。
This paper sets forth the two methods for topology analysis: neighboring matrix method and tree_search method, which are in common use.
对等网络的拓扑失配会引起不必要的网络流量，不仅加重了物理网络的负担，而且加大了节点间资源搜索的平均时延。
So both the overhead of the physical network and the average time delay for information searching between peers are aggravated.
通过对分布非结构化的搜索算法以及对现有改进算法的研究，参考网络中的小世界性给出了一种基于兴趣域中心节点的P2P网络拓扑结构。
The unstructured P2P systems' searching algorithm and the relative research are studied. And a P2P network topological based on interest domain with central node is given.
结构化p2p网络以其高效路由性能，在应用于搜索时能提供快速的响应时间，适合作为P 2 P搜索的网络拓扑。
Structured P2P topology is appropriate for P2P searching for its high efficiency in routing and short response time in searching.
若不能发现详细准确的网络信息，仅对网络的增长感兴趣，可选用基于DNS协议路由表的拓扑搜索；
If can't find the detailed and accurate network information, is only interested in the growth of the network, can select the topological search based on DNS agreement route form for use;
结构化P2P网络中主要采用分布式哈希（DHT）搜索算法，它查找速度快、效率高，但受网络拓扑结构的限制其应用有限；
DHT (Distributed Hash Table) search algorithms is mainly adopted in the structured P2P network, it works fast and efficiently, but it is also limited by the network topology structure;
结构化P2P网络中主要采用分布式哈希（DHT）搜索算法，它查找速度快、效率高，但受网络拓扑结构的限制其应用有限；
DHT (Distributed Hash Table) search algorithms is mainly adopted in the structured P2P network, it works fast and efficiently, but it is also limited by the network topology structure;
应用推荐