YoVDO

Good-Case Latency of Byzantine Broadcast: A Complete Categorization

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

Consensus Algorithms Courses Distributed Systems Courses Byzantine Fault Tolerance Courses

Course Description

Overview

Explore the complete categorization of good-case latency in Byzantine broadcast protocols through this conference talk from PODC 2021. Delve into state machine replication, examining results across synchronous, partially synchronous, and asynchronous network models. Gain insights into specific protocols like PBFT and FBA, understanding their performance characteristics and trade-offs in different network environments. Enhance your knowledge of distributed systems and consensus algorithms, particularly focusing on latency optimization in Byzantine fault-tolerant systems.

Syllabus

Introduction
State Machine Replication
Results
Synchrony
Partial Synchrony
PBFT
FAB
Asynchronous


Taught by

Association for Computing Machinery (ACM)

Related Courses

PBFT and Blockchains
Simons Institute via YouTube
Sync HotStuff: Simple and Practical Synchronous State Machine Replication
IEEE via YouTube
DispersedLedger - High-Throughput Byzantine Consensus on Variable Bandwidth Networks
USENIX via YouTube
Scalable Bias-Resistant Distributed Randomness
IEEE via YouTube
COBRA - Dynamic Proactive Secret Sharing for Confidential BFT Services
IEEE via YouTube