| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks
July 2010 (vol. 21 no. 7)
pp. 1027-1041
Kate Ching-Ju Lin, Research Center for Information Technology Innovation, Taipei Taiwan
Increasingly, peer-to-peer (P2P) network users expect to be able to search objects by semantic attributes based on their preferences for multimedia content. Partial match search (i.e., search through the use of multimedia content semantic information) has become an essential service in P2P systems. In this paper, we propose SocioNet, a social-based overlay that clusters peers based on their preference relationships as a small-world network. In SocioNet, peers mimic how people form a social network and how they query, by preference, their friends or acquaintances. Hence, SocioNet benefits from two desirable features of a social network: interest-based clustering and small-world properties (i.e., high cluster coefficient among all peers yet short path lengths between any two peers). To realize an interest-based small-world SocioNet, we also investigate the following practical design issues: 1) similarity estimation: we define a quantifiable similarity measure that enables clustering of similar peers in SocioNet; 2) distributed small-world overlay adaptation: peers maintain a small-world overlay under network dynamics; and 3) query strategy under the small-world overlay: we analyze appropriate settings for the Time-to-Live (TTL) value, for TTL-limited flooding, that provides a satisfactory success ratio and avoids redundant message overhead. We use simulations and a real database called AudioScrobbler [CHECK END OF SENTENCE], which tracks users' listening habits, to evaluate the performance of SocioNet. The results show that SocioNet assists peers in locating content at peers with similar interests through short path lengths, and hence, achieves a higher success ratio (than nonsmall-world interest-based overlays and noninterest-based small-world overlays) while reducing message overhead significantly.
[1] AudioScrobbler, http:/www.audioscrobbler.net/, 2009.
[2] 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.
[3] I. Stoica, R. Morris, D. Karger, M.F. Kaashoek, and H. Balakrishnan, "Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications," Proc. ACM SIGCOMM, 2001.
[4] I. Clarke, O. Sandberg, B. Wiley, and T.W. Hong, "Freenet: Adistributed Anonymous Information Storage and Retrieval System," Lecture Notes in Computer Science, vol. 2009, pp. 46-66, Springer, 2001.
[5] D. Stutzbach and R. Rejaie, "Understanding Churn in Peer-to-Peer Networks," Proc. ACM Internet Measurement Conf. (IMC), 2006.
[6] S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, A Scalable Content-Addressable Network. ACM Press, 2001.
[7] Gnutella, http:/www.gnutella.com/, 2008.
[8] R.A. Hanneman and M. Riddle, Introduction to Social Network Methods: Table of Contents, A. Oram, ed. Univ. of California, http://www.faculty.ucr.edu/hannemannettext /, 2005.
[9] D. Watts and S. Strogatz, "Collective Dynamics of 'Small-World' Networks," Nature, vol. 393, no. 6684, pp. 409-410, 1998.
[10] A. Crespo and H. Garcia-Molina, "Semantic Overlay Networks for p2p Systems," technical report, Computer Science Dept., Stanford Univ., 2002.
[11] R. Zhang and Y.C. Hu, "Assisted Peer-to-Peer Search with Partial Indexing," IEEE Trans. Parallel and Distributed Systems, vol. 18, no. 8, pp. 1146-1158, Aug. 2007.
[12] H. Zhang, A. Goel, and R. Govindan, "Using the Small-World Model to Improve Freenet Performance," Computer Networks, vol. 46, no. 4, pp. 555-574, 2004.
[13] C.-J. Lin, Y.-T. Chang, S.-C. Tsai, and C.-F. Chou, "Distributed Social-Based Overlay Adaptation for Unstructured P2P Networks," Proc. IEEE Global Internet Symp., 2007.
[14] M.S. Lew, N. Sebe, C. Djeraba, and R. Jain, "Content-Based Multimedia Information Retrieval: State of the Art and Challenges," ACM Trans. Multimedia Computing, Comm., and Applications, vol. 2, no. 1, pp. 1-19, 2006.
[15] C.G.M. Snoek, M. Worring, J.C. van Gemert, J.-M. Geusebroek, and A.W.M. Smeulders, "The Challenge Problem for Automated Detection of 101 Semantic Concepts in Multimedia," Proc. ACM Int'l Conf. MULTIMEDIA, 2006.
[16] C.-J. Lin, S.-C. Tsai, Y.-T. Chang, and C.-F. Chou, "Enabling Search and Similarity Search in Small-World-Based P2P Systems," Proc. Int'l Conf. Computer Comm. and Networks (ICCCN), 2007.
[17] G. Salton, Automatic Text Processing: The Transformation, Analysis, and Retrieval of Information by Computer. Addison-Wesley Longman Publishing Co., Inc., 1989.
[18] R. Ma, S. Lee, J. Lui, and D. Yau, "An Incentive Mechanism for p2p Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2004.
[19] Z. Zhang, S. Chen, and M. Yoon, "MARCH: A Distributed Incentive Scheme for Peer-to-Peer Networks," Proc. IEEE INFOCOM, 2007.
[20] A.W.S. Hoory and N. Linial, "Expander Graphs and Their Applications," Am. Math. Soc., vol. 43, no. 4, pp. 439-561, 2006.
[21] Napster, http:/www.napster.com/, 2009.
[22] K. Sripanidkulchai "The Popularity of Gnutella Queries and Its Implications on Scalability," http://www.cs.cmu.edu/ kunwadee/ research/p2p gnutella.html, 2001.
[23] K. Hui, J. Lui, and D. Yau, "Small World Overlay P2P Networks," Proc. IEEE Int'l Workshop Quality of Service (IWQOS), 2004.
[24] Brite, http://www.cs.bu.edubrite/, 2009.
[25] A. Goel and R. Govindan, "Using the Small-World Model to Improve Freenet Performance," Computer Networks J., vol. 46, no. 4, pp. 555-574, 2004.
[26] V. Vishnumurthy and P. Francis, "On Heterogeneous Overlay Construction and Random Node Selection in Unstructured p2p Networks," Proc. IEEE INFOCOM, 2006.
[27] P. Reynolds and A. Vahdat, "Efficient Peer-to-Peer Keyword Searching," Proc. Int'l Middleware Conf., June 2003.
[28] Y.-J. Joung, C.-T. Fang, and L.-W. Yang, "Keyword Search in dht-Based Peer-to-Peer Networks," Proc. Int'l Conf. Distributed Computing Systems (ICDCS), 2005.
[29] L. Liu, N. Antonopoulos, and S. Mackin, "Social Peer-to-Peer for Resource Discovery," Proc. Parallel, Distributed, and Network-Based Processing, Euromicro Conf., 2007.
[30] J. Travers and S. Milgram, "An Experimental Study of the Small World Problem," Sociometry, vol. 32, no. 4, pp. 425-443, 1969.
[31] K. Lui and D. Yau, "Small-World Overlay P2P Nntworks: Construction and Handling Dynamic Flash Crowd," Computer Networks J., vol. 50, no. 15, pp. 2727-2746, 2006.
[32] L. Liu, N. Antonopoulos, and S. Mackin, "Small-World Peer-to-Peer for Resource Discovery," Proc. Int'l Conf. Information Networking (ICOIN), 2007.
Index Terms:
Unstructured peer-to-peer networks, content search and retrieval, overlay construction, small-world theory.
Citation:
Kate Ching-Ju Lin, Chun-Po Wang, Cheng-Fu Chou, Leana Golubchik, "SocioNet: A Social-Based Multimedia Access System for Unstructured P2P Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 21, no. 7, pp. 1027-1041, July 2010, doi:10.1109/TPDS.2009.134
