Structuring Peer-to-Peer Networks Using Interest-Based Communities

  • Mujtaba Khambatti
  • Kyung Dong Ryu
  • Partha Dasgupta
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2944)


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.


Digital Library Overlay Network Group Attribute Bloom Filter Link Weight 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
  2. 2.
  3. 3.
  4. 4.
    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)Google Scholar
  5. 5.
  6. 6.
    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)Google Scholar
  7. 7.
  8. 8.
  9. 9.
    Yang, B., Garcia-Molina, H.: Efficient Search in Peer-to-peer Networks. In: International Conf. On Distributed Computing Systems, Vienna, Austria (2002)Google Scholar
  10. 10.
    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)Google Scholar
  11. 11.
    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)Google Scholar
  12. 12.
    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)Google Scholar
  13. 13.
    Gummadi, R., Hohlt, B.: Efficient Implementation Of A Publish-Subscribe-Notify Model Using Highly-Concurrent B-Trees (2000) (unpublished)Google Scholar
  14. 14.
    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)Google Scholar
  15. 15.
    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)Google Scholar
  16. 16.
    Bloom, B.: Space/time Trade-offs in Hash Coding with Allowable Errors. Communications of the ACM 13(7), 422–426 (1970)zbMATHCrossRefGoogle Scholar
  17. 17.
    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)Google Scholar
  18. 18.
    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)Google Scholar
  19. 19.
    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)Google Scholar
  20. 20.
    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)Google Scholar
  21. 21.
    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)Google Scholar
  22. 22.
    Ripeanu, M., Iamnitchi, A.: Bloom Filters – Short Tutorial (2001) (unpublished)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2004

Authors and Affiliations

  • Mujtaba Khambatti
    • 1
  • Kyung Dong Ryu
    • 1
  • Partha Dasgupta
    • 1
  1. 1.Arizona State UniversityTempeUSA

Personalised recommendations