CN117273713A - Low transaction fee priority cross-multi-person channel payment path selection method - Google Patents

Abstract

The invention discloses a low transaction fee priority cross-multi-user channel payment path selection method, which comprises the following steps: constructing a primary routing table and a secondary routing table, wherein the primary routing table records routes among multiple channels, and the secondary routing table records routes among common nodes inside each channel; searching a cross-multi-person channel payment path of the lowest transaction fee, and searching the path of the lowest transaction fee through a primary routing table when two nodes need to transact; and according to the lowest transaction fee channel path and the first-level routing table information, requesting to query the second-level routing table from the corresponding monitoring node, selecting the node with the lowest transaction fee according to the second-level routing table, and finally obtaining the cross-multi-person channel payment path with the lowest transaction fee. The invention introduces two-stage routing, uses the supervision node to reduce the cost of maintaining the whole network routing information, and adds the information such as channel balance, transaction fee and the like in the routing information, thereby helping the payment node to quickly select a proper payment route.

Description

Low transaction fee priority cross-multi-person channel payment path selection method

Technical Field

The invention belongs to the technical field of blockchains, and particularly relates to a low transaction fee priority cross-multi-person channel payment path selection method.

Background

The double channel or the two-way payment channel is a mechanism in the blockchain technology, and is mainly used for creating a micro-payment network under a chain to realize the transfer of digital assets among users. Two-person channel technology based on intelligent contracts, scholars have proposed a multi-person channel scheme. Within a multi-person channel, nodes within the channel may transact with each other, and when nodes within different channels transact, they are referred to as cross-channel payments. The nodes which are simultaneously positioned in a plurality of channels are used as payment transfer nodes for transaction, so that the payment range is greatly enlarged. Furthermore, the intermediate nodes may be in different blockchains, and thus, cross-channel payments may also enable cross-chain payments.

At present, cross-channel payment mainly faces two problems: 1) A sufficient balance is required in the network to support each stage of transaction payment; 2) The proper payment path is selected, and factors such as mobility of the channel, transaction cost, network delay and the like need to be considered. The payment path selection greatly affects the network payment efficiency and the node cost, so the payment path selection problem is widely focused.

The existing multi-person channel network routing algorithm ignores the problem of charging the commission of the intermediate node, and only considers the reachable paths with sufficient funds; however, the different path commissions differ significantly, and users are sensitive to transaction commissions and tend to select cross-channel payment paths that are less costly to transact.

Disclosure of Invention

The invention aims to overcome the defects and shortcomings of the prior art and provides a cross-multi-user-channel payment path selection method with low transaction fee priority.

In order to achieve the above purpose, the present invention adopts the following technical scheme:

a low transaction fee priority cross-multi-person channel payment path selection method is provided with a global multi-person channel network consisting of a plurality of multi-person channels, wherein the multi-person channels comprise common nodes and monitoring nodes, and the method comprises the following steps:

constructing a two-stage routing table, wherein the two-stage routing table comprises a first-stage routing table and a second-stage routing table, the first-stage routing table records routes among various multi-person channels, and the second-stage routing table records routes among common nodes inside each channel;

searching a cross-multi-person channel payment path of the lowest transaction fee, and searching the path of the lowest transaction fee through a primary routing table when two nodes need to transact; and according to the lowest transaction fee channel path and the first-level routing table information, requesting to query the second-level routing table from the corresponding monitoring node, selecting the node with the lowest transaction fee according to the second-level routing table, and finally obtaining the cross-multi-person channel payment path with the lowest transaction fee.

Compared with the prior art, the invention has the following advantages and beneficial effects:

1. the invention innovatively introduces two-stage routing, and uses the supervision node to reduce the cost of maintaining the whole network routing information; and the information such as the channel balance, the transaction fee and the like is added in the routing information, so that the payment node is helped to quickly select a proper payment path with low commission.

2. The two-stage routing of the invention significantly reduces communication, storage and calculation consumption; the supervising node only needs to maintain and store the route information of each channel (between supervising nodes) and the channel, and does not need to maintain and store the route information of all common nodes, and the common nodes only need to calculate the route information between channels according to the primary route table before transaction, and does not need to calculate the route information of all nodes in the whole network, thereby reducing the calculation consumption.

3. The invention solves the problem that the different channel commission cost low price strategies among the multiple channels are different, does not require that the commission cost types of all channels in the network are consistent, and has more practicability.

Drawings

FIG. 1 is a flow chart of the method of the present invention;

FIG. 2 is a schematic diagram of a multi-person channel network;

FIG. 3 is a path diagram of a path of node B transferring to node G in an embodiment;

fig. 4 is a node payment path diagram of the node B transfer to the node G in the embodiment.

Detailed Description

The present invention will be described in further detail with reference to examples and drawings, but embodiments of the present invention are not limited thereto.

Examples

Assume that a multi-person channel network t= { T composed of a plurality of multi-person channels is provided ₁ ，t ₂ …, the multi-person channel comprises a common node and a supervision node; the multi-person channel is denoted t _i ＝C _i ∪{s _i }, wherein C _i ＝{n ₁ ，n ₂ … } represents the common node set corresponding to channel i, s _i Representing a supervision node corresponding to the channel i; the supervising node or the ordinary node has a supervising node ID and an ordinary node ID, respectively, each node ID being unique in the network.

In addition, the invention provides that common nodes of the same channel can only select the same type of commission, for example, all nodes charge either on a per-pass basis or as a percentage of the transaction amount, and the transaction fees of the nodes can be completely different; the handling fee type and the handling fee size of the supervision node can be different from those of the common node.

As shown in fig. 1, a low transaction fee-priority cross-multi-person channel payment path selection method includes the following steps:

s1, constructing a two-stage routing table, wherein the two-stage routing table comprises a first-stage routing table and a second-stage routing table, the first-stage routing table records routes among various multi-person channels, and the second-stage routing table records routes among common nodes inside each channel.

In the channel t _i In each common node n _j A local routing table LR (j) is maintained, each entry in LR (j) consisting of six elements, i.e., LRI =<tid，sid，nid，bal，nfee，sfee>Whereintid represents a channel ID, tid represents a supervising node ID, nid represents a node ID, bal is the balance of the node on the channel, and nTee represents the commission required for using the node to pay across channels. sfee represents the commission of the channel supervising node. The balance bal and the transaction fee nfee of the same node in different channels may be different;

common node n _j Will periodically send to all its own supervising nodes s _i Transmitting own local routing table; the supervision node constructs a secondary routing table SR (i) according to a local routing table LR (j) sent by a common node in the own channel; each entry SRI of the secondary routing table is made up of the following elements: sri=<tid，sid，NF>；

Where tid represents a channel ID, sid represents a supervisory node ID, NF represents a node set connected to the channel tid in the present channel, NF is a triplet set, where each element consists of < nid, bal, nfee >, i.e. node ID, node balance and node transaction fee.

The construction of the secondary routing table is based on a local routing table of a common node, and specifically comprises the following steps:

assuming that the regular node sends the local routing table to the supervising node every m seconds and sets 2m as the timeout, at the time ts the supervising node receives a certain regular node n _j The supervising node performs the following construction operations:

step 1, judging whether LR (j) is empty:

if the routing table is empty, ending the construction of the secondary routing table and returning to the SR (i); if not empty, fetch an entry lri= < tid, sid, nid, bal, nfee, sfee >;

step 2, searching whether a tid related item exists in the SR (i):

if not, insert a secondary routing entryIf so, executing the step 3;

step 3, calculating the expiration time nexp;

and step 4, updating the secondary routing entries NF≡NF ++nid, bal, nfee and nexp > }, and then jumping to the step 1.

After the construction of the secondary routing table is completed, the supervision node s _i Constructing the channel t according to the secondary routing table SR _i Is described as a first level routing table FR (i);

the monitoring node sequentially takes out each item from the secondary routing table, and builds a primary routing item FRI= < from_tid, to_tid, from_sil, to_sil, mbal, sfee, mfee, exp >;

wherein from_tid is a transaction sending channel ID, to_tid is a transaction arrival channel ID, from_sid is a supervisory node ID corresponding to the transaction sending channel, to_sid is a supervisory node ID corresponding to the transaction arrival channel, and mbal represents the maximum balance of common nodes in the arrival channel path;

mbal can be derived from the secondary routing table, specifically:

firstly, a supervision node finds a corresponding entry from a secondary routing table according to tid, then a node set NF is obtained, and the maximum balance of a common node is obtained, namely, mbal=min { NF [ bal ] |nf epsilon NF) };

wherein, sfee represents the transaction fee of the supervision node of the departure channel, mfee represents the lowest transaction fee of the common node of the path, mfee is obtained by a secondary routing table, and specifically:

firstly, a supervision node finds out a corresponding entry from a secondary routing table to obtain a node set NF, and then finds out the minimum transaction cost of a common node from NF, namely mfee=min { NF [ nfee ] |nf E NF) };

wherein exp is the expiration time of the rerouting entry, which is determined by the earliest expired secondary routing entry in the rerouting path.

The construction of the first-level routing table is specifically as follows:

let it be channel t _i Is of the supervision node s of (a) _i The existing secondary routing table SR (i), the specific construction of which consists of two parts: constructing a first-level routing table entry starting from the channel and constructing a first-level routing table entry reaching the channel; the specific process is as follows:

step 1, find tid and equal item SRI of this channel ID from the secondary route table SR (i) _i ＝<t _i ，s _i ，，sfee _i ，NF _i >；

Step 2, removing NF according to the current time ts _i Medium expiration data, i.e. NF _i ←{nf|nf[nexp]＜ts，nf∈NF _i }；

Step 3, calculating the expiration time exp ₁ ←min{nf[nexp]|nf∈NF _i }；

Step 4, traversing each entry SRI in SR (i) _j ＝<t _j ，s _j ，sfee _j ，NF _j >The method comprises the following steps of:

step 41, if SRI _j ＝＝SRI _i Skipping; if SRI _j ≠SRI _i From SRI _j Removal of NF _j ；

Step 42, removing NF according to the current time ts _j Medium expiration data, i.e. NF _j ←{nf|nf[nexp]＜ts，nf∈NF _j }；

Step 43, from NF _j Obtain node ID set ns≡ { nf [ nid ]]|nf∈NF _j )}；

Step 44, slave SRI _i Removal of NF _i Traversing node ID set ns to obtain NF _i All relevant node information NF' _i I.e. NF' _i ←{nf|nf[nid]∈ns}；

Step 45, constructing a first-level routing table entry starting from the channel;

step 46, constructing a first-level routing table entry reaching the channel;

in step 45, a primary routing table entry from the present channel is constructed, including:

calculating the maximum balance mbal of the arrival channel;

calculate the minimum transaction fee mfee of this route++min { nf [ nfee ]]|nf∈NF′ _i )}；

FR(i)←FR(i)∪{<t _i ，s _i ，t _j ，s _j ，mbal，sfee _j ，mfee，exp ₁ >}；

In step 46, a primary routing table entry is constructed to the present channel, including:

calculating an expiration time exp ₂ ←min{nf[nexp]|nf∈NF _j }；

Calculating the maximum balance mbal of the arrival channel ≡min { nf [ bal ]]|nf∈NF′ _i )}；

Calculate the minimum transaction fee mfee of this route++min { nf [ nfee ]]|nf∈NF _j )}；

FR(i)←FR(i)∪{<t _j ，s _j ，t _i ，s _i ，mbal，sfee _i ，mfee，exp ₂ >}。

When a secondary routing table is constructed, the supervision node continuously updates the secondary routing table by broadcasting own local routing at regular time of the common node;

after updating the secondary routing table each time, the monitoring node updates own primary routing table entry information; meanwhile, all the monitoring nodes exchange local primary routing tables with other monitoring nodes in the neighbor channel, so that each monitoring node in the final network has a global primary routing table.

In the primary routing table and the secondary routing table, each routing entry includes an expiration time;

when the common node sends the local routing table to the monitoring node, the monitoring node learns that the common node still survives, so that the expiration time of the corresponding entry of the node in the secondary routing table is updated;

when the monitoring node generates the primary routing table, checking whether an entry in the secondary routing table is outdated or not, and deleting the outdated entry;

entries in the expired primary routing table are deleted before the primary routing tables are exchanged between the supervising nodes.

S2, searching a cross-multi-person channel payment path with the lowest transaction fee, and searching the path with the lowest transaction fee through a primary routing table when two nodes need to transact; and according to the lowest transaction fee channel path and the first-level routing table information, requesting to query the second-level routing table from the corresponding monitoring node, selecting the node with the lowest transaction fee according to the second-level routing table, and finally obtaining the cross-multi-person channel payment path with the lowest transaction fee.

The method for searching the path of the lowest transaction fee channel comprises the following steps:

step 1, a sending node requests a first-level routing table FR from a supervising node;

step 2, the transmitting node deletes the entry with the channel maximum balance smaller than the transmitting amount m in all the primary routing table entries to obtain a new primary routing table FR' = { FRI|FRI [ mbal ] < a, FRI epsilon FR };

step 3, the common node handling fee sfee and the supervision node handling fee mfee in the routing table FR' are updated by the sending node; for each routing entry in FR', if the sfee or mfee is of the percentage type, multiplying it by the amount m to obtain a specific commission, and finally updating the total commission = sfee + mfee into the routing entry;

step 4, the sending node constructs a directed weighted graph G according to the screened primary routing table FR', wherein each graph vertex is a tuple consisting of a channel ID and a supervision node ID, and the weight of each edge in the graph is the lowest commission fee between two channels;

step 5, the sending node searches the path RT of the lowest transaction fee channel reaching the receiving node by using a single-source shortest path algorithm, such as Dijkstra algorithm, and if the path RT is not found, the path which is not communicated between the two nodes is indicated;

and 6, calculating the transaction fee f by the sending node according to the path RT of the lowest transaction fee channel.

The method for obtaining the cross-multi-user channel payment path with the lowest transaction fee comprises the following steps:

step 1, a sending node sequentially inquires a secondary routing table corresponding to a channel where each supervising node in a path is located according to a channel path RT with the lowest transaction fee;

step 2, according to the secondary routing table, the sending node queries by using the channel ID to obtain a node information set NF in the secondary routing table, searches for a common node providing the lowest commission, and if a plurality of nodes meeting the conditions exist, selects the node with the largest balance;

step 3, the sending node checks whether the balance of the common node providing the lowest commission is greater than m+f;

if the balance of the node is less than m+f, the sending node deletes the corresponding channel route entry in FR' and jumps to the step 4 of searching the channel path with the lowest transaction fee; if the balance of the node is greater than m+f, continuing to execute the following steps;

step 4, the sending node adds the common node ID providing the lowest commission to the cross-multi-person channel payment path RN;

and step 5, obtaining the cross-multi-person channel payment path RN with the lowest transaction fee after all channels in the channel path RT with the lowest transaction fee are processed.

In this embodiment, it is assumed that a multi-person channel payment network diagram as shown in fig. 2 is provided, each vertex in the diagram is a multi-person channel, the balance and the commission fee of the node are marked beside each node in the vertex, and a triplet below each vertex represents a channel ID, a supervision node ID and a supervision node commission fee. Suppose node B is to transfer 15 a G. B first queries its own supervising node for a primary routing table and then constructs a directed weighted graph as shown in fig. 3, where each vertex is a channel ID and supervising node ID, and the edges are the lowest required costs, e.g., the costs from channel 11 to channel 12 are calculated as follows, and querying the primary routing table can result in routing entries <11,12,21,22,50,1%,0.1, exp >, so the total costs are 15 x 0.1+0.1 = 0.25. The same can calculate the commission of other paths and finally select a channel path with the lowest commission; in fig. 3, the solid line represents the channel path that the node B finally selects. Finally, a payment path with lowest transaction fee is finally selected according to the channel path, as shown in fig. 4, wherein the solid line represents the payment path finally selected by the node B.

It should also be noted that in this specification, terms such as "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising one … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.

The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims (10)

1. The low transaction fee priority cross-multi-channel payment path selection method is characterized in that a global multi-channel network consisting of a plurality of multi-channels is arranged, the multi-channels comprise common nodes and supervision nodes, and the method comprises the following steps:

constructing a two-stage routing table, wherein the two-stage routing table comprises a first-stage routing table and a second-stage routing table, the first-stage routing table records routes among various multi-person channels, and the second-stage routing table records routes among common nodes inside each channel;

searching a cross-multi-person channel payment path of the lowest transaction fee, and searching the path of the lowest transaction fee through a primary routing table when two nodes need to transact; and according to the lowest transaction fee channel path and the first-level routing table information, requesting to query the second-level routing table from the corresponding monitoring node, selecting the node with the lowest transaction fee according to the second-level routing table, and finally obtaining the cross-multi-person channel payment path with the lowest transaction fee.

2. A low transaction fee-preferred cross-multi-lane payment path selection method according to claim 1 wherein the global multi-lane network is denoted as t= { T ₁ ，t ₂ …, a multi-person channel denoted t _i ＝C _i ∪{s _i }, wherein C _i ＝{n ₁ ，n ₂ … } represents the common node set corresponding to channel i, s _i Representing a supervision node corresponding to the channel i;

the supervising node or the ordinary node has a supervising node ID and an ordinary node ID, respectively, each node ID being unique in the network.

3. A low transaction fee preferred cross-multi-person path payment routing method as recited in claim 2 wherein, at path t _i In each common node n _j A local routing table LR (j) is maintained, each entry in LR (j) consisting of six elements, i.e., LRI =<tid，sid，nid，bal，nfee，sfee>Wherein tid represents a channel ID, tid represents a supervision node ID, nid represents a node self ID, bal is the balance of the node on the channel, nfee represents the commission required to pay by using the node to pay across channels, and sfee represents the commission of the channel supervision node;

common node n _j Periodically directing all supervisory nodes s of the system to the system _i Transmitting own local routing table, and constructing a secondary routing table SR (i) by the monitoring node according to the local routing table LR (j) transmitted by the common node in the own channel; each entry SRI of the secondary routing table is made up of the following elements: sri=<rid，sid，NF>；

Where tid represents a channel ID, sid represents a supervisory node ID, NF represents a node set connected to the channel tid in the present channel; NF is a triplet set in which each element consists of < nid, bal, nfee >, i.e., node ID, node balance, and node transaction fee.

4. A low transaction fee-preferred cross-multi-person channel payment path selection method according to claim 3, wherein the construction of the secondary routing table is based on a local routing table of a common node, specifically:

setting a local routing table sent by a common node to a supervision node every m seconds, setting 2m as overtime, and receiving a certain common node n by the supervision node at the time ts _j Local routing table LR (j) of (b), supervising nodeThe following construction steps are carried out:

step 1, judging whether LR (j) is empty:

if the routing table is empty, ending the construction of the secondary routing table and returning to the SR (i); if not empty, fetch an entry lri= < tid, sid, nid, bal, nfee, sfee >;

step 2, searching whether a tid related item exists in the SR (i):

if not, insert a secondary routing entryIf so, executing the step 3;

step 3, calculating the expiration time nexp;

and step 4, updating the secondary routing entries NF≡NF ++nid, bal, nfee and nexp > }, and then jumping to the step 1.

5. The method for cross-multi-path payment routing with low transaction fee preference as recited in claim 4 wherein the supervisory node s, after the secondary routing table is constructed _i Constructing the channel t according to the secondary routing table SR _i Is described as a first level routing table FR (i);

the monitoring node sequentially takes out each item from the secondary routing table, and builds a primary routing item FRI= < from_tid, to_tid, from_sil, to_sil, mbal, sfee, mfee, exp >;

wherein from_tid is a transaction sending channel ID, to_tid is a transaction arrival channel ID, from_sid is a supervisory node ID corresponding to the transaction sending channel, to_sid is a supervisory node ID corresponding to the transaction arrival channel, and mbal represents the maximum balance of common nodes in the arrival channel path;

the mbal is derived from the secondary routing table, specifically:

firstly, a supervision node finds a corresponding entry from a secondary routing table according to tid, then a node set NF is obtained, and the maximum balance of a common node is obtained, namely, mbal=min { NF [ bal ] |nf epsilon NF) };

wherein, sfee represents the transaction fee of the supervision node of the departure channel, mfee represents the lowest transaction fee of the common node of the path, mfee is obtained by a secondary routing table, and specifically:

firstly, a supervision node finds out a corresponding entry from a secondary routing table to obtain a node set NF, and then finds out the minimum transaction cost of a common node from NF, namely mfee=min { NF [ nfee ] |nf E NF) };

wherein exp is the expiration time of the rerouting entry, which is determined by the earliest expired secondary routing entry in the rerouting path.

6. The method for selecting a payment path across multiple channels with low transaction fee preference according to claim 5, wherein the construction of the primary routing table is specifically as follows:

set a channel t _i Is of the supervision node s of (a) _i The existing secondary routing table SR (i), the specific construction of which consists of two parts: constructing a first-level routing table entry starting from the channel and constructing a first-level routing table entry reaching the channel; the specific process is as follows:

step 1, find tid and equal item SRI of this channel ID from the secondary route table SR (i) _i ＝<t _i ，s _i ，，sfee _i ，NF _i >；

Step 2, removing NF according to the current time ts _i Medium expiration data, i.e. NF _i ←{nf|nf[nexp]＜ts，nf∈NF _i }；

Step 3, calculating the expiration time exp ₁ ←min{nf[nexp]|nf∈NF _i }；

Step 4, traversing each entry SRI in SR (i) _j ＝<t _j ，s _j ，sfee _j ，NF _j >The method comprises the following steps of:

step 41, if SRI _j ＝＝SRI _i Skipping; if SRI _j ≠SRI _i From SRI _j Removal of NF _j ；

Step 42, removing NF according to the current time ts _j Medium expiration data, i.e. NF _j ←{nf|nf[nexp]＜ts，nf∈NF _j }；

Step 43, from NF _j Obtain node ID set ns≡ { nf [ nid ]]|nf∈NF _j )}；

Step 44, slave SRI _i Removal of NF _i Traversing node ID set ns to obtain NF _i All relevant node information NF' _i I.e. NF' _i ←{nf|nf[nid]∈ns}；

Step 45, constructing a first-level routing table entry starting from the channel;

step 46, constructing a first-level routing table entry reaching the channel;

in step 45, a primary routing table entry from the present channel is constructed, including:

calculating the maximum balance mbal of the arrival channel ≡min { nf [ bal ]]|nf∈NF _j )}；

Calculate the minimum transaction fee mfee of this route++min { nf [ nfee ]]|nf∈NF′ _i )}；

FR(i)←FR(i)∪{<t _i ，s _i ，t _j ，s _j ，mbal，sfee _j ，mfee，exp ₁ >}；

In step 46, a primary routing table entry is constructed to the present channel, including:

calculating an expiration time exp ₂ ←min{nf[nexp]|nf∈NF _j }；

Calculating the maximum balance mbal of the arrival channel ≡min { nf [ bal ]]|nf∈NF′ _i )}；

Calculate the minimum transaction fee mfee of this route++min { nf [ nfee ]]|nf∈NF _j )}；

FR(i)←FR(i)∪{<t _j ，s _j ，t _i ，s _i ，mbal，sfee _i ，mfee，exp ₂ >}。

7. The method for selecting a payment path across multiple channels with low transaction fee priority according to claim 6, wherein when constructing the secondary routing table, the supervising node continuously updates the secondary routing table by broadcasting its own local routing table at regular time of the common node;

after updating the secondary routing table each time, the monitoring node updates own primary routing table entry information; meanwhile, all the monitoring nodes exchange local primary routing tables with other monitoring nodes in the neighbor channel, so that each monitoring node in the final network has a global primary routing table.

8. A low transaction fee preferred cross-multi-lane payment routing method as recited in claim 7 wherein each routing entry includes an expiration time in the primary routing table and the secondary routing table;

when the common node sends the local routing table to the monitoring node, the monitoring node learns that the common node still survives, so that the expiration time of the corresponding entry of the node in the secondary routing table is updated;

when the monitoring node generates the primary routing table, checking whether an entry in the secondary routing table is outdated or not, and deleting the outdated entry;

entries in the expired primary routing table are deleted before the primary routing tables are exchanged between the supervising nodes.

9. The method for selecting a path for payment across multiple channels with low transaction fee priority according to claim 1, wherein the method for searching the path of the lowest transaction fee channel is specifically as follows:

step 1, a sending node requests a first-level routing table FR from a supervising node;

step 2, the transmitting node deletes the entry with the channel maximum balance smaller than the transmitting amount m in all the primary routing table entries to obtain a new primary routing table FR' = { FRI|FRI [ mbal ] < a, FRI epsilon FR };

step 3, the common node handling fee sfee and the supervision node handling fee mfee in the routing table FR' are updated by the sending node; for each routing entry in FR', if the sfee or mfee is of the percentage type, multiplying it by the amount m to obtain a specific commission, and finally updating the total commission = sfee + mfee into the routing entry;

step 4, the sending node constructs a directed weighted graph G according to the screened primary routing table FR', wherein each graph vertex is a tuple consisting of a channel ID and a supervision node ID, and the weight of each edge in the graph is the lowest commission fee between two channels;

step 5, the sending node searches the path Rf of the lowest transaction fee channel reaching the receiving node by using a single-source shortest path algorithm, and if the path Rf is not found, the path which is not communicated between the two nodes is indicated;

and 6, calculating the transaction fee f by the sending node according to the path RT of the lowest transaction fee channel.

10. The method for selecting a payment path across multiple channels with low transaction fee priority according to claim 9, wherein the method for obtaining the payment path across multiple channels with lowest transaction fee is specifically as follows:

step 1, a sending node sequentially inquires a secondary routing table corresponding to a channel where each supervising node in a path is located according to the channel path Rf with the lowest transaction fee;

step 2, according to the secondary routing table, the sending node queries by using the channel ID to obtain a node information set NF in the secondary routing table, searches for a common node providing the lowest commission, and if a plurality of nodes meeting the conditions exist, selects the node with the largest balance;

step 3, the sending node checks whether the balance of the common node providing the lowest commission is greater than m+f;

if the balance of the node is less than m+f, the sending node deletes the corresponding channel route entry in FR' and jumps to the step 4 of searching the channel path with the lowest transaction fee; if the balance of the node is greater than m+f, continuing to execute the following steps;

step 4, the sending node adds the common node ID providing the lowest commission to the cross-multi-person channel payment path RN;

and step 5, obtaining the cross-multi-person channel payment path RN with the lowest transaction fee after all channels in the channel path Rf with the lowest transaction fee are processed.