A Comparison Study of Byzantine Fault Tolerance Protocols
Zhuo, Danyang
Loading…
Permalink
https://hdl.handle.net/2142/47631
Description
Title
A Comparison Study of Byzantine Fault Tolerance Protocols
Author(s)
Zhuo, Danyang
Contributor(s)
Vaidya, Nitin
Issue Date
2013-05
Keyword(s)
Byzantine fault tolerance
Byzantine broadcast problem
fault tolerance protocols
Abstract
The Byzantine fault model is a worst-case assumption for faulty nodes in
distributed systems because it assumes faulty nodes to behave arbitrarily.
Previously, Lamport et al. proposed a replicated state way to solve the
Byzantine broadcast problem. But the original protocol is very expensive due
to large communication overhead. This thesis does a comparison study between
practical Byzantine fault tolerance (PBFT) and network coding based
algorithm (NCBA) which can solve the Byzantine broadcast problem with lower
cost. I implemented a generalized testing framework as well as the Digest
protocol and the NCBA protocol. By the experiments I conducted, NCBA
has comparable performance compared to Digest in fault-free cases.
Use this login method if you
don't
have an
@illinois.edu
email address.
(Oops, I do have one)
IDEALS migrated to a new platform on June 23, 2022. If you created
your account prior to this date, you will have to reset your password
using the forgot-password link below.
