More Web Proxy on the site http://driver.im/

research-article

ResilientDB: global scale resilient blockchain fabric

Authors:

Sajjad Rahnama,

Jelle Hellings,

Mohammad SadoghiAuthors Info & Claims

Proceedings of the VLDB Endowment, Volume 13, Issue 6

Pages 868 - 883

https://doi.org/10.14778/3380750.3380757

Published: 01 February 2020 Publication History

Abstract

Recent developments in blockchain technology have inspired innovative new designs in resilient distributed and database systems. At their core, these blockchain applications typically use Byzantine fault-tolerant consensus protocols to maintain a common state across all replicas, even if some replicas are faulty or malicious. Unfortunately, existing consensus protocols are not designed to deal with geo-scale deployments in which many replicas spread across a geographically large area participate in consensus.

To address this, we present the Geo-Scale Byzantine Fault-Tolerant consensus protocol (GeoBFT). GeoBFT is designed for excellent scalability by using a topological-aware grouping of replicas in local clusters, by introducing parallelization of consensus at the local level, and by minimizing communication between clusters. To validate our vision of high-performance geo-scale resilient distributed systems, we implement GeoBFT in our efficient ResilientDB permissioned blockchain fabric. We show that GeoBFT is not only sound and provides great scalability, but also outperforms state-of-the-art consensus protocols by a factor of six in geo-scale deployments.

References

[1]

2ndQuadrant. Postgres-XL: Open source scalable SQL database cluster. URL: https://www.postgres-xl.org/.

[2]

Michael Abd-El-Malek, Gregory R. Ganger, Garth R. Goodson, Michael K. Reiter, and Jay J. Wylie. Fault-scalable byzantine fault-tolerant services. In Proceedings of the Twentieth ACM Symposium on Operating Systems Principles, pages 59--74. ACM, 2005.

Digital Library

[3]

Ittai Abraham, Guy Gueta, Dahlia Malkhi, Lorenzo Alvisi, Ramakrishna Kotla, and Jean-Philippe Martin. Revisiting fast practical byzantine fault tolerance, 2017. URL: https://arxiv.org/abs/1712.01367.

[4]

Yair Amir, Brian Coan, Jonathan Kirsch, and John Lane. Customizable fault tolerance forwide-area replication. In 26th IEEE International Symposium on Reliable Distributed Systems, pages 65--82. IEEE, 2007.

[5]

Yair Amir, Claudiu Danilov, Danny Dolev, Jonathan Kirsch, John Lane, Cristina Nita-Rotaru, Josh Olsen, and David Zage. Steward: Scaling byzantine fault-tolerant replication to wide area networks. IEEE Transactions on Dependable and Secure Computing, 7(1):80--93, 2010.

Digital Library

[6]

Mohammad Javad Amiri, Divyakant Agrawal, and Amr El Abbadi. CAPER: A cross-application permissioned blockchain. PVLDB, 12(11):1385--1398, 2019.

Digital Library

[7]

Mohammad Javad Amiri, Divyakant Agrawal, and Amr El Abbadi. SharPer: Sharding permissioned blockchains over network clusters, 2019. URL: https://arxiv.org/abs/1910.00765v1.

[8]

GSM Association. Blockchain for development: Emerging opportunities for mobile, identity and aid, 2017. URL: https://www.gsma.com/mobilefordevelopment/wp-content/uploads/2017/12/Blockchain-for-Development.pdf.

[9]

Pierre-Louis Aublin, Rachid Guerraoui, Nikola Knežević, Vivien Quéma, and Marko Vukolić. The next 700 BFT protocols. ACM Transactions on Computer-Systems, 32(4):12:1--12:45, 2015.

Digital Library

[10]

Elaine Barker. Recommendation for key management, part 1: General. Technical report, National Institute of Standards & Technology, 2016. Special Publication 800--57 Part 1, Revision 4.

[11]

Johannes Behl, Tobias Distler, and Rüdiger Kapitza. Hybrids on steroids: SGX-based high performance BFT. In Proceedings of the Twelfth European Conference on Computer Systems, pages 222--237. ACM, 2017.

Digital Library

[12]

Philip A. Bernstein and Dah-Ming W. Chiu. Using semi-joins to solve relational queries. Journal of the ACM, 28(1):25--40, 1981.

Digital Library

[13]

Kenneth Birman, André Schiper, and Pat Stephenson. Lightweight causal and atomic group multicast. ACM Transactions on Computer Systems, 9(3):272--314, 1991.

Digital Library

[14]

Burkhard Blechschmidt. Blockchain in Europe: Closing the strategy gap. Technical report, Cognizant Consulting, 2018. URL: https://www.cognizant.com/whitepapers/blockchain-in-europe-closing-the-strategy-gap-codex3320.pdf.

[15]

Eric Brewer. CAP twelve years later: How the "rules" have changed. Computer, 45(2):23--29, 2012.

Digital Library

[16]

Eric A. Brewer. Towards robust distributed systems (abstract). In Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, pages 7--7. ACM, 2000.

Digital Library

[17]

Michael Casey, Jonah Crane, Gary Gensler, Simon Johnson, and Neha Narula. The impact of blockchain technology on finance: A catalyst for change. Technical report, International Center for Monetary and Banking Studies, 2018. URL: https://www.cimb.ch/uploads/1/1/5/4/115414161/geneva21_1.pdf.

[18]

Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance. In Proceedings of the Third Symposium on Operating Systems Design and Implementation, pages 173--186. USENIX Association, 1999.

Digital Library

[19]

Miguel Castro and Barbara Liskov. Practical byzantine fault tolerance and proactive recovery. ACM Transactions on Computer Systems, 20(4):398--461, 2002.

Digital Library

[20]

Gregory Chockler, Dahlia Malkhi, and Michael K. Reiter. Backoff protocols for distributed mutual exclusion and ordering. In Proceedings 21st International Conference on Distributed Computing Systems, pages 11--20. IEEE, 2001.

[21]

Christie's. Major collection of the fall auction season to be recorded with blockchain technology, 2018. URL: https://www.christies.com/presscenter/pdf/9160/RELEASE_ChristiesxArtoryxEbsworth_9160_1.pdf.

[22]

Byung-Gon Chun, Petros Maniatis, Scott Shenker, and John Kubiatowicz. Attested append-only memory: Making adversaries stick to their word. In Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles, pages 189--204. ACM, 2007.

Digital Library

[23]

Allen Clement, Edmund Wong, Lorenzo Alvisi, Mike Dahlin, and Mirco Marchetti. Making byzantine fault tolerant systems tolerate byzantine faults. In Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, pages 153--168. USENIX Association, 2009.

Digital Library

[24]

Cindy Compert, Maurizio Luinetti, and Bertrand Portier. Blockchain and GDPR: How blockchain could address five areas associated with gdpr compliance. Technical report, IBM Security, 2018. URL: https://public.dhe.ibm.com/common/ssi/ecm/61/en/61014461usen/security-ibm-security-solutions-wg-white-paper-external-61014461usen-20180319.pdf.

[25]

Brian F. Cooper, Adam Silberstein, Erwin Tam, Raghu Ramakrishnan, and Russell Sears. Benchmarking cloud serving systems with YCSB. In Proceedings of the 1st ACM Symposium on Cloud Computing, pages 143--154. ACM, 2010.

Digital Library

[26]

Oracle Corporation. MySQL NDB cluster: Scalability. URL: https://www.mysql.com/products/cluster/scalability.html.

[27]

Oracle Corporation. Oracle sharding. URL: https://www.oracle.com/database/technologies/high-availability/sharding.html.

[28]

Miguel Correia, Nuno Ferreira Neves, and Paulo Verissimo. How to tolerate half less one byzantine nodes in practical distributed systems. In Proceedings of the 23rd IEEE International Symposium on Reliable Distributed Systems, pages 174--183. IEEE, 2004.

[29]

James Cowling, Daniel Myers, Barbara Liskov, Rodrigo Rodrigues, and Liuba Shrira. HQ replication: A hybrid quorum protocol for byzantine fault tolerance. In Proceedings of the 7th Symposium on Operating Systems Design and Implementation, pages 177--190. USENIX Association, 2006.

Digital Library

[30]

Hung Dang, Tien Tuan Anh Dinh, Dumitrel Loghin, Ee-Chien Chang, Qian Lin, and Beng Chin Ooi. Towards scaling blockchain systems via sharding. In Proceedings of the 2019 International Conference on Management of Data, pages 123--140. ACM, 2019.

Digital Library

[31]

Alex de Vries. Bitcoin's growing energy problem. Joule, 2(5):801--805, 2018.

[32]

Richard A. DeMillo, Nancy A. Lynch, and Michael J. Merritt. Cryptographic protocols. In Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, pages 383--400. ACM, 1982.

Digital Library

[33]

Tien Tuan Anh Dinh, Ji Wang, Gang Chen, Rui Liu, Beng Chin Ooi, and Kian-Lee Tan. BLOCKBENCH: A framework for analyzing private blockchains. In Proceedings of the 2017 ACM International Conference on Management of Data, pages 1085--1100. ACM, 2017.

Digital Library

[34]

Microsoft Docs. Sharding pattern. URL: https://docs.microsoft.com/en-us/azure/architecture/patterns/sharding.

[35]

D. Dolev. Unanimity in an unknown and unreliable environment. In 22nd Annual Symposium on Foundations of Computer Science, pages 159--168. IEEE, 1981.

Digital Library

[36]

D. Dolev and H. Strong. Authenticated algorithms for byzantine agreement. SIAM Journal on Computing, 12(4):656--666, 1983.

[37]

Danny Dolev. The byzantine generals strike again. Journal of Algorithms, 3(1):14--30, 1982.

[38]

Danny Dolev and Rüdiger Reischuk. Bounds on information exchange for byzantine agreement. Journal of the ACM, 32(1):191--204, 1985.

Digital Library

[39]

John R. Douceur. The sybil attack. In Peer-to-Peer Systems, pages 251--260. Springer Berlin Heidelberg, 2002.

[40]

Ittay Eyal, Adem Efe Gencer, Emin Gün Sirer, and Robbert Van Renesse. Bitcoin-NG: A scalable blockchain protocol. In 13th USENIX Symposium on Networked Systems Design and Implementation, pages 45--59, Santa Clara, CA, 2016. USENIX Association.

[41]

Michael J. Fischer and Nancy A. Lynch. A lower bound for the time to assure interactive consistency. Information Processing Letters, 14(4):183--186, 1982.

[42]

Michael J. Fischer, Nancy A. Lynch, and Michael S. Paterson. Impossibility of distributed consensus with one faulty process. Journal of the ACM, 32(2):374--382, 1985.

Digital Library

[43]

Seth Gilbert and Nancy Lynch. Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News, 33(2):51--59, 2002.

Digital Library

[44]

Suyash Gupta, Jelle Hellings, Sajjad Rahnama, and Mohammad Sadoghi. An in-depth look of BFT consensus in blockchain: Challenges and opportunities. In Proceedings of the 20th International Middleware Conference Tutorials, pages 6--10, 2019.

Digital Library

[45]

Suyash Gupta, Jelle Hellings, Sajjad Rahnama, and Mohammad Sadoghi. Proof-of-Execution: Reaching Consensus through Fault-Tolerant Speculation, 2019. URL: https://arxiv.org/abs/1911.00838.

[46]

Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. Brief announcement: Revisiting consensus protocols through wait-free parallelization. In 33rd International Symposium on Distributed Computing (DISC 2019), volume 146 of Leibniz International Proceedings in Informatics (LIPIcs), pages 44:1--44:3. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.

[47]

Suyash Gupta, Jelle Hellings, and Mohammad Sadoghi. Scaling blockchain databases through parallel resilient consensus paradigm, 2019. URL: https://arxiv.org/abs/1911.00837.

[48]

Suyash Gupta, Sajjad Rahnama, and Mohammad Sadoghi. Revisiting fast practical byzantine fault tolerance, 2019. URL: https://arxiv.org/abs/1911.09208.

[49]

Suyash Gupta and Mohammad Sadoghi. Blockchain Transaction Processing, pages 1--11. Springer International Publishing, 2018.

[50]

Suyash Gupta and Mohammad Sadoghi. EasyCommit: A non-blocking two-phase commit protocol. In Proceedings of the 21st International Conference on Extending Database Technology, pages 157--168. Open Proceedings, 2018.

[51]

Suyash Gupta and Mohammad Sadoghi. Efficient and non-blocking agreement protocols. Distributed and Parallel Databases, 2019.

[52]

Thomas Haynes and David Noveck. RFC 7530: Network file system (NFS) version 4 protocol, 2015. URL: https://tools.ietf.org/html/rfc7530.

[53]

Jelle Hellings and Mohammad Sadoghi. Brief announcement: The fault-tolerant cluster-sending problem. In 33rd International Symposium on Distributed Computing (DISC 2019), volume 146 of Leibniz International Proceedings in Informatics (LIPIcs), pages 45:1--45:3. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2019.

[54]

Jelle Hellings and Mohammad Sadoghi. Coordination-free byzantine replication with minimal communication costs. In Proceedings of the 23rd International Conference on Database Theory, volume 155 of Leibniz International Proceedings in Informatics (LIPIcs). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2020.

[55]

Maurice Herlihy. Blockchains from a distributed computing perspective. Communications of the ACM, 62(2):78--85, 2019.

Digital Library

[56]

Maged N. Kamel Boulos, James T. Wilson, and Kevin A. Clauson. Geospatial blockchain: promises, challenges, and scenarios in health and healthcare. International Journal of Health Geographics, 17(1):1211--1220, 2018.

[57]

Rüdiger Kapitza, Johannes Behl, Christian Cachin, Tobias Distler, Simon Kuhnle, Seyed Vahid Mohammadi, Wolfgang Schröder-Preikschat, and Klaus Stengel. CheapBFT: Resource-efficient byzantine fault tolerance. In Proceedings of the 7th ACM European Conference on Computer Systems, pages 295--308. ACM, 2012.

Digital Library

[58]

Jonathan Katz and Yehuda Lindell. Introduction to Modern Cryptography. Chapman and Hall/CRC, 2nd edition, 2014.

[59]

Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. Ouroboros: A provably secure Proof-of-Stake blockchain protocol. In Advances in Cryptology - CRYPTO 2017, pages 357--388. Springer International Publishing, 2017.

[60]

Sunny King and Scott Nadal. PPCoin: Peer-to-peer crypto-currency with proof-of-stake, 2012. URL: https://peercoin.net/assets/paper/peercoin-paper.pdf.

[61]

Eleftherios Kokoris-Kogias, Philipp Jovanovic, Nicolas Gailly, Ismail Khoffi, Linus Gasser, and Bryan Ford. Enhancing bitcoin security and performance with strong consistency via collective signing. In Proceedings of the 25th USENIX Conference on Security Symposium, pages 279--296. USENIX Association, 2016.

Digital Library

[62]

Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: Speculative byzantine fault tolerance. In Proceedings of Twenty-first ACM SIGOPS Symposium on Operating Systems Principles, pages 45--58. ACM, 2007.

Digital Library

[63]

Ramakrishna Kotla, Lorenzo Alvisi, Mike Dahlin, Allen Clement, and Edmund Wong. Zyzzyva: Speculative byzantine fault tolerance. ACM Transactions on Computer Systems, 27(4):7:1--7:39, 2009.

Digital Library

[64]

Leslie Lamport. The part-time parliament. ACM Transactions on Computer Systems, 16(2):133--169, 1998.

Digital Library

[65]

Leslie Lamport, Robert Shostak, and Marshall Pease. The byzantine generals problem. ACM Transactions on Programming Languages and Systems, 4(3):382--401, 1982.

Digital Library

[66]

Barbara Liskov and Rodrigo Rodrigues. Byzantine clients rendered harmless. In Distributed Computing, pages 487--489. Springer Berlin Heidelberg, 2005.

Digital Library

[67]

Loi Luu, Viswesh Narayanan, Chaodong Zheng, Kunal Baweja, Seth Gilbert, and Prateek Saxena. A secure sharding protocol for open blockchains. In Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security, pages 17--30. ACM, 2016.

Digital Library

[68]

Dahlia Malkhi and Michael Reiter. Byzantine quorum systems. Distributed Computing, 11(4):203--213, 1998.

Digital Library

[69]

Dahlia Malkhi and Michael Reiter. Secure and scalable replication in Phalanx. In Proceedings Seventeenth IEEE Symposium on Reliable Distributed Systems, pages 51--58. IEEE, 1998.

[70]

Yanhua Mao, Flavio P. Junqueira, and Keith Marzullo. Mencius: Building efficient replicated state machines for WANs. In Proceedings of the 8th USENIX Conference on Operating Systems Design and Implementation, pages 369--384. USENIX Association, 2008.

[71]

Yanhua Mao, Flavio P. Junqueira, and Keith Marzullo. Towards low latency state machine replication for uncivil wide -area networks. In Fifth Workshop on Hot Topics in System Dependability, 2009.

[72]

Alfred J. Menezes, Scott A. Vanstone, and Paul C. Van Oorschot. Handbook of Applied Cryptography. CRC Press, Inc., 1st edition, 1996.

[73]

Shlomo Moran and Yaron Wolfstahl. Extended impossibility results for asynchronous complete networks. Information Processing Letters, 26(3):145--151, 1987.

Digital Library

[74]

Satoshi Nakamoto. Bitcoin: A peer-to-peer electronic cash system, 2009. URL: https://bitcoin.org/bitcoin.pdf.

[75]

Faisal Nawab and Mohammad Sadoghi. Blockplane: A global-scale byzantizing middleware. In 35th International Conference on Data Engineering, pages 124--135. IEEE, 2019.

[76]

M. Tamer Özsu and Patrick Valduriez. Principles of Distributed Database Systems. Springer New York, 3th edition, 2011.

[77]

Rafael Pass and Elaine Shi. Hybrid consensus: Efficient consensus in the permissionless model, 2016. URL: https://eprint.iacr.org/2016/917.

[78]

M. Pease, R. Shostak, and L. Lamport. Reaching agreement in the presence of faults. Journal of the ACM, 27(2):228--234, 1980.

Digital Library

[79]

Michael Pisa and Matt Juden. Blockchain and economic development: Hype vs. reality. Technical report, Center for Global Development, 2017. URL: https://www.cgdev.org/publication/blockchain-and-economic-development-hype-vs-reality.

[80]

Dan R. K. Ports, Jialin Li, Vincent Liu, Naveen Kr. Sharma, and Arvind Krishnamurthy. Designing distributed systems using approximate synchrony in data center networks. In Proceedings of the 12th USENIX Conference on Networked Systems Design and Implementation, pages 43--57. USENIX Association, 2015.

Digital Library

[81]

Bitcoin Project. Bitcoin developer guide: P2P network, 2018. URL: https://bitcoin.org/en/developer-guide#p2p-network.

[82]

Thamir M. Qadah and Mohammad Sadoghi. QueCC: A queue-oriented, control-free concurrency architecture. In Proceedings of the 19th International Middleware Conference, pages 13--25, 2018.

Digital Library

[83]

Aleta Ricciardi, Kenneth Birman, and Patrick Stephenson. The cost of order in asynchronous systems. In Distributed Algorithms, pages 329--345. Springer Berlin Heidelberg, 1992.

[84]

Mohammad Sadoghi and Spyros Blanas. Transaction Processing on Modern Hardware. Synthesis Lectures on Data Management. Morgan & Claypool, 2019.

[85]

Victor Shoup. Practical threshold signatures. In Advances in Cryptology --- EUROCRYPT 2000, pages 207--220. Springer Berlin Heidelberg, 2000.

[86]

Gadi Taubenfeld and Shlomo Moran. Possibility and impossibility results in a shared memory environment. Acta Informatica, 33(1):1--20, 1996.

Digital Library

[87]

Gerard Tel. Introduction to Distributed Algorithms. Cambridge University Press, 2nd edition, 2001.

[88]

Maarten van Steen and Andrew S. Tanenbaum. Distributed Systems. Maarten van Steen, 3th edition, 2017. URL: https://www.distributed-systems.net/.

[89]

Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, and Lau Cheuk Lung. EBAWA: Efficient byzantine agreement for wide-area networks. In 2010 IEEE 12th International Symposium on High Assurance Systems Engineering, pages 10--19. IEEE, 2010.

Digital Library

[90]

Giuliana Santos Veronese, Miguel Correia, Alysson Neves Bessani, Lau Cheuk Lung, and Paulo Verissimo. Efficient byzantine fault-tolerance. IEEE Transactions on Computers, 62(1):16--30, 2013.

Digital Library

[91]

Harald Vranken. Sustainability of bitcoin and blockchains. Current Opinion in Environmental Sustainability, 28:1--9, 2017.

[92]

Jiaping Wang and Hao Wang. Monoxide: Scale out blockchains with asynchronous consensus zones. In Proceedings of the 16th USENIX Symposium on Networked Systems Design and Implementation, pages 95--112. USENIX Association, 2019.

[93]

Gavin Wood. Ethereum: a secure decentralised generalised transaction ledger, 2016. EIP-150 revision. URL: https://gavwood.com/paper.pdf.

[94]

Maofan Yin, Dahlia Malkhi, Michael K. Reiter, Guy Golan Gueta, and Ittai Abraham. HotStuff: BFT consensus with linearity and responsiveness. In Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing, pages 347--356. ACM, 2019.

Digital Library

[95]

Mahdi Zamani, Mahnush Movahedi, and Mariana Raykova. RapidChain: Scaling blockchain via full sharding. In Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security, pages 931--948. ACM, 2018.

Digital Library

Cited By

Amiri MWu CAgrawal DEl Abbadi ALoo BSadoghi MVanbever LZhang I(2024)The bedrock of byzantine fault toleranceProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691847(371-400)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.5555/3691825.3691847
Zhang CXu CHu HXu JMa XWon Y(2024)COLEProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650717(329-346)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650717
Gao YLi XPeng ZZhang YYu G(2024)NeuChain+: A Sharding Permissioned Blockchain System with Ordering-Free ConsensusApplied Sciences10.3390/app1411489714:11(4897)Online publication date: 5-Jun-2024
https://doi.org/10.3390/app14114897
Show More Cited By

ResilientDB: global scale resilient blockchain fabric
1. Computer systems organization
2. Software and its engineering
  1. Software organization and properties
    1. Software system structures

Recommendations

The incremental agreement

To achieve reliable distributed systems, the fault-tolerance must be studied. One of the most important problems of fault-tolerance issues lies in the Byzantine Agreement (BA) problem. The primary issue surrounding BA is that fault-free processors must ...
Revisiting fault diagnosis agreement in a new territory

In convention, to consensus has been discussed variously. The way of fault masking is commonly used to reach consensus. However, reaching consensus is not enough in a high reliability application. Therefore, in this study, the fault diagnosis agreement ...
A self-adjusting approach to Byzantine agreement

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image Proceedings of the VLDB Endowment

Proceedings of the VLDB Endowment Volume 13, Issue 6

February 2020

170 pages

ISSN:2150-8097

Editors:
Magdalena Balazinska
University of Washington
,
Xiaofang Zhou
University of Queensland, Australia

Issue’s Table of Contents

Publisher

VLDB Endowment

Publication History

Published: 01 February 2020

Published in PVLDB Volume 13, Issue 6

Qualifiers

Research-article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

77
Total Citations
View Citations
327
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)5

Reflects downloads up to 18 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Amiri MWu CAgrawal DEl Abbadi ALoo BSadoghi MVanbever LZhang I(2024)The bedrock of byzantine fault toleranceProceedings of the 21st USENIX Symposium on Networked Systems Design and Implementation10.5555/3691825.3691847(371-400)Online publication date: 16-Apr-2024
https://dl.acm.org/doi/10.5555/3691825.3691847
Zhang CXu CHu HXu JMa XWon Y(2024)COLEProceedings of the 22nd USENIX Conference on File and Storage Technologies10.5555/3650697.3650717(329-346)Online publication date: 27-Feb-2024
https://dl.acm.org/doi/10.5555/3650697.3650717
Gao YLi XPeng ZZhang YYu G(2024)NeuChain+: A Sharding Permissioned Blockchain System with Ordering-Free ConsensusApplied Sciences10.3390/app1411489714:11(4897)Online publication date: 5-Jun-2024
https://doi.org/10.3390/app14114897
Nawab FSadoghi M(2024)Consensus in Data Management: With Use Cases in Edge-Cloud and Blockchain SystemsProceedings of the VLDB Endowment10.14778/3685800.368584317:12(4233-4236)Online publication date: 8-Nov-2024
https://dl.acm.org/doi/10.14778/3685800.3685843
Jo YPark C(2024)A Hierarchical Blockchain supporting Dynamic Locality by Extending Execute-Order-Validate ArchitectureDistributed Ledger Technologies: Research and Practice10.1145/3688811Online publication date: 22-Aug-2024
https://dl.acm.org/doi/10.1145/3688811
Stonebraker MPavlo A(2024)What Goes Around Comes Around... And Around...ACM SIGMOD Record10.1145/3685980.368598453:2(21-37)Online publication date: 31-Jul-2024
https://dl.acm.org/doi/10.1145/3685980.3685984
Loghin DDinh TGang CTeo YOoi B(2024)Characterizing the Performance and Cost of Blockchains on the Cloud and at the EdgeDistributed Ledger Technologies: Research and Practice10.1145/36660133:4(1-27)Online publication date: 7-Dec-2024
https://dl.acm.org/doi/10.1145/3666013
Berger CRodrigues LReiser HCogo VBessani ASchiavoni VEdinger JCao JJin Z(2024)Chasing Lightspeed Consensus: Fast Wide-Area Byzantine Replication with MercuryProceedings of the 25th International Middleware Conference10.1145/3652892.3700756(158-171)Online publication date: 2-Dec-2024
https://dl.acm.org/doi/10.1145/3652892.3700756
Zhang GPan FMao YTijanic SDang’ana MMotepalli SZhang SJacobsen H(2024)Reaching Consensus in the Byzantine Empire: A Comprehensive Review of BFT Consensus AlgorithmsACM Computing Surveys10.1145/363655356:5(1-41)Online publication date: 12-Jan-2024
https://dl.acm.org/doi/10.1145/3636553
Amiri MAgrawal DEl Abbadi ALoo BBarcelo PSanchez-Pi NMeliou ASudarshan S(2024)Distributed Transaction Processing in Untrusted EnvironmentsCompanion of the 2024 International Conference on Management of Data10.1145/3626246.3654684(570-579)Online publication date: 9-Jun-2024
https://dl.acm.org/doi/10.1145/3626246.3654684
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Issue’s Table of Contents