Iwazaru: The Byzantine Sequencer
AbstractIn this article we present Iwazaru - a dedicated Byzantine fault-tolerant distributed sequencer that significantly outperforms similar solutions previously used for that purpose. The proposed protocol is designed for timed asynchronous systems, i.e. environments in which the response time is bounded by a known value. Using this assumption we were able to reduce the total number of required communication rounds by one. Additionally, although Iwazaru itself still requires 3f + 1 replicas to tolerate f malicious parties, once the ordering is established no more than 2f + 1 machines are required to execute the requests. The performance evaluation shows that in gracious executions Iwazaru can perform around 30% faster than Castro and Liskov’s PBFT, which was previously used as an algorithm of choice for request ordering.
Kubatova Hana, Hochberger Christian, Danek Martin, Sick Bernhard (eds.): Architecture of Computing Systems – ARCS 2013, Lecture Notes In Computer Science, vol. 7767, 2013, Heidelberg New York Dordrecht London, Springer Berlin Heidelberg, ISBN 978-3-642-36423-5, 354 p., DOI:10.1007/978-3-642-36424-2
Front Mater1.pdf / 120.39 KB / No licence information
|Keywords in English||Byzantine fault tolerance, distributed sequencer, dependability, state macine replication|
|Score|| = 10.0, 27-03-2017, BookChapterSeriesAndMatConf|
= 15.0, 27-03-2017, BookChapterSeriesAndMatConf
|Citation count*||1 (2015-04-24)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.