Multimedia Access Community for Unstructured P2P Networks
Abstract
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 has become an essential service in P2P systems. To realize an interest-based small-world
CommunityNet, we also investigate the following practical design issues: 1) similarity estimation: we define a quantifiable similarity measure that enables clustering of similar peers in CommunityNet; 2)
distributed small-world overlay adaptation: peers maintain a smallworld 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 [1], which tracks users’ listening habits, to evaluate the performance of
CommunityNet. The results show that CommunityNet assists peers in locating content at peers with similar interests through short path lengths, and hence, achieves a higher success ratio (than nonsmallworld
interest-based overlays and noninterest-based small-world
overlays) while reducing message overhead significantly.
Keywords
Full Text:
PDFReferences
AudioScrobbler, http://www.audioscrobbler.net/, 2009.
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.
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.
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,
D. Stutzbach and R. Rejaie, “Understanding Churn in Peer-to-Peer
Networks,” Proc. ACM Internet Measurement Conf. (IMC), 2006.
S. Ratnasamy, P. Francis, M. Handley, R. Karp, and S. Schenker, A
Scalable Content-Addressable Network. ACM Press, 2001.
Gnutella, http://www.gnutella.com/, 2008.
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/hanneman/nettext/, 2005.
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.
G. Salton, Automatic Text Processing: The Transformation, Analysis,
and Retrieval of Information by Computer. Addison-Wesley Longman
Publishing Co., Inc., 1989.
R. Ma, S. Lee, J. Lui, and D. Yau, “An Incentive Mechanism for p2p
Networks,” Proc. Int’l Conf. Distributed Computing Systems (ICDCS),
Z. Zhang, S. Chen, and M. Yoon, “MARCH: A Distributed Incentive
Scheme for Peer-to-Peer Networks,” Proc. IEEE INFOCOM, 2007.
A.W.S. Hoory and N. Linial, “Expander Graphs and Their
Applications,” Am. Math. Soc., vol. 43, no. 4, pp. 439-561, 2006.
Napster, http://www.napster.com/, 2009.
K. Sripanidkulchai “The Popularity of Gnutella Queries and Its
Implications on Scalability,” http://www.cs.cmu.edu/
kunwadee/research/p2p/gnutella.html, 2001.
K. Hui, J. Lui, and D. Yau, “Small World Overlay P2P Networks,” Proc.
IEEE Int’l Workshop Quality of Service (IWQOS), 2004.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.