Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
U-Net: a user-level network interface for parallel and distributed computing
SOSP '95 Proceedings of the fifteenth ACM symposium on Operating systems principles
ACM Transactions on Computer Systems (TOCS)
Replication and fault-tolerance in the ISIS system
Proceedings of the tenth ACM symposium on Operating systems principles
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ACM Transactions on Computer Systems (TOCS)
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
The many faces of publish/subscribe
ACM Computing Surveys (CSUR)
A Gossip-Style Failure Detection Service
A Gossip-Style Failure Detection Service
High throughput reliable message dissemination
Proceedings of the 2004 ACM symposium on Applied computing
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
Exploiting Gossip for Self-Management in Scalable Event Notification Systems
ICDCSW '07 Proceedings of the 27th International Conference on Distributed Computing Systems Workshops
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
How robust are gossip-based communication protocols?
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
PNUTS: Yahoo!'s hosted data serving platform
Proceedings of the VLDB Endowment
| Hi-index | 0.00 |
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in support of this class of protocols. GO allows nodes to join multiple gossip groups without losing the appealing fixed bandwidth guarantee of gossip protocols, and the platform also optimizes latency in a principled manner. Our algorithm is based on the observations that multiple rumors can often be squeezed into a single IP packet, and that indirect routing of rumors can speed up delivery. We formalize these observations and develop a theoretical analysis of this algorithm. We have also implemented GO, and studied the effectiveness of the algorithm by comparing it to the more standard random dissemination gossip strategy.