Papers
Topics
Authors
Recent
Search
2000 character limit reached

Optimal endorsement for network-wide distributed blockchains

Published 11 Mar 2023 in cs.NI | (2303.06459v1)

Abstract: Blockchains offer trust and immutability in non-trusted environments, but most are not fast enough for latency-sensitive applications. Hyperledger Fabric (HF) is a common enterprise-level platform that is being offered as Blockchain-as-a-Service (BaaS) by cloud providers. In HF, every new transaction requires a preliminary endorsement by multiple mutually untrusted parties called organizations, which contributes to the delay in storing the transaction in the blockchain. The endorsement policy is specific to each application and defines the required approvals by the endorser peers (EPs) of the involved organizations. In this paper, given an input endorsement policy, we studied the optimal choice to distribute the endorsement requests to the proper EPs. We proposed the OPEN algorithm, devised to minimize the latency due to both network delays and the processing times at the EPs. By extensive simulations, we showed that OPEN can reduce the endorsement latency up to 70% compared to the state-of-the-art solution and approximated well the introduced optimal policies while offering a negligible implementation overhead compared to them.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.