A Real-Time Chain and Variable Bulk Arrival and Variable Bulk Service (VBAVBS) Model with λF

Nohpill Park,Abhilash Kancharla,Hye-Young Kim

doi:10.3390/app10103651

Nohpill Park, Abhilash Kancharla + Show 1 more

Open Access

https://doi.org/10.3390/app10103651

Copy DOI

Journal: Applied Sciences	Publication Date: May 25, 2020
Citations: 2	License type: CC BY 4.0

Affiliation: Oklahoma State University, Hongik University

Abstract

This paper proposes a real-time chain and a novel embedded Markovian queueing model with variable bulk arrival (VBA) and variable bulk service (VBS) in order to establish and assure a theoretical foundation to design a blockchain-based real-time system with particular interest in Ethereum. Based on the proposed model, various performances are simulated in a numerical manner in order to validate the efficacy of the model by checking good agreements with the results against intuitive and typical expectations as a baseline. A demo of the proposed real-time chain is developed in this work by modifying the open source of Ethereum Geth 1.9.11. The work in this paper will provide both a theoretical foundation to design and optimize the performances of the proposed real-time chain, and ultimately address and resolve the performance bottleneck due to the conventional block-synchrony by employing an asynchrony by the real-time deadline to some extent.

Highlights

The model assumes variable bulk arrivals of transactions in Poisson distribution, i.e., M1,n, where n is the number of slots across all the mined transactions, and variable bulk service of transactions in exponential time, i.e., M1,n, for posting in the current block, namely, variable bulk arrival and variable bulk service (VBAVBS) model with λF, where λF is a random variable employed to address the stringent real-time deadline requirement
A transactionand with a gas limit higher than 2,000,000 would be given higher priority in the standard (c). Such a transaction is posted here to highlight the difference in the priorities given to This paper has proposed an analytical approach how to design and realize a real-time chain
Since the deadline time analytical model has been proposed to estimate the performance of the real-time chain in was a higher than both the previous thisbulk transaction is posted in bulk blockservice

Summary

Introduction

The model assumes variable bulk arrivals of transactions in Poisson distribution, i.e., M1,n , where n is the number of slots across all the mined transactions, and variable bulk service of transactions in exponential time, i.e., M1,n , for posting in the current block, namely, variable bulk arrival and variable bulk service (VBAVBS) model with λF , where λF is a random variable employed to address the stringent real-time deadline requirement. Preliminaries and design-variables for the proposed real-time chain and its performance modeling and analysis are reviewed, and some related works on blockchain dependability [9,11] modeling and analysis are introduced; the proposed real-time chain and its analytical model are derived and captured in the context of a queueing system;. A section follows in order to demonstrate numerical simulations versus various blockchain-related parameters [10], and results are shown; conclusions are drawn and a discussion completes the last section

Preliminaries and Literature Review

Numerical Analysis

12. Average

A Demo

Discussion

Conclusions and Discussion

Conclusions