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
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
Dynamo: amazon's highly available key-value store
Proceedings of twenty-first ACM SIGOPS symposium on Operating systems principles
SRDS '07 Proceedings of the 26th IEEE International Symposium on Reliable Distributed Systems
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
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
| Hi-index | 0.00 |
Cloud computing is an Internet-based computing paradigm that provides services in a virtualized form composed of plenty of sharable resources. In cloud computing environments, gossip protocols are engaged as a method to rapidly disseminate the state information for innumerable resources. Although the gossip protocols provide a robust and scalable multicast, there is a drawback that requires redundant messages in satisfying 100% of reliability. In our study, we propose a Group-based Gossip Multicast Protocol to reduce the message overhead while delivering the state information efficiently and fault tolerantly. Furthermore, we verified the performance of the proposed protocol through experiments.