CN114095373B - Knowledge graph-based alliance chain management method, system, equipment and storage medium - Google Patents
Knowledge graph-based alliance chain management method, system, equipment and storage medium Download PDFInfo
- Publication number
- CN114095373B CN114095373B CN202111275626.XA CN202111275626A CN114095373B CN 114095373 B CN114095373 B CN 114095373B CN 202111275626 A CN202111275626 A CN 202111275626A CN 114095373 B CN114095373 B CN 114095373B
- Authority
- CN
- China
- Prior art keywords
- node
- network
- alliance chain
- graph
- consensus
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000007726 management method Methods 0.000 title claims abstract description 29
- 230000007246 mechanism Effects 0.000 claims abstract description 51
- 238000012217 deletion Methods 0.000 claims abstract description 7
- 230000037430 deletion Effects 0.000 claims abstract description 7
- 238000010845 search algorithm Methods 0.000 claims description 12
- 238000010276 construction Methods 0.000 claims description 5
- 238000000034 method Methods 0.000 abstract description 7
- 230000008520 organization Effects 0.000 description 27
- 238000005516 engineering process Methods 0.000 description 3
- 239000004744 fabric Substances 0.000 description 2
- 238000013475 authorization Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000008569 process Effects 0.000 description 1
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/12—Discovery or management of network topologies
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/23—Updating
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/27—Replication, distribution or synchronisation of data between databases or within a distributed database system; Distributed database system architectures therefor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/30—Information retrieval; Database structures therefor; File system structures therefor of unstructured textual data
- G06F16/36—Creation of semantic tools, e.g. ontology or thesauri
- G06F16/367—Ontology
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/04—Trading; Exchange, e.g. stocks, commodities, derivatives or currency exchange
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0803—Configuration setting
- H04L41/0813—Configuration setting characterised by the conditions triggering a change of settings
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0893—Assignment of logical groups to network elements
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/2866—Architectures; Arrangements
- H04L67/30—Profiles
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- Databases & Information Systems (AREA)
- General Physics & Mathematics (AREA)
- Business, Economics & Management (AREA)
- General Engineering & Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Technology Law (AREA)
- General Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Marketing (AREA)
- Economics (AREA)
- Development Economics (AREA)
- Computing Systems (AREA)
- Life Sciences & Earth Sciences (AREA)
- Animal Behavior & Ethology (AREA)
- Computational Linguistics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a knowledge graph-based alliance chain management method, a system, equipment and a storage medium, wherein the method comprises the following steps: acquiring member, block chain node, network relay node and network connection information in a alliance chain to construct an alliance chain network knowledge graph, adopting a graph structure representation mode of an attribute graph model, wherein the block chain node and the network relay node are used as vertexes, the node and the member information are used as vertex attributes, the connection relationship between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes; establishing a new member node algorithm model; when member nodes are newly added or deleted, the network topology needing to be added or deleted is calculated based on an algorithm model, a network strategy is rapidly configured, and new adding or deleting instructions are sent to nodes in the topology to update node configuration. Aiming at a large-scale alliance chain network, the method realizes the rapid access and deletion of the alliance chain members by constructing the knowledge graph of the alliance chain network, and improves the management efficiency of the alliance chain.
Description
Technical Field
The invention belongs to the technical field of computer systems and blockchains, and particularly relates to a knowledge-graph-based alliance chain management method, a knowledge-graph-based alliance chain management system, a knowledge-graph-based alliance chain management equipment and a knowledge-graph-based alliance chain management storage medium.
Background
The block chain is a distributed data account book technology which connects data blocks in sequence according to time sequence, combines a chain data structure, stores the data blocks in all participants in a decentralization mode, and guarantees that the data cannot be tampered, forged and traced through a cryptography technology. By applying the blockchain technology, the integrity and the reliability of the information can be ensured, and the trust and the safety problems in the information interaction process can be effectively solved.
The alliance chain refers to a blockchain network commonly maintained by a plurality of institutions, each institution joins or exits the network after authorization, the authority of each institution is completely equivalent, and the reading, writing and accounting rules of information on the chain are determined according to the alliance consensus. Compared with public chains, alliance chains have the advantages of high transaction performance, strong controllability, data privacy protection and the like, so that the alliance chains are widely applied to various scenes.
With the development of the alliance chain, the scale of the alliance chain network is continuously enlarged, more and more member institutions participating in the same alliance chain network are involved, and how to effectively manage alliance members, including member admission, member exit and network policy deployment, becomes a key problem to be solved urgently.
Disclosure of Invention
The invention aims to provide a knowledge graph-based alliance chain management method, a knowledge graph-based alliance chain management system, a knowledge graph-based alliance chain management equipment and a knowledge graph-based alliance chain management storage medium.
According to a first aspect of the present invention, there is provided a knowledge-graph-based federation chain management method, the method comprising:
Acquiring member, block chain node, network relay node and network connection information in a alliance chain, and constructing an alliance chain network knowledge graph, wherein the alliance chain network knowledge graph adopts a graph structure representation mode of an attribute graph model, the block chain node and the network relay node are used as vertexes, node information and member information are used as vertex attributes, the connection relationship between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes;
Based on the constructed alliance chain network knowledge graph, an algorithm model of newly added and deleted member nodes is established according to vertex types, consensus mechanisms, network connection information and node attributes of newly added and deleted members;
when member nodes in the alliance chain are newly added or deleted, rapidly calculating network topology needing to be newly added or deleted based on the established algorithm model;
based on the newly added and deleted network topology, the network strategy is rapidly configured, and new adding and deleting instructions are sent to all nodes in the topology, and after the nodes receive the instructions, the configuration files of the nodes are updated, so that the alliance chain network updating is completed.
Further, the construction of the alliance chain network knowledge graph comprises the following steps:
Knowledge modeling, namely establishing an ontology model of a alliance chain network knowledge graph, wherein the ontology model comprises concept definition, relationship definition and attribute definition, and for an alliance chain network, block chain nodes and network relay nodes are defined as vertex entities, node connection relations are edge entities, and node information, member information, a consensus mechanism and network connection information are attributes;
Knowledge acquisition, namely extracting structured knowledge in a alliance chain network according to an established ontology model, wherein the structured knowledge comprises alliance member information, block link point information, network relay node information, a consensus mechanism and network connection information;
Knowledge storage, namely adopting storage based on a graph structure, selecting an attribute graph model to store acquired data, taking a block chain node and a network relay node as vertexes, node information, member information and the like as vertex attributes, taking a connection relationship between nodes as edges, and taking a consensus mechanism and network connection information as edge attributes; the storage means may select a map database of the main stream, such as neo4j.
Further, an algorithm model of newly added alliance chain member nodes is established, and the newly added alliance chain member nodes are distinguished according to node types, including:
(1) If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, an algorithm model is defined to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of the alliance chain member; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
For example, in a federation chain network (e.g., FISCO BCOS) based on PBFT consensus mechanism, all consensus nodes in the network need to be connected, at this time, if a member needs to add a new consensus node, all nodes in the network need to be connected, if the member uses a network relay node to perform data routing, the corresponding algorithm model queries all vertices of the member through a graph search algorithm, if the member does not use the network relay node to perform data routing, the corresponding algorithm model queries all vertices of the member through the graph search algorithm, and vertex types in other members are vertices of the network relay node or the blockchain consensus node.
(2) If the member is a block chain non-consensus node, defining an algorithm model as searching the vertex type of other members closest to the member by a shortest path search algorithm of a graph as the vertex of a network relay node or a block chain consensus node according to a network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node to join a alliance chain, defining an algorithm model as searching the vertex of which any vertex type is the block chain consensus node in the member through a graph searching algorithm;
(3) If the network relay node is the network relay node, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of a alliance chain member, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
For example, in HYPERLEDGER FABRIC networks including order ordering nodes, peer nodes and anchor peer nodes (network relay nodes), if a certain organization in HYPERLEDGER FABRIC networks needs to add an anchor peer node, the node needs to connect all nodes in the organization and anchor peer nodes of other organizations, and the corresponding algorithm model queries all vertices in the organization through the graph search algorithm, and the vertices in other organizations are vertices with the type of anchor peer anchor node.
Further, an algorithm model for deleting the member nodes of the alliance chain is established, and the algorithm model is distinguished according to the node types and comprises the following steps:
(1) If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, according to the block chain network connection rule specified by the consensus mechanism, an algorithm model is defined to inquire the vertex of the member through a graph searching algorithm; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model as searching the vertexes of the member through a graph searching algorithm according to the blockchain network connection rule specified by the consensus mechanism, and the vertexes of other members are vertexes of the network relay node or the blockchain consensus node;
(2) If the node is a block chain non-consensus node, defining an algorithm model as searching the vertexes of nodes connected with the node to be deleted in other members through a graph searching algorithm according to the network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node added into a alliance chain, defining an algorithm model as searching the vertex of the node connected with the node to be deleted in the member through a graph searching algorithm;
(3) If the node is a network relay node, defining an algorithm model to inquire the vertex of the member through a graph searching algorithm according to the block chain network connection rule specified by the consensus mechanism and the network connection strategy of the alliance chain member, wherein the vertex type in other members is the vertex of the network relay node or the block chain consensus node.
Further, when the alliance chain needs to be newly added with member nodes, rapidly calculating the network topology needing to be newly added from the alliance chain network knowledge graph according to the type of the node to be newly added and the established algorithm model; when the member nodes of the alliance chain need to be deleted, the network topology needing to be deleted is rapidly calculated from the alliance chain network knowledge graph according to the type of the nodes to be deleted and the established algorithm model.
Further, based on the newly added network topology, the network policy is rapidly configured by the alliance chain members, the network is opened, and the newly added member node instructions are sent to all nodes in the topology, wherein the instructions comprise the information of the nodes to be newly added, and the nodes update the configuration files after receiving the instructions, so that the alliance chain network update is completed; based on the deleted network topology, sending a member node deleting instruction to all nodes in the topology, wherein the instruction comprises information of the nodes to be deleted, updating respective configuration files after the nodes receive the instruction, completing the update of the alliance chain network, and simultaneously recovering the network policy by the alliance chain members according to the network topology.
According to a second aspect of the present invention, there is provided a knowledge-graph-based federated chain management system comprising:
The alliance chain network knowledge graph construction module: acquiring member, block chain node, network relay node and network connection information in a alliance chain, and constructing an alliance chain network knowledge graph, wherein the alliance chain network knowledge graph adopts a graph structure representation mode of an attribute graph model, the block chain node and the network relay node are used as vertexes, node information and member information are used as vertex attributes, the connection relationship between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes;
An algorithm modeling module: based on the constructed alliance chain network knowledge graph, an algorithm model of newly added and deleted member nodes is established according to vertex types, consensus mechanisms, network connection information and node attributes of newly added and deleted members;
A network topology updating module: when member nodes in the alliance chain are newly added or deleted, rapidly calculating network topology needing to be newly added or deleted based on the established algorithm model;
A coalition chain network updating module: based on the newly added and deleted network topology, the network strategy is rapidly configured, and new adding and deleting instructions are sent to all nodes in the topology, and after the nodes receive the instructions, the configuration files of the nodes are updated, so that the alliance chain network updating is completed.
Further, the algorithm modeling module comprises a newly added alliance chain member node algorithm model sub-module and a deleted alliance chain member node algorithm model sub-module;
in the newly added alliance chain member node algorithm model submodule, distinguishing according to node types comprises the following steps:
If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, an algorithm model is defined to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of the alliance chain member; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
If the member is a block chain non-consensus node, defining an algorithm model as searching the vertex type of other members closest to the member by a shortest path search algorithm of a graph as the vertex of a network relay node or a block chain consensus node according to a network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node to join a alliance chain, defining an algorithm model as searching the vertex of which any vertex type is the block chain consensus node in the member through a graph searching algorithm;
If the network relay node is the network relay node, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of a alliance chain member, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
the deletion alliance chain member node algorithm model submodule is distinguished according to node types and comprises the following steps:
If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, according to the block chain network connection rule specified by the consensus mechanism, an algorithm model is defined to inquire the vertex of the member through a graph searching algorithm; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model as searching the vertexes of the member through a graph searching algorithm according to the blockchain network connection rule specified by the consensus mechanism, and the vertexes of other members are vertexes of the network relay node or the blockchain consensus node;
If the node is a block chain non-consensus node, defining an algorithm model as searching the vertexes of nodes connected with the node to be deleted in other members through a graph searching algorithm according to the network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node added into a alliance chain, defining an algorithm model as searching the vertex of the node connected with the node to be deleted in the member through a graph searching algorithm;
If the node is a network relay node, defining an algorithm model to inquire the vertex of the member through a graph searching algorithm according to the block chain network connection rule specified by the consensus mechanism and the network connection strategy of the alliance chain member, wherein the vertex type in other members is the vertex of the network relay node or the block chain consensus node.
According to a third aspect of the present invention, there is provided a computer device comprising a memory and a processor, the memory having stored therein computer readable instructions which, when executed by the processor, cause the processor to perform the steps of the above-described knowledge-graph-based federation chain management method.
According to a fourth aspect of the present invention there is provided a storage medium storing computer readable instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of the knowledge-graph based federation chain management method described above.
The beneficial effects of the invention are as follows: firstly, acquiring member, block chain node, network relay node and network connection information in a alliance chain to construct an alliance chain network knowledge graph, wherein the knowledge graph adopts a graph structure representation mode of an attribute graph model, the block chain node and the network relay node are used as vertexes, node information and member information are used as vertex attributes, the connection relation between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes; then, based on the knowledge graph of the alliance chain network, an algorithm model of newly added and deleted member nodes is established; when member nodes in the alliance chain are newly added or deleted, the network topology needing to be added or deleted is calculated based on an algorithm model, a network strategy is rapidly configured based on the network topology, and new adding or deleting instructions are sent to nodes in the topology to update node configuration. Aiming at a large-scale alliance chain network, the method realizes the rapid access and deletion of the alliance chain members by constructing the knowledge graph of the alliance chain network, and improves the management efficiency of the alliance chain.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are required in the embodiments or the description of the prior art will be briefly described, and it is obvious that the drawings in the following description are some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1 is a flowchart of a knowledge-graph-based federation chain management method according to an embodiment of the present invention;
Fig. 2 is a diagram illustrating a knowledge graph of a federated chain network in accordance with an embodiment of the present invention.
Detailed Description
The invention will now be described in further detail with reference to the drawings and the specific examples, it being understood that the specific embodiments described herein are for purposes of illustration only and are not intended to limit the invention.
The embodiment of the invention provides a knowledge graph-based alliance chain management method, and a flow chart of the method is shown in figure 1.
Firstly, constructing a alliance chain network knowledge graph, which comprises the following steps:
Knowledge modeling, namely establishing an ontology model of a alliance chain network knowledge graph, wherein the ontology model comprises concept definition, relationship definition and attribute definition, and for an alliance chain network, block chain nodes and network relay nodes are defined as vertex entities, node connection relations are edge entities, and node information, member information, a consensus mechanism and network connection information are attributes;
Knowledge acquisition, namely extracting structured knowledge in a alliance chain network according to an established ontology model, wherein the structured knowledge comprises alliance member information, block link point information, network relay node information, a consensus mechanism and network connection information;
Knowledge storage, namely adopting storage based on a graph structure, selecting an attribute graph model to store acquired data, taking a block chain node and a network relay node as vertexes, node information, member information and the like as vertex attributes, taking a connection relationship between nodes as edges, and taking a consensus mechanism and network connection information as edge attributes; the storage means may select a map database of the main stream, such as neo4j.
The step of constructing the network knowledge graph of the alliance chain is obtained, as shown in fig. 2, the network knowledge graph of the alliance chain is shown in an example graph of the network knowledge graph of the alliance chain, the alliance chain network comprises five participation organizations of organization a, organization B, organization C, organization D and organization E, vertexes are nodes participated in organization deployment, edges are connection relations among the nodes, the vertexes comprise consensus nodes, non-consensus nodes and network relay nodes, wherein the consensus nodes participate in the whole network consensus, the non-consensus nodes do not participate in the consensus, are responsible for synchronizing data and forwarding transactions, the network relay nodes are responsible for routing forwarding of messages, vertex attributes comprise vertex id, types, affiliated organizations and the like, the relations among the vertexes comprise common consensus protocols and the like, for example, the organization a shown in the graph comprises three consensus nodes A 1、A2、A3 and one network relay node G A, the organization B comprises four consensus nodes B 1、B2、B3、B4 and one network relay node G B, the organization C comprises two consensus nodes C 1、C2 and one network relay node G C, the organization D comprises two consensus nodes D 1、D2, the organization E comprises one non-consensus node E 1, and the network relay node adopts the common network protocol.
In the algorithm modeling stage, an algorithm model for building new addition and deletion of alliance chain members based on the alliance chain network knowledge graph of fig. 2 is as follows:
aiming at the new addition of the member nodes of the alliance chain, distinguishing according to node types, if the member nodes are consensus nodes, for example, an A organization needs to newly add an A 1 node, all the consensus nodes are required to be connected according to the BFT consensus protocol, the A 1 needs to be connected with the A 2、A3 node and the G A node, other organization networks are connected through a network relay node G A, and an algorithm model searches a graph searching algorithm P A for searching other vertexes of the organization A from the vertex A 1; if the node is a non-consensus node, for example, the E organization needs to join the organization D to deploy a non-consensus node E 1, and as the non-consensus node only needs to be connected with one consensus node, the algorithm model searches a graph searching algorithm P E of any node of the organization D starting from a vertex E 1; if the network relay node is a network relay node, for example, an organization B needs to newly add a G B node, and G B is simultaneously connected with all consensus nodes of the organization and needs to be connected with other organization networks, the algorithm model searches a graph searching algorithm P B comprising all the consensus nodes in the organization B, other network relay nodes and all the consensus nodes in the organization without the network relay nodes by starting from G B;
Aiming at the deletion of the member node of the alliance chain, the node directly connected with the node is usually only needed to be found, namely, the corresponding algorithm model is a first-degree association search algorithm of the graph, for example, the organization D wants to exit the consensus node D 1, the corresponding algorithm model is a first-degree association search algorithm P D of the vertex D 1, the network relay node still exists in the large alliance chain network to realize the route forwarding, the multi-degree association search algorithm model of the graph needs to be established at the moment, for example, the organization C wants to exit the consensus node C 2 on the premise that the connection between the consensus node C 2 and the A 3 in the graph in FIG. 2 is realized through the port forwarding of the network relay nodes G C and G A, and the algorithm model is a first-degree association search and a third-degree association search algorithm P C of the vertex C 2.
In the network topology updating stage, the member nodes needing to be added/deleted are input through the established algorithm model to quickly obtain the network topology needing to be updated. Taking the algorithm model obtained in the algorithm modeling stage as an example, the network topology obtained by the algorithm P A is A 1、A2、A3 and G A and the relation between the two; the network topology obtained by the algorithm P E is E 1、D1 and the relation between the two; the network topology obtained by the algorithm P B is B 1、B2、B3、B4、GB、GA、GC、D1、D2 and the relation between the two; the network topology obtained by the algorithm P D is D 1、D2、GB、GA、GC、E1 and the relation between the two; the network topology obtained by algorithm P C is C 1、C2、GA、GC、A3 and the relationships between them.
Finally, based on the newly added network topology, the alliance chain members rapidly configure the network strategy, open the network, and send out newly added member node instructions to all nodes in the topology, wherein the instructions comprise information of the nodes to be newly added, and the nodes update the configuration files after receiving the instructions, so as to complete the update of the alliance chain network; based on the deleted network topology, sending a member node deleting instruction to all nodes in the topology, wherein the instruction comprises information of the nodes to be deleted, updating respective configuration files after the nodes receive the instruction, completing the update of the alliance chain network, and simultaneously recovering the network policy by the alliance chain members according to the network topology.
In one embodiment, a knowledge-graph-based federated chain management system is presented, comprising:
The alliance chain network knowledge graph construction module: acquiring member, block chain node, network relay node and network connection information in a alliance chain, and constructing an alliance chain network knowledge graph, wherein the alliance chain network knowledge graph adopts a graph structure representation mode of an attribute graph model, the block chain node and the network relay node are used as vertexes, node information and member information are used as vertex attributes, the connection relationship between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes;
An algorithm modeling module: based on the constructed alliance chain network knowledge graph, an algorithm model of newly added and deleted member nodes is established according to vertex types, consensus mechanisms, network connection information and node attributes of newly added and deleted members;
A network topology updating module: when member nodes in the alliance chain are newly added or deleted, rapidly calculating network topology needing to be newly added or deleted based on the established algorithm model;
A coalition chain network updating module: based on the newly added and deleted network topology, the network strategy is rapidly configured, and new adding and deleting instructions are sent to all nodes in the topology, and after the nodes receive the instructions, the configuration files of the nodes are updated, so that the alliance chain network updating is completed.
The algorithm modeling module comprises a newly added alliance chain member node algorithm model sub-module and a deleted alliance chain member node algorithm model sub-module;
in the newly added alliance chain member node algorithm model submodule, distinguishing according to node types comprises the following steps:
If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, an algorithm model is defined to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of the alliance chain member; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
If the member is a block chain non-consensus node, defining an algorithm model as searching the vertex type of other members closest to the member by a shortest path search algorithm of a graph as the vertex of a network relay node or a block chain consensus node according to a network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node to join a alliance chain, defining an algorithm model as searching the vertex of which any vertex type is the block chain consensus node in the member through a graph searching algorithm;
If the network relay node is the network relay node, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of a alliance chain member, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
the deletion alliance chain member node algorithm model submodule is distinguished according to node types and comprises the following steps:
If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, according to the block chain network connection rule specified by the consensus mechanism, an algorithm model is defined to inquire the vertex of the member through a graph searching algorithm; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model as searching the vertexes of the member through a graph searching algorithm according to the blockchain network connection rule specified by the consensus mechanism, and the vertexes of other members are vertexes of the network relay node or the blockchain consensus node;
If the node is a block chain non-consensus node, defining an algorithm model as searching the vertexes of nodes connected with the node to be deleted in other members through a graph searching algorithm according to the network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node added into a alliance chain, defining an algorithm model as searching the vertex of the node connected with the node to be deleted in the member through a graph searching algorithm;
If the node is a network relay node, defining an algorithm model to inquire the vertex of the member through a graph searching algorithm according to the block chain network connection rule specified by the consensus mechanism and the network connection strategy of the alliance chain member, wherein the vertex type in other members is the vertex of the network relay node or the block chain consensus node.
In one embodiment, a computer device is provided, including a memory and a processor, where the memory stores computer readable instructions that, when executed by the processor, cause the processor to perform the steps in the knowledge-graph-based federation chain management method in the foregoing embodiments.
In one embodiment, a storage medium storing computer readable instructions that, when executed by one or more processors, cause the one or more processors to perform the steps in the knowledge-graph-based federation chain management method in the above embodiments is presented. Wherein the storage medium may be a non-volatile storage medium.
Those of ordinary skill in the art will appreciate that all or part of the steps in the various methods of the above embodiments may be implemented by a program to instruct related hardware, the program may be stored in a computer readable storage medium, and the storage medium may include: read Only Memory (ROM), random access memory (RAM, random Access Memory), magnetic or optical disk, and the like.
The foregoing description of the preferred embodiment(s) is (are) merely intended to illustrate the embodiment(s) of the present invention, and it is not intended to limit the embodiment(s) of the present invention to the particular embodiment(s) described.
Claims (7)
1. A alliance chain management method based on a knowledge graph is characterized by comprising the following steps:
Acquiring member, block chain node, network relay node and network connection information in a alliance chain, and constructing an alliance chain network knowledge graph, wherein the alliance chain network knowledge graph adopts a graph structure representation mode of an attribute graph model, the block chain node and the network relay node are used as vertexes, node information and member information are used as vertex attributes, the connection relationship between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes;
Based on the constructed alliance chain network knowledge graph, an algorithm model of newly added and deleted member nodes is established according to vertex types, consensus mechanisms, network connection information and node attributes of newly added and deleted members;
establishing an algorithm model of newly added alliance chain member nodes, distinguishing according to node types, and comprising the following steps:
(1) If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, an algorithm model is defined to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of the alliance chain member; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
(2) If the member is a block chain non-consensus node, defining an algorithm model as searching the vertex type of other members closest to the member by a shortest path search algorithm of a graph as the vertex of a network relay node or a block chain consensus node according to a network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node to join a alliance chain, defining an algorithm model as searching the vertex of which any vertex type is the block chain consensus node in the member through a graph searching algorithm;
(3) If the network relay node is the network relay node, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of a alliance chain member, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
Establishing an algorithm model for deleting the alliance chain member nodes, distinguishing according to node types, and comprising the following steps:
(1) If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, according to the block chain network connection rule specified by the consensus mechanism, an algorithm model is defined to inquire the vertex of the member through a graph searching algorithm; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model as searching the vertexes of the member through a graph searching algorithm according to the blockchain network connection rule specified by the consensus mechanism, and the vertexes of other members are vertexes of the network relay node or the blockchain consensus node;
(2) If the node is a block chain non-consensus node, defining an algorithm model as searching the vertexes of nodes connected with the node to be deleted in other members through a graph searching algorithm according to the network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node added into a alliance chain, defining an algorithm model as searching the vertex of the node connected with the node to be deleted in the member through a graph searching algorithm;
(3) If the network relay node is the network relay node, defining an algorithm model to inquire the vertex of the member through a graph searching algorithm according to the block chain network connection rule specified by the consensus mechanism and the network connection strategy of the alliance chain member, wherein the vertex type in other members is the vertex of the network relay node or the block chain consensus node;
when member nodes in the alliance chain are newly added or deleted, rapidly calculating network topology needing to be newly added or deleted based on the established algorithm model;
based on the newly added and deleted network topology, the network strategy is rapidly configured, and new adding and deleting instructions are sent to all nodes in the topology, and after the nodes receive the instructions, the configuration files of the nodes are updated, so that the alliance chain network updating is completed.
2. The knowledge-graph-based federation chain management method according to claim 1, wherein the construction of the knowledge graph of the federation chain network comprises the following steps:
Knowledge modeling, namely establishing an ontology model of a alliance chain network knowledge graph, wherein the ontology model comprises concept definition, relationship definition and attribute definition, and for an alliance chain network, block chain nodes and network relay nodes are defined as vertex entities, node connection relations are edge entities, and node information, member information, a consensus mechanism and network connection information are attributes;
Knowledge acquisition, namely extracting structured knowledge in a alliance chain network according to an established ontology model, wherein the structured knowledge comprises alliance member information, block link point information, network relay node information, a consensus mechanism and network connection information;
and storing knowledge, namely selecting an attribute graph model to store the acquired data by adopting graph structure-based storage.
3. The knowledge graph-based alliance chain management method according to claim 1, wherein when the alliance chain needs to add member nodes, the network topology needing to be added is rapidly calculated from the knowledge graph of the alliance chain network according to the types of the nodes to be added and the established algorithm model; when the member nodes of the alliance chain need to be deleted, the network topology needing to be deleted is rapidly calculated from the alliance chain network knowledge graph according to the type of the nodes to be deleted and the established algorithm model.
4. The knowledge graph-based alliance chain management method according to claim 1, wherein based on a newly added network topology, the alliance chain members rapidly configure a network policy, open a network, and send a newly added member node instruction to all nodes in the topology, wherein the instruction comprises information of the nodes to be newly added, and the nodes update respective configuration files after receiving the instruction to complete the update of the alliance chain network; based on the deleted network topology, sending a member node deleting instruction to all nodes in the topology, wherein the instruction comprises information of the nodes to be deleted, updating respective configuration files after the nodes receive the instruction, completing the update of the alliance chain network, and simultaneously recovering the network policy by the alliance chain members according to the network topology.
5. A alliance chain management system based on a knowledge graph is characterized by comprising the following modules:
The alliance chain network knowledge graph construction module: acquiring member, block chain node, network relay node and network connection information in a alliance chain, and constructing an alliance chain network knowledge graph, wherein the alliance chain network knowledge graph adopts a graph structure representation mode of an attribute graph model, the block chain node and the network relay node are used as vertexes, node information and member information are used as vertex attributes, the connection relationship between the nodes is used as edges, and a consensus mechanism and the network connection information are used as edge attributes;
An algorithm modeling module: based on the constructed alliance chain network knowledge graph, an algorithm model of newly added and deleted member nodes is established according to vertex types, consensus mechanisms, network connection information and node attributes of newly added and deleted members;
the algorithm modeling module comprises a newly added alliance chain member node algorithm model sub-module and a deleted alliance chain member node algorithm model sub-module;
in the newly added alliance chain member node algorithm model submodule, distinguishing according to node types comprises the following steps:
If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, an algorithm model is defined to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of the alliance chain member; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
If the member is a block chain non-consensus node, defining an algorithm model as searching the vertex type of other members closest to the member by a shortest path search algorithm of a graph as the vertex of a network relay node or a block chain consensus node according to a network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node to join a alliance chain, defining an algorithm model as searching the vertex of which any vertex type is the block chain consensus node in the member through a graph searching algorithm;
If the network relay node is the network relay node, defining an algorithm model to inquire all vertexes of the member through a graph searching algorithm according to a blockchain network connection rule specified by a consensus mechanism and a network connection strategy of a alliance chain member, wherein the vertex types in other members are vertexes of the network relay node or the blockchain consensus node;
the deletion alliance chain member node algorithm model submodule is distinguished according to node types and comprises the following steps:
If the block chain consensus node is: for the situation that the member adopts the network relay node to carry out data routing, according to the block chain network connection rule specified by the consensus mechanism, an algorithm model is defined to inquire the vertex of the member through a graph searching algorithm; for the situation that the member does not adopt the network relay node to carry out data routing, defining an algorithm model as searching the vertexes of the member through a graph searching algorithm according to the blockchain network connection rule specified by the consensus mechanism, and the vertexes of other members are vertexes of the network relay node or the blockchain consensus node;
If the node is a block chain non-consensus node, defining an algorithm model as searching the vertexes of nodes connected with the node to be deleted in other members through a graph searching algorithm according to the network connection strategy of the member of the alliance chain under the condition that the member joins the alliance chain through the non-consensus node; for the situation that the member has a block chain consensus node added into a alliance chain, defining an algorithm model as searching the vertex of the node connected with the node to be deleted in the member through a graph searching algorithm;
if the network relay node is the network relay node, defining an algorithm model to inquire the vertex of the member through a graph searching algorithm according to the block chain network connection rule specified by the consensus mechanism and the network connection strategy of the alliance chain member, wherein the vertex type in other members is the vertex of the network relay node or the block chain consensus node;
A network topology updating module: when member nodes in the alliance chain are newly added or deleted, rapidly calculating network topology needing to be newly added or deleted based on the established algorithm model;
A coalition chain network updating module: based on the newly added and deleted network topology, the network strategy is rapidly configured, and new adding and deleting instructions are sent to all nodes in the topology, and after the nodes receive the instructions, the configuration files of the nodes are updated, so that the alliance chain network updating is completed.
6. A computer device comprising a memory and a processor, the memory having stored therein computer readable instructions that, when executed by the processor, cause the processor to perform the steps of the knowledge-graph based federation chain management method of any of claims 1-4.
7. A storage medium storing computer-readable instructions that, when executed by one or more processors, cause the one or more processors to perform the steps of the knowledge-graph based federation chain management method of any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111275626.XA CN114095373B (en) | 2021-10-29 | 2021-10-29 | Knowledge graph-based alliance chain management method, system, equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111275626.XA CN114095373B (en) | 2021-10-29 | 2021-10-29 | Knowledge graph-based alliance chain management method, system, equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114095373A CN114095373A (en) | 2022-02-25 |
| CN114095373B true CN114095373B (en) | 2024-04-19 |
Family
ID=80298394
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111275626.XA Active CN114095373B (en) | 2021-10-29 | 2021-10-29 | Knowledge graph-based alliance chain management method, system, equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114095373B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116484409B (en) * | 2023-05-18 | 2023-10-10 | 青岛鑫晟汇科技有限公司 | Knowledge graph-based alliance chain block chain management system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110945853A (en) * | 2018-12-07 | 2020-03-31 | 北京大学深圳研究生院 | Method for generating and managing multimode identification network based on alliance chain voting consensus algorithm |
| CN111580841A (en) * | 2020-04-07 | 2020-08-25 | 浙商银行股份有限公司 | Dynamic upgrade service method for union chain |
| CN112506925A (en) * | 2020-12-01 | 2021-03-16 | 浙商银行股份有限公司 | Data retrieval system and method based on block chain |
| CN112511350A (en) * | 2020-12-01 | 2021-03-16 | 浙商银行股份有限公司 | Alliance chain multi-level consensus method, alliance chain multi-level consensus equipment and storage medium |
| CN112508562A (en) * | 2020-12-01 | 2021-03-16 | 浙商银行股份有限公司 | Block chain public transaction multi-level consensus method, equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20190220768A1 (en) * | 2017-05-16 | 2019-07-18 | Peking University Shenzhen Graduate School | Constructing topology for satisfying partition tolerance in consortium blockchain consensus |
-
2021
- 2021-10-29 CN CN202111275626.XA patent/CN114095373B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110945853A (en) * | 2018-12-07 | 2020-03-31 | 北京大学深圳研究生院 | Method for generating and managing multimode identification network based on alliance chain voting consensus algorithm |
| CN111580841A (en) * | 2020-04-07 | 2020-08-25 | 浙商银行股份有限公司 | Dynamic upgrade service method for union chain |
| CN112506925A (en) * | 2020-12-01 | 2021-03-16 | 浙商银行股份有限公司 | Data retrieval system and method based on block chain |
| CN112511350A (en) * | 2020-12-01 | 2021-03-16 | 浙商银行股份有限公司 | Alliance chain multi-level consensus method, alliance chain multi-level consensus equipment and storage medium |
| CN112508562A (en) * | 2020-12-01 | 2021-03-16 | 浙商银行股份有限公司 | Block chain public transaction multi-level consensus method, equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114095373A (en) | 2022-02-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111640017B (en) | Transaction correctness verification method and device applied to alliance chain cross-chain transfer | |
| Detwarasiti et al. | Influence diagrams for team decision analysis | |
| CN111478811B (en) | Network key point analysis method based on double-layer information flow transmission | |
| CN112866380B (en) | Chain network architecture based on block chain | |
| CN112511350B (en) | Alliance chain multi-level consensus method, device and storage medium | |
| Griffin | The stratified shortest-paths problem | |
| WO2021047541A1 (en) | Method and device for obtaining transaction dependency relationship in blockchain | |
| CN111625598B (en) | Engineering collaboration block chain data structure and application method | |
| KR102106590B1 (en) | Blockchain network system for Internetworking in Heterogeneous Platforms and Method for chaining Block thereof | |
| CN114095373B (en) | Knowledge graph-based alliance chain management method, system, equipment and storage medium | |
| EP1519520B1 (en) | Management node device, node device, network configuration management system, network configuration management method, node device control method, management node device control method | |
| CN112232619A (en) | Block output and sequencing method, node and block chain network system of alliance chain | |
| CN110187831A (en) | The block data storage system and method for block chain alliance chain | |
| Zhao et al. | An analysis of blockchain consistency in asynchronous networks: Deriving a neat bound | |
| CN110149335A (en) | Establish the method and apparatus of the home zone for the protection of block chain data-privacy | |
| Moskvina et al. | Togetherness: an algorithmic approach to network integration | |
| Sakavalas et al. | Network topology and fault-tolerant consensus | |
| CN113609231A (en) | Method and device for maintaining network architecture information of block chain system | |
| CN109032499A (en) | A kind of data access method of Distributed Storage, information data processing terminal | |
| Singh | Blockchain and IOT integrated Smart City Architecture | |
| Dinneen et al. | Edge-and node-disjoint paths in P systems | |
| Semertzidis et al. | A hybrid approach to temporal pattern matching | |
| CN114580661A (en) | Data processing method and device based on federal learning and computer equipment | |
| JP7294450B2 (en) | Apparatus, method and program for generating network topology | |
| CN111181830B (en) | TX increment calculation method and system based on network management L3vpn service |
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 |