Files in this item



application/pdfECE499-Sp2013-zhuo.pdf (157kB)
(no description provided)PDF


Title:A Comparison Study of Byzantine Fault Tolerance Protocols
Author(s):Zhuo, Danyang
Contributor(s):Vaidya, Nitin
Subject(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.
Issue Date:2013-05
Publication Status:unpublished
Peer Reviewed:not peer reviewed
Date Available in IDEALS:2014-03-20

This item appears in the following Collection(s)

Item Statistics