Abstract
Interest-based communities are a natural arrangement of distributed systems that prune the search space and allow for better dissemination of information to participating peers. In this paper, we introduce the notion of peer communities. Communities are like interest groups, modeled after human communities and can overlap. Our work focuses on providing efficient formation, discovery and management techniques that can be implemented to constantly changing community structures. We provide a mechanism to generate realistic peer-to-peer network topologies that can be used in simulations that evaluate the operation of our algorithms. Our experiments show how searching the peer-to-peer network can take advantage of peer communities to reduce the number of messages and improve the quality of search results.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Google, http://www.google.com/
Yahoo, http://www.yahoo.com/
AltaVista, http://www.altavista.com/
Khambatti, M., Ryu, K., Dasgupta, P.: Efficient Discovery of Implicitly Formed Peer-to-Peer Communities. Int’l. Jour. of Parallel and Distributed Systems and Networks 5(4), 155–164 (2002)
Gnutella, http://www.gnutelliums.com/
Clarke, I., Sandberg, O., Wiley, B., Hong, T.W.: Freenet: A distributed anonymous information storage and retrieval system. In: Workshop on Design Issues in Anonymity and Unobservability, Berkeley, CA, USA, pp. 311–320 (2000)
Napster, http://www.napster.com/
Yahoo Groups, http://groups.yahoo.com
Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-peer Networks. In: International Conf. On Distributed Computing Systems, Vienna, Austria (2002)
Stoica, I., Morris, R., Karger, D., Kaashoek, F., Balakrishnan, H.: Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications. In: Proc. ACM SIGCOMM, pp. 149–160 (2001)
Druschel, P., Rowstron, A.: Past: Persistent and anonymous storage in a peer-to-peer networking environment. In: Proc. the 8th IEEE Work. Hot Topics in Operating Systems (HotOS), Germany, May 2001, pp. 65–70 (2001)
Khambatti, M., Ryu, K., Dasgupta, P.: Peer-to-Peer Communities: Formation and Discovery. In: 14th IASTED Int’l. Conf. Parallel and Distributed Computing Systems (PDCS), Cambridge, MA, USA, pp. 497–504 (2002)
Gummadi, R., Hohlt, B.: Efficient Implementation Of A Publish-Subscribe-Notify Model Using Highly-Concurrent B-Trees (2000) (unpublished)
Khambatti, M., Ryu, K., Dasgupta, P.: Push-Pull Gossiping for Information Sharing in Peer-to-Peer Communities. In: Int’l Conf. on Parallel and Distributed Processing Techniques and Applications (PDPTA), Las Vegas, NV (2003)
Steyvers, M., Tenenbaum, J. B.: The large-scale structure of semantic networks: statistical analyses and a model of semantic growth. In: 25th Annual Meeting of the Cognitive Science Society (CogSci), Boston, MA (2003) (submitted)
Bloom, B.: Space/time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM 13(7), 422–426 (1970)
Gribble, S.D., Brewer, E.A., Hellerstein, J.M., Culler, D.: Scalable, Distributed Data Structures for Internet Service Construction. In: Proc. of the Fourth Symposium on Operating Systems Design and Implementation (OSDI 2000), San Diego, CA (2000)
Gribble, S.D., Welsh, M., Behren, R., Behren, R.v., Brewer, E.A., Culler, D., Borisov, N., Czerwinski, S., Gummadi, R., Hill, J., Joseph, A.D., Katz, R.H., Mao, Z., Ross, S., Zhao, B.: The Ninja Architecture for Robust Internet-Scale Systems and Services. Special Issue of Computer Networks on Pervasive Computing 35(4), 473–497 (2001)
Hodes, T.D., Czerwinski, S.E., Zhao, B.Y., Joseph, A.D., Katz, R.H.: An Architecture for Secure Wide-Area Service Discovery. In: ACM Baltzer Wireless Networks: Selected papers from MobiCom 1999 (1999)
Kubiatowicz, J., Bindel, D., Chen, Y., Czerwinski, S., Eaton, P., Geels, D., Gummadi, R., Rhea, S., Weatherspoon, H., Weimer, W., Wells, C., Zhao, B.: OceanStore: An Architecture for Global-Scale Persistent Storage. In: Proc. of the Ninth Int’l Conf. on Architectural Support for Prog. Lang. and Operating Systems (ASPLOS 2000), Cambridge, MA (2000)
Fan, L., Cao, P., Almeida, J., Broder, A.: Summary Cache: A Scalable Wide-Area Web Cache Sharing Protocol. In: Proc. of ACM SIGCOMM 1998, Vancouver, Canada (1998)
Ripeanu, M., Iamnitchi, A.: Bloom Filters – Short Tutorial (2001) (unpublished)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Khambatti, M., Ryu, K.D., Dasgupta, P. (2004). Structuring Peer-to-Peer Networks Using Interest-Based Communities. In: Aberer, K., Koubarakis, M., Kalogeraki, V. (eds) Databases, Information Systems, and Peer-to-Peer Computing. DBISP2P 2003. Lecture Notes in Computer Science, vol 2944. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24629-9_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-24629-9_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20968-3
Online ISBN: 978-3-540-24629-9
eBook Packages: Springer Book Archive