基于OPNET的洪泛搜索算法分析
Analysis of the flooding search algorithm with OPNET
摘要：
在这项工作中，我们认为流行的OPNET模拟器作为一种工具，性能评估的算法在对等（P2P）网络中运行。我们创建了一个简单的框架，并使用它来分析泛洪搜索算法，这是一种流行的技术，在一个非结构化的P2P网络中搜索文件。我们调查的副本数量和生存时间（TTL）的搜索查询的算法性能的影响。在准备模拟时，虽然模拟的网络规模有限，但我们没有报告P2P专用模拟器中常见的问题。
英文摘要：
In this work, we consider the popular OPNET simulator as a tool for performance evaluation of algorithms operating in peer-to-peer (P2P) networks. We created simple framework and used it to analyse the flooding search algorithm which is a popular technique for searching files in an unstructured P2P network. We investigated the influence of the number of replicas and time to live (TTL) of search queries on the algorithm performance. Preparing the simulation we did not reported the problems which are commonly encountered in P2P dedicated simulators although the size of simulated network was limited.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
