Reaching (and Maintaining) Agreement in the Presence of Mobile Faults (Extended Abstract)

In this paper we consider a model where malicious agents can corrupt hosts and move around in a network of processors. We investigate the issue of fault mobility and the faults' power of disruption as a function of the fundamental parameter in such systems: the faults' speed. We do so by evaluating in a mobile-fault environment a classical testbed problem for fault-tolerant computing: Byzantine agreement.