CN115811498A - Node routing method, device, equipment and storage medium of alliance chain - Google Patents
Node routing method, device, equipment and storage medium of alliance chain Download PDFInfo
- Publication number
- CN115811498A CN115811498A CN202310069376.7A CN202310069376A CN115811498A CN 115811498 A CN115811498 A CN 115811498A CN 202310069376 A CN202310069376 A CN 202310069376A CN 115811498 A CN115811498 A CN 115811498A
- Authority
- CN
- China
- Prior art keywords
- routing
- node
- strategy
- routing strategy
- selecting
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 49
- 230000004044 response Effects 0.000 claims abstract description 25
- 230000008569 process Effects 0.000 claims abstract description 18
- 238000004590 computer program Methods 0.000 claims description 6
- 238000010276 construction Methods 0.000 claims description 3
- 230000009286 beneficial effect Effects 0.000 abstract description 3
- 230000000694 effects Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 3
- 230000008520 organization Effects 0.000 description 3
- 230000003111 delayed effect Effects 0.000 description 2
- 238000012163 sequencing technique Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
Images
Abstract
The invention discloses a node routing method, a device, equipment and a storage medium of a alliance chain, wherein the method comprises the following steps: constructing various routing strategies, and determining a matching rule based on the routing information characteristics of the routing strategies; selecting and calling a routing strategy meeting the service requirement according to the routing information characteristic of the routing strategy and the service requirement; according to the matching rule, the selected routing strategy is applied to the processes of issuing, receiving and introducing the routing of the alliance chain, and the optimal node is selected to access and send a transaction proposal; the method applies the routing strategy to the alliance chain submission transaction, and selects the node with the optimal response time through the routing strategy polling to submit the transaction proposal, thereby ensuring the load balance of the node and further being beneficial to improving the processing efficiency of the alliance chain.
Description
Technical Field
The present invention relates to the field of block chain technologies, and in particular, to a node routing method, apparatus, device, and storage medium for a federation chain.
Background
A federation chain is a block chain in which multiple organizations or enterprises participate, each organization or enterprise managing one or more nodes. The node is responsible for maintaining blockchain ledger data, processing transaction proposals and responses, and keeping the ledger data up to date at all times by continuously applying for update transactions.
The flow of blockchain commit transactions is substantially as follows: the client initiates a transaction proposal to the block chain network through the SDK, and after receiving the transaction proposal, the endorsement node verifies the signature and confirms whether the submitter is authorized to execute the operation or not, and returns the endorsement result to the client; the client side collects endorsement results meeting the endorsement strategy, packages the data into a transaction, signs and sends the transaction to the consensus nodes, the consensus nodes perform consensus sequencing on the transaction, then generates a new block according to the block generation strategy, and broadcasts the new block to each node in the block chain network, so that each node keeps the latest state of the account book data.
At present, for most alliance chains, when a client initiates a transaction proposal to a blockchain network through an SDK, the SDK selects a certain node in a blockchain organization in a random selection manner, and if the same node is randomly selected each time, the node load is too heavy, which affects the response time of the transaction.
Disclosure of Invention
In view of the above technical problems, the present invention provides a federation chain node routing method, apparatus, device, and storage medium for at least solving some of the above technical problems, where the method applies a routing policy to a federation chain submission transaction, and selects an optimal node to submit a transaction proposal through the routing policy, thereby reducing the response time of the node, and helping to ensure balanced access of the node and reduce the load of the node.
In order to achieve the purpose, the invention adopts the technical scheme that:
in a first aspect, an embodiment of the present invention provides a node routing method for a federation chain, including the following steps:
s1, constructing various routing strategies, and determining a matching rule based on routing information characteristics of the routing strategies;
s2, selecting and calling a routing strategy meeting the service requirement according to the routing information characteristic of the routing strategy and the service requirement;
and S3, applying the selected routing strategy to the processes of releasing, receiving and introducing the routing of the alliance chain according to the matching rule, and selecting an optimal node to access and send a transaction proposal.
Further, in step S1, the plurality of routing policies include: simple routing strategy, balanced routing strategy, weighted routing strategy and delay routing strategy, wherein:
the simple routing strategy is: when the client receives a plurality of node resources and needs to select one of the node resources, a random algorithm is adopted to randomly select a node to be accessed;
the balanced routing strategy is as follows: when a client receives a plurality of nodes of one type, the nodes are sequenced, and the nodes to be accessed are selected in sequence by adopting a polling algorithm;
the weighted routing strategy is: when the node resources received by the client contain weight values, summing the weight values of all the node resources, and selecting the node to be accessed according to the random value;
the delay routing policy is: and when the client receives a plurality of target nodes corresponding to the domain name, selecting the node with the shortest response time for access, and then selecting the node with the shortest response time from the rest nodes for access.
Further, in step S2, when a routing policy meeting the service requirement is selected and invoked, only one of the simple routing policy, the balanced routing policy, the weighted routing policy, and the delayed routing policy may be selected for each invocation.
Further, in step S3, the step of applying the selected routing policy to the process of issuing, receiving, and introducing the route of the federation chain selects an optimal node to access and send a transaction proposal, specifically:
in the route publishing process: informing the SDK of the selected routing strategy, and selecting the node to be accessed by the SDK according to the selected routing strategy;
in the route receiving process: the SDK receives the selected routing strategy and selects an optimal access node according to the selected routing strategy;
in the route introduction process: and the SDK constructs an access request according to the optimal access node and sends a transaction proposal to the node.
In a second aspect, an embodiment of the present invention further provides a node routing apparatus for an alliance chain, where the node routing method for an alliance chain described in the foregoing embodiment is applied to implement selecting an optimal node to submit a transaction proposal; the device comprises:
the routing strategy construction module is used for constructing various routing strategies and determining a matching rule based on the routing information characteristics of the routing strategies;
the routing strategy selection module is used for selecting and calling a routing strategy meeting the service requirement according to the routing information characteristics of the routing strategy and the service requirement;
and the routing strategy application module is used for applying the selected routing strategy to the processes of issuing, receiving and introducing the routing of the alliance chain according to the matching rule and selecting an optimal node to access and send a transaction proposal.
In a third aspect, an embodiment of the present invention further provides a node routing device, where the node routing device includes: a processor, a memory, and a computer program stored on the memory and executable by the processor, wherein:
when executed by the processor, the computer program implements the steps of the node routing method of a federation chain in the above embodiments.
In a fourth aspect, an embodiment of the present invention further provides a storage medium, on which one or more programs readable by a computing device are stored, wherein: the one or more programs include instructions which, when executed by a computing device, cause the computing device to implement a federation chain node routing method as described in the embodiments above.
Compared with the prior art, the invention has the following beneficial effects:
1. the node routing method of the alliance chain provided by the embodiment of the invention constructs a plurality of routing strategies, applies the routing strategies to the alliance chain submission transaction, selects the optimal node through the routing strategies to submit the transaction proposal, reduces the response time of the node, is beneficial to ensuring the balance of node access and effectively reduces the node load.
2. The weighted routing strategy and the delay routing strategy constructed by the invention can improve the response efficiency of the nodes. The weighted routing strategy sums the weights of all node resources, and selects nodes according to random numbers, wherein the larger the weight of the node resources is, the larger the selection probability is; the delay routing strategy selects the nodes according to the node response time, and the response time is short.
3. The four routing strategies constructed by the invention realize load balancing to a certain extent and prevent the single node from being overloaded. The simple routing strategy selects the nodes to be accessed through a random selection algorithm, reduces the probability of repeated selection to a certain extent, and achieves the effect of balance; the balanced routing strategy sequences the nodes, and the nodes are selected in sequence by calling each time, so that the balance of the access times of the nodes is ensured; the weighted routing strategy selects nodes with high resource weight for the first time, and then selects nodes with high resource weight from the rest nodes, so that different nodes are guaranteed to be accessed each time, and a balanced effect is achieved; the delay routing strategy selects the node with the shortest response time for the first time to access, and then selects the node with the shortest response time from the rest nodes to ensure that different nodes are accessed every time, thereby achieving the balanced effect.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and drawings.
The technical solution of the present invention is further described in detail by the accompanying drawings and embodiments.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are some embodiments of the present application, and other drawings can be obtained by those skilled in the art without creative efforts.
The accompanying drawings, which are included to provide a further understanding of the invention and are incorporated in and constitute a part of this specification, illustrate embodiments of the invention and together with the description serve to explain the principles of the invention and not to limit the invention.
Fig. 1 is a flowchart illustrating a node routing method of a federation chain according to an embodiment of the present invention.
Fig. 2 is a schematic block diagram of a node routing apparatus of a federation chain according to an embodiment of the present invention.
Fig. 3 is a schematic block diagram of a structure of a node routing device according to an embodiment of the present invention.
Detailed Description
In order to make the technical means, the creation characteristics, the achievement purposes and the effects of the invention easy to understand, the invention is further explained by combining the specific embodiments.
In the description of the present invention, it should be noted that, unless explicitly stated or limited otherwise, the terms "mounted," "disposed," "connected," and the like are to be construed broadly, such as "connected," which may be fixedly connected, detachably connected, or integrally connected; can be mechanically or electrically connected; they may be connected directly or indirectly through intervening media, or they may be interconnected between two elements. The specific meanings of the above terms in the present invention can be understood in specific cases to those skilled in the art. Moreover, the various numbers are used for descriptive purposes only and are not to be construed as indicating or implying relative importance.
Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
Example 1:
referring to fig. 1, the present invention provides a node routing method for a federation chain, including the following steps:
s1, constructing various routing strategies, and determining a matching rule based on routing information characteristics of the routing strategies;
s2, selecting and calling a routing strategy meeting the service requirement according to the routing information characteristic of the routing strategy and the service requirement;
and S3, applying the selected routing strategy to the processes of releasing, receiving and introducing the routing of the alliance chain according to the matching rule, and selecting an optimal node to access and send a transaction proposal.
The above steps are described in detail below:
in the step S1, a plurality of routing policies are constructed for selective use, including a simple routing policy, a balanced routing policy, a weighted routing policy, and a delayed routing policy, specifically referring to the following:
the simple routing policy is the simplest way, when the client receives multiple resources and needs to select one of them, it randomly sends a request to the destination address by using an algorithm (e.g. random algorithm, and code using random. Nextnint (size), where size is the number of nodes).
The balanced routing strategy means that when a client receives a plurality of nodes of one type, the nodes are sequenced, and the nodes to be accessed are selected in sequence by adopting an algorithm; that is, there are many addresses received by the client, and at this time, an algorithm (such as a polling algorithm) is used to send requests to the target address in a balanced manner, so that the requests received by the server are basically the same, and the single service load is avoided from being too large.
The weighted routing strategy depends on the address configuration of the server side, and the server side assigns a weight to each resource. The resource records received by the client contain the weight value, the client can sum the ownership weight values of the same resource to obtain n, then a random value from 0 to n is generated, and a resource address is selected according to the space where the random value is located.
The delay routing strategy refers to that when the client receives a plurality of target nodes corresponding to the domain name, the client selects the node with the shortest response time for access, and then selects the node with the shortest response time from the rest nodes for access; after receiving a plurality of destination addresses corresponding to the domain name, the client randomly selects 2 (configurable) addresses when accessing the resource for the first time, then pings the two addresses, records the RTT time of the two addresses, and selects the sending request with the shortest RTT return time; the second time of accessing the resource is to select another address to ping, compare with the previous RTT and select the sending request with the shortest RTT time; by analogy, when all addresses are found to be ping before sending the request, the request is directly sent to the shortest RTT.
Further, the characteristics of the routing information on which the routing policy is to be enforced may be set as the basis for matching.
In the step S2, a routing policy meeting the actual application requirement is selected according to the characteristics of the routing information of the routing policy and the actual application requirement.
And selecting a routing strategy according to the service requirement, wherein only one of a simple routing strategy, a balanced routing strategy, a weighted routing strategy and a delay routing strategy can be selected in each calling.
In the above step S3, according to the set matching rules, they are applied to the process of issuing, receiving and introducing routes.
And (4) route release: and informing the SDK of the selected routing strategy, and selecting the node to be accessed by the SDK according to the selected routing strategy.
And route receiving: and the SDK receives the selected routing strategy and selects the node to be finally accessed according to the selected routing strategy. A simple routing strategy, namely randomly selecting a node from a node list as a final access node; balancing the routing strategy, namely sequencing the node list, sequentially selecting nodes from the sequenced node list, and recording the accessed nodes after each access, thereby facilitating the next selection; a weighted routing strategy, namely selecting a final access node according to the weight of the node resource; and (4) delaying the routing strategy, namely selecting the node with the shortest node response time as the final access node.
Route introduction: and the SDK constructs an access request according to the finally selected node and sends a transaction proposal to the node.
Example 2:
as shown in fig. 2, an embodiment of the present invention further provides a node routing apparatus of a federation chain, which applies the node routing method of the federation chain of embodiment 1 to implement selecting an optimal node to submit a transaction proposal, where the apparatus includes:
the routing strategy construction module is used for constructing various routing strategies and determining a matching rule based on the routing information characteristics of the routing strategies;
the routing strategy selection module is used for selecting and calling a routing strategy meeting the service requirement according to the routing information characteristics of the routing strategy and the service requirement;
and the routing strategy application module is used for applying the selected routing strategy to the processes of releasing, receiving and introducing the routing of the alliance chain according to the matching rule and selecting an optimal node for accessing and sending a transaction proposal.
The device provided by the embodiment of the present invention has the same implementation principle and technical effect as the method embodiments, and for the sake of brief description, no part of the device embodiments is mentioned, and reference may be made to the corresponding contents in the method embodiments, and no further description is given here.
Example 3:
as shown in fig. 3, an embodiment of the present invention further provides a node routing device, where the node routing device includes: a processor (processing component), a memory (storage component), and a computer program (computer instructions) stored on the memory and executable by the processor, wherein: the computer program, when executed by a processor, implements a federation chain node routing method of embodiment 1 described above.
The structure shown in fig. 3 is a block diagram of only a part of the structure related to the present application, and does not constitute a limitation to the devices to which the present application is applied, and a specific node routing device may include more or less components than those shown in the figure, or combine some components, or have a different arrangement of components.
It should be noted that, as is clear to those skilled in the art, for convenience and simplicity of description, for a specific working process of the node routing device described above, reference may be made to a corresponding process in the foregoing method embodiment, and details are not described herein again.
Example 4:
the embodiment of the invention also provides a storage medium; one or more programs readable by a computing device are stored thereon, the one or more programs including instructions which, when executed by the computing device, cause the computing device to perform a federation chain node routing method of embodiment 1.
In embodiments of the present invention, the storage medium may be, for example, an electrical storage device, a magnetic storage device, an optical storage device, an electromagnetic storage device, a semiconductor storage device, or any suitable combination of the foregoing. More specific examples (non-exhaustive) include: 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 a punch card or an in-groove protruding structure with instructions stored thereon, and any suitable combination of the foregoing.
Through the description of the above embodiments, those skilled in the art may appreciate that the present invention provides a method, an apparatus, a device, and a storage medium for routing a federation chain node; aiming at most alliances, when a client initiates a transaction proposal to a block chain network through an SDK, the SDK selects a certain node in a block chain organization in a random selection mode, and if the same node is randomly selected each time, the problem that the node load is too heavy and the response time of the transaction is influenced is caused, so the invention designs a node routing method of the alliances, wherein four routing strategies are constructed, wherein:
the weighted routing strategy and the delay routing strategy provided by the invention can improve the response time of the node to a certain extent. The weighted routing strategy calculates the sum n of the weights of all node resources, and selects nodes according to a random number (0-n), wherein the larger the weight of the node resource is, the larger the selection probability is; the delay routing strategy selects the nodes according to the node response time, and the response time is short.
The four routing strategies provided by the invention realize load balancing to a certain extent and prevent the single node from being overloaded. The simple routing strategy selects the nodes to be accessed through a random selection algorithm, reduces the probability of repeated selection to a certain extent, and achieves the effect of balance; the balanced routing strategy sequences the nodes, and the nodes are selected in sequence by calling each time, so that the balance of the access times of the nodes is ensured; the weighted routing strategy selects the nodes with high resource weight for the first time, and then selects the nodes with high resource weight from the rest nodes, so as to ensure that different nodes are accessed each time, thereby achieving the balanced effect; the delay routing strategy selects the node with the shortest response time for the first time to access, and then selects the node with the shortest response time from the rest nodes to ensure that different nodes are accessed every time, thereby achieving the balanced effect.
The invention applies the routing strategy to the alliance chain submission transaction, and selects the node with the optimal performance (response time) to submit the transaction proposal through the routing strategy polling, thereby ensuring the load balance of the node. The SDK selects one node in the node list for access according to the routing strategy selected by the user, replaces the original mode of randomly selecting the node for access by the SDK, ensures the balance of the node access by the mode of SDK plus the routing strategy and reduces the node response time to a certain extent.
The embodiments in the present description are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same and similar parts among the embodiments are referred to each other. The device disclosed in the embodiment corresponds to the method disclosed in the embodiment, so that the description is simple, and the relevant points can be referred to the description of the method part.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (7)
1. A node routing method of a federation chain is characterized by comprising the following steps:
s1, constructing various routing strategies, and determining a matching rule based on routing information characteristics of the routing strategies;
s2, selecting and calling a routing strategy meeting the service requirement according to the routing information characteristic of the routing strategy and the service requirement;
and S3, applying the selected routing strategy to the process of issuing, receiving and introducing the routing of the alliance chain according to the matching rule, and selecting an optimal node to access and send a transaction proposal.
2. A federation link node routing method as claimed in claim 1, wherein in step S1, the plurality of routing policies include: simple routing strategy, balanced routing strategy, weighted routing strategy and delay routing strategy, wherein:
the simple routing strategy is as follows: when a client receives a plurality of node resources and needs to select one of the node resources, a random algorithm is adopted to randomly select a node to be accessed;
the balanced routing strategy is as follows: when the client receives that a plurality of nodes of one type exist, the nodes are sequenced, and the nodes to be accessed are selected in sequence by adopting a polling algorithm;
the weighted routing strategy is: when the node resources received by the client contain the weight values, the weight values of all the node resources are summed, and the node to be accessed is selected according to the random value;
the delay routing policy is: and when the client receives a plurality of target nodes corresponding to the domain name, selecting the node with the shortest response time for access, and then selecting the node with the shortest response time from the rest nodes for access.
3. The method for routing a node in a federation chain as claimed in claim 2, wherein in step S3, the step of applying the selected routing policy to the process of issuing, receiving and introducing a route in a federation chain to select an optimal node for accessing a transaction proposal includes:
in the route issuing process: informing the SDK of the selected routing strategy, and selecting the node to be accessed by the SDK according to the selected routing strategy;
in the route receiving process: the SDK receives the selected routing strategy and selects an optimal access node according to the selected routing strategy;
in the route introduction process: and the SDK constructs an access request according to the optimal access node and sends a transaction proposal to the node.
4. A node routing device of a federation chain, characterized in that, the node routing method of a federation chain according to any one of claims 1 to 3 is applied to realize the selection of an optimal node to submit a transaction proposal.
5. A federation chain node routing apparatus as claimed in claim 4, the apparatus comprising:
the routing strategy construction module is used for constructing various routing strategies and determining a matching rule based on the routing information characteristics of the routing strategies;
the routing strategy selection module is used for selecting and calling a routing strategy meeting the service requirement according to the routing information characteristics of the routing strategy and the service requirement;
and the routing strategy application module is used for applying the selected routing strategy to the processes of issuing, receiving and introducing the routing of the alliance chain according to the matching rule and selecting an optimal node to access and send a transaction proposal.
6. A node routing device, characterized in that the node routing device comprises: a processor, a memory, and a computer program stored on the memory and executable by the processor, wherein:
the computer program, when executed by the processor, implementing the steps of a method for node routing for a federation chain as claimed in any one of claims 1 to 3.
7. A storage medium having one or more programs stored thereon that are readable by a computing device, the one or more programs comprising: the one or more programs include instructions that, when executed by a computing device, cause the computing device to perform a federation chain node routing method of any one of claims 1 to 3.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310069376.7A CN115811498A (en) | 2023-02-06 | 2023-02-06 | Node routing method, device, equipment and storage medium of alliance chain |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310069376.7A CN115811498A (en) | 2023-02-06 | 2023-02-06 | Node routing method, device, equipment and storage medium of alliance chain |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN115811498A true CN115811498A (en) | 2023-03-17 |
Family
ID=85487546
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310069376.7A Pending CN115811498A (en) | 2023-02-06 | 2023-02-06 | Node routing method, device, equipment and storage medium of alliance chain |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115811498A (en) |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109347955A (en) * | 2018-10-19 | 2019-02-15 | 北京奇艺世纪科技有限公司 | A kind of block chain network system and information processing method |
| CN109462505A (en) * | 2018-11-12 | 2019-03-12 | 上海点融信息科技有限责任公司 | Realize the method and apparatus across chain communication between multiple block chain networks |
| CN110163756A (en) * | 2019-05-28 | 2019-08-23 | 深圳市网心科技有限公司 | A kind of method of commerce based on alliance's chain, system, server and block catenary system |
| CN110619520A (en) * | 2018-06-20 | 2019-12-27 | 深圳市红砖坊技术有限公司 | Block chain system and routing method of routing node applied to block chain system |
| US20200076610A1 (en) * | 2017-05-15 | 2020-03-05 | Visa International Service Association | Techniques For Secure Blockchain Routing |
| CN112200681A (en) * | 2020-12-04 | 2021-01-08 | 腾讯科技（深圳）有限公司 | Service processing method, information processing method and node equipment of block chain network |
| CN113923155A (en) * | 2021-12-06 | 2022-01-11 | 浙商银行股份有限公司 | Shortest path algorithm-based alliance link communication method and system |
-
2023
- 2023-02-06 CN CN202310069376.7A patent/CN115811498A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20200076610A1 (en) * | 2017-05-15 | 2020-03-05 | Visa International Service Association | Techniques For Secure Blockchain Routing |
| CN110619520A (en) * | 2018-06-20 | 2019-12-27 | 深圳市红砖坊技术有限公司 | Block chain system and routing method of routing node applied to block chain system |
| CN109347955A (en) * | 2018-10-19 | 2019-02-15 | 北京奇艺世纪科技有限公司 | A kind of block chain network system and information processing method |
| CN109462505A (en) * | 2018-11-12 | 2019-03-12 | 上海点融信息科技有限责任公司 | Realize the method and apparatus across chain communication between multiple block chain networks |
| CN110163756A (en) * | 2019-05-28 | 2019-08-23 | 深圳市网心科技有限公司 | A kind of method of commerce based on alliance's chain, system, server and block catenary system |
| CN112200681A (en) * | 2020-12-04 | 2021-01-08 | 腾讯科技（深圳）有限公司 | Service processing method, information processing method and node equipment of block chain network |
| CN113923155A (en) * | 2021-12-06 | 2022-01-11 | 浙商银行股份有限公司 | Shortest path algorithm-based alliance link communication method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108540536B (en) | Block chain-based network mass service processing method, equipment and storage medium | |
| Marti et al. | Limited reputation sharing in P2P systems | |
| US20060235859A1 (en) | Prescriptive architecutre recommendations | |
| US7730186B2 (en) | Networked queuing system and method for distributed collborative clusters of services | |
| Papaioannou et al. | Reputation-based policies that provide the right incentives in peer-to-peer environments | |
| Sonnek et al. | Reputation-based scheduling on unreliable distributed infrastructures | |
| Chen et al. | The server reassignment problem for load balancing in structured P2P systems | |
| Kurdi et al. | TrustyFeer: A subjective logic trust model for smart city peer-to-peer federated clouds | |
| US8464342B2 (en) | Adaptively selecting electronic message scanning rules | |
| Gummadi et al. | Modeling group trust for peer-to-peer access control | |
| Merizig et al. | A multi-agent system approach for service deployment in the cloud | |
| Shamsi et al. | QoSMap: QoS aware mapping of virtual networks for resiliency and efficiency | |
| CN115811498A (en) | Node routing method, device, equipment and storage medium of alliance chain | |
| Choi et al. | Group-based dynamic computational replication mechanism in peer-to-peer grid computing | |
| Tajeddine et al. | A comprehensive reputation-based trust model for distributed systems | |
| US20120054859A1 (en) | Adaptive electronic message scanning | |
| Wang et al. | A super‐agent‐based framework for reputation management and community formation in decentralized systems | |
| Lagesse et al. | AREX: An adaptive system for secure resource access in mobile P2P systems | |
| CN112001800B (en) | Method and device for processing business in block chain system | |
| Schosser et al. | Incentives engineering for structured p2p systems-a feasibility demonstration using economic experiments | |
| CN110601877B (en) | Service negotiation method, device, electronic equipment and storage medium | |
| Homsi et al. | Game theoretic-based approaches for cybersecurity-aware virtual machine placement in public cloud clusters | |
| Aringhieri et al. | Assessing efficiency of trust management in peer-to-peer systems | |
| Karakaya et al. | A connection management protocol for promoting cooperation in Peer-to-Peer networks | |
| Fan et al. | Peer cluster: a maximum flow‐based trust mechanism in P2P file sharing networks |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20230317 |