A Realtime Crypto Computing and Block-Dependability
Abhilash Kancharla, Nohpill Park · 2019
This paper proposes an analytical approach how to design and realize a crypto computing (Ethereum blockchain-based) under stringent real-time requirement. In order to evaluate the efficacy of the approach, a new analytical metric is defined and developed to estimate the dependability, referred to as the block-dependability. The proposed block-dependability precisely models the probability for the pending transactions to be posted within the current, in other words, within the target block delay, namely, within the deadline required if their expected execution times are within the temporal range of the deadline. Various methods how to prioritize and select transactions in the pending transaction pool in order to facilitate those transactions to be executed within their deadline requirements, such as the normal, random, sorted, and stratified, are proposed and simulated. A set of performance variables, or parameters, such as the number of pending transactions in the pool, the average speed of the transactions, gas fees, deadlines as well as the number of miners, are identified and taken into the block-dependability in order to reveal the influence of each variable on the block-dependability, versus each of those proposed prioritization and selection methods. Extensive parametric simulations are conducted and results are observed and discussed in the cases of the random transaction selection method and the sorted.