Because query routing in the unstructured P2P network is similar to the process of foraging ants, the ant colony algorithm can simulate query process very well.
由于在非结构化P2P网络中选择路由类似于蚁群觅食的过程,因此,蚁群算法非常适合用于选择P2P路由。
参考来源 - 非结构化对等网络中的信息检索若干关键技术研究The researches of interest-based driven P2P search method on unstructured P2P network is the most important issue. Nowadays, there are tow deficiencies of the interest-based driven P2P search method.
无结构P2P网络环境下基于兴趣驱动的P2P搜索方法的研究是其中一个重要的课题。
参考来源 - 基于兴趣驱动的P2P搜索方法研究Unstructured P2P network adopted the traditional Flooding searching algorithm. There existed a great number of redundant messages and thus it would consume a lot of bandwidth and induce delay.
然而由于非结构化P2P系统采取传统的泛洪搜索方式查找资源,产生大量冗余消息,也消耗了大量的带宽。
参考来源 - 非结构化P2P网络中搜索算法的研究·2,447,543篇论文数据,部分数据来源于NoteExpress
应用推荐