Subscribe
Toronto, Canada
June 25, 2007 to June 27, 2007
ISBN: 0-7695-2837-3
pp: 27
Ajoy Datta , UNLV, School of Computer Science, USA
Pascal Felber , University of Neuchatel, Switzerland
Silvia Bianchi , University of Neuchatel, Switzerland
ABSTRACT
<p>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.</p> <p>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 problem for complex subscriptions (spanning multi-dimensional intervals). Embedding a publish/ subscribe system in a DR-trees is a new and viable solution. The DR-tree overlay also guarantees subscription and publication times logarithmic in the size of the network while keeping its space requirement low (comparable to its DHT-based counterparts). Nonetheless, the DRtree overlay helps in eliminating the false negatives and drastically reduces the false positives in the embedded publish/ subscribe system.</p>
INDEX TERMS
Content-based routing, publish/subscribe, peer-to-peer, self-organization, stabilizing dynamic R-trees.
CITATION
Ajoy Datta, Pascal Felber, Silvia Bianchi, "Stabilizing Peer-to-Peer Spatial Filters", ICDCS, 2007, 2013 IEEE 33rd International Conference on Distributed Computing Systems, 2013 IEEE 33rd International Conference on Distributed Computing Systems 2007, pp. 27, doi:10.1109/ICDCS.2007.139