[2018] COMPSCI 711 Parallel and Distributed Computing - Byzantine Problem and EIG Algorithms
Question 5
(a) Demonstrate your understanding of the Byzantine problem by describing one scenario where the EIG algorithm fails to reach agreement for three nodes, N=3, with one failure, F=1, even if the EIG tree is expanded to two levels.
(b) Which of the three correctness conditions (termination, agreement and validity) will be violated in this case and why?
Hint: Consider the case when process P1 is faulty, process P2 is non-faulty and starts with v2=1, process P3 is non-faulty and starts with v3=1 and the default (tie-breaking) value is v0=0. To support your arguments, you can use EIG diagrams such as the one given below.
Get the Solution to This Question
WeChat (微信)
WhatsApp
