Gossip-based aggregation of trust in decentralized reputation systems
Autonomous Agents and Multi-Agent Systems
Quilt: a patchwork of multicast regions
Proceedings of the Fourth ACM International Conference on Distributed Event-Based Systems
Local agent-based self-stabilisation in global resource utilisation
International Journal of Autonomic Computing
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
Hyphen: a hybrid protocol for generic overlay construction in P2P environments
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Reliable operational services in MANETs by misbehavior-tolerant quorum systems
Proceedings of the 8th International Conference on Network and Service Management
| Hi-index | 0.00 |
There is an inherent trade-off between epidemic and deterministic tree-based broadcast primitives. Tree-based approaches have a small message complexity in steady-state but are very fragile in the presence of faults. Gossip, or epidemic, protocols have a higher message complexity but also offer much higher resilience. This paper proposes an integrated broadcast scheme that combines both approaches. We use a low cost scheme to build and maintain broadcast trees embedded on a gossipbased overlay. The protocol sends the message payload preferably via tree branches but uses the remaining links of the gossip overlay for fast recovery and expedite tree healing. Experimental evaluation presented in the paper shows that our new strategy has a low overhead and that is able to support large number of faults while maintaining a high reliability.