File:Document for Publication-joaosousa2011.pdf

From Navigators

Revision as of 19:45, 20 January 2013 by Jcs (Talk | contribs)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to: navigation, search

Document_for_Publication-joaosousa2011.pdf(file size: 448 KB, MIME type: application/pdf)

Summary

Abstract—We present a new algorithm for state machine replication that is built around a leader-driven consensus primitive. This algorithm requires only two additional communication steps between replicas and clients if the consensus leader is correct and the system is synchronous, being thus the first latency-optimal transformation from Byzantine consensus to BFT state machine replication. We also discuss how to make simple modifications to leader-driven consensus algorithms in order to make them compatible with our transformation.

Licensing

© IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.

File history

Click on a date/time to view the file as it appeared at that time.

Date/TimeDimensionsUserComment
current19:45, 20 January 2013 (448 KB)Jcs (Talk | contribs) (Abstract—We present a new algorithm for state machine replication that is built around a leader-driven consensus primitive. This algorithm requires only two additional communication steps between replicas and clients if the consensus leader is correct a)

The following page links to this file:

Personal tools
Navigators toolbox