Enhancing DAG-Based Consensus Protocols with Weighted Voting: A Performance Analysis of Narwhal and Tusk

Bachelor thesis (2024)

Authors

V. Robotin Electrical Engineering, Mathematics and Computer Science

Contributors

Jérémie Decouchant Data-Intensive Systems - EEMCS (mentor)
R.M. Chotkan Data-Intensive Systems - EEMCS (mentor)
K. Liang Cyber Security - EEMCS (graduation committee member)
Faculty
Electrical Engineering, Mathematics and Computer Science, Electrical Engineering, Mathematics and Computer Science
More Info
expand_more

Published Date

26-06-2024

Language

English

Reuse Rights

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.

Faculty

Electrical Engineering, Mathematics and Computer Science

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.