Infrastructureless Data Dissemination: A Distributed Hash Table Based Publish/Subscribe System

Vinod Muthusamy.

University of Toronto, 2005.


Peer-to-peer networks can offer benefits to distributed content-based publish/subscribe data dissemination systems. In particular, since a peer-to-peer network's aggregate resources grows as the number of participants increases, scalability can be achieved without managing or deploying additional infrastructure. This thesis proposes an efficient algorithm for supporting publish/subscribe subscriptions that specify a range of interest. The algorithm is built over the Pastry distributed hash table and is completely decentralized. Load balance is addressed by subscription delegation away from overloaded peers, and a bottom up tree search technique that avoids root hotspots. As well, fault-tolerance is achieved with a light-weight replication scheme that quickly detects and recovers from faults. Simulations support the scalability and fault-tolerance properties of the algorithm.


Tags: p2p

Readers who enjoyed the above work, may also like the following:

  • Infrastructure Free Content-Based Publish/Subscribe.
    Vinod Muthusamy and Hans-Arno Jacobsen.
    ACM/IEEE Trans. on Networking, November 2013.
    (Accepted for publication in August, 2013).
    Tags: content-based publish/subscribe, content-based routing, p2p, publish/subscribe
  • Small-Scale Peer-to-peer Publish/Subscribe.
    Vinod Muthusamy and Hans-Arno Jacobsen.
    In P2P Knowledge Management Workshop at MobiQuitous, July 2005.
    Tags: p2p