Research and Implementation on Routing Scheme Based on Interest Mining in Unstructured P2P Systems

In the environment of unstructured peer-to-peer (P2P), routing scheme is one of the key factors affecting information searches. A routing scheme based on interest indexical table is proposed in this paper. Moreover, on the basis of it, we implement a P2P full text information retrieval prototype system, Isearch. Firstly, we represent local file content of a peer with vector space model. After that, space vector is clustered to obtain interest class of this peer. And then, interest similar degree is computed among peers to build interest indexical table locally. When search occurs, query requests are forwarded to the peers with similar interest directly according to the interest indexical table. Experimental results show that Isearch doesn't have much influence on retrieval results, but also can reduce the number of query peers so that make routing more efficient.