Scaling blockchain efficiency is crucial to its widespread usage in which thepayment channel is one of the most prominent approaches . With payment channelsand the network they construct, two users can move some transactions off-chain in a predetermined duration to avoid expensive and time-consuming on-chainsettlements . The key idea is to reorder the processing sequence of atomictransactions, other than to handle each of them separately and immediately . In the former, all the incoming transactions in a short time interval are processed collectively . We formulate an optimization model to minimize their total routing fee and derive the optimal permutation of processing transactions as well as the routingpolicy for each of . them . A Shapley value based scheme is presented toredistribute the benefit of reordering among the transactions efficiently and fairly. In the latter, we model the waiting time of a strategic transaction on a single payment channel as the first passage time problem in queueing theory in the latter of the model of a payment channel . We are able to calculate the recurrence of waiting for time distribution that is useful to gauge a user’s cost of patience, and the waiting for . time distribution, we calculate therecrecording a user’s waiting for a transaction value in the model well. By capturing the capacity dynamics, we were able to determine the recursion of a transaction

Author(s) : Qianlan Bai, Yuedong Xu, Xin Wang

Links : PDF - Abstract

Code :

Keywords : time - model - waiting - channel - transactions -

Leave a Reply

Your email address will not be published. Required fields are marked *