Building Distributed Computing Abstractions in the Presence of Mobile Byzantine Failures
Antonella Del Pozzo
11 July 2017, 10:30 Salle/Bat : 465/PCRI-N
Contact :
Activités de recherche : Distributed algorithms
Résumé :
In a distributed system the nodes affected by arbitrarily failures are modeled as Byzantine. In this model the set of Byzantine processes never changes during the time contrarily to what happens in a long lasting execution, where nodes can be affected and restored. The Mobile Byzantine Model aims to capture such kind of scenario. In this talk we present the different Mobile Byzantine Failures models that have been defined so far and the problems, Consensus, Approximate Agreement and Distributed Registers, that have been solved in such models. Besides that, we are going to underline the challenges and impossibilities that arises when we move from the Byzantine to the Mobile Byzantine Failures model.
