泛滥是为在未组织的 P2P 网络定位内容的最著名的技术。最近传统的泛滥被更多的有效动态质问(DQ ) 代替了;如此的算法的不同变体。动态质问是能为由估计寻找的文件的流行泛滥的询问估计合适的 time-to-live (TTL ) 价值的一种新泛滥技术,;在为减少网络交通充满范围控制下面检索足够的结果。然而,所有象 DQ 一样搜索算法是“盲目”的以便大量冗余的消息被引起。在这篇论文,我们建议了一个新搜索计划,叫的有免疫力的搜索计划(ISS ) ,应付这个问题。在 ISS,一免疫系统启发了管理类似的克隆增长的概念;为询问消息运动的变化被使用。一些助理策略,也就是说捷径创造;同伴旅行被合并到 ISS 为改进搜索性能开发“有免疫力的存储器”,它能做 ISS 别盲目却启发式。
Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flooding has been replaced by more efficient dynamic query (DQ) and different variants of such algorithms. Dynamic query is a new flooding technique which could estimate a proper time-to-live (TTL) value for a query flooding by estimating the popularity of the searched files, and retrieve sufficient results under controlled flooding range for reducing network traffic. However, all DQ-like search algorithms are "blind" so that a large amount of redundant messages are caused. In this paper, we proposed a new search scheme, called Immune Search Scheme (ISS), to cope with this problem. In ISS, an immune systems inspired concept of similarity-governed clone proliferation and mutation for query message movement is applied. Some assistant strategies, that is, shortcuts creation and peer traveling are incorporated into ISS to develop "immune memory" for improving search performance, which can make ISS not be blind but heuristic.