Peer-to-peer evolutionary algorithms with adaptive autonomous selection
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Collaboration among a satellite swarm
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
Synopsis diffusion for robust aggregation in sensor networks
ACM Transactions on Sensor Networks (TOSN)
Rappel: Exploiting interest and network locality to improve fairness in publish-subscribe systems
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 10th ACM/IFIP/USENIX International Conference on Middleware
A decentralized, scalable, and autonomous grid monitoring system
OPODIS'07 Proceedings of the 11th international conference on Principles of distributed systems
Towards dependable networks of mobile arbitrary devices - diagnosis and scalability
Future directions in distributed computing
Middleware'09 Proceedings of the ACM/IFIP/USENIX 10th international conference on Middleware
| Hi-index | 0.00 |
Abstract: Gossip-based multicast can be an effective tool for providing highly reliable and scalable message dissemination. In this paper, we consider the problem of gossiping within overlapping process groups. If each subgroup independently runs a uniform gossip protocol, then the total gossip overhead could be high for a process that is a member of many subgroups. We present a novel gossip protocol that allows individual subgroup members to trade-off update quality for gossip overhead, enabling processes to belong to several subgroups while maintaining a low total gossip overhead. Our results include a mathematical model for message dissemination under this modified gossip protocol, and an algorithm that computes gossip parameters such that all processes within a subgroup achieve their desired update quality.