Tiara: A Self-stabilizing Deterministic Skip List
SSS '08 Proceedings of the 10th International Symposium on Stabilization, Safety, and Security of Distributed Systems
Dynamic publish/subscribe to meet subscriber-defined delay and bandwidth constraints
EuroPar'10 Proceedings of the 16th international Euro-Par conference on Parallel processing: Part I
Dynamically reconfigurable filtering architectures
SSS'10 Proceedings of the 12th international conference on Stabilization, safety, and security of distributed systems
Self-stabilizing minimum degree spanning tree within one from the optimal degree
Journal of Parallel and Distributed Computing
Ripple: A publish/subscribe service for multidata item updates propagation in the cloud
Journal of Network and Computer Applications
Corona: a stabilizing deterministic message-passing skip list
SSS'11 Proceedings of the 13th international conference on Stabilization, safety, and security of distributed systems
Tiara: A self-stabilizing deterministic skip list and skip graph
Theoretical Computer Science
A content-based publish/subscribe matching algorithm for 2d spatial objects
Middleware'11 Proceedings of the 12th ACM/IFIP/USENIX international conference on Middleware
Content-based publish/subscribe using distributed R-trees
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
A content-based publish/subscribe matching algorithm for 2D spatial objects
Proceedings of the 12th International Middleware Conference
Corona: A stabilizing deterministic message-passing skip list
Theoretical Computer Science
| Hi-index | 0.00 |
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 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.