A group membership service for large-scale grids
Proceedings of the 6th international workshop on Middleware for grid computing
Improving scalability of autonomic systems: the frequency-aware search approach
Autonomics '08 Proceedings of the 2nd International Conference on Autonomic Computing and Communication Systems
CLON: overlay network for clouds
Proceedings of the Third Workshop on Dependable Distributed Data Management
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
FlightPath: obedience vs. choice in cooperative services
OSDI'08 Proceedings of the 8th USENIX conference on Operating systems design and implementation
Flexible and efficient resource location in large-scale systems
Proceedings of the 4th International Workshop on Large Scale Distributed Systems and Middleware
Balancing gossip exchanges in networks with firewalls
IPTPS'10 Proceedings of the 9th international conference on Peer-to-peer systems
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
RCourse: a robustness benchmarking suite for publish/subscribe overlay simulations with Peersim
Proceedings of the First Workshop on P2P and Dependability
Bounded gossip: a gossip protocol for large-scale datacenters
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
Gossip, or epidemic, protocols have emerged as a powerful strategy to implement highly scalable and resilient reliable broadcast primitives. Due to scalability reasons, each participant in a gossip protocol maintains a partial view of the system. The reliability of the gossip protocol depends upon some critical properties of these views, such as degree distribution and clustering coefficient. Several algorithms have been proposed to maintain partial views for gossip protocols. In this paper, we show that under a high number of faults, these algorithms take a long time to restore the desirable view properties. To address this problem, we present HyParView, a new membership protocol to support gossip-based broadcast that ensures high levels of reliability even in the presence of high rates of node failure. The HyParView protocol is based on a novel approach that relies in the use of two distinct partial views, which are maintained with different goals by different strategies.