• DocumentCode
    1661193
  • Title

    Anonymous publish/subscribe in P2P networks

  • Author

    Datta, A.K. ; Gradinariu, M. ; Raynal, M. ; Simon, G.

  • fYear
    2003
  • Abstract
    One of the most important issues to deal with in peer-to-peer networks is how to disseminate information. In this paper, we use a completely new approach to solving the information dissemination problem. Our approach uses the publish/subscribe paradigm. The publish/subscribe method is the most inclusive strategy to establish communication between the information providers (publishers) and the information consumers (subscribers). We give a formal definition of publish/subscribe systems. We then use the publish/subscribe communication paradigm to design deterministic protocols (topic and content-based) for peer-to-peer networks. Our protocols are designed on top of an innovative information dissemination scheme, and can cope with the anonymity and mobility of both publishers and subscribers, weak-connectivity, and polarization, which are some of the characteristics of peer-to-peer networks. Moreover, in our solutions, every node could play a role of both publisher and subscriber The algorithms are designed completely independent of the underlying routing substrates. The key advantage of our protocols is that they are scalable without additional re-organization cost. To the best of our knowledge, this is the first time the content-based subscription has been addressed in peer-to-peer networks.
  • Keywords
    computer networks; protocols; P2P networks; anonymous publish/subscribe networks; deterministic protocols; information dissemination problem; peerto-peer networks; Algorithm design and analysis; Computer science; Costs; Intelligent networks; Peer to peer computing; Polarization; Protocols; Routing; Subscriptions; Telecommunications;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Parallel and Distributed Processing Symposium, 2003. Proceedings. International
  • ISSN
    1530-2075
  • Print_ISBN
    0-7695-1926-1
  • Type

    conf

  • DOI
    10.1109/IPDPS.2003.1213174
  • Filename
    1213174