EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Leadership Uniformity in Timeout-Based Quorum Byzantine Fault Tolerance (QBFT) Consensus

Andreas Polyvios Delladetsimas, Stamatis Papangelou, Elias Iosif, George Giaglis

Big Data and Cognitive Computing · 24.07.2025 · 9 (8) · 196

DOI: 10.3390/bdcc9080196 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Big Data and Cognitive Computing, online erschienen am 24.07.2025. Verfasst von Andreas Polyvios Delladetsimas und 3 weiteren Autor:innen. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 34 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: European Union—DIGI4ECO project.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This study evaluates leadership uniformity—the degree to which the proposer role is evenly distributed among validator nodes over time—in Quorum-based Byzantine Fault Tolerance (QBFT), a Byzantine Fault-Tolerant (BFT) consensus algorithm used in permissioned blockchain networks. By introducing simulated follower timeouts derived from uniform, normal, lognormal, and Weibull distributions, it models a range of network conditions and latency patterns across nodes. This approach integrates Raft-inspired timeout mechanisms into the QBFT framework, enabling a more detailed analysis of leader selection under different network conditions. Three leader selection strategies are tested: Direct selection of the node with the shortest timeout, and two quorum-based approaches selecting from the top 20% and 30% of nodes with the shortest timeouts. Simulations were conducted over 200 rounds in a 10-node network. Results show that leader selection was most equitable under the Weibull distribution with shape k=0.5, which captures delay behavior observed in real-world networks. In contrast, the uniform distribution did not consistently yield the most balanced outcomes. The findings also highlight the effectiveness of quorum-based selection: While choosing the node with the lowest timeout ensures responsiveness in each round, it does not guarantee uniform leadership over time. In low-variability distributions, certain nodes may be repeatedly selected by chance, as similar timeout values increase the likelihood of the same nodes appearing among the fastest. Incorporating controlled randomness through quorum-based voting improves rotation consistency and promotes fairer leader distribution, especially under heavy-tailed latency conditions. However, expanding the candidate pool beyond 30% (e.g., to 40% or 50%) introduced vote fragmentation, which complicated quorum formation in small networks and led to consensus failure. Overall, the study demonstrates the potential of timeout-aware, quorum-based leader selection as a more adaptive and equitable alternative to round-robin approaches, and provides a foundation for developing more sophisticated QBFT variants tailored to latency-sensitive networks.

Förderung

  • European Union—DIGI4ECO project

Zitieren

APA

Delladetsimas, A. P., Papangelou, S., Iosif, E., & Giaglis, G. (2025). Leadership Uniformity in Timeout-Based Quorum Byzantine Fault Tolerance (QBFT) Consensus. Big Data and Cognitive Computing, 9(8), 196. https://doi.org/10.3390/bdcc9080196

Vancouver

Delladetsimas AP, Papangelou S, Iosif E, Giaglis G. Leadership Uniformity in Timeout-Based Quorum Byzantine Fault Tolerance (QBFT) Consensus. Big Data and Cognitive Computing. 2025;9(8):196. doi:10.3390/bdcc9080196

BibTeX
@article{Delladetsimas2025,
  author = {Delladetsimas, Andreas Polyvios and Papangelou, Stamatis and Iosif, Elias and Giaglis, George},
  title = {Leadership Uniformity in Timeout-Based Quorum Byzantine Fault Tolerance (QBFT) Consensus},
  journal = {Big Data and Cognitive Computing},
  year = {2025},
  volume = {9},
  number = {8},
  pages = {196},
  doi = {10.3390/bdcc9080196}
}
Kostenlos starten →