An Adaptive Algorithm for Efficient Message Diffusion in Unreliable Environments

In this paper, we propose a novel approach for solving the reliable broadcast problem in a probabilistic unreliable model. Our approach consists in first defining the optimality of probabilistic reliable broadcast algorithms and the adaptiveness of algorithms that aim at converging toward such optimality. Then, we propose an algorithm that precisely converges toward the optimal behavior, thanks to an adaptive strategy based on Bayesian statistical inference. We compare the performance of our algorithm with that of a typical gossip algorithm through simulation. Our results show, for example, that our adaptive algorithm quickly converges toward such exact knowledge.


Published in:
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN'2004), 507-516
Presented at:
International Conference on Dependable Systems and Networks (DSN'2004), Florence, Italy, July 2004
Year:
2004
Keywords:
Laboratories:




 Record created 2006-05-10, last modified 2018-03-17

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)