CN113225254A - Under-chain payment channel route balancing method - Google Patents
Under-chain payment channel route balancing method Download PDFInfo
- Publication number
- CN113225254A CN113225254A CN202110184018.1A CN202110184018A CN113225254A CN 113225254 A CN113225254 A CN 113225254A CN 202110184018 A CN202110184018 A CN 202110184018A CN 113225254 A CN113225254 A CN 113225254A
- Authority
- CN
- China
- Prior art keywords
- transaction
- sub
- channel
- network
- node
- 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.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/38—Flow based routing
-
- 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/30—Payment architectures, schemes or protocols characterised by the use of specific devices or networks
- G06Q20/32—Payment architectures, schemes or protocols characterised by the use of specific devices or networks using wireless devices
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/14—Routing performance; Theoretical aspects
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- Accounting & Taxation (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention provides a method for balancing a route of a payment channel under a chain, wherein nodes in a payment channel network under the chain are divided into multi-level sub-areas step by step, each upper-level sub-area comprises a plurality of lower-level sub-areas, and each sub-area generates a routing table comprising all the nodes in the area, wherein the method comprises the following steps: responding to the demand of paying the transaction under the chain, inquiring a common upper-level subregion according to the subregion of the transaction sender and the subregion of the transaction receiver, and carrying out route balance in the upper-level subregion to obtain a transaction path. The invention divides the network into a hierarchical region structure according to the network topology structure, only the target hierarchical region needs to be found when the transaction is initiated, the query of the routing table is completed in a local range, the hierarchical strategy is favorable for the construction of the routing table, the channel unbalance phenomenon is obviously reduced by the influence of the channel balance factor, and the efficiency of the routing method is improved.
Description
Technical Field
The invention relates to the field of block chains, in particular to the technical field of channel under a block chain, and more particularly to the field of transaction routing of multi-hop payment of a network of channel under a chain payment, namely a method for balancing the routing of the channel under a chain payment.
Background
Since 2008, the bitcoin proposed by this wisdom appeared, the blockchain technology has rapidly developed in the last decade, which can effectively avoid the trust risk caused by centralization in the traditional internet and financial economy, and rapidly becomes a representative technology in the form of decentralized organization. In traditional transactions, fraud is inevitable because the basis of the transaction is derived from the trust of the user with the central node due to the centralized organizational architecture. However, in the decentralized application of the block chain, each node maintains a dedicated transaction record without the existence of centralized organization, thereby avoiding the trust crisis.
The application scene of the block chain technology is also shifted to more internet and financial economy fields from the original digital currency field. The trend of block chain application and research is raised domestically and internationally, and researchers in various countries hope to drive the block chain technology into more industries. However, as the block chain technology develops, more and more problems of developing the restricted block chain are revealed, wherein one of the most important reasons for developing the restricted block chain technology is the flux deficiency problem of the block chain.
In a blockchain system, the transaction processing rate is much slower than the centralized system architecture. The peak value of a typical centralized transaction processing system TPS can reach hundreds of thousands of transactions per second. Whereas a typical representation of the blockchain technique generates one block every 10 minutes, each block has an upper limit of 1 megabyte of transactions, which requires an average of 250 bytes of storage per bitcoin transaction, these limits mean that bitcoins only support 7 transactions per second, which is far from the processing speed of a practical transaction processing system.
In the blockchain system, it is also a serious problem that it is not friendly enough to micropayment transactions. The common identification node is prone to process high transaction fee transactions, and small transaction fees are low, and long time is often needed for on-chain confirmation. The over-long confirmation time on the chain cannot meet the requirements of high frequency and low delay of small transactions, and the possibility that the blockchain system becomes a daily transaction system is greatly reduced. Therefore, in order to better expand the application of the block chain technology, researchers have proposed various expansion schemes. The existing scheme mainly comprises three types of chain expansion, outer-chain expansion and 0 th-layer expansion:
in the 0 th layer of expansion, by changing the bottom layer of broadcast protocol, after comprehensively considering factors such as network flow conditions, connection and load conditions of each node, distances between the nodes and users, response time of the users and the like, links which hinder data transmission speed and stability are avoided as much as possible, the most efficient service nodes are distributed for the users, and further transaction flux is improved. However, the technical level has a certain uncertainty, and the lifting performance is not clear enough.
The on-chain expansion is mainly divided into block expansion and frequency expansion. The capacity expansion purpose is realized by fundamentally modifying partial parameters of a block chain by improving the capacity upper limit of a block or modifying the time interval generated by the block. The block expansion mainly comprises increasing the size of a block chain block, using a lightweight consensus method and the like; the frequency expansion mainly includes reducing the interval time of the blocks, and carrying out fragmentation on the transactions on the block chain. However, most of the on-chain capacity expansion schemes bring risks of reducing the safety of the main chain to a certain extent, and the modified protocols are generally quite complex and incomplete at present, so that the whole community cannot be easily accepted, and a great risk challenge is faced.
The under-chain expansion is mainly divided into an under-chain channel network and a side chain scheme, wherein the side chain refers to a chain parallel to the main chain, the chains can have own consensus mechanism and do not need to be the same as the consensus mechanism of the main chain, the side chains are not completely independent, and the side chains finally rely on the main chain for final settlement; the downlink channel networks are two-layer networks extending from a specific block chain system and mainly include a downlink general channel network and a downlink sub-channel network. Among them, the under-link payment channel network is representative of a lightning network, and the like. In the under-chain payment channel network, besides the establishment and the closing of the transaction channel and a few necessary on-chain interaction, main transaction operation does not need to be participated on the chain, and only needs to be carried out under the chain, thereby greatly improving the transaction speed. Meanwhile, the method is also very friendly to small-amount high-frequency transactions, and multiple transactions only need to spend once channel establishment.
The lightning network is proposed to solve the problem of expandability of the bitcoin network, and a hash time lock is used to perform safe and instantly-confirmed off-link transaction. The thunder grid network is one of the off-link capacity expansion schemes of the Ethernet workshop, the design principle is similar to that of a lightning network, and an intelligent contract brings convenience for the design of an off-link payment channel of the Ethernet workshop. Both the lightning network and the lightning network are online major networks, but the lightning network and the lightning network are faced with the problems of channel path discovery strategy lag and insufficient maintenance channel balance strategy, and the academic circles never stop the design and research of channel routing protocols, and provide various solutions, but still have some aspects capable of being improved. The method provides a method for quickly finding the route on the spanning tree, but if the topology is complex, the success rate of the transaction is reduced. The Rohrer team realizes a new routing method of the payment channel network, provides a capacity locking concept and improves the concurrency of the payment process. The CoinExpress method adds a series of limits such as waiting time, channel effective time, message generation time and the like on the basis of a network flow method, and further discusses how to solve the problem of transaction timeliness. The problems of concurrency and privacy existing in the lightning network are also researched, and two lightning network protocols Fulgor and Rayo are provided. At the heart of Fulgor and Rayo is a Multi-Hop hash time lock (Multi-Hop HTLC) that provides conditional payment functionality while reducing runtime and communication overhead. Fulgor is a privacy-certified lightning network payment protocol compatible with bitcoin scripting systems, and Fulgor is a blocking protocol, and therefore is as prone to concurrent payment deadlock problems as currently available lightning networks. In contrast, Rayo is the first non-blocking, mandatory protocol for lightning networks, and experiments in the literature show that only 5 seconds are required for a payment channel through 10 intermediary users, thus demonstrating the feasibility of both protocols. Some researchers have studied methods for anonymity of payment channels in lightning networks, which proposed methods reduce the load of the payment network while ensuring security, privacy and immediacy.
The above-mentioned prior art channel routing solutions are all focused, but still have some problems to be solved, which mainly include the following aspects:
the scale of the existing under-chain pay-channel network is not large and a plurality of global routing modes are adopted, so that most of nodes need to be searched on a global routing table in the routing process, relatively large expenditure is brought, the problems of low routing efficiency and the like are brought, and the further expansion of the network is not favorable. If the scale of the sub-link payment channel network is further enlarged, most routing methods have poor adaptability and the efficiency is obviously reduced.
In the routing process, the problem of channel imbalance can bring about the reduction of routing efficiency. Most of the existing routing methods do not reasonably allocate the transferred fund yield on each path according to a plurality of paths, so that the fund allocation difference on two sides of the channels of part of the channels is overlarge, the originally generated bidirectional channel is degraded into a unidirectional channel, and the condition is called channel imbalance. And the routing ability that the one-way channel can provide mostly is limited for the routing condition of whole network needs to spend more hops and expense, has increased the load of network and has reduced the holistic flux of network, makes the trade promotion obvious inadequately under the chain payment channel network compare with on the chain.
Clogging of the channel can result in a reduction in the time the channel is used to provide routing. The routing efficiency is reduced due to the blockage of the channel, so that owners of two sides of the channel are more inclined to close the channel in advance and return funds in the channel to a chain for circulation. The problem that the channel of the network changes too frequently, the topological structure changes rapidly and the like can be caused by closing the channel in advance, the routing difficulty is further increased, and the cost of the routing method is increased.
Disclosure of Invention
Therefore, an object of the present invention is to overcome the above-mentioned drawbacks of the prior art, and to provide a method for balancing a route of a payment tunnel under a chain, wherein nodes in a payment tunnel under a chain are divided into multiple sub-areas step by step, each sub-area at a higher level contains multiple sub-areas at a lower level, and each sub-area generates a routing table containing all nodes in the sub-area, the method comprising: responding to the demand of paying the transaction under the chain, inquiring a common upper-level subregion according to the subregion of the transaction sender and the subregion of the transaction receiver, and carrying out route balance in the upper-level subregion to obtain a transaction path.
Preferably, the nodes in the under-chain pay channel network are divided into multi-stage sub-regions step by step in the following manner: h1, reading all network nodes, topological structures and all channel capacities in the sub-chain payment channels to be divided, and randomly generating a different label for each node; h2, traversing each node, counting the channel capacity sum corresponding to each type of label in the neighbor set of each node, and replacing the label of the current node into a label with the maximum channel capacity sum corresponding to the neighbor set; h3, dividing the nodes with the same label into the same subarea, and generating a routing table containing all the nodes in each subarea. In some embodiments of the invention, the method further comprises: and H4, taking the sub-areas with the number of nodes in the area larger than a preset intra-domain node threshold value and the network diameter of the intra-domain network topology larger than a preset network diameter threshold value as new sub-link paying channels needing to be divided, so as to further divide the sub-areas into a plurality of sub-areas of the next level until the number of nodes in the sub-area of the last level is smaller than or equal to the intra-domain node threshold value or the network diameter of the intra-domain network topology is smaller than or equal to a preset network diameter threshold value. Preferably, the intra-domain node threshold and the network diameter threshold are set by integrating the network condition and the communication overhead of the system before the block chain system opens the downlink channel on the chain.
Preferably, based on the partition condition of the sub-regions, a hierarchical region structure table is generated for saving the condition that the nodes are located in each hierarchical region, and each sub-region has an independent number.
Preferably, in the case that the transaction sender and the transaction receiver are located in sub-areas of the same hierarchy, intra-area route balancing is performed as follows: x1, the transaction sender sends a transaction request to the transaction receiver; x2, initializing a residual error network into a network channel condition in a sub-area where a transaction sender and a transaction receiver are located; x3, finding an extension path from a sender to a receiver in a residual error network; x4, updating a residual error network, and subtracting the network flow of the extended path found in the step X3 from the residual error network; x5, when the sum of the current expanded paths exceeds the transaction amount multiplied by the expansion factor or no more expanded paths can be found, distributing transaction flow of each expanded path to calculate the sum of channel balance factors, wherein the flow on each expanded path is the upper limit of the capacity of the congested path; when the sum of the current expansion paths is less than the transaction amount multiplied by the expansion factor or more expansion paths can be found, continuously finding an expansion path from the sender to the receiver in the residual error network; x6, readjusting the transaction flow on each expansion path, so that the sum of channel balance factors of the whole transaction is relatively minimum after the transaction flow is redistributed; and X7, taking the adjusted money on each extended path as a final route balancing result delivery chain and sequentially executing the transaction by the lower payment channel network.
In some embodiments of the present invention, an extended path from a sender to a receiver is found in a residual network using a dijkstra method and a greedy strategy, and a linear programming is used to adjust transaction traffic on each extended path.
Preferably, in the case that the transaction sender and the transaction receiver are not located in sub-areas of the same hierarchy, inter-domain route balancing is performed as follows: y1, the transaction sender sends a transaction request to the transaction receiver; y2, the transaction sender sends the transaction request to a higher level area containing the sub-area where the transaction sender is located step by step until the first higher level area can contain the transaction sender and the transaction receiver at the same time; y3, abstracting subordinate sub-regions of the high-level regions into nodes, wherein all channels between the regions are integral channels, and generating a virtual channel network; y4, performing intra-domain route balancing in the high-level region, and splitting the transaction requirement into inter-domain transactions among a plurality of lower-level sub-regions; y5, adjusting the inter-domain transaction flow of each transaction by using a linear plan to enable the sum of inter-domain channel balance factors to be relatively minimum; y6, regarding the lower sub-area, performing intra-area transaction route balancing in the sub-area by using the input of inter-area traffic transaction in the area as a transaction initiator and the output of inter-area traffic transaction as a transaction receiver.
In some embodiments of the invention, the channel balance factor is calculated by:
Compared with the prior art, the invention has the advantages that: the invention divides the network into a hierarchical region structure according to the network topology structure, only needs to find the target hierarchical region when the transaction is initiated, completes the query of the routing table in a local range, and the hierarchical strategy is favorable for the construction of the routing table, and the channel unbalance phenomenon is obviously reduced by the influence of the channel balance factor, thereby improving the efficiency of the routing method.
Drawings
Embodiments of the invention are further described below with reference to the accompanying drawings, in which:
FIG. 1 is a diagram illustrating a structure of dividing sub-regions of a downlink channel according to an embodiment of the present invention;
FIG. 2 is a flow chart diagram illustrating a single sub-region partition according to an embodiment of the present invention;
FIG. 3 is a schematic diagram of a layer-by-layer hierarchical region structure according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of an intra-domain route balancing process according to an embodiment of the present invention;
fig. 5 is a schematic diagram of an inter-domain route balancing process according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is further described in detail by the following embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The inventor finds that reasonably solving the reasonable matching of a plurality of routes in the route and balancing the network channels of the sub-link payment channels is a method for improving the routing efficiency of the sub-link payment channels. In the existing channel balancing technology, for example, path optimization research is performed in a multi-hop payment process in a lightning network, one-time overall channel balancing is adopted in the network operation process, and a linear planning method is used for balancing the payment balance among multiple channels of nodes, so that the payment efficiency is improved, and the payment cost is reduced. The balance mode of the method belongs to channel balance after the execution of the routing protocol, namely the routing method adjusts the channel with problems after the execution of the routing method is finished, and the channel needing to be adjusted needs to be locked in advance during the adjustment of the method, so that the routing time provided by the channel is reduced to a certain extent, and the method is not flexible and convenient.
Therefore, the invention provides a hierarchical regional routing method with balanced channels aiming at solving the problems of the routing method of the downlink channel network in the prior art, combines the technical advantages of the downlink channel network of the block chain and the traditional internet hierarchy, and solves the problems existing at present. In the framework of the invention, a network layering and zoning model is adopted, a single transaction address of a node is converted into an address of each layering zone, and an original routing table which only uses the global is converted into a routing table result which corresponds to each layering. In the transaction process, the hierarchical region where the destination address is located can be selected step by step, the corresponding routing table is inquired step by step to select the routing path, the large-scale network structure is effectively adapted, and meanwhile, the cost of a large number of methods is saved. The method can dynamically adjust the network balance in real time in the under-chain payment channel transaction processing process according to the current unbalance condition of the area, so that the under-chain channel network does not have large-scale unbalance, the routing efficiency is improved, and the robustness of the network is ensured. The invention aims to solve the problem of channel balance in a trade channel network under a chain and the problem of network scale expansion, and provides a hierarchical regional routing balance method which can be used for self-adaptive channel balance and is suitable for a large-scale network on the basis of a block chain architecture and a core protocol of a pay channel network under the chain. The method can perform dynamic balance when the routing method is executed, integrally relieves the network imbalance condition, and improves the channel survival time and the routing efficiency. The structure of the same time-division layer and area enables the transaction to be locally carried out, and routing expenditure is saved.
As can be seen from the above research and analysis on the prior art, the channel imbalance problem of the current sub-link pay-per-channel network has become one of the bottlenecks of the routing method. Meanwhile, in order to ensure that the under-chain payment channel network has wider application, most of the under-chain payment channel networks need to be adapted to larger-scale networks, and the larger-scale networks mean more difficult channel balance adjustment, and most of the existing methods have an unsatisfactory effect on solving the problem of channel imbalance of the larger-scale networks. The invention provides a routing scheme of a multi-level regional chain lower payment channel network, which is mainly suitable for a chain lower payment channel network with large network scale, serious channel unbalance phenomenon and relatively complex topology among nodes. The scheme itself includes three parts, namely, network hierarchy division, intra-domain route balancing and inter-domain route balancing, and each part is described in detail below.
(1) Hierarchical region partitioning
The invention divides the whole sub-chain sub-payment channel network into a plurality of new sub-areas according to the topological structure of the network and the capacity of the network channel. And then, continuously dividing a new secondary sub-area for each sub-area until the network diameter of the sub-area is smaller than a preset network diameter threshold or the number of nodes in the area is lower than a preset network node threshold, and finally forming a hierarchical area structure. Higher level areas in the hierarchical area structure contain lower level areas, with higher level areas meaning more nodes. Wherein the network diameter is defined as the longest distance between any two nodes in the current topology network.
According to an example of the present invention, as shown in fig. 1, after a sub-chain pay-channel network having 10 nodes (node 1, node 2, node 3 …, and node 10, respectively) is divided into a region level, a primary level includes 3 secondary level sub-regions, which are respectively a secondary level sub-region 1 (including node 1, node 2, and node 3), a secondary level sub-region 2 (including node 4 and node 5), and a secondary level sub-region 3 (including node 6, node 7, node 8, node 9, and node 10). The secondary-level sub-region 3 includes 2 tertiary-level sub-regions, namely a tertiary-level sub-region 1 (including a node 6, a node 7, and a node 8) and a tertiary-level sub-region 2 (including a node 9 and a node 10). Each sub-region generates a routing table containing all nodes in the sub-region, for example, the primary level generates a routing table containing all nodes (node 1, node 2, node 3 …, node 10) in the region, the secondary level sub-region 3 generates a routing table containing node 6, node 7, node 8, node 9, node 10, and so on, and each sub-region generates a routing table containing all nodes in the sub-region.
The main purpose of generating the hierarchical regional structure is to enable the routing method to be executed without calculating on the global payment channel network, and only an area enough containing nodes of a transaction sender and a transaction receiver needs to be selected, so that the network flow routing method is completed in the area. Compared with the traditional full-local routing method mode, the hierarchical region structure only needs to execute the query of the routing table in the local region, which is beneficial to saving the calculation cost, accelerating the routing and improving the routing efficiency. The routing table in the local area is constructed during the hierarchical area division, and is only used for describing the network topology structure in the current local hierarchical area. The channel balance is realized in the hierarchical region structure only by balancing in the sub-regions of the sender and the receiver related to the transaction each time, the balance cost is low, and the balance speed is high. The hierarchical region can defend the detection and attack of nodes of other sub-regions to the transaction to a great extent, protect the privacy of the transaction in a certain program, and prevent the attack of malicious nodes to the transaction.
The method for generating the regional hierarchical structure comprises two parts of dividing sub-regions and generating the hierarchical regional structure layer by layer according to the sub-regions:
the sub-region division is a method based on label propagation, each division divides the current region into a batch of sub-regions with high internal correlation degree, and then the sub-regions are divided into new secondary regions according to the sub-regions, so as to generate a hierarchical region structure. According to an embodiment of the present invention, the internal correlation indicates that the channel capacity inside the area is larger than the channel capacity between the areas, and the larger the difference between the two values is, the higher the internal correlation is. The input to the network is the initial weighted graph G ═ V, E, C, where V is the nodes of the graph, E is all the edges of the graph, and C is the capacity corresponding to the edges. All nodes are initialized, and labels are initialized for each node, so that the labels of each node are completely different from one another at first. And then, starting iteration, wherein in each iteration, each node counts the sum of the channel capacity contained in each label in the neighbor node set N (x), and then updates the label of the node into the label with the maximum sum of the accumulated channel capacity in the neighbor node set N (x). If the channel capacities of a plurality of labels are as much as the sum, one label is randomly selected from the plurality of labels, and the original label is replaced by the label. And continuing the iteration until the number of the labels in the network is less than a preset network node threshold value or the network diameter of the topological network among the label nodes is reduced to be less than or equal to half of the original diameter, putting the nodes represented by the same label into the same sub-area to form a plurality of sub-areas, wherein the relationship among the sub-areas is in the same level.
According to an embodiment of the present invention, as shown in fig. 2, for a single sub-region partition in a downlink channel network, the method includes the following steps:
d1, reading the network nodes of the down-link channels to be divided, the topological structure and all the channel capacities, and randomly generating a different label for each node;
d2, circularly traversing each node, and counting the sum of the channel capacity corresponding to each type of label in each node neighbor set;
d3, replacing the label of the node itself into one with the largest sum of the channel capacities corresponding to the labels in the neighbor set, and randomly selecting one if the labels with the largest sum of the channel capacities appear at the same time;
d4, regarding the nodes with the same label as the same sub-region, wherein the channel capacity between different sub-regions is the sum of the channel capacities between the nodes of the region;
d5, if the number of the labels in the network is less than the preset network node threshold value or the network diameter of the topological network among the label nodes is reduced to be less than or equal to half of the original network diameter, outputting the generated subregion set, otherwise, repeating the step D2.
The generation of the hierarchical region structure from sub-regions layer by layer is to further divide the larger sub-regions into finer sub-regions. Firstly, a sub-domain dividing method is used for dividing the sub-chain payment channel network into a plurality of sub-domain networks which are positioned in a first level. And repeatedly calling a sub-region network dividing method for the sub-regions with the number of nodes in the region higher than the threshold value of the regional network nodes and the network diameter of the network topology larger than the minimum topology network diameter, and dividing the sub-regions of the primary level into a plurality of sub-regions of the secondary level. And sequentially and recursively invoking to generate the hierarchical region structure until all the lowest-layer sub-regions at least need to meet the condition that the number of nodes in the domain is lower than a preset network node threshold or the network diameter of the network topology in the domain is lower than a preset network diameter threshold. The network node threshold and the network diameter threshold are typically specified as a fixed value by the system integration of the downlink network conditions, traffic overhead, etc. before the downlink channel is opened up on the link.
According to an embodiment of the present invention, as shown in fig. 3, the step of generating the hierarchical region structure from the sub-regions layer by layer includes the following steps:
z1, initiating a request on the chain to acquire the channel topology information of the payment channel network under the current chain;
z2, calling a single sub-region division method to divide the global under-link pay channel network, wherein the single division is performed after all nodes in the network are initialized to be allocated with labels;
z3, checking whether all current lowest level sub-areas meet the condition that the number of nodes in the domain is lower than a preset network node threshold or the network diameter of the network topology in the domain is lower than a preset network diameter threshold;
z4, calling a sub-region not meeting the requirement to a single sub-region dividing method, generating a new layer and dividing a new sub-region, and only performing single division after re-initializing an allocation label on the node in the selected sub-region not meeting the requirement;
z5, generating a hierarchical region structure table according to the sub-region generation process, and storing the condition that the node is in each hierarchical region;
and Z6, the node acquires the sub-region number of the node and the higher-level region number containing the node according to the hierarchical region structure table.
(2) Intra-domain route balancing
The intra-domain route balancing part is mainly used for solving the problem that the transaction sender and the transaction receiver are in the same hierarchical sub-domain, and the intra-domain processing balance is realized in the transaction routing process, so that the channels in the sub-domain are not obviously unbalanced.
According to one embodiment of the invention, intra-domain route balancing seeks a policy for taking network flow routes. For the nodes in the sub-regions to send out transaction requests, firstly, a sender confirms that a receiver is positioned in the same sub-region, and an intra-domain balanced routing strategy is started. According to one embodiment of the invention, the intra-domain route balancing strategy initializes the residual network to an initial network capacity state. The residual error network refers to the capacity remaining in each channel in the remaining network after the capacity of the found routing path is removed in the current network, and can be generally used for recording the intermediate state of finding multiple paths in the routing process. The intra-domain balanced routing strategy uses a dijkstra method and a greedy strategy to find an extended path from a sender to a receiver, and then subtracts the transaction flow of the extended path in a residual network until a new extended path cannot be found or the transaction flow which can be loaded by the currently found extended path exceeds the amount required by the current transaction request and is multiplied by an extension factor gamma, wherein the extension factor is generally larger than 1. The Dijkstra method is a typical shortest path method for calculating the shortest path from one node to other nodes, and is mainly characterized in that the method is expanded to the outer layer by taking a starting point as the center and utilizing the breadth-first search idea until the shortest path is expanded to a terminal point. The greedy strategy of the invention means that after the shortest path is found by a dijkstra method, the transaction flow of the expanded path is firstly preliminarily calculated as the maximum value which can be accommodated by the current path until a channel on the path is possibly exhausted, and then the transaction amount on the path is redistributed by a channel balance method so that the total sum of the channel balance factors of the whole current transaction is minimum, thereby ensuring the channel balance in the subarea. And finally, calling a transaction execution mechanism of the down-link payment channel to complete the transaction execution of the transaction amount on each extended path. According to one embodiment of the invention, the channel balance strategy is to allocate the amount of money required to be traded on each found extension path according to a linear planning mode, so that the channel balance factor in the sub-area network is integrally minimized.
According to one embodiment of the invention, the channel balance factor is defined as: at time t, the multi-hop off-link transaction with amount v needs to pass through the neighbor node { a ] by the node Ai|ai∈SAGet it to the destination node, SAIs a set of the reachable destination nodes in the neighbor nodes of A according to the slave node A and the neighbor ai(ai∈SA) Between the channels
Establishing A direction a to t timeiTotal amount of funds transferred
aiTotal amount of funds transferred to A
At time t the channel
Middle A node balance
The payment channel at time t is obtained by
The channel balance factor of (a) is:
for each path L ═ L through inter-domain routing1,l2,……,lmAmount of money to be allocated for payment, LiIs assigned to r on the path ofiAccording to the allocated payment sum set R-R1,……,rmObtaining the final flow of the payment channel, wherein the distributed payment sum set R ═ R1,……,rmThe optimal solution is obtained by resolving the following linear program:
and the target optimization function of the function is that the sum of the channel balance factors of each payment channel on each payment path is minimum, namely the result of optimization. m is the total number of paths found by intra-domain balanced routing, liFor the ith payment path found, ekiIs the k-th transaction lane on the ith payment path,
is in the channel ekiChannel balance factor of (1), riIs the transaction amount allocated on the ith payment path, b is the total amount of the current transaction,
is the channel capacity upper limit of the k transaction channel on the ith payment path.
The intra-domain route balancing method can better balance the route distribution among all the channels through the route balancing, and can better avoid the current situation that some channels are frequently found and are easy to block due to being in some key routes in a graph structure, so that the subsequent routes cannot be continuously searched, thereby solving a series of problems of route efficiency reduction and the like caused by channel unbalance.
According to one embodiment of the present invention, as shown in fig. 4, intra-domain route balancing includes the following steps:
n1, the transaction sender initiates a transaction request, and checks if the receiver is located in the same hierarchical sub-area,
n2, initializing a residual error network to be a network channel condition in the current subregion for the transaction of the transaction sender and the transaction receiver in the same hierarchy subregion;
n3, finding an extension path from a sender to a receiver in the residual error network by using a Dijkstra method and a greedy strategy;
n4, updating a residual error network, and subtracting the network flow of the extended path in the step N3 from the residual error network;
n5, judging whether the sum of the current expansion path set exceeds the transaction amount multiplied by the expansion factor or not or cannot find more expansion paths, if so, turning to a step N6, and if not, executing a step N3;
n6, distributing each expansion path transaction flow to calculate the sum of channel balance factors, and adopting a primary distribution scheme that the flow on each expansion path is the upper limit of the capacity of a congestion channel;
n7, readjusting the transaction flow on each expansion path by using a linear programming mode, so that the sum of channel balance factors of the whole transaction is minimum after the transaction flow is redistributed;
and N8, taking the adjusted money on each extended path as a final routing result delivery chain and sequentially executing the transaction by the lower payment channel network.
(3) Inter-domain route balancing
If the sender and receiver looking for the transaction route do not belong to the same sub-area, then an inter-domain route balancing method needs to be used.
In the inter-domain balanced routing method, when a sender cannot find a receiver in the same sub-region, a transaction request is sent to a higher-level region containing the sub-region of the sender step by step, and the higher-level region searches whether a receiver node is in the higher-level region. The inter-domain balanced routing method begins until the first high-level region is searched that can contain both sender and receiver nodes. In the high-level region, each sub-region under the region is regarded as a node, the sub-region containing the inflow transaction amount is regarded as a sender node of funds, the sub-region containing the outflow transaction amount is regarded as a receiver node of the funds, and all paths between two different sub-regions are regarded as an integral channel. And (3) regarding the network generated by the conversion of the secondary sub-areas of the high-level area as a network which can be used for routing transaction in the domain, calling a routing balance method in the domain, minimizing the whole channel balance factor between the areas by using linear programming, and determining the transaction amount flow direction between the secondary sub-areas. And then, the transaction amount flow between the secondary sub-areas is taken as a new small transaction and sequentially sent to the secondary sub-areas, and the secondary sub-areas are divided into a plurality of secondary transactions again by using an inter-domain balanced routing strategy until the transactions are completely divided into bottom layer transactions which can finish fine account transfer between the nodes. It should be noted that the split secondary transaction only contains inter-domain transaction information from one domain to another, and cannot be directly approved by the under-link payment gateway network to directly transact on the gateway.
The inter-domain routing method is mainly characterized in that the routing search at a higher level does not directly search for a channel which is accurate to a certain level, but firstly roughly searches for the network traffic among the regions and accurately searches in the next layer region. The method has the advantages that on one hand, security guarantee is provided, and attacks of malicious nodes outside the area on the routing path can be effectively prevented. The flow rate of the upper region to the specific channels of the lower region is unknown, and the specific flow control and channel selection are still taken charge of by the lower region. On the other hand, when the nodes of the hierarchical region are divided, the internal node division condition and the subsequent channel condition change of the lower region in the upper region are not known. The direct selection of a particular transaction channel by the upper layer may carry a greater risk of hop count. The separation strategy also ensures that the interior of the region can be recombined at proper time, and the region is re-divided according to a proper region dividing method, so that the characteristics of complex change of the channel network under the chain are adapted.
According to one embodiment of the present invention, as shown in fig. 5, the inter-domain route balancing comprises the following steps:
j1, the sender initiates a transaction request and determines that the sender and the receiver are not in the same layer area;
j2, the sender sends the transaction request to the higher level area containing its own sub-area step by step until the first higher level area containing both sender and receiver nodes;
j3, abstracting the sub-area of the high-level area as a node, and generating a virtual area channel network by taking all channels between the areas as integral channels.
J4, calculating the routing path and transaction flow of the virtual area channel network by using an intra-domain routing balance method, and dividing an actual transaction into a plurality of inter-domain transactions;
j5, adjusting inter-domain transaction flow on each pen by using linear programming to minimize the sum of inter-domain channel balance factors;
j6, in the sub-area, the input of the inter-area traffic transaction is used as an inter-area transaction initiator, the output of the traffic transaction is used as a transaction receiver, and the intra-area route balancing method is used for calculating the route path and the transaction traffic in the sub-area;
j7, if the sub-region still has lower level, taking the sub-region as a high-level region to repeatedly call an inter-domain routing balance method, and further splitting inter-domain transaction;
j8, determine whether all the split transactions have successfully found a suitable path, that is, whether the current channel capacity in the path can support the completion of the split transactions, and there may be a case that no suitable transaction path can be found in a partial local area.
J9, if no suitable path is found, the routing fails, after a suitable path is found, all the split inter-domain paths are integrated into a complete routing path, and the transaction is executed in sequence by the delivery chain lower payment channel network.
The invention provides a hierarchical regional routing balancing method comprehensively considering channel balance and large-scale network expansion, aiming at the problems that related researches are mainly concentrated in solutions of a side chain, a downlink channel network and the like in a current mainstream block chain downlink expansion scheme, and the existing downlink channel network project is generally low in routing protocol efficiency and lacks of a comprehensive scheme for channel balance and large-scale network expansion. The invention divides the network into a hierarchical region structure according to the network topology structure, only needs to find the target hierarchical region when the transaction is initiated, completes the query of the routing table in a local range, and the hierarchical strategy is beneficial to the construction of the routing table, and the channel unbalance phenomenon is obviously reduced by the influence of the channel balance factor, thereby improving the efficiency of the routing method.
It should be noted that, although the steps are described in a specific order, it is not meant that the steps must be executed in the specific order, and in fact, some of the steps may be executed concurrently or even in a different order as long as the required functions are achieved.
The present invention may be a system, method and/or computer program product. The computer program product may comprise a computer readable storage medium having computer readable program instructions embodied therewith for causing a processor to implement various aspects of the present invention.
The computer readable storage medium may be a tangible device that retains and stores instructions for use by an instruction execution device. The computer readable storage medium may include, for example, but is not limited to, an electronic memory device, a magnetic memory device, an optical memory device, an electromagnetic memory device, a semiconductor memory device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), a Static Random Access Memory (SRAM), a portable compact disc read-only memory (CD-ROM), a Digital Versatile Disc (DVD), a memory stick, a floppy disk, a mechanical coding device, such as punch cards or in-groove projection structures having instructions stored thereon, and any suitable combination of the foregoing.
Having described embodiments of the present invention, the foregoing description is intended to be exemplary, not exhaustive, and not limited to the embodiments disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the described embodiments. The terminology used herein is chosen in order to best explain the principles of the embodiments, the practical application, or improvements made to the technology in the marketplace, or to enable others of ordinary skill in the art to understand the embodiments disclosed herein.
Claims (12)
1. A method for balancing routing of a payment channel under a chain, wherein nodes in a payment channel network under the chain are divided into multi-level sub-areas step by step, each upper-level sub-area comprises a plurality of lower-level sub-areas, and each sub-area generates a routing table comprising all nodes in the area, the method comprising:
responding to the demand of paying the transaction under the chain, inquiring a common upper-level subregion according to the subregion of the transaction sender and the subregion of the transaction receiver, and carrying out route balance in the upper-level subregion to obtain a transaction path.
2. The method according to claim 1, wherein the nodes in the sub-chain pay channel network are divided into multiple sub-regions in a stepwise manner as follows:
h1, reading all network nodes, topological structures and all channel capacities in the sub-chain payment channels to be divided, and randomly generating a different label for each node;
h2, traversing each node, counting the channel capacity sum corresponding to each type of label in the neighbor set of each node, and replacing the label of the current node into a label with the maximum channel capacity sum corresponding to the neighbor set;
h3, dividing nodes with the same label into the same sub-area, and generating a routing table containing all the nodes in the area by each sub-area.
3. The method for balancing offline paid channel routing according to claim 2, further comprising:
and H4, taking the sub-regions of which the number of nodes in the region is greater than a preset intra-domain node threshold and the network diameter of the intra-domain network topology is greater than a preset network diameter threshold as new sub-link paying channels needing to be divided, so as to further divide the sub-regions into a plurality of sub-regions of the next level until the number of nodes in the sub-region of the last level is less than or equal to the intra-domain node threshold or the network diameter of the intra-domain network topology is less than or equal to a preset network diameter threshold.
4. The method as claimed in claim 3, wherein the intra-domain node threshold and the network diameter threshold are set by combining the network conditions and the communication overhead of the system before the blockchain system opens the downlink channel on the chain.
5. The method for balancing offline paid channel routing according to claim 4, further comprising:
and generating a hierarchical region structure table based on the division condition of the sub-regions, wherein the hierarchical region structure table is used for storing the condition that the nodes are positioned in each hierarchical region, and each sub-region has an independent number.
6. The method according to claim 5, wherein, when the transaction sender and the transaction receiver are located in the same hierarchical sub-area, intra-domain route balancing is performed as follows:
x1, the transaction sender initiates a transaction request to the transaction receiver;
x2, initializing a residual error network into a network channel condition in a subregion where a transaction sender and a transaction receiver are located;
x3, finding an extension path from a sender to a receiver in a residual error network;
x4, updating a residual error network, and subtracting the network flow of the extended path found in the step X3 from the residual error network;
x5, when the sum of the current aggregate expanded paths exceeds the transaction amount multiplied by the expansion factor or no more expanded paths can be found, distributing transaction flow of each expanded path to calculate the sum of channel balance factors, wherein the flow on each expanded path is the upper limit of the capacity of the congested channel; when the sum of the current expansion paths is less than the transaction amount multiplied by the expansion factor or more expansion paths can be found, continuously finding out an expansion path from the sender to the receiver in the residual error network;
x6, readjusting the transaction flow on each expansion path, so that the sum of channel balance factors of the whole transaction is relatively minimum after the transaction flow is redistributed;
and X7, taking the adjusted money on each extended path as a final route balancing result delivery chain and sequentially executing the transaction by the lower payment channel network.
7. The method of claim 6, wherein the extended path from the sender to the receiver is found in a residual network using dijkstra's method and greedy strategy.
8. The method of claim 6, wherein linear programming is used to adjust the transaction traffic on each extended path.
9. The method according to claim 8, wherein when the transaction sender and the transaction receiver are not located in the same hierarchical sub-area, inter-domain route balancing is performed as follows:
y1, the transaction sender sends a transaction request to the transaction receiver;
y2, the transaction sender sends the transaction request to a higher level area containing the sub-area where the transaction sender is located step by step until the first higher level area can contain the transaction sender and the transaction receiver at the same time;
y3, abstracting subordinate sub-regions of the high-level regions into nodes, wherein all channels between the regions are integral channels, and generating a virtual channel network;
y4, performing intra-domain route balancing in the high-level region, and splitting the transaction requirement into inter-domain transactions among a plurality of lower-level sub-regions;
y5, adjusting the inter-domain transaction flow of each transaction by using linear programming to enable the sum of inter-domain channel balance factors to be relatively minimum;
y6, regarding the next sub-area, performing intra-area transaction route balancing in the sub-area by using the input of the inter-area traffic transaction in the sub-area as the transaction initiator and the output of the inter-area traffic transaction as the transaction receiver.
10. The method of claim 9, wherein the channel balancing factor is calculated as follows:
11. A computer-readable storage medium, having embodied thereon a computer program, the computer program being executable by a processor to perform the steps of the method of any one of claims 1 to 10.
12. An electronic device, comprising:
one or more processors;
storage means for storing one or more programs which, when executed by the one or more processors, cause the electronic device to carry out the steps of the method according to any one of claims 1 to 10.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110184018.1A CN113225254B (en) | 2021-02-10 | 2021-02-10 | Under-chain payment channel route balancing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110184018.1A CN113225254B (en) | 2021-02-10 | 2021-02-10 | Under-chain payment channel route balancing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN113225254A true CN113225254A (en) | 2021-08-06 |
| CN113225254B CN113225254B (en) | 2022-04-22 |
Family
ID=77084862
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110184018.1A Active CN113225254B (en) | 2021-02-10 | 2021-02-10 | Under-chain payment channel route balancing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113225254B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113923015A (en) * | 2021-10-08 | 2022-01-11 | 浙江大学 | Anonymous multi-hop data transmission method based on block chain payment channel |
| CN114938379A (en) * | 2022-05-19 | 2022-08-23 | 中山大学 | Optimal under-link channel network routing method based on minimum cost flow |
| US20230252429A1 (en) * | 2022-02-07 | 2023-08-10 | Fujitsu Limited | Management device, management method, and computer-readable recording medium storing management program |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100110932A1 (en) * | 2008-10-31 | 2010-05-06 | Intergence Optimisation Limited | Network optimisation systems |
| CN103220216A (en) * | 2013-04-22 | 2013-07-24 | 南京邮电大学 | Wireless body area network routing method based on region division |
| EP3377859A1 (en) * | 2016-02-22 | 2018-09-26 | Siemens Aktiengesellschaft | Method and device for providing recorded anonymized routes |
| CN110113171A (en) * | 2019-04-22 | 2019-08-09 | 武汉大学 | A kind of data management system and method based on layering multiple domain block chain network |
| CN110223055A (en) * | 2019-05-05 | 2019-09-10 | 中山大学 | A kind of routing resource of block chain payment channel network |
| CN111429120A (en) * | 2020-03-27 | 2020-07-17 | 武汉大学 | Block chain payment channel network multi-path routing method based on genetic algorithm |
| CN111510309A (en) * | 2020-04-08 | 2020-08-07 | 深圳大学 | Block chain data transmission method, device, equipment and computer readable storage medium |
| CN112200558A (en) * | 2020-10-20 | 2021-01-08 | 焦点科技股份有限公司 | Rule weight-based distributed payment routing method and system |
| CN112258171A (en) * | 2020-09-21 | 2021-01-22 | 西安电子科技大学 | Block chain-based under-chain payment center routing method, system, medium and equipment |
-
2021
- 2021-02-10 CN CN202110184018.1A patent/CN113225254B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100110932A1 (en) * | 2008-10-31 | 2010-05-06 | Intergence Optimisation Limited | Network optimisation systems |
| CN103220216A (en) * | 2013-04-22 | 2013-07-24 | 南京邮电大学 | Wireless body area network routing method based on region division |
| EP3377859A1 (en) * | 2016-02-22 | 2018-09-26 | Siemens Aktiengesellschaft | Method and device for providing recorded anonymized routes |
| CN110113171A (en) * | 2019-04-22 | 2019-08-09 | 武汉大学 | A kind of data management system and method based on layering multiple domain block chain network |
| CN110223055A (en) * | 2019-05-05 | 2019-09-10 | 中山大学 | A kind of routing resource of block chain payment channel network |
| CN111429120A (en) * | 2020-03-27 | 2020-07-17 | 武汉大学 | Block chain payment channel network multi-path routing method based on genetic algorithm |
| CN111510309A (en) * | 2020-04-08 | 2020-08-07 | 深圳大学 | Block chain data transmission method, device, equipment and computer readable storage medium |
| CN112258171A (en) * | 2020-09-21 | 2021-01-22 | 西安电子科技大学 | Block chain-based under-chain payment center routing method, system, medium and equipment |
| CN112200558A (en) * | 2020-10-20 | 2021-01-08 | 焦点科技股份有限公司 | Rule weight-based distributed payment routing method and system |
Non-Patent Citations (2)
| Title |
|---|
| HICHAM ZAARAOUI等: "《A novel approach to face recognition using freeman chain code and nearest neighbor classifier》", 《IEEE》 * |
| 于雷: "《区块链全局账本数据的拆分技术研究》", 《高技术通讯》 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113923015A (en) * | 2021-10-08 | 2022-01-11 | 浙江大学 | Anonymous multi-hop data transmission method based on block chain payment channel |
| CN113923015B (en) * | 2021-10-08 | 2023-02-24 | 浙江大学 | Anonymous multi-hop data transmission method based on block chain payment channel |
| US20230252429A1 (en) * | 2022-02-07 | 2023-08-10 | Fujitsu Limited | Management device, management method, and computer-readable recording medium storing management program |
| CN114938379A (en) * | 2022-05-19 | 2022-08-23 | 中山大学 | Optimal under-link channel network routing method based on minimum cost flow |
| CN114938379B (en) * | 2022-05-19 | 2023-10-20 | 中山大学 | Optimal link down channel network routing method based on minimum cost flow |
Also Published As
| Publication number | Publication date |
|---|---|
| CN113225254B (en) | 2022-04-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN113225254B (en) | Under-chain payment channel route balancing method | |
| Di Stasi et al. | Routing payments on the lightning network | |
| CN108260169B (en) | QoS guarantee-based dynamic service function chain deployment method | |
| CN105262681B (en) | Distributed routing framework | |
| US5519836A (en) | Method of on-line permanent virtual circuit routing | |
| JP2023011876A (en) | Probabilistic relay for efficient propagation in block chain network | |
| CN107332913A (en) | A kind of Optimization deployment method of service function chain in 5G mobile networks | |
| EP1757026B1 (en) | Method and apparatus for forwarding data in a data communications network | |
| CN108881207B (en) | Network security service realization method based on security service chain | |
| CN114090244B (en) | Service arrangement method, device, system and storage medium | |
| CN112189328A (en) | System and method for propagating data packets in a network of nodes | |
| CN111865800B (en) | Routing frequency spectrum allocation method and device suitable for elastic optical network | |
| CN110992177B (en) | Block chain flux improving method and system based on out-of-chain channel route evaluation mechanism | |
| CN107147530B (en) | Virtual network reconfiguration method based on resource conservation | |
| CN105827528A (en) | Routing method suitable for frequency spectrum-flexible optical network | |
| CN114978908A (en) | Computing power network node evaluation and operation method and device | |
| CN105357124B (en) | A kind of MapReduce bandwidth optimization methods | |
| Mercan et al. | Improving transaction success rate in cryptocurrency payment channel networks | |
| WO2003007557A1 (en) | Method for routing in telecommunications networks | |
| Li et al. | Joint service function chain deploying and path selection for bandwidth saving and VNF reuse | |
| CN112119620A (en) | System and method for propagating data packets in a network of nodes | |
| Mao et al. | Provably efficient algorithms for traffic-sensitive SFC placement and flow routing | |
| Nguyen et al. | Efficient virtual network embedding with node ranking and intelligent link mapping | |
| Risso et al. | Metaheuristic approaches for IP/MPLS network design | |
| CN100440867C (en) | Method of real time soft seizing wave length route photo network |
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 |