Highly available distributed services and fault-tolerant distributed garbage collection
PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
SIAM Journal on Applied Mathematics
Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Flexible update propagation for weakly consistent replication
Proceedings of the sixteenth ACM symposium on Operating systems principles
Optimal Unconditional Information Diffusion
DISC '01 Proceedings of the 15th International Conference on Distributed Computing
Efficient Buffering in Reliable Multicast Protocols
NGC '99 Proceedings of the First International COST264 Workshop on Networked Group Communication
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Scalable and Secure Resource Location
HICSS '00 Proceedings of the 33rd Hawaii International Conference on System Sciences-Volume 4 - Volume 4
On Diffusing Updates in a Byzantine Environment
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
WEAK-CONSISTENCY GROUP COMMUNICATION AND MEMBERSHIP (Ph.D. dissertation)
WEAK-CONSISTENCY GROUP COMMUNICATION AND MEMBERSHIP (Ph.D. dissertation)
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
IEEE Transactions on Dependable and Secure Computing
How robust are gossip-based communication protocols?
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
On the benefits of cheating by self-interested agents in vehicular networks
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
On spreading recommendations via social gossip
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Brahms: byzantine resilient random membership sampling
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
AVMEM - availability-aware overlays for management operations in non-cooperative distributed systems
Proceedings of the ACM/IFIP/USENIX 2007 International Conference on Middleware
Brahms: Byzantine resilient random membership sampling
Computer Networks: The International Journal of Computer and Telecommunications Networking
AVMEM: availability-aware overlays for management operations in non-cooperative distributed systems
MIDDLEWARE2007 Proceedings of the 8th ACM/IFIP/USENIX international conference on Middleware
Scalable byzantine computation
ACM SIGACT News
Preventing DDoS attacks on internet servers exploiting P2P systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Discovering network topology in the presence of byzantine faults
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On byzantine broadcast in loosely connected networks
DISC'12 Proceedings of the 26th international conference on Distributed Computing
| Hi-index | 0.00 |
A new class of gossip protocols to diffuse updates securely is presented. The protocols rely on annotating updates with the path along which they travel. To avoid a combinatorial explosion in the number of annotated updates, rules are employed to choose which updates to keep. Different sets of rules lead to different protocols. Results of simulated executions for a collection of such protocols are described-the protocols would appear to be practical, even in large networks.