论文部分内容阅读
Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flood-ing 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 similar-ity-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.
Flooding is the most famous technique for locating contents in unstructured P2P networks. Recently traditional flood-ing 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 In this paper, we propose a new search scheme, called Immune Search Scheme (ISS), to cope with this problem. In ISS, an immune systems inspired concept of similar-ity-governed clone 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 improved search performance, which can make ISS not be blind but heuristic.