ACM Transactions on Computer Systems (TOCS)
Directional Gossip: Gossip in a Wide Area Network
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
Lightweight Probabilistic Broadcast
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
ACM Transactions on Computer Systems (TOCS)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Low Latency Probabilistic Broadcast in Wide Area Networks
SRDS '04 Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Efficient and Adaptive Epidemic-Style Protocols for Reliable and Scalable Multicast
IEEE Transactions on Parallel and Distributed Systems
T-Man: gossip-based overlay topology management
ESOA'05 Proceedings of the Third international conference on Engineering Self-Organising Systems
Gossip-based service coordination for scalability and resilience
Proceedings of the 3rd workshop on Middleware for service oriented computing
| Hi-index | 0.00 |
The scalability and resilience of epidemic multicast, also called probabilistic or gossip-based multicast, rests on its symmetry: Each participant node contributes the same share of bandwidth thus spreading the load and allowing for redundancy On the other hand, the symmetry of gossiping means that it does not avoid nodes or links with less capacity Unfortunately, one cannot naively avoid such symmetry without also endangering scalability and resilience In this paper we point out how to break out of this dilemma, by lazily deferring message transmission according to a configurable policy An experimental proof-of-concept illustrates the approach.