Optimal endorsement for network-wide distributed blockchains

arxiv(2023)

引用 1|浏览5
暂无评分
摘要
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.
更多
查看译文
关键词
optimal endorsement,blockchains,network-wide
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要