论文标题
端到端潜伏分析和工作证明区块链应用的最佳区块大小
End-to-End Latency Analysis and Optimal Block Size of Proof-of-Work Blockchain Applications
论文作者
论文摘要
由于对区块链技术越来越兴趣促进安全，可审计，分散的应用程序，因此需要解决与该技术相关的一系列挑战。在这封信中，我们专注于与工作证明（POW）基于基于工作证明的区块链网络相关的延迟，参与者通过共识验证将通过共识将新信息验证以确认交易。我们提出了一种基于批处理排队理论的新颖端到端潜伏模型，该理论是第一次表征计时器和叉子。此外，我们在分析上得出了最佳块大小的估计。在模拟结果的认可下，我们表明最佳块大小近似是一种一致的方法，它通过显着降低与区块链应用程序相关的开销，从而导致近距离性能。
Due to the increasing interest in blockchain technology for fostering secure, auditable, decentralized applications, a set of challenges associated with this technology need to be addressed. In this letter, we focus on the delay associated with Proof-of-Work (PoW)-based blockchain networks, whereby participants validate the new information to be appended to a distributed ledger via consensus to confirm transactions. We propose a novel end-to-end latency model based on batch-service queuing theory that characterizes timers and forks for the first time. Furthermore, we derive an estimation of optimum block size analytically. Endorsed by simulation results, we show that the optimal block size approximation is a consistent method that leads to close-to-optimal performance by significantly reducing the overheads associated with blockchain applications.
