Unformatted text preview: sender. Consider the Byzantine general’s problem in a system where all the processors are on the same broadcast channel. (a) In the above system, is it possible to tolerate more than n/3 faulty processors? (b) Suggest an efficient algorithm for the Byzantine general's problem in this system. 4. Exercise 12.5 from the textbook (4 th edition). 5. Consider the algorithm for the Byzantine general's problem with 4 nodes (Section 12.5.3 of the textbook, 4 th edition). Illustrate how the algorithm may not achieve correct outcome if only two of the nodes are fault-free. You may show the scenario using a figure (such as figure 12.20 in the textbook). P 1 P 2 P 3 P1 P2 P3 ECE428/CS425/CSE424: Distributed Systems Spring 2011 Homework 2 Due: by 2 pm on 02/22/2011...
View Full Document
- Spring '08
- AirTrain Newark, Total order, Causal Ordering, broadcast channel, following ordering property