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

Abstract

The invention discloses a cross-multi-person channel payment path selection method with low transaction fee priority, which includes the following steps: constructing a first-level routing table and a second-level routing table. The first-level routing table records the routes between each multi-person channel; The first-level routing table records the routes between ordinary nodes within each channel; finds the payment path with the lowest transaction fee across multi-person channels. When two nodes need to trade, find the lowest transaction fee channel path through the first-level routing table; according to For the lowest transaction fee channel path and first-level routing table information, request the corresponding supervisory node to query the second-level routing table, select the node with the lowest transaction fee based on the second-level routing table, and finally obtain the cross-multiple channel payment path with the lowest transaction fee. The invention introduces two-level routing and uses supervisory nodes to reduce the cost of maintaining routing information of the entire network. The invention also adds channel balance, transaction fee and other information to the routing information, thereby helping payment nodes quickly select appropriate payment routes.

Description

A low transaction fee priority payment path selection method across multiple channels

Technical field

The invention belongs to the field of blockchain technology, and specifically relates to a payment path selection method across multi-person channels with low transaction fee priority.

Background technique

Two-person channel or two-way payment channel is a mechanism in blockchain technology that is mainly used to create an off-chain micropayment network to realize the transfer of digital assets between users. Based on the two-person channel technology of smart contracts, scholars have proposed a multi-person channel solution. In a multi-person channel, nodes in the channel can trade with each other, and when nodes in different channels conduct transactions, it is called cross-channel payment. Using nodes located in multiple channels at the same time as payment transfer nodes for transactions greatly expands the scope of payment. In addition, the intermediate nodes may be in different blockchains, so cross-channel payments can also achieve cross-chain payments.

Currently, cross-channel payment mainly faces two problems: 1) There needs to be sufficient balance in the network to support transaction payments at each stage; 2) Choosing an appropriate payment path requires considering the liquidity of the channel, transaction fees and network delays. And other factors. Among them, the choice of payment path greatly affects the network payment efficiency and node overhead. Therefore, the payment path selection issue has received widespread attention.

The existing multi-channel network routing algorithm ignores the problem of intermediate nodes charging fees and only considers reachable paths with sufficient funds; however, the fees for different paths vary greatly, and users are sensitive to transaction fees and tend to choose transaction costs. Lower cross-channel payment paths.

Contents of the invention

The main purpose of the present invention is to overcome the shortcomings and deficiencies of the existing technology and propose a cross-multiple channel payment path selection method with low transaction fee priority.

In order to achieve the above objects, the present invention adopts the following technical solutions:

A cross-multi-person channel payment path selection method with low transaction fee priority, which has a global multi-person channel network composed of multiple multi-person channels. The multi-person channel includes ordinary nodes and supervisory nodes. The method includes the following steps:

Construct a two-level routing table, including the construction of a first-level routing table and a second-level routing table. The first-level routing table records the routes between each multi-person channel, and the second-level routing table records the routes between ordinary nodes within each channel;

Find the cross-multi-person channel payment path with the lowest transaction fee. When two nodes need to trade, find the lowest transaction fee channel path through the first-level routing table; based on the lowest transaction fee channel path and the first-level routing table information, report to the corresponding supervisor The node requests to query the secondary routing table, selects the node with the lowest transaction fee based on the secondary routing table, and finally obtains the payment path across multi-person channels with the lowest transaction fee.

Compared with the existing technology, the present invention has the following advantages and beneficial effects:

1. The present invention innovatively introduces two-level routing and uses supervisory nodes to reduce the cost of maintaining routing information of the entire network; and adds channel balance, transaction fee and other information to the routing information, thereby helping payment nodes quickly select appropriate low-cost routing information. Payment method for handling fees.

2. The two-level routing of the present invention significantly reduces communication, storage and computing consumption; the supervision node only needs to maintain and store the routing information between each channel (between supervision nodes) and this channel, and does not need to maintain and store the routing information of all ordinary nodes. Routing information, while ordinary nodes only need to calculate the routing information between channels based on the first-level routing table before transactions, instead of calculating the routing information of all nodes in the entire network, thus reducing computing consumption.

3. The present invention solves the problem of different low-price handling fee strategies for different channels among multiple channels. It does not require the handling fee types of all channels in the network to be consistent, and is more practical.

Description of the drawings

Figure 1 is a flow chart of the method of the present invention;

Figure 2 is a schematic diagram of the multi-person channel network;

Figure 3 is a channel path diagram for node B to transfer money to node G in the embodiment;

Figure 4 is a node payment path diagram for node B to transfer money to node G in the embodiment.

Detailed ways

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

Example

Suppose there is a multi-person channel network T = {t ₁ , t ₂ ,...} composed of multiple multi-person channels. The multi-person channel includes ordinary nodes and supervisory nodes; the multi-person channel is expressed as t _i =C _i ∪{s _i }, where C _i ={n ₁ , n ₂ ,...} represents the set of ordinary nodes corresponding to channel i, and s _i represents the supervisory node corresponding to channel i; supervisory nodes or ordinary nodes have supervisory node IDs and ordinary node IDs respectively. , each node ID is unique in the network.

In addition, the present invention stipulates that ordinary nodes in the same channel can only choose the same type of handling fee. For example, all nodes either charge per-time or as a percentage of the transaction amount, and the transaction fees of the nodes can be completely different; while the supervision nodes' The fee type and fee size can be different from those of ordinary nodes.

As shown in Figure 1, a low transaction fee priority payment path selection method across multi-person channels includes the following steps:

S1. Construct a two-level routing table, including the construction of a first-level routing table and a second-level routing table. The first-level routing table records the routes between each multi-person channel, and the second-level routing table records the routes between ordinary nodes within each channel. routing.

In channel _ti , each ordinary node n _j maintains a local routing table LR(j). Each entry in LR(j) consists of six elements, that is, LRI=<tid, sid, nid, bal, nfee, sfee>, where tid represents the channel ID, sid represents the supervision node ID, nid represents the node's own ID, bal is the node's balance in the channel, and nTee represents the handling fee required to use the node for cross-channel payment. sfee represents the handling fee of the channel supervision node. The balance bal and transaction fee nfee of the same node in different channels may be different;

Ordinary node n _j will regularly send its own local routing table to all its supervisory nodes s _i ; the supervisory node constructs a secondary routing table SR(i) based on the local routing table LR(j) sent by the ordinary nodes in its own channel; Each entry SRI in the secondary routing table consists of the following elements: SRI=<tid, sid, NF>;

Among them, tid represents the channel ID, sid represents the supervision node ID, NF represents the set of nodes connected to the channel tid in this channel, NF is a triplet set, in which each element consists of <nid, bal, nfee>, which is the node ID , node balance and node transaction fees.

The construction of the secondary routing table is based on the local routing table of ordinary nodes, specifically:

Assume that the ordinary node sends the local routing table to the supervisory node every m seconds, and sets 2m as the timeout. At time ts, the supervisory node receives the local routing table LR(j) of an ordinary node n _j , and the supervisory node performs the following construction operate:

Step 1. Determine whether LR(j) is empty:

If it is empty, end the construction of the secondary routing table and return SR(i); if it is not empty, take out an entry LRI=<tid, sid, nid, bal, nfee, sfee>;

Step 2. Find whether there are related entries of tid in SR(i):

If it does not exist, insert the secondary routing entry If it exists, go to step 3;

Step 3. Calculate the expiration time nexp←ts+2m;

Step 4. Update the secondary routing entry NF←NF∪{<nid, bal, nfee, nexp>}, and then jump to step 1.

After the construction of the secondary routing table is completed, the supervisory node s _i constructs the primary routing table FR(i) of this channel t _i based on the secondary routing table SR;

The supervisory node takes out each entry from the secondary routing table in turn and constructs the primary routing entry FRI=<from_tid, to_tid, from_sid, to_sid, mbal, sfee, mfee, exp>;

Among them, from_tid is the ID of the transaction sending channel, to_tid is the ID of the transaction arrival channel, from_sid is the supervision node ID corresponding to the transaction sending channel, to_sid is the supervision node ID corresponding to the transaction arrival channel, and mbal represents the maximum balance of the ordinary node in the arrival channel path;

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

First, the supervisory node finds the corresponding entry from the secondary routing table according to tid, and then obtains the node set NF, and obtains the maximum balance of ordinary nodes, that is, mbal=min{nf[bal]|nf∈NF)};

Among them, sfee represents the transaction fee of the supervision node of the departure channel, mfee represents the minimum transaction fee of the ordinary node on this path, and mfee is derived from the secondary routing table, specifically:

First, the supervisory node finds the corresponding entry from the secondary routing table to obtain the node set NF, and then finds the minimum transaction fee of the ordinary node from NF, that is, mfee=min{nf[nfee]|nf∈NF)};

Among them, exp is the expiration time of the modified routing entry, which is determined by the earliest expired secondary routing entry in the modified path.

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

Assume that the supervisory node s _i of channel t _i already has a secondary routing table SR(i). The specific construction of the primary routing table consists of two parts: constructing the primary routing table entry starting from this channel and constructing the entry arriving at this channel. First-level routing table entry; the specific process is as follows:

Step 1. Find the entry SRI _i = <t _i , si , sfee _{i ,} NF _i > whose tid is equal to the channel ID from the secondary routing table SR(i);

Step 2. According to the current time ts, remove expired data in NF _i , that is, NF _i ←{nf|nf[nexp]<ts, nf∈NF _i };

Step 3. Calculate the expiration time exp ₁ ←min{nf[nexp]|nf∈NF _i };

Step 4. Traverse each entry SRI _j =<t _j , s _j , sfee _j , NF _j > in SR(i) and perform the following steps:

Step 41. If SRI _j == SRI _i , skip; if SRI _j ≠ SRI _i , take out NF _j from SRI _j ;

Step 42. According to the current time ts, remove expired data in NF _j , that is, NF _j ←{nf|nf[nexp]<ts, nf∈NF _j };

Step 43. Obtain the node ID set ns←{nf[nid]|nf∈NF _j )} from NF _j ;

Step 44: Take out NF _i from SRI _i , traverse the node ID set ns to obtain all relevant node information NF′ _i in NF _i , that is, NF′ _i ←{nf|nf[nid]∈ns};

Step 45: Construct a first-level routing table entry starting from this channel;

Step 46: Construct a first-level routing table entry to reach this channel;

Among them, in step 45, a first-level routing table entry starting from this channel is constructed, including:

Calculate the maximum balance of the arrival channel mbal←min{nf[bal]|nf∈NFj)};

Calculate the minimum transaction fee mfee←min{nf[nfee]|nf∈NF′ _i )} for this path;

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

In step 46, a first-level routing table entry to this channel is constructed, including:

Calculate the expiration time exp ₂ ←min{nf[nexp]|nf∈NF _j };

Calculate the maximum balance of the arrival channel mbal←min{nf[bal]|nf∈NF′ _i )};

Calculate the minimum transaction fee mfee←min{nf[nfee]|nf∈NF _j )} for this path;

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

When constructing the secondary routing table, regular nodes broadcast their own local routes regularly, and the supervisory nodes continuously update the secondary routing table;

After each update of the secondary routing table, the supervisory node will update its own first-level routing table entry information; at the same time, all supervisory nodes will exchange their local first-level routing tables with other supervisory nodes in the neighbor channel, so that the final network Each supervisory node in the network has a global first-level routing table.

In the first-level routing table and the second-level routing table, each routing entry includes an expiration time;

When the ordinary node sends the local routing table to the supervisory node, the supervisory node learns that the ordinary node is still alive, so it updates the expiration time of the corresponding entry of the node in the secondary routing table;

When the supervisory node generates the first-level routing table, it will check whether the entries in the second-level routing table have expired and delete the expired entries;

Expired entries in the first-level routing table will be deleted before exchanging the first-level routing tables between supervisory nodes.

S2. Find the cross-multi-person channel payment path with the lowest transaction fee. When two nodes need to trade, the lowest transaction fee channel path is found through the first-level routing table; based on the lowest transaction fee channel path and the first-level routing table information, the corresponding The supervision node requests to query the secondary routing table, selects the node with the lowest transaction fee based on the secondary routing table, and finally obtains the cross-multiple channel payment path with the lowest transaction fee.

The specific method to find the lowest transaction fee channel path is:

Step 1. The sending node requests the first-level routing table FR from the supervisory node;

Step 2. The sending node deletes the entries in all first-level routing table entries whose channel maximum balance is less than the sending amount m, and obtains a new first-level routing table FR′={FRI|FRI[mbal]<a, FRI∈FR};

Step 3. The sending node updates the ordinary node handling fee sfee and the supervision node handling fee mfee in the routing table FR′; for each routing entry in FR′, if sfee or mfee is a percentage type, multiply it by the amount m Obtain the specific handling fee, and finally update the total handling fee fee=sfee+mfee to the routing entry;

Step 4. The sending node constructs a directed weighted graph G based on the filtered first-level routing table FR′, in which each graph vertex is a tuple consisting of a channel ID and a supervisory node ID. Each edge in the graph The weight is the lowest handling fee between the two channels;

Step 5. The sending node uses a single-source shortest path algorithm, such as the Dijkstra algorithm, to find the lowest transaction fee channel path RT to the receiving node. If it is not found, it means that there is no connected path between the two nodes;

Step 6. Based on the lowest transaction fee channel path RT, the sending node calculates the transaction fee f.

The specific method to obtain the payment path across multi-person channels with the lowest transaction fee is:

Step 1. Based on the lowest transaction fee channel path RT, the sending node sequentially queries each supervision node in the path for the secondary routing table corresponding to its channel;

Step 2. According to the secondary routing table, the sending node uses the channel ID to query to obtain the node information set NF in the secondary routing table, and finds the ordinary node that provides the lowest handling fee. If there are multiple nodes that meet the conditions, select the one with the largest balance. that node;

Step 3. The sending node checks whether the balance of the ordinary node that provides the lowest handling fee is greater than m+f;

If the node's balance is less than m+f, the sending node deletes the corresponding channel routing entry in FR' and jumps to step 4 of finding the lowest transaction fee channel path; if the node's balance is greater than m+f, continue to perform the following steps;

Step 4. The sending node adds the common node ID that provides the lowest handling fee to the cross-multiplayer channel payment path RN;

Step 5: When all channels in the lowest transaction fee channel path RT are processed, the cross-multiple channel payment path RN with the lowest transaction fee is obtained.

In this embodiment, assume that there is a multi-person channel payment network diagram as shown in Figure 2. Each vertex in the diagram is a multi-person channel. Next to each node in the vertex is the balance and handling fee of the node. The triplet under each vertex represents the channel ID, supervision node ID and supervision node handling fee. Assume that node B wants to transfer 15 to G. Then B first asks its own supervision node for the first-level routing table, and then it constructs a directed weighted graph, as shown in Figure 3, in which each vertex is the channel ID and supervision node ID, and the edge is the minimum required procedure. For example, the handling fee from channel 11 to channel 12 is calculated as follows. Querying the first-level routing table, you can get the routing entry <11,12,21,22,50,1%,0.1,exp>, so the total handling fee is 15*0.1+0.1=0.25. Similarly, the handling fees of other paths can be calculated and a channel path with the lowest handling fee can be finally selected; in Figure 3, the solid line represents the channel path finally selected by node B. Finally, a payment path with the lowest transaction fee is finally selected based on the channel path, as shown in Figure 4. The solid line in the figure represents the payment path finally selected by node B.

It should also be noted that in this specification, terms such as "comprising", "comprises" or any other variations thereof are intended to cover non-exclusive inclusion, such that a process, method, article or device that includes a series of elements not only includes Those elements, but also other elements not expressly listed or inherent in such process, method, article or equipment. Without further limitation, an element defined by the statement "comprises a..." does not exclude the presence of additional identical elements in a process, method, article, or apparatus that includes the stated element.

The above description of the disclosed embodiments enables those 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 practiced in 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.