A study on fault tolerant distributed algorithms for time-bounded Byzantine faults

点击翻译按钮获取中文摘要

Large-scale distributed systems require distributed algorithms that guarantee tolerance against faults at processes. We aim to propose a new fault model in between the transient fault model and the permanent Byzantine fault model, and extend existing design schemes for fault tolerant distributed algorithms, such as self-stabilization. We focused on the mobile Byzantine fault model, and we obtained distributed algorithms for the mobile Byzantine agreement problem. Additionally, we obtained results about design of self-stabilizing algorithms, such as probabilistically stabilizing algorithms with bounded expected stabilization time, memory complexity of the leader election problem in the population protocol model.