Lewis Tseng: Fault-tolerant Consensus in Directed Networks

We studied various fault-tolerant consensus problems under different fault models in communication networks that are modeled as arbitrary directed graphs. I will present the tight necessary and sufficient conditions on the underlying communication graph for exact crash-tolerant consensus and Byzantine consensus. Moreover, I will discuss how to deal with asymmetric flow of information due to the existence of directed links