Issue No. 06 - June (2008 vol. 19)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TPDS.2008.42
Gang Chen , Nanyang Technological University, Singapore
Chor Ping Low , Nanyang Technological University, Singapore
Zhonghua Yang , Nanyang Technological University, Singapore
Peer-to-Peer (P2P) networks establish loosely-coupled application-level overlays on top of the Internet to facilitate efficient sharing of resources. They can be roughly classified as either structured or unstructured networks. Without stringent constraints over the network topology, unstructured P2P networks can be constructed very efficiently and are therefore considered suitable to the Internet environment. However, the random search strategies adopted by these networks usually perform poorly with large network size. In this paper, we seek to enhance the search performance in unstructured P2P networks through exploiting users' common interest patterns captured within a probability-theoretic framework termed the user interest model (UIM). A search protocol and a routing table updating protocol are further proposed in order to expedite the search process through self-organizing the P2P network into a small world. Both theoretical and experimental analysis are conducted and demonstrated the effectiveness and efficiency of our approach.
Unstructured Peer-to-peer network, search performance, user interest model
Z. Yang, G. Chen and C. P. Low, "Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest," in IEEE Transactions on Parallel & Distributed Systems, vol. 19, no. , pp. 821-836, 2008.