A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems

Agrawal, Shreya and Daudjee, Khuzaima (2016) A Performance Comparison of Algorithms for Byzantine Agreement in Distributed Systems. In: 2016 12th European Dependable Computing Conference. (Submitted)

[img] Text
agrawal-daudjee-performance-evaluation.pdf
Restricted to Registered users only
Download (763kB)

Abstract

Reaching agreement in the presence of byzantine processes is an important task in distributed systems. Theoretical analysis of algorithms for Byzantine Agreement can provide insight into their efficiency. However, analysis of algorithms under varying parameters and practical constraints through experimental evaluation can be key to understanding the performance and trade-offs of theoretically well-performing algorithms. We compare the performance of two randomized byzantine agreement algorithms—one using the pull-push approach and another using the concept of quorums—and a third recent simple deterministic byzantine agreement algorithm. Through implementation on a testbed environment using the metrics of bit complexity, round complexity and latency in the presence of network sizes and faulty processes, we quantify the performance of each algorithm. In terms of bit complexity, we show that for small networks (n < 32) and up to 10% faulty processes, the simple deterministic algorithm performs best, while for larger networks, pull-push is the best performing algorithm. The second randomized algorithm performs best in terms of latency. Keywords-Distributed systems; Performance; Byzantine failures; Fault-tolerant; Consensus; Complexity.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: systems Performance Byzantine failures Fault-tolerant Consensus Complexity
Subjects: Projects > BloSSom 2019
Main Topics > Distributed Systems
Divisions: Computer Science
Depositing User: Unnamed user with email richard.dabels@uni-rostock.de
Date Deposited: 03 Sep 2019 16:32
Last Modified: 03 Sep 2019 16:32
URI: http://blossom.informatik.uni-rostock.de/id/eprint/2

Actions (login required)

View Item View Item
Blockchain is powered by EPrints 3 which is developed by the School of Electronics and Computer Science at the University of Southampton. More information and software credits.