Juno: Aggregated Vector Consensus for Optimal Asynchronous Common Subset
In this paper, we propose aggregated vector consensus, a new vector consensus primitive designed for asynchronous networks. The primitive achieves agreement by outputting a vector of values aggregated from independent process inputs. We then introduce Juno, an asynchronous common subset (ACS) protocol that fully implements our aggregated vector consensus to attain optimal ${\mathcal{O}}\left({{n^2}}\right)$ message complexity.We further implement and evaluate Juno in comparison with the legacy HoneyBadgerBFT and the state-of-the-art Dory. Experiment results demonstrate its efficacy and efficiency. Our protocol demonstrates an average throughput performance improvement of 93% compared with HoneyBadgerBFT and a 47% improvement compared with Dory. Notably, our study makes significant progress in addressing the gap in applying vector consensus protocol in fully asynchronous networks.
Authors
- Joseph K. Liu (ORCID: https://orcid.org/0000-0001-6656-6240)
- Liangrong Zhao (ORCID: https://orcid.org/0009-0005-4294-5314)
- Jiangshan Yu (ORCID: https://orcid.org/0000-0001-8006-7392)
- Wang Qin (ORCID: https://orcid.org/0000-0002-5837-1125)
Institutions
- Commonwealth Scientific and Industrial Research Organisation (AU)
- The University of Sydney (AU)
- Australian Regenerative Medicine Institute (AU)
- Data61 (AU)
- Monash University (AU)
Publication Details
- Published
- 2024-11-13
- DOI
- https://doi.org/10.1109/prdc63035.2024.00023
- Primary Topic
- Distributed systems and fault tolerance
- Type
- article
- Field-Weighted Citation Impact
- 0.00