Good-case early-stopping latency of synchronous byzantine reliable broadcast: the deterministic case

This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical distributed systems. Although significant strides have b...

Full description

Saved in:
Bibliographic Details
Published in:Distributed computing Vol. 37; no. 2; pp. 121 - 143
Main Authors: Albouy, Timothé, Frey, Davide, Raynal, Michel, Taïani, François
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.06.2024
Springer Nature B.V
Springer Verlag
Subjects:
Algorithms
Computer Communication Networks
Computer Hardware
Computer Science
Computer Systems Organization and Communication Networks
Distributed processing
Messages
Questions
Software Engineering/Programming and Operating Systems
Theory of Computation
Transfer of funds
Upper bounds
Synchronous system
Weighted predicate
Genericity
Deterministic algorithm
Good-case latency
Reliable broadcast
Byzantine fault
Byzantine Fault
Good-Case Latency
Reliable Broadcast
Synchronous System
Deterministic Algorithm
Weighted Predicate
ISSN:0178-2770, 1432-0452
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers the good-case latency of Byzantine Reliable Broadcast (BRB), i.e., the time taken by correct processes to deliver a message when the initial sender is correct. This time plays a crucial role in the performance of practical distributed systems. Although significant strides have been made in recent years on this question, progress has mainly focused on either asynchronous or randomized algorithms. By contrast, the good-case latency of deterministic synchronous BRB under a majority of Byzantine faults has been little studied. In particular, it was not known whether a good-case latency below the worst-case bound of t + 1 rounds could be obtained. This work answers this open question positively and proposes a deterministic synchronous Byzantine reliable broadcast that achieves a good-case latency of max ( 2 , t + 3 - c ) rounds (or equivalently max ( 2 , f + t + 3 - n ) ), where t is the upper bound on the number of Byzantine processes, f ≤ t the number of effectively Byzantine processes, and c = n - f the number of effectively correct processes. The proposed algorithm does not put any constraint on t , and assumes an authenticated setting, in which individual processes can sign the messages they send, and verify the authenticity of the signatures they receive.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-2770
1432-0452
DOI:10.1007/s00446-024-00464-6