Stabilizing Peer-to-Peer Spatial Filters

In this paper, we propose and prove correct a distributed stabilizing implementation of an overlay, called DR-tree, optimized for efficient selective dissemination of information. DR-tree copes with nodes dynamicity (frequent joins and leaves) and memory and counter program corruptions, that is, the processes can connect/disconnect at any time, and their memories and programs can be corrupted. The maintenance of the structure is local and requires no additional memory to guarantee its stabilization. The structure is balanced and is of height O(logm(N)), which makes it suitable for performing efficient data storage or search. We extend our overlay in order to support complex content-based filtering in publish/subscribe systems. Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion in distributed networks. Developing efficient publish/subscribe schemes in dynamic distributed systems is still an open prob...

• Type: Conference
• Year: 2007
• Where: ICDCS
• Authors: Silvia Bianchi, Ajoy Kumar Datta, Pascal Felber, Maria Gradinariu
• Keywords: Distributed And Parallel Computing, Efficient Publish/subscribe Schemes, ICDCS 2007, Publish/subscribe, Publish/subscribe System