Directional Gossip: Gossip in a Wide Area Network
EDCC-3 Proceedings of the Third European Dependable Computing Conference on Dependable Computing
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
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Araneola: A Scalable Reliable Multicast System for Dynamic Environments
NCA '04 Proceedings of the Network Computing and Applications, Third IEEE International Symposium
The peer sampling service: experimental evaluation of unstructured gossip-based implementations
Proceedings of the 5th ACM/IFIP/USENIX international conference on Middleware
HiScamp: self-organizing hierarchical membership protocol
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
HyParView: A Membership Protocol for Reliable Gossip-Based Broadcast
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Emergent Structure in Unstructured Epidemic Multicast
DSN '07 Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks
Disk failures in the real world: what does an MTTF of 1,000,000 hours mean to you?
FAST '07 Proceedings of the 5th USENIX conference on File and Storage Technologies
A scalable, commodity data center network architecture
Proceedings of the ACM SIGCOMM 2008 conference on Data communication
Adaptive Gravitational Gossip: A Gossip-Based Communication Protocol with User-Selectable Rates
IEEE Transactions on Parallel and Distributed Systems
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive 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
| Hi-index | 0.00 |
Although epidemic or gossip-based multicast is a robust and scalable approach to reliable data dissemination, its inherent redundancy results in high resource consumption on both links and nodes. This problem is aggravated in settings that have costlier or resource constrained links as happens in Cloud Computing infrastructures composed by several interconnected data centers across the globe. The goal of this work is therefore to improve the efficiency of gossip-based reliable multicast by reducing the load imposed on those constrained links. In detail, the proposed clon protocol combines an overlay that gives preference to local links and a dissemination strategy that takes into account locality. Extensive experimental evaluation using a very large number of simulated nodes shows that this results in a reduction of traffic in constrained links by an order of magnitude, while at the same time preserving the resilience properties that make gossip-based protocols so attractive.