Epidemic algorithms for replicated database maintenance
PODC '87 Proceedings of the sixth annual ACM Symposium on Principles of distributed computing
Peer-to-Peer Membership Management for Gossip-Based Protocols
IEEE Transactions on Computers
A Lightweight, Robust P2P System to Handle Flash Crowds
ICNP '02 Proceedings of the 10th IEEE International Conference on Network Protocols
Gossip versus Deterministically Constrained Flooding on Small Networks
DISC '00 Proceedings of the 14th International Conference on Distributed Computing
ACM Transactions on Computer Systems (TOCS)
Improving Search in Peer-to-Peer Networks
ICDCS '02 Proceedings of the 22 nd International Conference on Distributed Computing Systems (ICDCS'02)
Lightweight probabilistic broadcast
ACM Transactions on Computer Systems (TOCS)
Correctness of a gossip based membership protocol
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Simple Locality-Aware Co-allocation in Peer-to-Peer Supercomputing
CCGRID '06 Proceedings of the Sixth IEEE International Symposium on Cluster Computing and the Grid
Smartsockets: solving the connectivity problems in grid computing
Proceedings of the 16th international symposium on High performance distributed computing
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
A robust and scalable peer-to-peer gossiping protocol
AP2PC'03 Proceedings of the Second international conference on Agents and Peer-to-Peer Computing
Smartsockets: solving the connectivity problems in grid computing
Proceedings of the 16th international symposium on High performance distributed computing
Gossiping in distributed systems
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Formal analysis techniques for gossiping protocols
ACM SIGOPS Operating Systems Review - Gossip-based computer networking
Supporting self-organization for hybrid grid resource scheduling
Proceedings of the 2008 ACM symposium on Applied computing
Prestige-based peer sampling service: interdisciplinary approach to secure gossip
Proceedings of the 2009 ACM symposium on Applied Computing
An analytical model of information dissemination for a gossip-based protocol
Computer Networks: The International Journal of Computer and Telecommunications Networking
Gozar: NAT-friendly peer sampling with one-hop distributed NAT traversal
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
Usurp: distributed NAT traversal for overlay networks
Proceedings of the 11th IFIP WG 6.1 international conference on Distributed applications and interoperable systems
AgentScope: multi-agent systems development in focus
The 10th International Conference on Autonomous Agents and Multiagent Systems - Volume 1
Design of a P2P content recommendation system using affinity networks
Computer Communications
| Hi-index | 0.00 |
Gossiping is an effective way of disseminating information in large dynamic systems. Until now, most gossiping algorithms have been designed and evaluated using simulations. However, these algorithms often cannot cope with several real-world problems that tend to be overlooked in simulations, such as node failures, message loss, non-atomicity ofinformation exchange, and firewalls. We explore the problems in designing and applying gossiping algorithms in real systems. Next to identifying the most prominent real-world problems and their current solutions, we introduce Actualized Robust Random Gossiping (ARRG), an algorithm specifically designed to take all of these real-world problems into account simultaneously. To address network connectivity problems such as firewalls we introduce a novel technique, the Fallback Cache. This cache can be applied to existing gossiping algorithms to improve their resilience against connectivity problems. We introduce a new metric, Perceived Network Size to measure a gossiping algorithm's effectiveness. In contrast to existing metrics, our new metric does not require global knowledge. Evaluation of ARRG and the Fallback Cache in a number of realistic scenarios shows that the proposed techniques significantly improve the performance of gossiping algorithms in networks with limited connectivity. Even in pathological situations, with 50% message loss and with 80% of the nodes behind a NAT, ARRG continues to work well. Existing algorithms fail in these circumstances.