Stabilizing Distributed R-Trees for Peer-to-Peer Content Routing

Publish/subscribe systems provide useful platforms for delivering data (events) from publishers to subscribers in a decoupled fashion. Developing efficient publish/subscribe schemes in dynamic distributed systems is still an open problem for complex subscriptions (spanning multi-dimensional intervals). We propose a distributed R-tree (DR-tree) structure that uses R-tree-based spatial filters to construct a peer-to-peer overlay optimized for scalable and efficient selective dissemination of information. We adapt wellknown variants of R-trees to organize publishers and subscribers in balanced peer-to-peer networks that support content-based filtering in publish/subscribe systems. DR-tree overlays guarantee subscription and publication times logarithmic in the size of the network while keeping space requirements low (comparable to distributed hash tables). The maintenance of the overlay is local and the structure is balanced with height logarithmic in the number of nodes. DR-tree overlays...

• Type: Journal
• Year: 2010
• Where: TPDS
• Authors: Silvia Bianchi, Pascal Felber, Maria Gradinariu Potop-Butucaru
• Keywords: Dynamic Distributed Systems, Efficient Selective Dissemination, Hardware, Support Content-based Filtering, TPDS 2010