FBAE implements currently a version of Sequencer and BBOBB algorithms which do not guarantee uniform property (if a process delivers a message, all correct processes will eventually deliver this message) of these total order broadcast algorithms.
But LCR and Ring Paxos algorithms (which are currently implemented) intrinsically guarantee uniform property.
So, to be able to compare all of these 4 algorithms, we must add a new program argument (e.g. -u) to specify that tested algorithm must guarantee uniform property and modify Sequencer and BBOBB algorithms to add this guarantee.
Note: Trains algorithm (which is also currenly implement) can guarantee this prperty or not ==> It must take into account this new program argument.
FBAE implements currently a version of Sequencer and BBOBB algorithms which do not guarantee uniform property (if a process delivers a message, all correct processes will eventually deliver this message) of these total order broadcast algorithms.
But LCR and Ring Paxos algorithms (which are currently implemented) intrinsically guarantee uniform property.
So, to be able to compare all of these 4 algorithms, we must add a new program argument (e.g. -u) to specify that tested algorithm must guarantee uniform property and modify Sequencer and BBOBB algorithms to add this guarantee.
Note: Trains algorithm (which is also currenly implement) can guarantee this prperty or not ==> It must take into account this new program argument.