Abstracting remote object interaction in a peer-2-peer environment
JGI '02 Proceedings of the 2002 joint ACM-ISCOPE conference on Java Grande
Distributed Programming with Typed Events
IEEE Software
Mobile databases: a selection of open issues and research directions
ACM SIGMOD Record
Evaluation of gossip to build scalable and reliable multicast protocols
Performance Evaluation - Special issue: Distributed systems performance
Scalable information dissemination for pervasive systems: implementation and evaluation
Proceedings of the 4th international workshop on Middleware for Pervasive and Ad-Hoc Computing (MPAC 2006)
Type-based publish/subscribe: Concepts and experiences
ACM Transactions on Programming Languages and Systems (TOPLAS)
Compact samples for data dissemination
Journal of Computer and System Sciences
Implementation and performance testing of a gossip-based communication system
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
A middleware for job distribution in peer-to-peer networks
PARA'06 Proceedings of the 8th international conference on Applied parallel computing: state of the art in scientific computing
Parametric subscriptions for content-based publish/subscribe networks
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
Compact samples for data dissemination
ICDT'07 Proceedings of the 11th international conference on Database Theory
BGP-based clustering for scalable and reliable gossip broadcast
GC'04 Proceedings of the 2004 IST/FET international conference on Global Computing
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
CBSE'06 Proceedings of the 9th international conference on Component-Based Software Engineering
Parametric Content-Based Publish/Subscribe
ACM Transactions on Computer Systems (TOCS)
| Hi-index | 0.00 |
Gossip-based broadcast algorithms have been considered as a viable alternative to traditional deterministic reliable broadcast algorithms in large scale environments. However, these algorithms focus on broadcasting events inside a large group of processes, while the multicasting events to a subset of processes in a group only, potentially varying for every event, has not been considered. We propose a scalable gossip-based multicast algorithm which ensures, with a high probability, that (1) a process interested in a multicast event delivers that event (just like in typical gossip-based broadcast algorithms), and that (2) a process not interested in that event does not receive it (unlike broadcast algorithms).