Enhancing DAG-Based Consensus Protocols with Weighted Voting: A Performance Analysis of Narwhal and Tusk
V. Robotin (TU Delft - Electrical Engineering, Mathematics and Computer Science)
Jérémie Decouchant – Mentor (TU Delft - Data-Intensive Systems)
R.M. Chotkan – Mentor (TU Delft - Data-Intensive Systems)
K. Liang – Graduation committee member (TU Delft - Cyber Security)
More Info
expand_more
Other than for strictly personal use, it is not permitted to download, forward or distribute the text or part of it, without the consent of the author(s) and/or copyright holder(s), unless the work is under an open content license such as Creative Commons.
Abstract
This paper explores the integration of weighted vot-ing mechanisms into DAG-based consensus proto-cols, such as Tusk [EuroSys’22], which promise high throughput and low latency. Weighted voting,
pioneered by protocols like WHEAT [SRDS’15] and AWARE [TDSC’20], aims to optimize perfor-mance metrics such as latency and throughput by assigning weights to nodes based on their latency with other nodes. We employ real-world latency data from CloudPing to evaluate the impact of weighted voting on Tusk, comparing them against its unweighted counterpart. Our results demon-strate significant performance improvements, with the weighted voting mechanism achieving up to 37% lower consensus latency compared to un-weighted approaches.