CN113537968B - Game theory-based transaction request processing method in payment channel network - Google Patents
Game theory-based transaction request processing method in payment channel network Download PDFInfo
- Publication number
- CN113537968B CN113537968B CN202110638994.XA CN202110638994A CN113537968B CN 113537968 B CN113537968 B CN 113537968B CN 202110638994 A CN202110638994 A CN 202110638994A CN 113537968 B CN113537968 B CN 113537968B
- Authority
- CN
- China
- Prior art keywords
- transaction
- transaction request
- payment channel
- requests
- channel network
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000003672 processing method Methods 0.000 title claims description 7
- 238000012545 processing Methods 0.000 claims abstract description 54
- 230000007246 mechanism Effects 0.000 claims abstract description 26
- 238000000034 method Methods 0.000 claims abstract description 14
- 238000005457 optimization Methods 0.000 claims abstract description 7
- 230000005540 biological transmission Effects 0.000 claims description 12
- 230000008569 process Effects 0.000 claims description 10
- 230000008901 benefit Effects 0.000 claims description 8
- 230000008707 rearrangement Effects 0.000 claims description 4
- 238000012546 transfer Methods 0.000 claims description 4
- 230000002146 bilateral effect Effects 0.000 claims description 3
- 230000015572 biosynthetic process Effects 0.000 claims description 2
- 239000004576 sand Substances 0.000 claims description 2
- 238000013461 design Methods 0.000 abstract description 4
- 238000004088 simulation Methods 0.000 abstract description 4
- 238000013178 mathematical model Methods 0.000 abstract 1
- 238000011056 performance test Methods 0.000 abstract 1
- 238000002474 experimental method Methods 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 241000239290 Araneae Species 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 239000003999 initiator Substances 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 230000000737 periodic effect Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
- 238000012360 testing method Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/22—Payment schemes or models
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q20/00—Payment architectures, schemes or protocols
- G06Q20/08—Payment architectures
- G06Q20/14—Payment architectures specially adapted for billing systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
Landscapes
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Finance (AREA)
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Strategic Management (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Marketing (AREA)
- Technology Law (AREA)
- Financial Or Insurance-Related Operations Such As Payment And Settlement (AREA)
Abstract
The invention belongs to the field of payment channel network mechanism design, and particularly relates to a payment channel network transaction request processing mechanism design based on a game theory. The invention firstly constructs a mathematical model of the transaction request processing problem of the payment channel network, namely constructs the payment channel network as a directed graph:
using balance limit and public chain transaction expense limit as limit conditions; the optimization model is used for minimizing the total transaction cost of a plurality of transactions, related algorithms are designed, the optimal sequence for processing the transactions and the payment channel selection strategy of each transaction are obtained, meanwhile, a Shapril value function is adopted for carrying out fair and reasonable distribution on the income brought by a new mechanism, and finally, the mechanism performance test is carried out in a simulation environment. Simulation experiment results show that the method can greatly improve the success rate of transaction processing in the payment channel network, reduce the total cost required by the transaction, and provide a new idea for improving the performance of the transaction channel network.
Description
Technical Field
The invention belongs to the technical field of payment channel network design, and particularly relates to a payment channel network transaction request processing method based on a game theory.
Background
The payment channel, in which two users store a certain amount of electronic money in a multi-sign address of the blockchain, which represents the maximum amount that the user can pay to another user at the moment, is one of the important means to solve the problem of scalability of the blockchain [1] [2 ]. Before the payment channel is closed, two users can frequently conduct transactions without uploading the transactions to a block chain public chain for recording, and meanwhile, the respective balances of the two parties can be changed, but the sum of the balances is not changed. In the payment channel network, the transaction between users who do not establish the payment channel needs to be completed through the relay channel. The balance of the relay channel is not less than the transmission amount of the transaction request, a transaction initiator needs to pay corresponding transaction cost for using the relay channel, if the payment channel network does not meet the relevant channel of the transaction request, the transaction request needs to be processed on a block chain public chain, the transaction cost is high, the time for waiting for transaction confirmation is long, and how to select the appropriate relay channel so as to minimize the transaction cost is a very challenging problem in the payment channel network.
Currently, research on minimizing transaction fees by improving a trunk channel selection algorithm in a payment channel network is mainly divided into two types, one is mainly performed for a single transaction request. Zhang et al [3] designed the Cheapay algorithm to find available paths under time and balance constraints to achieve transaction cost minimization; authors such as Piatkivskyi and Rohrer propose a series of related works in [7] and [8] respectively, and single-path transmission is converted into multi-path transmission, so that channel balance limitation is resisted, and transaction cost is reduced; ren 5 et al propose a new charging mechanism for keeping balance of channel balance, defining the charging ratio as the negative index of the current capacity, thus ensuring that the balance of the payment channel can be kept relatively balanced, and further successfully processing more transaction requests. Wang et al [4] propose a Flash algorithm to classify transaction requests into two categories based on transmission amounts, with transaction requests with larger transmission amounts focusing mainly on transaction fee payouts, and transaction requests with smaller transmission amounts focusing mainly on detecting payouts generated by available relay channels. Varma and Maguluri use bilateral queues to handle as many transaction requests as possible by rebalancing the channel balances [9 ]. Sivaraman et al propose a Spider network based on transaction request packet processing to improve the throughput of a payment channel network by employing a multi-path transmission protocol [6 ]. However, the existing mechanisms only focus on low cost or high efficiency, and few studies simultaneously achieve reasonable cost and efficiency through balance between the two.
Disclosure of Invention
Aiming at the defects of a payment channel selection algorithm in the conventional payment channel network, the invention provides a transaction request processing method which can simultaneously realize reasonable cost and reasonable efficiency in the payment channel network based on the thought of a game theory.
The invention rearranges the transaction request processing sequence through the cooperative game and the optimization model and selects the optimal path for each transaction request. Under the framework of the alliance game and the cooperation mechanism, the Shapril value function is used for reallocating the income, so that the formation and the stability of the alliance are stimulated. The income distribution method has the characteristics of individuality, high efficiency and fairness, and all transaction requests in the alliance benefit from reduction of total routing cost, so that high transaction request processing success rate and low total transaction cost are achieved.
The invention provides a payment channel network transaction request processing method based on a game theory, which comprises the following specific steps:
firstly, carrying out mathematical modeling on a payment channel network transaction request processing problem, and specifically comprising the following steps:
modeling the payment channel network as a directed graph:
wherein,
representing a node set, and epsilon represents a link set; each node
Representing a user who has established one or more payment channels in a payment channel network; each link eijEpsilon represents slave node niTo node njA payment channel of (1). Each link has three attributes (c)ij(t),wij,bij)，
Finger node n at time tiCan pay to node njIs called the maximum amount ofChannel balance, unlike conventional communication networks, niAnd njThe balance of the bilateral channel is added to be a constant when a slave niTo njTransaction requests for payment are successfully processed, cijDecrease, cjiIncrease and vice versa;
represents cij(t) a set of the values of (t),
represents wijIn the collection of the images, the image data is collected,
represents bijGathering;
if the transaction request processing requires passing through the link eijThen transfer of money per unit to n is requiredjA fee paid;
finger use eijThe base fee, the base fee being independent of the transfer amount. Using quadruplets Xk＝(ns(k),nr(k),vk,tk) Represents a transaction request, where nsAnd nrRepresenting the sender and receiver of transaction k, v, respectivelykIndicating the transmission amount, tkIndicating the time of arrival of the transaction request. For transaction XkThe transaction fee may be expressed as:
The task of the novel transaction processing mechanism is to follow the available path rule, select a proper available path and relay node, process as many transaction requests as possible through a payment channel network, and process the rest transaction requests through a block chain public chain, so as to minimize the total transaction cost of all transaction requests;
the objective of the novel transaction processing mechanism is to find the optimal sequence for processing the transaction requests, and to find the optimal path of each transaction request under the limitation of the available path rules, so as to minimize the transaction cost, and to successfully process as many transaction requests as possible in the payment channel network on the premise of reducing the transaction cost;
available path rules include balance condition limits and public chain transaction cost limits, i.e.:
wherein, Vk(i, j) is a transaction request XkOn link eijThe amount actually transferred, including the transaction amount and the transaction fee to be paid,
is transaction XkThe selected payment channel path.
(II) reordering transaction requests
The invention is different from the principle of transaction request 'arrival and processing' in the traditional payment channel network, the payment channel network carries out centralized transaction request processing once every T time, and for m transaction requests generated in every T time, the generation of the transaction requests instantly needs to select whether to cooperate with other transaction requests or not, and submits personal transaction request information, wherein the transaction requests comprise a sender, a receiver and transmission amount of the transaction requests, and meanwhile, a timestamp of arrival of the transaction requests is recorded; and for the n transaction requests selected to cooperate, calculating the optimal processing sequence based on the cooperation game idea, and acquiring the minimum transaction cost.
The participants: each transaction request is treated as a participant, and the transaction set is represented as: x: x ═ X0,X1,…,XN-1Wherein the transaction request arrival time
Characteristic function: ψ (S), wherein S is any non-empty subset of X; the characteristic function is used for measuring the benefits generated by the cooperation of the union members, namely receiving the benefits generated by the cooperation and generating the benefits by depending on the related new mechanism;
all transaction request processing sequences are mainly based on two rules:
rule 1: for the transaction requests outside the alliance, the transaction request processing time is recorded as the arrival time of the transaction request, namely:
for the transaction requests in the alliance, the transaction request processing time is recorded as the arrival time of the earliest arriving transaction in the alliance, namely:
according to
And
the transaction request processing sequence is sequenced, and the alliance S is regarded as a whole.
Rule 2: for the intra-federation transaction requests, a transaction sequence rearrangement is required to minimize the total transaction cost, the rearrangement sequence being determined by an optimization model:
fij(Xk) If n is 0j＝nr(k)；
γij(Xk) Use of index, f, for the channelij(Xk) Represents XkAt e{ij}And then the transaction fee to be paid.
The optimal transaction request processing order can be obtained by the optimization model, and the obtained characteristic function is as follows:
i.e. the gain achieved by the new mechanism. The characteristic function satisfies the cohesiveness and the weak additivity, which ensure that for the league S, if the players in the league increase, the total earning of the league is not lower than the current earning, which will encourage as many players as possible to join the league, i.e. there is an incentive for accepting new mechanisms for all players.
(III) revenue redistribution by Shapril value function
Rearranging transactions causes a portion of transaction fees to increase, the present invention proposes to redistribute revenue obtained from collaboration among transaction requests using a salpril value, the salpril value being obtained from the following formula:
Δt(S)＝ψ(S∪{i})-ψ(S)。 (9)
the Shapril value function has the properties of symmetry, effectiveness and additivity, and the properties ensure that the profits obtained by different players are matched with the contribution of the different players to the alliance and ensure that the profits can be distributed fairly; meanwhile, the Shapril value function also has the personal nature, the nature guarantees that the income obtained by the individual is not less than 0, and the nature can encourage the player to join the alliance and accept a new mechanism.
The whole process of the system is as follows:
(1) the system sets a transaction processing period T, and transaction request processing is carried out once per period T. Before time T, all arriving transaction requests select whether a cooperation mechanism is adopted at the arrival time, meanwhile, the transaction requests need to submit transaction information to a system, including a sender, a receiver and transaction money of the transaction, the system records the time at the moment as the arrival time of the transaction, and each user signs corresponding intelligent contracts;
(2) at the time T, searching a transaction available path by using formulas (2) and (3), calculating the transaction cost required to be paid by each transaction request if a 'coming to the process' mechanism is used for processing by using (1), recording the network topology at the moment, including nodes, links, link balances and the basic cost and the charging rate of each link, and calculating the optimal transaction request processing sequence and the corresponding minimum transaction cost under a cooperation mechanism by using formulas (4), (5) and (6);
(3) calculating the profit generated by the cooperation mechanism by using formula (7), and calculating the profit allocation for each player by using formulas (8) and (9), wherein each player automatically obtains the profit by the intelligent contract and pays the transaction fee;
(4) and (5) timing to 0, and repeating the step 1.
Experiments and theories prove that the Shapril value function meets the properties of personal rationality and small group rationality, and meanwhile, the Shapril value function meets the requirements of symmetry, effectiveness and additivity, and the properties can guarantee the mechanism to be fair, reasonable, stable and effective.
The payment channel network transaction request processing mechanism provided by the invention can realize that lower transaction cost is obtained by sacrificing part of efficiency, transaction requests are reordered by a periodic transaction processing scheme to obtain smaller routing cost, and the obtained benefit is redistributed by a Shapril value to ensure fairness and stability. Experiments show that the invention can greatly improve the success rate of the transaction request in the payment channel network and greatly reduce the cost required by the transaction.
Drawings
FIG. 1 shows the result of the successful transaction request increase rate and transaction fee decrease rate of the payment channel network with the user of the payment channel network after the present invention is applied.
FIG. 2 shows the result of the change of the transaction request increase rate and the transaction fee decrease rate of the successful transaction processing of the payment channel network with the number of the payment channel network channels after the present invention is applied.
FIG. 3 shows the result of the transaction request increase rate and transaction fee decrease rate of the payment channel network successfully processed by the present invention.
Detailed Description
Example (b):
parameters of the examples are set as follows:
simulation environment: python;
number of users of payment channel network: 150;
number of payment channel network channels: 700 of the base material;
number of transaction requests: 4;
channel capacity: 10-15 coins, and randomly selecting;
transaction request transfer amount: 1-12 coins, and randomly selecting;
transaction fee basis fee: 0;
transaction rate: 1% -5%, randomly selecting;
public chain transaction fee: 100 coins;
the method for testing the performance of the transaction request processing mechanism based on the game theory comprises the following specific steps:
step 1: randomly generating a payment channel network with a required size, and randomly generating transaction requests with required quantity;
step 2: fully arranging all transaction requests;
and step 3: for each transaction request in each arrangement sequence, selecting a payment channel with the minimum cost meeting the requirement to complete processing, and if no available path exists in the payment channel network, completing the transaction request on a public chain;
and 4, step 4: comparing the sum of transaction fees required by successful processing of all transaction requests under each arrangement, selecting the smallest transaction fee as an optimal arrangement sequence, comparing the number and the total amount of the transaction requests which can be successfully completed in the payment channel network under the optimal arrangement sequence and the worst arrangement sequence, and calculating the growth rate; comparing the transaction fees required under the optimal arrangement sequence and the worst arrangement sequence, and calculating the reduction rate;
and (3) simulation results:
the average results of 50 transaction requests and 50 payment channel networks are shown in fig. 1-3, the increase rate of successful processing of transaction requests and the decrease rate of transaction fees in the payment channels increase with the decrease of network users and the increase of payment channels, and the increase rate of successful processing of transaction requests and the decrease rate of transaction fees in the payment channels greatly increase with the increase of the number of transaction requests.
Reference documents:
[1]Poon Joseph and Thaddeus Dryja.“The bitcoin lightning network:Scalable off-chain instant payments."(2016).
[2]Network Raiden.“What is the raiden network."(2018).
[3]Yuhui Zhang,Dejun Yang,and GuoliangXue.“Cheapay:An optimal algorithm for fee minimization in blockchain-based payment channel networks."ICC 2019-2019IEEE International Conference on Communications(ICC).IEEE,2019.
[4]Peng Wang,et al.“Flash:efficient dynamic routing for offchain networks."Proceedings of the 15th International Conference on Emerging Networking Experiments And Technologies.2019.
[5]Ren,Alvin Heng Jun,et al.“Optimal Fee Structure for Efficient Lightning Networks."2018IEEE 24th International Conference on Parallel and Distributed Systems(ICPADS).IEEE,2018.
[6]SivaramanVibhaalakshmi,et al.“High Throughput Cryptocurrency Routing in Payment Channel Networks."17th USENIX Symposium on Networked Systems Design and Implementation(NSDI).2020.
[7]Piatkivskyi Dmytro and Mariusz Nowostawski.“Split payments in payment networks."Data Privacy Management,Cryptocurrencies and Blockchain Technology.Springer,Cham,2018.67-75.
[8]Rohrer Elias,Jann-Frederik Laβ,and Florian Tschorsch.“Towards a concurrent and distributed route selection for payment channel networks."Data Privacy Management,Cryptocurrencies and Blockchain Technology.Springer,Cham,2017.411-419.
[9]Varma,Sushil Mahavir,and Siva ThejaMaguluri.“Throughput Optimal Routing in Blockchain Based Payment Systems."arXiv preprint arXiv:2001.05299(2019).。
Claims (2)
1. a payment channel network transaction request processing method based on game theory is characterized in that transaction request processing sequence is rearranged through an optimization model, and an optimal path is selected for each transaction request; under a certain rule and a alliance game framework, utilizing a Shapril value function to redistribute income, and further exciting the formation and stability of a large alliance; the method comprises the following specific steps:
firstly, carrying out mathematical modeling on a payment channel network transaction request processing problem, and specifically comprising the following steps:
modeling the payment channel network as a directed graph:
wherein,
representing a node set, and epsilon represents a link set; each node
Representing a user who has established one or more payment channels in a payment channel network; each link eijEpsilon represents slave node niTo node njA payment channel of (1); each link has three attributes (c)ij(t),wij,bij)，
Finger node n at time tiCan pay to node njIs called the channel balance, niAnd njThe balance of the bilateral channel is added to be a constant when a slave niTo njTransaction requests for payment are successfully processed, cijDecrease, cjiIncrease and vice versa;
represents cij(t) a set of the values of (t),
represents wijIn the collection of the images, the image data is collected,
represents bijGathering;
if the transaction request processing requires passing through the link eijThen transfer of money per unit to n is requiredjA fee paid;
finger use eijA base fee, the base fee being independent of the transmission amount; using quadruplets Xk＝(ns(k),nr(k),vk,tk) Represents a transaction request, where nsAnd nrRepresenting the sender and receiver of transaction k, v, respectivelykIndicating the transmission amount, tkIndicating the arrival time of the transaction request; for transaction XkThe transaction fee is expressed as:
the task of transaction processing is to follow the available path rule, select a proper available path and relay node, process as many transaction requests as possible through a payment channel network, and process the rest transaction requests through a block chain public link, thereby minimizing the total transaction cost of all transaction requests;
the goal of transaction processing is to find the optimal sequence for processing transaction requests, and to find the optimal path of each transaction request under the limitation of available path rules, so as to minimize transaction fees, and to successfully process as many transaction requests as possible in the payment channel network on the premise of reducing the transaction fees;
available path rules include balance condition limits and public chain transaction cost limits, i.e.:
wherein, Vk(i, j) is a transaction request XkOn link eijThe amount actually transferred, including the transaction amount and the transaction fee to be paid,
is transaction XkA selected payment channel path;
(II) reordering transaction requests
The payment channel network carries out centralized transaction request processing once every T time period, for m transaction requests generated in each T time period, the generation of the transaction requests needs to select whether to cooperate with other transaction requests or not instantly, and submits personal transaction request information, wherein the transaction request information comprises a sender, a receiver and transmission amount of the transaction requests, and meanwhile, time stamps of arrival of the transaction requests are recorded; for n transaction requests selected to cooperate, calculating the optimal processing sequence based on the cooperation game idea to obtain the minimum transaction cost;
the participants: each transaction request is treated as a participant, and the transaction set is represented as: x: x ═ X0,X1,…,XN-1Wherein the transaction request arrives at time tn≤T,
Characteristic function: ψ (S), wherein S is any non-empty subset of X; the characteristic function is used for measuring the benefits generated by the cooperation of the union members, namely receiving the benefits generated by the cooperation and generating the benefits by depending on the related new mechanism;
all transaction request processing sequences are mainly based on two rules:
rule 1: for the transaction requests outside the alliance, the transaction request processing time is recorded as the arrival time of the transaction request, namely:
for the transaction requests in the alliance, the transaction request processing time is recorded as the arrival time of the earliest arriving transaction in the alliance, namely:
according to
And
ordering the transaction request processing sequence of the data, and regarding the alliance S as a whole;
rule 2: for the intra-federation transaction requests, a transaction sequence rearrangement is performed to minimize the total transaction cost, the rearrangement sequence being determined by an optimization model:
s.t.
γij(Xk)(vk+fij(Xk))≤cij(ηk),
fij(Xk) If n is 0j＝nr(k)；
γij(Xk) Use of index, f, for the channelij(Xk) Represents XkAt e{ij}The transaction fee to be paid later;
the optimal transaction request processing order is obtained by the optimization model, and the obtained characteristic function is as follows:
namely the income gained by the new mechanism;
(III) revenue redistribution by Shapril value function
Since reordering transactions results in increased fractional transaction fees, revenue from the collaboration is redistributed among the transaction requests using a Shapril value, determined for the actual revenue obtained for each transaction request, obtained from the following equation:
Δt(S)＝ψ(S∪{i})-ψ(S)； (9)。
2. the payment channel network transaction request processing method based on the game theory as claimed in claim 1, wherein the overall process is as follows:
(1) the system sets a transaction processing period T, and transaction request processing is carried out once per period T; before time T, all arriving transaction requests select whether a cooperation mechanism is adopted at the arrival time, meanwhile, the transaction requests need to submit transaction information to a system, including a sender, a receiver and transaction money of the transaction, the system records the time at the moment as the arrival time of the transaction, and each user signs corresponding intelligent contracts;
(2) at the time T, searching a transaction available path by using formulas (2) and (3), calculating the transaction cost required to be paid by each transaction request if a 'coming to the process' mechanism is used for processing by using (1), recording the network topology at the moment, including nodes, links, link balances and the basic cost and the charging rate of each link, and calculating the optimal transaction request processing sequence and the corresponding minimum transaction cost under a cooperation mechanism by using formulas (4), (5) and (6);
(3) calculating the profit generated by the cooperation mechanism by using formula (7), and calculating the profit allocation for each player by using formulas (8) and (9), wherein each player automatically obtains the profit by the intelligent contract and pays the transaction fee;
(4) and (5) timing to 0, and repeating the step 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110638994.XA CN113537968B (en) | 2021-06-08 | 2021-06-08 | Game theory-based transaction request processing method in payment channel network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110638994.XA CN113537968B (en) | 2021-06-08 | 2021-06-08 | Game theory-based transaction request processing method in payment channel network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113537968A CN113537968A (en) | 2021-10-22 |
| CN113537968B true CN113537968B (en) | 2022-03-18 |
Family
ID=78124690
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110638994.XA Active CN113537968B (en) | 2021-06-08 | 2021-06-08 | Game theory-based transaction request processing method in payment channel network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113537968B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN114938379B (en) * | 2022-05-19 | 2023-10-20 | 中山大学 | Optimal link down channel network routing method based on minimum cost flow |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110223055A (en) * | 2019-05-05 | 2019-09-10 | 中山大学 | A kind of routing resource of block chain payment channel network |
| CN111401868A (en) * | 2020-03-19 | 2020-07-10 | 南开大学 | Minimum-cost block-chain down-link transaction routing algorithm |
| CN111429120A (en) * | 2020-03-27 | 2020-07-17 | 武汉大学 | Block chain payment channel network multi-path routing method based on genetic algorithm |
| CN111522884A (en) * | 2020-05-22 | 2020-08-11 | 哈尔滨工程大学 | Benefit distribution-based transaction promoting method for threat information transaction alliance chain |
| CN111757354A (en) * | 2020-06-15 | 2020-10-09 | 武汉理工大学 | Multi-user slicing resource allocation method based on competitive game |
-
2021
- 2021-06-08 CN CN202110638994.XA patent/CN113537968B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110223055A (en) * | 2019-05-05 | 2019-09-10 | 中山大学 | A kind of routing resource of block chain payment channel network |
| CN111401868A (en) * | 2020-03-19 | 2020-07-10 | 南开大学 | Minimum-cost block-chain down-link transaction routing algorithm |
| CN111429120A (en) * | 2020-03-27 | 2020-07-17 | 武汉大学 | Block chain payment channel network multi-path routing method based on genetic algorithm |
| CN111522884A (en) * | 2020-05-22 | 2020-08-11 | 哈尔滨工程大学 | Benefit distribution-based transaction promoting method for threat information transaction alliance chain |
| CN111757354A (en) * | 2020-06-15 | 2020-10-09 | 武汉理工大学 | Multi-user slicing resource allocation method based on competitive game |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113537968A (en) | 2021-10-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| He et al. | Blockchain-based edge computing resource allocation in IoT: A deep reinforcement learning approach | |
| Zhang et al. | A hierarchical game framework for resource management in fog computing | |
| Hussein et al. | Efficient task offloading for IoT-based applications in fog computing using ant colony optimization | |
| Gao et al. | Truthful incentive mechanism for nondeterministic crowdsensing with vehicles | |
| Karsten et al. | Resource pooling and cost allocation among independent service providers | |
| Wang et al. | QoS multicast routing for multimedia group communications using intelligent computational methods | |
| Kakhbod et al. | An efficient game form for unicast service provisioning | |
| CN113537968B (en) | Game theory-based transaction request processing method in payment channel network | |
| CN110751469A (en) | Encrypted currency multichannel payment method based on intelligent contract | |
| CN114884895A (en) | Intelligent traffic scheduling method based on deep reinforcement learning | |
| CN114071582A (en) | Service chain deployment method and device for cloud-edge collaborative Internet of things | |
| CN107483355B (en) | Data center-oriented online scene low-bandwidth overhead traffic scheduling scheme | |
| Karamanis et al. | Dynamic pricing in one-sided autonomous ride-sourcing markets | |
| Liu et al. | Fine-grained offloading for multi-access edge computing with actor-critic federated learning | |
| Yue et al. | A double auction-based approach for multi-user resource allocation in mobile edge computing | |
| Du et al. | Adversarial deep learning for online resource allocation | |
| Krumke et al. | Extensions to online delay management on a single train line: new bounds for delay minimization and profit maximization | |
| CN103824195A (en) | Excitation method based on three-round bargaining in opportunity network | |
| Mišić et al. | Towards decentralization in dpos systems: election, voting and leader selection using virtual stake | |
| Liwang et al. | Overbook in advance, trade in future: Computing resource provisioning in hybrid device-edge-cloud networks | |
| Shukla et al. | Share loss analysis of internet traffic distribution in computer networks | |
| CN115361392A (en) | Control method, system and storage medium of computing power network based on block chain | |
| CN112416579B (en) | Time-sensitive multiparty data fusion excitation method | |
| Gao et al. | Deep reinforcement learning based node pairing scheme in edge-chain for IoT applications | |
| Avarikioti et al. | Lightning creation games |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |