A Variable Bulk Arrival and Static Bulk Service Queueing Model for Blockchain

2020 ◽  
Author(s):  
Jongho Seol ◽  
Abhilash Kancharla ◽  
Zuqiang Ke ◽  
Hyeyoung Kim ◽  
Nohpill Park
Keyword(s):  
Queueing Model ◽  
Bulk Service ◽  
Bulk Arrival

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

2020 ◽  
Vol 10 (10) ◽  
pp. 3651
Author(s):  
Nohpill Park ◽  
Abhilash Kancharla ◽  
Hye-Young Kim
Keyword(s):  
Open Source ◽  
Real Time ◽  
Theoretical Foundation ◽  
Queueing Model ◽  
Time System ◽  
Real Time System ◽  
The Real ◽  
Proposed Model ◽  
Bulk Service ◽  
Bulk Arrival

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.

Interdependent Queueing Model with Varying Bulk Service

2012 ◽  
Vol 2 (1) ◽  
pp. 109 ◽  
Author(s):  
T. S. R Murthy ◽  
Sivarama Krishna ◽  
G. V. S Raju
Keyword(s):  
Queueing Model ◽  
Bulk Service

scholarly journals Queues with two units connected in series with a multiserver bulk service with accessible and non accessible batch in unit II

2014 ◽  
Vol 4 (1) ◽  
Author(s):  
G. Ayyappan ◽  
S. Velmurugan
Keyword(s):  
Service Time ◽  
Subject Classification ◽  
Geometric Method ◽  
Finite Buffer ◽  
Queueing Model ◽  
Service Station ◽  
Matrix Geometric Method ◽  
In Series ◽  
Bulk Service ◽  
Number Of Customers

This paper analyses a queueing model consisting of two units I and II connected in series, separated by a finite buffer of size N. Unit I has only one exponential server capable of serving customers one at a time. Unit II consists of c parallel exponential servers and they serve customers in groups according to the bulk service rule. This rule admits each batch served to have not less than ‘a’ and not more than ‘b’ customers such that the arriving customers can enter service station without affecting the service time if the size of the batch being served is less than ‘d’ ( a ≤ d ≤ b ). The steady stateprobability vector of the number of customers waiting and receiving service in unit I and waiting in the buffer is obtained using the modified matrix-geometric method. Numerical results are also presented. AMS Subject Classification number: 60k25 and 65k30

scholarly journals Markovian bulk-arrival and bulk-service queues with general state-dependent control

2020 ◽  
Vol 95 (3-4) ◽  
pp. 331-378 ◽  
Author(s):  
Anyue Chen ◽  
Xiaohan Wu ◽  
Jing Zhang
Keyword(s):  
General State ◽  
State Dependent ◽  
Bulk Service ◽  
Bulk Arrival

Controlled Markovian bulk-arrival and bulk-service queues with catastrophes

2015 ◽  
Vol 45 (5) ◽  
pp. 527-538
Author(s):  
JunPing LI ◽  
LiNa ZHANG
Keyword(s):  
Bulk Service ◽  
Bulk Arrival
Sign in / Sign up

Export Citation Format

Share Document