Decentralized interconnection and intercommunication method, device, equipment and storage medium

Abstract

The decentralized interconnection method, device, equipment and storage medium provided by the application are applied to the technical field of communication. The method comprises the following steps: acquiring configuration information sent by a first computing node; distributing the configuration information to a secondary scheduling node in an idle state in a scheduling network; acquiring first data information fed back by the secondary scheduling node; generating a target task list according to the first data information; and sending the target task list to a second computing node, so that the second computing node performs corresponding privacy calculation processing according to the first data information. Since the primary scheduling node in the method is elected by consensus of all scheduling nodes in the scheduling network, the method can realize the decentralization of the scheduling network, and provides data security cross-domain sharing capability for each participant, and realizes collaborative management, collaborative scheduling, collaborative calculation and collaborative evidence storage in the whole process.

Description

Technical Field

[0001] This application relates to the field of communication technology, and in particular to a decentralized interconnection method, apparatus, device and storage medium. Background Technology

[0002] Cross-platform interoperability is based on the principle of ensuring the independence, integrity, and security of each privacy computing technology platform. It uses the instantiated nodes after the technology platform is installed and deployed as the basic building blocks, achieving platform connectivity through node interconnection. Building upon node connectivity, it further enables cross-platform computing tasks among multiple participants through resource connectivity and algorithm collaboration.

[0003] To meet the fundamental requirements of "loose coupling, replicability, and easy scalability" for heterogeneous interoperability, current solutions mainly include middleware-based solutions and blockchain-based solutions. Middleware-based solutions divide the privacy computing platform into a foundational layer, data layer, algorithm layer, and application layer from bottom to top; achieving interoperability between heterogeneous platforms requires alignment across all layers. Blockchain-based solutions integrate smart contract mechanisms to achieve interoperability between heterogeneous platforms.

[0004] However, middleware-based solutions require comprehensive data integration across all layers and algorithms, making this model unsuitable for large-scale interconnectivity management applications. Blockchain-based solutions rely heavily on blockchain smart contract mechanisms; if the blockchain version changes, re-integration is necessary, and network communication efficiency is limited by the blockchain network, making this model equally unsuitable for large-scale interconnectivity management applications. Summary of the Invention

[0005] This application provides a decentralized interconnection method, apparatus, device, and storage medium to address the problems of excessive reliance on smart contracts and the need for comprehensive interoperability at various levels in the prior art, which affects efficiency.

[0006] On the one hand, this application provides a decentralized interconnection method applied to a scheduling network, the scheduling network including: a primary scheduling node and secondary scheduling nodes, wherein the primary scheduling node is elected by consensus among the scheduling nodes in the scheduling network, and the primary scheduling node can be any one of the scheduling nodes. The method includes:

[0007] Obtain configuration information sent by the first computing node, wherein the configuration information is used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node;

[0008] The configuration information is assigned to secondary scheduling nodes in the scheduling network whose job status is idle.

[0009] Obtain the first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain;

[0010] Based on the first data information, generate a list of target tasks;

[0011] The target task list is sent to the second computing node, so that the second computing node performs corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list.

[0012] Optionally, before obtaining the configuration information sent by the first computing node, the method further includes:

[0013] Obtain the number M of candidate scheduling nodes in the scheduling network;

[0014] Determine whether the number of nodes M is greater than a preset number, wherein the preset number is an odd number;

[0015] If so, then a preset number of candidate scheduling nodes are selected from the M candidate scheduling nodes as scheduling nodes;

[0016] The primary scheduling node is elected from among the multiple scheduling nodes through consensus, and the other scheduling nodes are designated as secondary scheduling nodes.

[0017] Optionally, the method further includes:

[0018] When the number of nodes M is less than the preset number, determine whether the number of nodes M is an odd number;

[0019] If so, then the M candidate scheduling nodes will be used as scheduling nodes;

[0020] If not, then select M-1 candidate scheduling nodes from the M candidate scheduling nodes as scheduling nodes;

[0021] The primary scheduling node is elected from among the multiple scheduling nodes through consensus, and the other scheduling nodes are designated as secondary scheduling nodes.

[0022] Optionally, the step of consensus-electing the primary scheduling node from the plurality of scheduling nodes and designating the other scheduling nodes as secondary scheduling nodes includes:

[0023] Set a consensus election cycle, wherein the consensus election cycle is a preset duration;

[0024] According to the consensus election cycle, a primary scheduling node is elected from the plurality of scheduling nodes by consensus, and the other scheduling nodes are designated as secondary scheduling nodes. The primary scheduling node elected by consensus in two adjacent consensus election cycles is different.

[0025] Optionally, sending the target task list to the second computing node includes:

[0026] Based on the configuration information, a second computing node that is associated with the project is determined, and the second computing node includes one or more.

[0027] The list of target tasks is sent to the second computing node.

[0028] Optionally, before obtaining the configuration information sent by the first computing node, the method further includes:

[0029] Obtain second data information sent by a third computing node, wherein the third computing node is a privacy computing node to be added, and the second data information is metadata information related to the algorithm of the third computing node;

[0030] The second data information is uploaded to the blockchain and encrypted. The second computing node may be the same as or different from the third computing node.

[0031] Optionally, before obtaining the configuration information sent by the first computing node, the method further includes:

[0032] Obtain a join request sent by the first computing node, the join request being used to instruct the second computing node to be added to the project;

[0033] Send join feedback information to the first node and the second node, wherein the join feedback information is used to instruct the first computing node and the second computing node to update the node list information and the project information of the project, respectively;

[0034] Based on the join request, the node information of the first computing node and the second computing node is queried from the blockchain, and the node information is updated on the blockchain. The node information includes: node list information and project information of the project.

[0035] Secondly, this application provides a decentralized interconnection device applied to a scheduling network, the scheduling network including: a primary scheduling node and secondary scheduling nodes, wherein the primary scheduling node is elected by consensus among the scheduling nodes in the scheduling network, and the primary scheduling node can be any one of the scheduling nodes. The device includes:

[0036] The acquisition module is used to acquire configuration information sent by the first computing node, wherein the configuration information is used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node;

[0037] The allocation module is used to allocate the configuration information to secondary scheduling nodes in the scheduling network whose job status is idle.

[0038] The acquisition module is further configured to acquire first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain.

[0039] The generation module is used to generate a list of target tasks based on the first data information;

[0040] The sending module is used to send the target task list to the second computing node, so that the second computing node performs corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list.

[0041] Optionally, the device further includes: a judgment module and a processing module;

[0042] The acquisition module is also used to acquire the number M of candidate scheduling nodes in the scheduling network;

[0043] The judgment module is used to determine whether the number of nodes M is greater than a preset number, wherein the preset number is an odd number;

[0044] The processing module is used to select a preset number of candidate scheduling nodes as scheduling nodes from the M candidate scheduling nodes when the number of nodes M is greater than a preset number.

[0045] The processing module is further configured to elect the primary scheduling node from the plurality of scheduling nodes by consensus, and to designate the other scheduling nodes as secondary scheduling nodes.

[0046] Optionally, the judging module is further configured to judge whether the number of nodes M is odd when the number of nodes M is less than the preset number;

[0047] The processing module is further configured to use the M candidate scheduling nodes as scheduling nodes when the number of nodes M is odd.

[0048] The processing module is further configured to select M-1 candidate scheduling nodes as scheduling nodes from the M candidate scheduling nodes when the number of nodes M is not odd.

[0049] Optionally, the processing module is further configured to set a consensus election period, wherein the consensus election period is a preset duration;

[0050] The processing module is specifically used to elect a primary scheduling node from the plurality of scheduling nodes according to the consensus election cycle, and to designate the other scheduling nodes as secondary scheduling nodes, wherein the primary scheduling node elected in two adjacent consensus election cycles is different.

[0051] Optionally, the device further includes: a determining module;

[0052] The determining module is used to determine, based on the configuration information, a second computing node that is associated with the project, wherein the second computing node includes one or more.

[0053] Optionally, the acquisition module is further configured to acquire second data information sent by the third computing node, wherein the third computing node is a privacy computing node to be added, and the second data information is metadata information related to the algorithm of the third computing node;

[0054] The processing module is further configured to upload the second data information to the blockchain and encrypt the second data information, wherein the second computing node may be the same as or different from the third computing node.

[0055] Optionally, the device further includes: a query module and an update module;

[0056] The acquisition module is further configured to acquire a join request sent by the first computing node, the join request being used to instruct the second computing node to be added to the project;

[0057] The query module is used to query the node information of the first computing node and the second computing node from the blockchain according to the join request;

[0058] The update module is used to update the node information on the blockchain, the node information including: node list information and project information of the project.

[0059] Thirdly, this application provides a decentralized interconnection device, comprising:

[0060] Memory;

[0061] processor;

[0062] The memory stores computer-executed instructions;

[0063] The processor executes computer execution instructions stored in the memory to implement the decentralized interconnection method as described in the first aspect and various possible implementations of the first aspect above.

[0064] Fourthly, this application provides a computer storage medium storing computer execution instructions thereon, which are executed by a processor to implement the decentralized interconnection method as described in the first aspect and various possible implementations of the first aspect above.

[0065] The decentralized interconnection method provided in this application involves: acquiring configuration information sent by a first computing node, wherein the configuration information indicates the configuration status of the privacy computing job of the project corresponding to the first computing node; allocating the configuration information to secondary scheduling nodes in the scheduling network whose job status is idle; acquiring first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain; generating a target task list based on the first data information; and sending the target task list to a second computing node, wherein the second computing node is a computing node associated with the target task list. Since the primary scheduling node in this method is elected through consensus among all scheduling nodes in the scheduling network, the scheduling network can be decentralized. Furthermore, this method provides secure cross-domain data sharing capabilities for all participants, realizing full-process collaborative management, collaborative scheduling, collaborative computing, and collaborative evidence storage. Attached Figure Description

[0066] The accompanying drawings, which are incorporated in and form part of this specification, illustrate embodiments consistent with this application and, together with the description, serve to explain the principles of this application.

[0067] Figure 1 This is a schematic diagram illustrating a scenario of the decentralized interconnection method provided in this application.

[0068] Figure 2 This application provides a process for a decentralized interconnection method. Figure 1 .

[0069] Figure 3 This application provides a process for a decentralized interconnection method. Figure 2 .

[0070] Figure 4 This application provides a process for a decentralized interconnection method. Figure 3 .

[0071] Figure 5 This is a schematic diagram of the decentralized interconnection device provided in this application.

[0072] Figure 6 This is a schematic diagram of the decentralized interconnection device provided in this application.

[0073] The accompanying drawings have illustrated specific embodiments of this application, which will be described in more detail below. These drawings and descriptions are not intended to limit the scope of the concept in any way, but rather to illustrate the concept of this application to those skilled in the art through reference to specific embodiments. Detailed Implementation

[0074] To make the objectives, technical solutions, and advantages of this application clearer, the technical solutions of this application will be clearly and completely described below with reference to the accompanying drawings. Obviously, the described embodiments are only some embodiments of this application, not all embodiments. Based on the embodiments of this application, all other embodiments obtained by those skilled in the art without creative effort are within the scope of protection of this application.

[0075] The terms "first," "second," "third," "fourth," etc. (if present) in the specification, claims, and accompanying drawings of this invention are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It should be understood that such data can be interchanged where appropriate so that embodiments of the invention described herein can be implemented, for example, in orders other than those illustrated or described herein.

[0076] In this application, the terms "exemplary" or "for example" are used to indicate examples, illustrations, or descriptions. Any embodiment or design described as "exemplary" or "for example" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a concrete manner.

[0077] First, the terms used in this application will be explained.

[0078] Interconnection: This refers to the physical connection between telecommunications networks. Interconnection enables users of a telecommunications operator to communicate with users of other telecommunications operators, or allows users of a telecommunications operator to enjoy various telecommunications services provided by other telecommunications operators.

[0079] Blockchain: A chain of blocks. Each block contains corresponding information, and the blocks are linked together in chronological order of their creation. The blockchain is stored on all servers, and as long as there are normally functioning servers in the system, the entire blockchain is secure. Servers in a blockchain system are called nodes, and each server node provides storage space and computing power for the entire blockchain system. To modify information in the blockchain, the consent of more than half of the nodes must be obtained, and the information in all nodes must be modified. These nodes are usually controlled by different entities, making it extremely difficult to tamper with information in the blockchain.

[0080] Privacy-preserving computation refers to a set of techniques for performing data analysis and computation while protecting the data itself from external disclosure, achieving the goal of making the data "usable but not visible." It aims to transform and release the value of data while fully protecting data and privacy security. Privacy-preserving computation is a computational theory and method for protecting privacy information throughout its entire lifecycle. It is a computable model and axiomatic system for privacy measurement, the cost of privacy leakage, and the complexity of privacy protection and analysis when the ownership, management, and usage rights of privacy information are separated.

[0081] In the current context, cross-platform interoperability for privacy computing must first and foremost be based on ensuring the independence, integrity, and security of each privacy computing technology platform. While preserving the unique design characteristics of each platform, cross-platform interoperability should use the instantiated nodes after the technology platform is installed and deployed as the basic building blocks, achieving platform connectivity through node connectivity. Building upon node connectivity, resource connectivity and algorithm collaboration will ultimately enable cross-platform computing tasks among multiple participants.

[0082] To meet the basic requirements of "loose coupling, replicability, and easy scalability" for heterogeneous interoperability, current solutions mainly include middleware-based solutions and blockchain-based solutions.

[0083] 1) Middleware-based solution: The privacy computing platform is divided into a foundation layer, a data layer, an algorithm layer, and an application layer from bottom to top; the foundation layer ensures the uniformity of communication protocols, task scheduling, and task status synchronization; the data layer ensures that the data encryption mechanisms, security parameters, and other metadata of all parties are consistent, and that the encryption, decryption, and exchange order standards are unified; the algorithm layer ensures the uniformity of algorithm protocols; and the application layer ensures that the algorithm application parameter settings of all parties are the same.

[0084] 2) Blockchain-based solution: Integrating smart contract mechanisms, privacy nodes are logically divided into initiators, data providers, algorithm providers, and result providers based on their roles. The initiator, as the task requester, starts the computation task and issues the task through a smart contract. After listening to the task event, the participants perform collaborative computation, execute according to the algorithm's computation logic, and issue the execution process data through a smart contract. Each participant performs collaborative computation by listening to contract events and calling contract interfaces. The result provider summarizes the execution status and intermediate results of the computation through a smart contract to complete the computation task.

[0085] However, middleware-based solutions require comprehensive integration of the foundation layer, data layer, algorithm layer, and application layer. This necessitates various integrations such as message reconstruction of algorithm data, task event forwarding, and task status synchronization. From the perspective of communication networks for privacy computing interconnection, this model is not suitable for large-scale interconnection management applications.

[0086] Blockchain-based solutions rely too heavily on smart contract mechanisms. Interoperability between privacy computing platforms requires integration with smart contract rules. If the blockchain version changes, re-integration is necessary. Network communication efficiency is limited by the blockchain network. From the perspective of communication networks for privacy computing interoperability, this model is also unsuitable for large-scale interoperability management applications.

[0087] To address the problems existing in the prior art, this application proposes a decentralized interconnection method. This method takes the interconnection between various communication service components as the criterion, and forms collaborative authentication, collaborative supervision, collaborative scheduling, and collaborative evidence storage for various service modules, thereby realizing a secure, flexible, and diverse integrated interconnection device.

[0088] Figure 1 A schematic diagram illustrating a scenario for the decentralized interconnection method provided in this application. For example... Figure 1 As shown, the network topology of this method consists of a distributed authentication node network, a distributed scheduling network, a blockchain network, and a privacy computing network. The distributed authentication node network comprises CA authentication nodes, the distributed scheduling network comprises scheduling nodes, the blockchain network comprises blocks, and the privacy computing network comprises computing nodes. Each computing node includes a control panel, a data panel, a storage panel, and a channel panel. The control panel is used to standardize node resources, task scheduling, data information, and statistical analysis; the data panel is used to standardize the programmed computation process executed within the computing node; the storage panel is responsible for storage; and the channel panel is used for information exchange. The distributed authentication node network, distributed scheduling network, blockchain network, and privacy computing network are interconnected, enabling data sharing and interaction.

[0089] The network initialization steps include: the regulatory authority providing the CA root node; the regulatory authority initializing the distributed authentication node network, with the CA root node proving the legitimacy of the CA authentication nodes in the distributed authentication node network; initializing the blockchain network and related contracts; initializing the distributed digital identity; and initializing the distributed scheduling network.

[0090] The distributed authentication node network is used to oversee the distributed scheduling network, blockchain network, and privacy computing network, and to prove the legitimacy of nodes in the network. The blockchain network is used to manage the distributed digital identities of scheduling nodes and computing nodes, as well as the data flow of computing nodes. The completion status of scheduling tasks in the distributed scheduling network must also be stored on the blockchain network. The distributed scheduling network is used to obtain the scheduling information of computing nodes and to trigger scheduling nodes to perform scheduling jobs through this information. Each computing node in the privacy computing network is managed through the above network. When a scheduling task is sent to multiple computing nodes, each computing node simultaneously generates a scheduling job and communicates according to the corresponding process until the scheduling job is completed. The CA root node is used to prove the legitimacy of CA authentication nodes in the distributed authentication node network.

[0091] The decentralized interconnection method provided in this application is applied to... Figure 1 The scheduling network shown in this embodiment includes a primary scheduling node and secondary scheduling nodes. The primary scheduling node can be any one of all scheduling nodes in the network, and it can be elected through consensus among all scheduling nodes. After obtaining the configuration information of a first computing node, the primary scheduling node distributes this configuration information to other secondary scheduling nodes. These secondary nodes then query the blockchain for first data information corresponding to the configuration information. Upon obtaining the first data information, the primary scheduling node generates a target task list and sends it to a second computing node associated with that list. The second computing node then performs corresponding privacy-preserving computation based on the first data information in the target task list. Because the primary scheduling node is elected through consensus among all scheduling nodes in the network, the scheduling network is decentralized. Furthermore, this method provides secure cross-domain data sharing capabilities for all participants, achieving end-to-end collaborative management, scheduling, computation, and evidence storage.

[0092] The technical solution of this application and how the technical solution of this application solves the above-mentioned technical problems are described in detail below with specific embodiments. These specific embodiments can be combined with each other, and the same or similar concepts or processes may not be described again in some embodiments. The embodiments of this application will be described below with reference to the accompanying drawings.

[0093] Figure 2This is the flow of the decentralized interconnection method provided in the embodiments of this application. Figure 1 This embodiment is applied to a scheduling network, which includes a primary scheduling node and secondary scheduling nodes. The primary scheduling node is elected by consensus among the scheduling nodes in the scheduling network, and can be any one of the scheduling nodes. Figure 2 As shown in this embodiment, the decentralized interconnection method includes:

[0094] S101: Obtain configuration information sent by the first computing node, the configuration information being used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node.

[0095] The first computing node can be, for example, Figure 1 Any computing node in the privacy computing network of this embodiment. Each computing node's storage panel stores configuration information for the privacy computing job of the corresponding project; the configuration information may include, for example, the node list information of the first computing node and the project information of the project.

[0096] The compute nodes can send the above configuration information to the distributed scheduling network. The main scheduling node in the distributed scheduling network obtains the configuration information so that it can perform the corresponding scheduling operations.

[0097] S102: Distribute the configuration information to secondary scheduling nodes in the scheduling network whose job status is idle.

[0098] In a distributed scheduling network, the job status of a secondary scheduling node can include, for example, an idle state and a busy state. When a secondary scheduling node is executing a scheduling task, its job status is busy; when a secondary scheduling node is not executing a scheduling task, its job status is idle.

[0099] After obtaining the configuration information, the primary scheduling node queries the secondary scheduling nodes in the distributed scheduling network whose job status is idle. Based on the number of secondary scheduling nodes in the idle state, the scheduling information is randomly split into multiple scheduling information as the number of secondary scheduling nodes, and the split scheduling information is randomly assigned to the secondary scheduling nodes in the idle state.

[0100] S103: Obtain the first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain.

[0101] The first data information is related to the configuration information, and the first data information is used to indicate the metadata information of the computing nodes that are related to the above-mentioned projects.

[0102] After receiving the scheduling information assigned by the primary scheduling node, the secondary scheduling node queries and downloads the corresponding first data information from the blockchain, and then sends this first data information back to the primary scheduling node. The primary scheduling node receives first data information from multiple secondary scheduling nodes.

[0103] Understandably, because the scheduling information is randomly distributed among multiple secondary scheduling nodes, each secondary scheduling node receives different data. That is, each secondary scheduling node retrieves the corresponding data from the blockchain based on its assigned scheduling information and feeds this data back to the primary scheduling node. The primary scheduling node then obtains the initial data information by combining the data from the multiple secondary scheduling nodes.

[0104] S104: Generate a target task list based on the first data information.

[0105] The target task list includes the identifiers of computing nodes that are related to the first data information and the temporal sequence of the computing tasks. For example, the target task list can be a task list with a DAG structure. A DAG is a directed acyclic graph structure that, compared to the single-chain structure of traditional blockchains, allows for asynchronous and concurrent scheduling of tasks.

[0106] After obtaining the first data information, the main scheduling node in the distributed scheduling network can generate a corresponding list of target tasks based on the first data information.

[0107] S105: The target task list is sent to the second computing node so that the second computing node performs corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list.

[0108] The second computing node can be determined, for example, based on the first data information. The second computing node is associated with the target task list. It is understood that the first data information is used to indicate the metadata information of the computing nodes associated with the aforementioned projects, and the computing nodes associated with the projects are the second computing nodes. That is, the first data information is used to indicate the algorithm metadata information involved in the second computing node.

[0109] In this step, the purpose of sending the target task list to the second computing node is to enable the second computing node, which is related to the project, to execute the corresponding privacy algorithm processing based on the algorithm metadata information involved.

[0110] The decentralized interconnection method provided in this embodiment obtains configuration information sent by a first computing node, which indicates the configuration status of the privacy computing job of the project corresponding to the first computing node; allocates the configuration information to a secondary scheduling node in the scheduling network whose job status is idle; obtains first data information fed back by the secondary scheduling node, which is obtained by the secondary scheduling node from the blockchain; generates a target task list based on the first data information; and sends the target task list to a second computing node, so that the second computing node performs the corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list. Since the primary scheduling node in this method is elected through consensus among all scheduling nodes in the scheduling network, the scheduling network can be decentralized. Furthermore, this method provides data security cross-domain sharing capabilities for all participants, realizing full-process collaborative management, collaborative scheduling, collaborative computing, and collaborative evidence storage.

[0111] Figure 3 This is the flow of the decentralized interconnection method provided in the embodiments of this application. Figure 2 This embodiment is... Figure 2 Based on the implementation examples, the decentralized interconnection method will be described in detail.

[0112] like Figure 3 As shown in this embodiment, the decentralized interconnection method includes:

[0113] S201: Obtain the number M of candidate scheduling nodes in the scheduling network.

[0114] The distributed scheduling network includes scheduling nodes currently participating in scheduling and scheduling nodes not currently participating in scheduling. Candidate scheduling nodes are the scheduling nodes currently participating in scheduling within the distributed scheduling network. The number M of candidate scheduling nodes can be the same as or different from the total number of nodes in the distributed scheduling network; that is, the distributed scheduling network can include scheduling nodes currently participating in scheduling and scheduling nodes not currently participating in scheduling, or it can only include scheduling nodes currently participating in scheduling.

[0115] The purpose of obtaining the number of candidate scheduling nodes in a distributed scheduling network is to select the primary scheduling node based on the candidate scheduling nodes in subsequent steps.

[0116] S202: Determine whether the number of nodes M is greater than the preset number; if yes, proceed to step S203; if no, proceed to step S204.

[0117] In this context, before selecting scheduling nodes and secondary scheduling nodes, the distributed scheduling network presets the number of scheduling nodes required to complete the target scheduling task. This preset number may be the same as or different from the total number of scheduling nodes in the distributed scheduling network, and for example, it may be an odd number.

[0118] Understandably, determining whether the number of candidate scheduling nodes M is greater than a preset number is the first step in the distributed scheduling network's selection of scheduling nodes. Subsequent determinations are divided into two cases: the number of candidate scheduling nodes M is greater than the preset number, and the number of candidate scheduling nodes M is less than the preset number. The distributed scheduling network further selects scheduling nodes in both of these cases.

[0119] S203: Select a preset number of candidate scheduling nodes from the M candidate scheduling nodes as scheduling nodes.

[0120] If the number of nodes M is greater than a preset number, it indicates that the number of scheduling nodes currently participating in the scheduling in the distributed scheduling network is greater than the preset number. In this case, a preset number of candidate scheduling nodes can be selected from the M candidate scheduling nodes as the scheduling nodes. This can be understood as follows: for example, the preset number of candidate scheduling nodes can be randomly selected, or a preset number of candidate scheduling nodes with better performance can be selected as the scheduling nodes based on their performance.

[0121] S204: Determine whether the number of nodes M is odd; if yes, proceed to step S205; if no, proceed to step S206.

[0122] If the number of nodes M is less than the preset number, it indicates that the number of scheduling nodes currently participating in the scheduling in the distributed scheduling network has not reached the preset number. In this case, it is necessary to determine whether the number of candidate scheduling nodes M is odd. The purpose of this step is to ensure that the number of determined scheduling nodes is odd, thereby avoiding a tie in the subsequent consensus election of the main scheduling node, that is, to elect a single main scheduling node through the election.

[0123] S205: Select the M candidate scheduling nodes as scheduling nodes.

[0124] If the number M of candidate scheduling nodes is odd, then all M candidate scheduling nodes can be used as scheduling nodes.

[0125] S206: Select M-1 candidate scheduling nodes from the M candidate scheduling nodes as scheduling nodes.

[0126] If the number of candidate scheduling nodes M is not odd, then all M candidate scheduling nodes cannot be selected as scheduling nodes. This is because if all M candidate scheduling nodes are selected as scheduling nodes, it will lead to a tie in the subsequent consensus election of the main scheduling node, resulting in two main scheduling nodes.

[0127] Therefore, M-1 candidate scheduling nodes can be selected as scheduling nodes to ensure that there is no tie in the election of the primary scheduling node during consensus. Understandably, the specific implementation of selecting M-1 candidate scheduling nodes from M candidate scheduling nodes can be, for example, randomly selecting M-1 candidate scheduling nodes, or selecting M-1 candidate scheduling nodes with better performance based on their performance.

[0128] S207: Elect the primary scheduling node from the plurality of scheduling nodes by consensus, and designate the other scheduling nodes as secondary scheduling nodes.

[0129] Consensus election can be conducted periodically, with a primary scheduling node elected at the end of each period. This election period can be, for example, 5 minutes. Every scheduling node in the distributed scheduling network has the potential to become the primary scheduling node.

[0130] The primary scheduling node is determined by Raft consensus election among the scheduling nodes in the distributed scheduling network. This primary scheduling node is used to communicate with the distributed computing network, store all scheduling job information on the blockchain, and store the computation results of the distributed computing network on the blockchain.

[0131] Once a primary scheduling node is elected through consensus, the other scheduling nodes become secondary scheduling nodes. The relationship between the primary and secondary scheduling nodes can be understood as that of a "general" and "pawns." However, in this distributed scheduling network, the "general" rotates according to the consensus election cycle.

[0132] The purpose of this step is to enable the scheduling nodes in the distributed scheduling network to decide the leader of the network themselves, thereby achieving a decentralized effect.

[0133] Optionally, this step can be implemented as follows: setting a consensus election cycle; electing a primary scheduling node from among the multiple scheduling nodes according to the consensus election cycle, and designating the other scheduling nodes as secondary scheduling nodes.

[0134] The consensus election period can be determined by the scheduling nodes in the distributed scheduling network, and the consensus election period can be a preset duration.

[0135] The primary scheduling node elected in two adjacent consensus election cycles is different. A new primary scheduling node is elected in each cycle, and every scheduling node has the opportunity to participate in the consensus election.

[0136] Optionally, after all scheduling nodes in the distributed scheduling network have been elected through consensus, a preset number of new scheduling nodes can be reselected from all candidate scheduling nodes in the distributed scheduling network, and a new primary scheduling node can be selected from these preset number of new scheduling nodes.

[0137] Understandably, the consensus election period is set to five minutes. After this period ends, the distributed scheduling network re-elects a primary scheduling node. If a scheduling node fails to complete the scheduling task for the corresponding project within the consensus election period, the primary scheduling node within that election period must package the execution information of the scheduling task and send it to the newly elected primary scheduling node to complete the scheduling task.

[0138] S208: Obtain configuration information sent by the first computing node, wherein the configuration information is used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node.

[0139] S209: Assign the configuration information to secondary scheduling nodes in the scheduling network whose job status is idle.

[0140] S210: Obtain the first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain.

[0141] S211: Generate a target task list based on the first data information.

[0142] Steps S208-S211 are similar to steps S101-S104 above, and will not be repeated here.

[0143] S212: Based on the configuration information, determine the second computing node that is associated with the project.

[0144] The second computing node may include one or more nodes, and may be determined based on the first data information. The second computing node is associated with the target task list. It is understood that the first data information is used to indicate the metadata information of the computing nodes associated with the aforementioned projects, and the computing nodes associated with the projects are the second computing nodes. That is, the first data information is used to indicate the metadata information of the algorithms involved in the second computing node. The second computing node may or may not include the first computing node.

[0145] S213: Send the target task list to the second computing node.

[0146] In this step, the purpose of sending the target task list to the second computing node is to enable the second computing node, which is related to the project, to execute the corresponding privacy algorithm processing based on the algorithm metadata information involved.

[0147] The decentralized interconnection method provided in this embodiment achieves decentralization of the distributed scheduling network by having the scheduling nodes in the distributed scheduling network elect a master scheduling node as the leader of the distributed scheduling network to execute scheduling tasks through consensus. At the same time, it ensures the flexibility and diversity of distributed scheduling network management. Furthermore, through the interaction between the distributed scheduling network and the distributed computing network, it provides all participants with the ability to share data securely across domains, realizing collaborative management, collaborative scheduling, and collaborative computing throughout the entire process.

[0148] Figure 4 This is the flow of the decentralized interconnection method provided in the embodiments of this application. Figure 3 This embodiment is... Figure 1 Based on Example 1 or Example 2, the specific implementation method of adding computing nodes to the project is described in detail. For example... Figure 4 As shown in this embodiment, the decentralized interconnection method includes:

[0149] S301: Obtain the second data information sent by the third computing node, wherein the third computing node is a privacy computing node to be added, and the second data information is metadata information related to the algorithm of the third computing node.

[0150] When a third computing node wants to join the distributed computing network, it needs to use its own distributed digital identity information to send registration information to the distributed scheduling network. This registration information includes metadata information related to all the algorithms of the third computing node, which is also known as second data information.

[0151] Understandably, a third computing node can contain... Figure 2 or Figure 3 The second computing node in the embodiment may also not include this second computing node.

[0152] S302: Upload the second data information to the blockchain and encrypt the second data information.

[0153] After the distributed scheduling network obtains the second data information from the third computing node, it needs to encrypt and store the second data information on the blockchain.

[0154] Understandably, this step could be performed by, for example, the primary scheduling node elected through consensus in the current distributed scheduling network. The primary scheduling node uploads the second data information to the blockchain, using the distributed digital identity of the third computing node as the key. The second data information includes: metadata about the algorithm, a list of participating nodes, node information, and metadata about the data source. When executing the scheduling job for a corresponding project, the scheduling node can query this second data information to generate a list of target tasks.

[0155] S303: Obtain a join request sent by the first computing node, the join request being used to instruct the second computing node to be added to the project.

[0156] The second computing node is at least one of the aforementioned third computing nodes, and the second computing node includes the first computing node.

[0157] The second computing node sends a verification code to the first computing node, which then verifies the verification code through its node management module. Upon successful verification, the first computing node sends a join request message to the primary scheduling node in the distributed scheduling network.

[0158] S304: Send join feedback information to the first computing node and the second computing node, wherein the join feedback information is used to instruct the first computing node and the second computing node to update the node list information and the project information of the project respectively;

[0159] The distributed scheduling network receives the join request messages from the first computing node and the second computing node, triggering the node management modules of the first computing node and the second computing node to simultaneously update the list information and project information of the first computing node and the second computing node, thereby realizing collaborative authentication and collaborative governance.

[0160] S305: Based on the joining request, query the node information of the first computing node and the second computing node from the blockchain, and update the node information on the blockchain. The node information includes: node list information and project information of the project.

[0161] The distributed scheduling network updates the node list information and project information of the first computing node and the second computing node on the blockchain. If the distributed scheduling network subsequently receives a request to join other computing nodes included in the project, the execution steps are as described in S303-S305 above.

[0162] The decentralized interconnection method provided in this embodiment adds computer nodes to the corresponding project tasks through a distributed scheduling network and stores the corresponding data information on the blockchain, ensuring the security of the data of each participant. Furthermore, due to data sharing, communication efficiency is improved, realizing collaborative management, collaborative authentication, and collaborative governance throughout the entire process.

[0163] Figure 5 This is a schematic diagram of the decentralized interconnection device provided in this application. The device is applied to a scheduling network, which includes a primary scheduling node and secondary scheduling nodes. The primary scheduling node is elected through consensus among the scheduling nodes in the scheduling network, and can be any one of the scheduling nodes. Figure 5 As shown, this application provides a decentralized interconnection device, the decentralized interconnection device 400 comprising:

[0164] The acquisition module 401 is used to acquire configuration information sent by the first computing node, wherein the configuration information is used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node;

[0165] Allocation module 402 is used to allocate the configuration information to secondary scheduling nodes in the scheduling network whose job status is idle.

[0166] The acquisition module 401 is further configured to acquire first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain.

[0167] The generation module 403 is used to generate a target task list based on the first data information;

[0168] The sending module 404 is used to send the target task list to the second computing node, so that the second computing node performs corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list.

[0169] Optionally, the device further includes: a judgment module 405 and a processing module 406;

[0170] The acquisition module 401 is also used to acquire the number M of candidate scheduling nodes in the scheduling network;

[0171] The judgment module 405 is used to determine whether the number of nodes M is greater than a preset number, wherein the preset number is an odd number;

[0172] The processing module 406 is used to select a preset number of candidate scheduling nodes as scheduling nodes from the M candidate scheduling nodes when the number of nodes M is greater than a preset number.

[0173] The processing module 406 is further configured to elect the primary scheduling node from the plurality of scheduling nodes by consensus, and to designate the other scheduling nodes as secondary scheduling nodes.

[0174] Optionally, the judgment module 405 is further configured to determine whether the number of nodes M is odd when the number of nodes M is less than the preset number;

[0175] The processing module 406 is further configured to use the M candidate scheduling nodes as scheduling nodes when the number of nodes M is odd.

[0176] The processing module 406 is further configured to select M-1 candidate scheduling nodes as scheduling nodes from the M candidate scheduling nodes when the number of nodes M is not odd.

[0177] Optionally, the processing module 406 is further configured to set a consensus election period, wherein the consensus election period is a preset duration;

[0178] The processing module 406 is specifically used to elect a primary scheduling node from the plurality of scheduling nodes according to the consensus election cycle, and to use the other scheduling nodes as secondary scheduling nodes, wherein the primary scheduling node elected in two adjacent consensus election cycles is different.

[0179] Optionally, the device further includes: a determining module 407;

[0180] The determining module 407 is used to determine, based on the configuration information, a second computing node that is associated with the project, wherein the second computing node includes one or more.

[0181] Optionally, the acquisition module 401 is further configured to acquire second data information sent by the third computing node, wherein the third computing node is a privacy computing node to be added, and the second data information is metadata information related to the algorithm of the third computing node;

[0182] The processing module 406 is further configured to upload the second data information to the blockchain and encrypt the second data information, wherein the second computing node is the same as or different from the third computing node.

[0183] Optionally, the device further includes: a query module 408 and an update module 409;

[0184] The acquisition module 401 is further configured to acquire a join request sent by the first computing node, the join request being used to instruct the second computing node to be added to the project;

[0185] The query module 408 is used to query the node information of the first computing node and the second computing node from the blockchain according to the join request;

[0186] The update module 409 is used to update the node information on the blockchain, the node information including: node list information and project information of the project.

[0187] Figure 6 A schematic diagram of the decentralized interconnection device provided in this application. (See diagram below.) Figure 6 As shown, this application provides a decentralized interconnection device 500, which includes a receiver 501, a transmitter 502, a processor 503, and a memory 504.

[0188] Receiver 501 is used to receive instructions and data;

[0189] Transmitter 502 is used to send commands and data;

[0190] Memory 504 is used to store instructions executed by the computer;

[0191] Processor 503 is used to execute computer execution instructions stored in memory 504 to implement the various steps performed by the decentralized interconnection method in the above embodiments. For details, please refer to the relevant descriptions in the foregoing embodiments of the decentralized interconnection method.

[0192] Alternatively, the memory 504 can be either standalone or integrated with the processor 503.

[0193] When the memory 504 is set up independently, the electronic device also includes a bus for connecting the memory 504 and the processor 503.

[0194] This application also provides a computer-readable storage medium storing computer-executable instructions, which, when executed by a processor, implement the decentralized interconnection method performed by the decentralized interconnection device described above.

[0195] It will be understood by those skilled in the art that all or some of the steps, systems, or apparatuses disclosed above, and their functional modules / units, can be implemented as software, firmware, hardware, or suitable combinations thereof. In hardware implementations, the division between functional modules / units mentioned in the above description does not necessarily correspond to the division of physical components; for example, a physical component may have multiple functions, or a function or step may be performed collaboratively by several physical components. Some or all physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application-specific integrated circuit (ASIC). Such software may be distributed on a computer-readable medium, which may include computer storage media (or non-transitory media) and communication media (or transient media). As is known to those skilled in the art, the term computer storage media includes volatile and non-volatile, removable and non-removable media implemented in any method or technology for storing information (such as computer-readable instructions, data structures, program modules, or other data). Computer storage media include, but are not limited to, RAM, ROM, EEPROM, flash memory or other memory technologies, CD-ROM, digital versatile disc (DVD) or other optical disc storage, magnetic cartridges, magnetic tape, disk storage or other magnetic storage devices, or any other medium that can be used to store desired information and can be accessed by a computer. Furthermore, it is well known to those skilled in the art that communication media typically contain computer-readable instructions, data structures, program modules, or other data in modulated data signals such as carrier waves or other transmission mechanisms, and may include any information delivery medium.

[0196] The technical solutions of this application have been described above with reference to the preferred embodiments shown in the accompanying drawings. However, it is readily understood by those skilled in the art that the scope of protection of this application is obviously not limited to these specific embodiments. The above embodiments are only used to illustrate the technical solutions of this application and are not intended to limit them. Although this application has been described in detail with reference to the foregoing embodiments, those skilled in the art should understand that modifications can still be made to the technical solutions described in the foregoing embodiments, or equivalent substitutions can be made to some or all of the technical features therein. These modifications or substitutions do not cause the essence of the corresponding technical solutions to deviate from the scope of the technical solutions of the embodiments of this application.

Claims

1. A decentralized interconnection method, characterized in that, The method is applied to a scheduling network, which includes a primary scheduling node and secondary scheduling nodes. The primary scheduling node is elected by consensus among the scheduling nodes in the scheduling network, and the primary scheduling node can be any one of the scheduling nodes. Obtain configuration information sent by the first computing node, wherein the configuration information is used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node; The configuration information is assigned to secondary scheduling nodes in the scheduling network whose job status is idle. Obtain the first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain; Based on the first data information, generate a list of target tasks; The target task list is sent to the second computing node, so that the second computing node performs corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list.

2. The method according to claim 1, characterized in that, Before obtaining the configuration information sent by the first computing node, the method further includes: Obtain the number M of candidate scheduling nodes in the scheduling network; Determine whether the number of nodes M is greater than a preset number, wherein the preset number is an odd number; If so, then a preset number of candidate scheduling nodes are selected from the M candidate scheduling nodes as scheduling nodes; The primary scheduling node is elected from among the scheduling nodes through consensus, and the other scheduling nodes are designated as secondary scheduling nodes.

3. The method according to claim 2, characterized in that, The method further includes: When the number of nodes M is less than the preset number, determine whether the number of nodes M is an odd number; If so, then the M candidate scheduling nodes will be used as scheduling nodes; If not, then select M-1 candidate scheduling nodes from the M candidate scheduling nodes as scheduling nodes; The primary scheduling node is elected from among the scheduling nodes through consensus, and the other scheduling nodes are designated as secondary scheduling nodes.

4. The method according to claim 2 or 3, characterized in that, The process of consensus-electing the primary scheduling node from the scheduling nodes and designating the other scheduling nodes as secondary scheduling nodes includes: Set a consensus election cycle, wherein the consensus election cycle is a preset duration; According to the consensus election cycle, a primary scheduling node is elected from the plurality of scheduling nodes by consensus, and the other scheduling nodes are designated as secondary scheduling nodes. The primary scheduling node elected by consensus in two adjacent consensus election cycles is different.

5. The method according to claim 1, characterized in that, Sending the target task list to the second computing node includes: Based on the configuration information, a second computing node that is associated with the project is determined, and the second computing node includes one or more. The list of target tasks is sent to the second computing node.

6. The method according to claim 1, characterized in that, Before obtaining the configuration information sent by the first computing node, the method further includes: Obtain second data information sent by a third computing node, wherein the third computing node is a privacy computing node to be added, and the second data information is metadata information related to the algorithm of the third computing node; The second data information is uploaded to the blockchain and encrypted. The second computing node may be the same as or different from the third computing node.

7. The method according to claim 6, characterized in that, Before obtaining the configuration information sent by the first computing node, the method further includes: Obtain a join request sent by the first computing node, the join request being used to instruct the second computing node to be added to the project; Send join feedback information to the first computing node and the second computing node, wherein the join feedback information is used to instruct the first computing node and the second computing node to update the node list information and the project information of the project, respectively; Based on the join request, the node information of the first computing node and the second computing node is queried from the blockchain, and the node information is updated on the blockchain. The node information includes: node list information and project information of the project.

8. A decentralized interconnection device, characterized in that, An apparatus applied to a scheduling network, the scheduling network comprising: a primary scheduling node and secondary scheduling nodes, wherein the primary scheduling node is elected by consensus among the scheduling nodes in the scheduling network, and the primary scheduling node can be any one of the scheduling nodes; the apparatus comprises: The acquisition module is used to acquire configuration information sent by the first computing node, wherein the configuration information is used to indicate the configuration status of the privacy computing job of the project corresponding to the first computing node; The allocation module is used to allocate the configuration information to secondary scheduling nodes in the scheduling network whose job status is idle. The acquisition module is further configured to acquire first data information fed back by the secondary scheduling node, wherein the first data information is obtained by the secondary scheduling node from the blockchain. The generation module is used to generate a list of target tasks based on the first data information; The sending module is used to send the target task list to the second computing node, so that the second computing node performs corresponding privacy computing processing based on the first data information. The second computing node is a computing node that is associated with the target task list.

9. A decentralized interconnection device, characterized in that, include: Memory; processor; The memory stores computer-executed instructions; The processor executes computer execution instructions stored in the memory to implement the decentralized interconnection method as described in any one of claims 1-7.

10. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer-executable instructions, which, when executed by a processor, are used to implement the decentralized interconnection method as described in any one of claims 1-7.

Images