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
An efficient reliable broadcast protocol
ACM SIGOPS Operating Systems Review
End-to-end packet delay and loss behavior in the internet
SIGCOMM '93 Conference proceedings on Communications architectures, protocols and applications
ACM Transactions on Computer Systems (TOCS)
Scalable Management and Data Mining Using Astrolabe
IPTPS '01 Revised Papers from the First International Workshop on Peer-to-Peer Systems
Lightweight Probabilistic Broadcast
DSN '01 Proceedings of the 2001 International Conference on Dependable Systems and Networks (formerly: FTCS)
SCAMP: Peer-to-Peer Lightweight Membership Service for Large-Scale Group Communication
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
Application-Level Multicast Using Content-Addressable Networks
NGC '01 Proceedings of the Third International COST264 Workshop on Networked Group Communication
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
GSGC: An Efficient Gossip-Style Garbage Collection Scheme for Scalable Reliable Multicast
Directional Gossip: Gossip in a Wide Area Network
Directional Gossip: Gossip in a Wide Area Network
GROUP MEMBERSHIP IN THE EPIDEMIC STYLE
GROUP MEMBERSHIP IN THE EPIDEMIC STYLE
Overcast: reliable multicasting with on overlay network
OSDI'00 Proceedings of the 4th conference on Symposium on Operating System Design & Implementation - Volume 4
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 2
Scribe: a large-scale and decentralized application-level multicast infrastructure
IEEE Journal on Selected Areas in Communications
Probabilistic Reliable Dissemination in Large-Scale Systems
IEEE Transactions on Parallel and Distributed Systems
Low traffic overlay networks with large routing tables
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Designing a DHT for low latency and high throughput
NSDI'04 Proceedings of the 1st conference on Symposium on Networked Systems Design and Implementation - Volume 1
CLON: Overlay Networks and Gossip Protocols for Cloud Environments
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
Building a peer-to-peer overlay for efficient routing and low maintenance
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
A gossip-based mutual exclusion algorithm for cloud environments
GPC'12 Proceedings of the 7th international conference on Advances in Grid and Pervasive Computing
An unstructured termination detection algorithm using gossip in cloud computing environments
ARCS'13 Proceedings of the 26th international conference on Architecture of Computing Systems
Bounded gossip: a gossip protocol for large-scale datacenters
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
| Hi-index | 0.00 |
Gossip-based or epidemic algorithms rely on a peer-to-peer model for dissemination of multicast messages, and are simple, scalable and reliable. However, traditional gossip-based protocols suffer from two major drawbacks: (i) they rely on each peer having knowledge of the global membership and (ii) they are oblivious to the underlying network and impose a high load on core router links. In this paper we present a self-organizing hierarchical membership protocol which attemps to solve these two issues. Nodes organize themselves into clusters reflecting the topology, and obtain partial views of the membership both within and outside the cluster. The size of the partial views is tuned automatically to achieve high reliability. Gossip messages are targeted mainly within clusters, thereby reducing network load.