Why is it needed to be anonymous in a distributed system?
Answers
1. Why is it needed to be anonymous in a distributed system? Describe the
algorithmic process of electing a leader from a set of anonymous peers.
Compute its best message complexity specifying the assumptions you need.
2.In a network of 100 processes, specify an initial configuration of Franklin’s
algorithm so that the leader is elected in the second round.
3.For each case give an example (with simple code) of the following faults (separately)
along with the normally correct behavior of the system that you want to propose.
i. Omission failure
ii. Transient failure
iii. Byzantine failure
iv. Software failure
v. Temporal failure
4.Present an example to show that in a synchronous system, byzantine agreement
cannot be reached using the oral message algorithm when there are six generals
and two traitors.
plzzz do me as brainliest one