Let us consider a Regular Reliable Broadcast primitive satisfying the following properties: Validity: If a correct process p broadcasts a message m, then p eventually delivers m. No duplication: No message is delivered more than once. No creation: If a process delivers a message m with sender s, then m was previously broadcast by process s. Agreement: If a message m is delivered by some correct process, then m is eventually delivered by every correct process. Let us consider a distributed system composed of N processes executing the Eager algorithm (reported in figure)

Implements: ReliableBroadcast, instance rb. Uses: BestEffortBroadcast, instance beb. upon event ! rb, Init " do delivered := ; upon event ! rb, Broadcast | m " do trigger ! beb, Broadcast | [DATA, self, m] "; upon event ! beb, Deliver | p, [DATA, s, m] " do if m $ delivered then delivered := delivered {m}; trigger ! rb, Deliver | s, m "; trigger ! beb, Broadcast | [DATA, s, m] ";

Answer to the following questions: 1. assuming that up to f processes may commit omission failures and no other failures may happen, discuss if the eager algorithm is still able to satisfy the Regular Reliable Broadcast specification (discuss each property individually). 1. assuming that up to f processes may be Byzantine faulty but constrained to have a symmetric behaviour1

, discuss if the eager algorithm is still able to satisfy the Regular Reliable Broadcast

specification (discuss each property individually).