The Community for Technology Leaders
RSS Icon
Issue No.06 - June (2008 vol.19)
pp: 821-836
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
Gang Chen, Chor Ping Low, Zhonghua Yang, "Enhancing Search Performance in Unstructured P2P Networks Based on Users' Common Interest", IEEE Transactions on Parallel & Distributed Systems, vol.19, no. 6, pp. 821-836, June 2008, doi:10.1109/TPDS.2008.42
[1] Kazaa Media Desktop, http:/, 2001.
[2] BitTorrent, http:/, 2003.
[3] The Gnutella Website, http:/, 2003.
[4] The Napster Website, http:/, 2007.
[5] T.M. Adami, E. Best, and J.J. Zhu, “Stability Assessment Using Lyapunov's First Method,” Proc. 34th Southeastern Symp. System Theory (SSST '02), pp. 297-301, 2002.
[6] S. Androutsellis-Theotokis and D. Spinellis, “A Survey of Peer-to-Peer Content Distribution Technologies,” ACM Computing Surveys, vol. 36, no. 4, pp. 335-371, 2004.
[7] V. Cholvi, P.A. Felber, and E.W. Biersack, “Efficient Search in Unstructured Peer-to-Peer Networks,” European Trans. Telecomm., vol. 15, no. 6, 2004.
[8] E. Cohen, A. Fiat, and H. Kaplan, “Associative Search in Peer-to-Peer Networks: Harnessing Latent Semantics,” Proc. IEEE INFOCOM, 2003.
[9] E. Herskovits, “Computer-Based Probabilistic-Network Construction,” PhD dissertation, Stanford Univ., 1991.
[10] R.A. Horn and C.R. Johnson, Matrix Analysis. Cambridge Univ. Press, 1990.
[11] H. Jin, X. Ning, and H. Chen, “Efficient Search for Peer-to-Peer Information Retrieval Using Semantic Small World,” Proc. Int'l Conf. World Wide Web (WWW '06), pp. 1003-1004, 2006.
[12] M. Khambatti, K. Ryu, and P. Dasgupta, “Structuring Peer-to-Peer Networks Using Interest-Based Communities,” Proc. Int'l Workshop Databases, Information Systems and Peer-to-Peer Computing (P2PDBIS), 2003.
[13] J. Kleinberg, “The Small-World Phenomenon: An Algorithmic Perspective,” Proc. 32nd ACM Symp. Theory of Computing (STOC), 2000.
[14] J. Lafferty, A. McCallum, and F. Pereira, “Conditional Random Fields: Probabilistic Models for Segmenting and Labeling Sequence Data,” Proc. 18th Int'l Conf. Machine Learning (ICML), 2001.
[15] A. Löser, S. Staab, and C. Tempich, “Semantic Social Overlay Networks,” IEEE J. Selected Areas in Comm., vol. 25, no. 1, pp. 5-14, 2007.
[16] M. Li, W. Lee, and A. Sivasubramaniam, “Semantic Small World: An Overlay Network for Peer-to-Peer Search,” Proc. 12th IEEE Int'l Conf. Network Protocols (ICNP), 2004.
[17] E.K. Lua, J. Crowcroft, M. Pias, R. Sharma, and S. Lim, “A Survey and Comparison of Peer-to-Peer Overlay Network Schemes,” IEEE Comm. Surveys and Tutorials, vol. 7, no. 2, pp. 72-93, 2005.
[18] G.S. Manku, M. Bawa, and P. Raghavan, “Symphony: Distributed Hashing in a Small World,” Proc. Fourth Usenix Symp. Internet Technologies and Systems (USITS), 2003.
[19] M. Mitzenmacher, “The Power of Two Choices in Randomized Load Balancing,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 10, pp. 1094-1104, Oct. 2001.
[20] C. Plaxton, R. Rajaraman, and A. Richa, “Accessing Nearby Copies of Replicated Objects in a Distributed Environment,” Proc. Ninth Ann. ACM Symp. Parallel Algorithms and Architectures, 1997.
[21] A. Rowstron and P. Druschel, “Pastry: Scalable, Distributed Object Location and Routing for Large-Scale Peer-to-Peer Systems,” Proc. IFIP/ACM Int'l Conf. Distributed Systems Platforms (Middleware), 2001.
[22] P. Smyth, D. Heckerman, and M. Jordan, “Probabilistic Independence Networks for Hidden Markov Models,” Neural Computation, vol. 9, no. 2, pp. 227-269, 1997.
[23] P. Spirtes and C. Meek, “Learning Bayesian Networks with Discrete Variables from Data,” Proc. ACM SIGKDD, 1995.
[24] K. Sripanidkulchai, B. Maggs, and H. Zhang, “Efficient Content Location Using Interest-Based Locality in Peer-to-Peer Systems,” Proc. IEEE INFOCOM, 2003.
[25] I. Stoica, R. Morris, D. Liben-Nowell, D.R. Karger, M.F. Kaashoek, F. Dabek, and H. Balakrishnan, “Chord: A Scalable Peer-to-Peer Lookup Protocol for Internet Applications,” IEEE/ACM Trans. Networking, vol. 11, no. 1, pp. 17-32, 2003.
[26] S. Tewari and L. Kleinrock, “Optimal Search Performance in Unstructured Peer-to-Peer Networks with Clustered Demands,” IEEE J. Selected Areas in Comm., vol. 25, no. 1, 2007.
[27] B. Yang and H. Garcia-Monlina, “Efficient Search in Peer-to-Peer Networks,” Proc. 22nd IEEE Int'l Conf. Distributed Computing Systems (ICDCS), 2002.
[28] H. Zhang, A. Goel, and R. Govindan, “Using the Small-World Model to Improve Freenet Performance,” Computer Networks, vol. 46, pp. 555-574, 2004.
[29] B.Y. Zhao, L. Huang, J. Stribling, S.C. Rhea, A.D. Joseph, and J.D. Kubiatowicz, “Tapestry: A Resilient Global-Scale Overlay for Service Deployment,” IEEE J. Selected Areas in Comm., vol. 22, no. 1, pp. 41-53, 2004.
30 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool