This paper explores the problem good-case latency of Byzantine fault-tolerant
broadcast, motivated by the real-world latency and performance of practical
state machine replication protocols. The good-case latency measures the time it
takes for all non-faulty parties to commit when the designated broadcaster is
non-faulty. We provide a complete characterization of tight bounds on good-case
latency, in the authenticated setting under synchrony, partial synchrony and
asynchrony. Some of our new results may be surprising, e.g., 2-round PBFT-style
partially synchronous Byzantine broadcast is possible if and only if $ngeq
5f-1$, and a tight bound for good-case latency under $n/3<f<n/2$ under
synchrony is not an integer multiple of the delay bound.

Go to Source of this post
Author Of this post: <a href="http://arxiv.org/find/cs/1/au:+Abraham_I/0/1/0/all/0/1">Ittai Abraham</a>, <a href="http://arxiv.org/find/cs/1/au:+Nayak_K/0/1/0/all/0/1">Kartik Nayak</a>, <a href="http://arxiv.org/find/cs/1/au:+Ren_L/0/1/0/all/0/1">Ling Ren</a>, <a href="http://arxiv.org/find/cs/1/au:+Xiang_Z/0/1/0/all/0/1">Zhuolun Xiang</a>

By admin