|Résumé||Reaching consensus on a common value in a distributed system is a well-studied central problem in distributed computing. Unfortunately, even modest network dynamics prohibit solvability. For many problems, such as, distributed control, clock synchronization, etc., it is however sufficient to asymptotically converge to the same value, or decide on values not too far from each other. We study solvability of these consensus variants in highly dynamic networks, provide time complexity results, and present fast algorithms. The talk finishes with an outlook on current research in biology.
The talk is on previous and current research with Bernadette Charron-Bost (LIX) and Thomas Nowak (LRI). |