Table 3 Parameters for algorithms MA and CL
From: Timing analysis of leader-based and decentralized Byzantine consensus algorithms
Fault-free case | Worst case | |||
|---|---|---|---|---|
α | β | α | β | |
MA-D | t+2 | 0 | t+2 | 0 |
MA-L | 4 | 0 | 4 | t |
CL-D | t+3 | 0 | t+3 | 0 |
CL-L | 5 | 0 | 5 | t |
From: Timing analysis of leader-based and decentralized Byzantine consensus algorithms
Fault-free case | Worst case | |||
|---|---|---|---|---|
α | β | α | β | |
MA-D | t+2 | 0 | t+2 | 0 |
MA-L | 4 | 0 | 4 | t |
CL-D | t+3 | 0 | t+3 | 0 |
CL-L | 5 | 0 | 5 | t |