ABSTRACT:

Peer-to-peer (P2P) networks establish loosely coupled application-level overlays on prime of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. While not stringent constraints over the network topology, unstructured P2P networks can be constructed terribly efficiently and are therefore thought of suitable to the Internet atmosphere. However, the random search ways adopted by these networks typically perform poorly with a large network size. In this paper, we tend to ask for to reinforce the search performance in unstructured P2P networks through exploiting users' common interest patterns captured within a likelihood-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are additional proposed in order to expedite the search method through self organizing the P2P network into a small world. Both theoretical and experimental analyses are conducted and demonstrated the effectiveness and potency of our approach.