Efficient Partial Order Based Transaction Processing for Permissioned Blockchains | IEEE Conference Publication | IEEE Xplore

Efficient Partial Order Based Transaction Processing for Permissioned Blockchains


Abstract:

With the development of permissioned blockchains, transaction processing plays an increasingly crucial role in improving performance. The execution and consensus phases i...Show More

Abstract:

With the development of permissioned blockchains, transaction processing plays an increasingly crucial role in improving performance. The execution and consensus phases in existing transaction processing methods are based on total order. The consensus phase constructs a total order representing the execution order and submission order of different transactions. Then, in the execution phase, transactions are executed or validated sequentially based on this total order. However, while the total order guarantees consistency across nodes, it also restricts the execution order of any two transactions, even if there is no conflict between them. Additionally, existing methods process transactions based on block snapshots before the consensus phase, but these snapshots are only updated after reaching consensus. The stale data between these phases results in high transaction abort rates due to delays in updated visibility. Therefore, we propose a novel blockchain called Partial Order-Based Ledger (POBL). POBL constructs a partial order of transaction executions in the execution phase and then, in the consensus phase, builds a consistent submission order based on this execution partial order. Notably, POBL allows the visibility of transaction processing results in the execution phase even before committing its block. To ensure the correct execution, the consensus and execution phases need to consider the consistency of data and the dependencies between transactions. Therefore, we use a graph, PGraph, to capture the concurrent partial order in the execution phase. In the consensus phase, we propose a consensus algorithm to conduct the maximal common subgraph, CPGraph, based on the PGraphs of different nodes. We propose to validate blocks and transactions in parallel based on CPGraph, without being restricted by the order between blocks. We perform extensive experiments compared to state-of-the-art architectural systems, and our method significantly outperforms existing work.
Date of Conference: 13-16 May 2024
Date Added to IEEE Xplore: 23 July 2024
ISBN Information:

ISSN Information:

Conference Location: Utrecht, Netherlands

Funding Agency:


I. Introduction

With the success and growing influence of decentralized technologies, blockchain services have gained significant at-tention in academia and industry. By using blockchain ser-vices, business partners do not need to trust each other, and can store immutable data and deploy smart contracts. Most blockchain services are constructed based on permissioned blockchains, because data need to be accessed and shared among restricted business partners. Unlike permissionless blockchains, a permissioned blockchain is maintained by iden-tified members and runs a Byzantine-fault-tolerant consensus protocol to commit transactions. Amazon [1], IBM [2], and Microsoft [3] have all provided blockchain services based on permissioned blockchains.

Contact IEEE to Subscribe

References

References is not available for this document.