CN111028902A - Request processing method, device, equipment and medium based on node switching - Google Patents
Request processing method, device, equipment and medium based on node switching Download PDFInfo
- Publication number
- CN111028902A CN111028902A CN201911249550.6A CN201911249550A CN111028902A CN 111028902 A CN111028902 A CN 111028902A CN 201911249550 A CN201911249550 A CN 201911249550A CN 111028902 A CN111028902 A CN 111028902A
- Authority
- CN
- China
- Prior art keywords
- node
- main
- standby
- master node
- master
- 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.)
- Withdrawn
Links
Images
Classifications
-
- G—PHYSICS
- G16—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR SPECIFIC APPLICATION FIELDS
- G16H—HEALTHCARE INFORMATICS, i.e. INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR THE HANDLING OR PROCESSING OF MEDICAL OR HEALTHCARE DATA
- G16H10/00—ICT specially adapted for the handling or processing of patient-related medical or healthcare data
- G16H10/20—ICT specially adapted for the handling or processing of patient-related medical or healthcare data for electronic clinical trials or questionnaires
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/1658—Data re-synchronization of a redundant component, or initial sync of replacement, additional or spare unit
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/1675—Temporal synchronisation or re-synchronisation of redundant processing components
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Quality & Reliability (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Health & Medical Sciences (AREA)
- Epidemiology (AREA)
- General Health & Medical Sciences (AREA)
- Medical Informatics (AREA)
- Primary Health Care (AREA)
- Public Health (AREA)
- Hardware Redundancy (AREA)
Abstract
The disclosure relates to a request processing method and device based on node switching, an electronic device and a storage medium, relates to the technical field of block chains, and can be applied to a scene of data management based on the block chain technology. The request processing based on node switching is applied to a standby main node in a target alliance chain, and comprises the following steps: receiving a service request sent by a client and acquiring the running state of a main host node; judging whether the main host node fails or not; if yes, upgrading to a new main master node to process the service request, and determining a new standby master node from the nodes of the target alliance chain. According to the method, when the main node of the block chain fails, the standby main node can be upgraded to the main node, and a new standby main node is selected; in addition, when the standby main node fails, the main node can initiate election broadcasting and select a new standby main node from the target alliance chain, so that the high availability and the robustness of the data access service are improved.
Description
Technical Field
The present disclosure relates to the field of blockchain technologies, and in particular, to a method and an apparatus for processing a request based on node switching, an electronic device, and a computer-readable storage medium.
Background
The multicenter clinical trial data mainly includes a Case Report Form (CRF), and in the conventional multicenter clinical trial process, the access of the data is strictly limited because the data among hospitals cannot be intercommunicated. For the purpose of Data interconnection, an Electronic Data capture system (EDC system) is currently generally used to manage multicenter clinical trial Data.
However, the conventional EDC system cannot solve the problems of data security and easy tampering. Thus, data storage, management, and access for multi-center clinical trials using blockchain techniques has emerged. The problem that data storage safety is poor and data storage is easy to tamper can be solved by adopting the block chain technology, but when the request processing based on node switching is carried out by the existing block chain technology, only one main master node is usually set, when the main master node fails, the request processing based on node switching cannot be continuously carried out, robustness is poor, and great influence can be generated on the multi-center clinical trial research process.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
The present disclosure is directed to a method for processing a request based on node switching, a device for processing a request based on node switching, an electronic device, and a computer-readable storage medium, so as to overcome, at least to some extent, the problem that a data management service cannot be provided and robustness is poor due to a failure of a master node in a blockchain network.
Additional features and advantages of the disclosure will be set forth in the detailed description which follows, or in part will be obvious from the description, or may be learned by practice of the invention.
According to a first aspect of the present disclosure, a method for processing a request based on node switching is provided, where the method is applied to a standby master node in a target federation chain, where the target federation chain includes a master node, and the method includes: receiving a service request sent by a client and acquiring the running state of a main host node; judging whether the main host node fails or not; if yes, upgrading to a new main master node to process the service request, and determining a new standby master node from the nodes of the target alliance chain.
Optionally, the target federation chain includes a slave node, and the method further includes: acquiring node identifications corresponding to all nodes in a target alliance chain; determining a master node and a slave node in a target alliance chain according to each node identifier; the main nodes comprise a main node and a standby main node.
Optionally, the method further includes: distributing a corresponding serial number identifier for the service request through the main host node, and generating a serial number distribution message; sending the serial number distribution message to the slave node through the main master node; acquiring a confirmation message returned by each node aiming at the sequence number distribution message received by the client; and determining a processing result of the service request according to the confirmation message.
Optionally, determining a processing result of the service request according to the confirmation message includes: determining a target acknowledgement message based on the acknowledgement message; the message quantity of the target confirmation message is greater than a preset threshold value; the target acknowledgement message is taken as a result of the processing of the service request.
Optionally, the target federation chain includes a slave node, and determining whether the master node fails includes: determining a master-slave synchronization period between the master node and the master node, and communicating with the master node based on the master-slave synchronization period; if the communication signal with the main master node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the master-slave synchronization period of the first preset number is detected, the master node is determined to be in a normal state; if not, determining that the main host node is in a fault state.
According to a second aspect of the present disclosure, a method for processing a request based on node switching is provided, where the method is applied to a primary master node in a target federation chain, where the target federation chain includes a standby master node, and the method includes: detecting whether the standby main node fails or not; and if so, issuing election broadcasting in the target alliance chain so as to select one node from the target alliance chain as a new standby main node.
Optionally, the target federation chain includes a slave node, and detecting whether the standby master node fails includes: determining a main and standby synchronization period between the master node and the standby main node, and communicating with the standby main node based on the main and standby synchronization period; if the communication signal with the standby main node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the main-standby synchronous period of the first preset number is detected, the standby main node is determined to be in a fault state; if not, the standby main node is determined to be in a normal state.
According to a third aspect of the present disclosure, there is provided a node-switching-based request processing apparatus, including: the state acquisition module is used for receiving a service request sent by a client and acquiring the running state of the main host node; the judging module is used for judging whether the main host node fails or not; and the node switching module is used for upgrading the node to a new main master node to process the service request and determining a new standby master node from the nodes of the target alliance chain if the node switching module is used for upgrading the node to the new main master node to process the service request.
Optionally, the request processing device based on node switching further includes a node identity confirmation module, configured to obtain node identifiers corresponding to all nodes in the target federation chain; determining a master node and a slave node in a target alliance chain according to each node identifier; the main nodes comprise a main node and a standby main node.
Optionally, the request processing apparatus based on node switching further includes a request processing module, configured to allocate, by using the master host node, a corresponding sequence number identifier for the service request, and generate a sequence number allocation message; sending the serial number distribution message to the slave node through the main master node; acquiring a confirmation message returned by each node aiming at the sequence number distribution message received by the client; and determining a processing result of the service request according to the confirmation message.
Optionally, the request processing module includes a request processing unit, configured to determine a target acknowledgement message based on the acknowledgement message; the message quantity of the target confirmation message is greater than a preset threshold value; the target acknowledgement message is taken as a result of the processing of the service request.
Optionally, the determining module includes a determining unit, configured to determine a primary and secondary synchronization period between the master node and the primary master node, and communicate with the primary master node based on the primary and secondary synchronization period; if the communication signal with the main master node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the master-slave synchronization period of the first preset number is detected, the master node is determined to be in a normal state; if not, determining that the main host node is in a fault state.
According to a fourth aspect of the present disclosure, there is provided a node-switching-based request processing apparatus, including: the fault detection module is used for detecting whether the standby main node has a fault; and the node election module is used for issuing election broadcasting in the target alliance chain if the node election broadcasting is received, so that one node is selected from the target alliance chain to serve as a new standby main node.
Optionally, the fault detection module includes a fault detection unit, configured to determine a primary/secondary synchronization period between the master node and the secondary master node, and communicate with the secondary master node based on the primary/secondary synchronization period; if the communication signal with the standby main node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the main-standby synchronous period of the first preset number is detected, the standby main node is determined to be in a fault state; if not, the standby main node is determined to be in a normal state.
According to a fifth aspect of the present disclosure, there is provided an electronic device comprising: a processor; and a memory having computer readable instructions stored thereon, which when executed by the processor implement the method for processing a request for a node switch according to any one of the above.
According to a sixth aspect of the present disclosure, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a node switching based request processing method according to any one of the above.
The technical scheme provided by the disclosure can comprise the following beneficial effects:
the request processing method based on node switching in the exemplary embodiment of the present disclosure receives a service request sent by a client and acquires an operating state of a master host node; and judging whether the main node fails, if so, upgrading the standby main node to a new main node to process the service request, and determining the new standby main node from the target alliance chain. On one hand, by adopting the block chain technology, for example, data processing such as data storage, management and access is performed based on the target alliance chain, compared with the traditional application system for data management, the block chain data processing method can improve the security of data access and prevent data from being tampered. On the other hand, the standby main node is added in the target alliance chain, when the main node fails, the standby main node can be started immediately, and high availability and robustness of service are guaranteed.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the disclosure.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present disclosure and together with the description, serve to explain the principles of the disclosure. It is to be understood that the drawings in the following description are merely exemplary of the disclosure, and that other drawings may be derived from those drawings by one of ordinary skill in the art without the exercise of inventive faculty. In the drawings:
fig. 1 schematically shows a flow chart of a method of node handover based request handling according to an exemplary embodiment of the present disclosure;
fig. 2 schematically illustrates a process diagram for processing a service request when an active master node is in a normal state according to an exemplary embodiment of the present disclosure;
fig. 3 schematically illustrates a process diagram of upgrading a standby master node to a master node to process a service request in place of the master node when the master node fails according to an exemplary embodiment of the present disclosure;
fig. 4 schematically shows a flowchart of mutually detecting whether a failure occurs between main and standby master nodes according to an exemplary embodiment of the present disclosure;
fig. 5 schematically illustrates a flow chart of a method of node handover based request processing according to another exemplary embodiment of the present disclosure;
fig. 6 schematically illustrates a block diagram of a node switch-based request processing apparatus according to some demonstrative embodiments of the present disclosure;
FIG. 7 schematically illustrates a block diagram of a node switch-based request processing apparatus according to another exemplary embodiment of the present disclosure;
FIG. 8 schematically illustrates a block diagram of an electronic device according to an exemplary embodiment of the present disclosure;
fig. 9 schematically illustrates a schematic diagram of a computer-readable storage medium according to an exemplary embodiment of the present disclosure.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the embodiments set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art. The same reference numerals denote the same or similar parts in the drawings, and thus, a repetitive description thereof will be omitted.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the disclosure. One skilled in the relevant art will recognize, however, that the subject matter of the present disclosure can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known structures, methods, devices, implementations, materials, or operations are not shown or described in detail to avoid obscuring aspects of the disclosure.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. That is, these functional entities may be implemented in the form of software, or in one or more software-hardened modules, or in different networks and/or processor devices and/or microcontroller devices.
At present, the data storage, management and access modes of multi-center clinical tests are carried out by adopting a block chain technology, so that the problems of low data security, easy tampering and the like in the conventional EDC system can be effectively solved. However, when the existing block chain technology is used to perform request processing based on node switching, only one primary master node is usually set, and when the primary master node fails, the request processing based on node switching cannot be performed continuously, so that the robustness is poor, and a large influence is generated on a multi-center clinical trial research process.
Based on this, in this example embodiment, first, a request processing method based on node switching is provided, which may be applied to a standby main node of a federation chain, where the standby main node may be a server or a terminal device, that is, the request processing method based on node switching of the present disclosure may be implemented by using a server, and the method of the present disclosure may also be implemented by using a terminal device, where the terminal described in the present disclosure may include a mobile terminal such as a mobile phone, a tablet computer, a notebook computer, a palm computer, a Personal Digital Assistant (PDA), and a fixed terminal such as a desktop computer. Fig. 1 schematically illustrates a schematic diagram of a node handover-based request processing method flow according to some embodiments of the present disclosure. Referring to fig. 1, the node handover-based request processing method may include the steps of:
step S110, receiving a service request sent by the client and acquiring an operating state of the master host node.
Step S120, determining whether the master host node fails.
And step S130, if yes, upgrading the master node to a new master node to process the service request, and determining a new standby master node from the nodes of the target alliance chain.
According to the request processing method based on node switching in the present exemplary embodiment, on one hand, a blockchain technique is adopted, for example, data processing such as data storage, management and access is performed based on a target federation chain, and compared with the data management performed by using a conventional application system, the security of data access can be improved, and data is prevented from being tampered. On the other hand, the standby main node is added in the target alliance chain, when the main node fails, the standby main node can be started immediately, and high availability and robustness of service are guaranteed.
Next, a request processing method based on node switching in the present exemplary embodiment will be further described.
In step S110, a service request sent by the client is received and the operating state of the master node is obtained.
In some exemplary embodiments of the present disclosure, the request processing method based on node switching may be applied to a standby master node of a target federation chain, and specifically, the target federation chain may include an active master node, a standby master node, and a slave node. A federation chain may be one type of blockchain used in a variety of application scenarios. The target federation chain may be the federation chain to which the node-switch based request processing method of the present disclosure applies. For example, the fields to which the request processing method based on node switching according to the present disclosure is applicable may include a medical field, an insurance field, a logistics field, an e-commerce field, a banking field, a financial field, a securities field, and the like, and the present disclosure does not have any particular limitation on the specific fields to which the method is applicable.
The service request can be a request which is sent by the client and correspondingly generated by data operations such as data storage, data access and the like. The client may be a terminal that sends a service request to the target federation chain, for example, taking the medical field as an example, the client may be a terminal device that is used by a certain doctor to request data access when the doctor wants to acquire data in the target federation chain. The master node may be a node pre-established for performing the data management based on the target federation chain, and generally, the master node has more resources than the ordinary service node in the target federation chain, and sometimes, in addition to verifying, saving, and transmitting transactions, the master node promotes other events in the block chain according to its properties, such as voting events, execution of protocol operations, and compliance with rules of the block chain.
When the client generates a service request, the client can respectively send the service request to the main master node and the standby master node, and when the running state of the main master node is a normal state, the main master node can perform corresponding processing operation on the service request. In the actual use process, the main host node may have a fault, so that the operating state of the main host node can be acquired, and whether the main host node operates normally or not can be judged.
According to some exemplary embodiments of the present disclosure, node identifiers respectively corresponding to all nodes in a target federation chain are obtained; determining a master node and a slave node in a target alliance chain according to each node identifier; the main nodes comprise a main node and a standby main node. The node identifier may be an identifier corresponding to each node in the target federation chain, and each node has a unique node identifier. The node identification may include node information of the node, such as node identity information.
Obtaining the node identifiers corresponding to all the nodes in the target federation chain, the identity information of each node in the target federation chain, that is, the master node N0, the standby master node N1, and a plurality of slave nodes (that is, slave service nodes), that is, slave service nodes N2, and slave service nodes N3, …, may be determined according to the node identifier of each node. After the identity information of each node in the target alliance chain is determined, the node identity information corresponding to the main node and the standby main node can be broadcasted to the whole target alliance chain through the main node.
The consensus mechanism can be a mathematical algorithm for establishing trust and obtaining rights and interests among different nodes in the blockchain system. Considering that the embodiment of the present invention adopts a framework of a federation block chain, and each node has a high reliability, a Practical Byzantine Fault Tolerance algorithm (PBFT) is selected as the consensus mechanism of the embodiment of the present invention. The conventional requests are guaranteed to be effectively consensus through a consistency protocol, a checkpoint protocol and a view change protocol in a practical Byzantine fault tolerant system.
According to another exemplary embodiment of the present disclosure, a primary master node allocates a corresponding sequence number identifier to a service request, and generates a sequence number allocation message; sending the serial number distribution message to the slave node through the main master node; acquiring a confirmation message returned by each node aiming at the sequence number distribution message received by the client; and determining a processing result of the service request according to the confirmation message. The sequence number identification may be an identification of a sequence number corresponding to the service request. The sequence number allocation message may be a message generated based on a sequence number identifier, and after the master host node allocates a corresponding sequence number identifier to the service request, the sequence number allocation message may be generated based on the sequence number identifier and sent to the slave service node. The confirmation message may be a confirmation message returned by the master node and the slave node in the blockchain network for the service request through an interaction process and a sequence number confirmation process.
According to yet another exemplary embodiment of the present disclosure, a target acknowledgement message is determined based on the acknowledgement message; the message quantity of the target confirmation message is greater than a preset threshold value; the target acknowledgement message is taken as a result of the processing of the service request. The target confirmation message may be a message which is returned by each service node for the service request and has the same message content, and the number of messages is greater than a preset threshold. In addition, the target confirmation message may also be a response returned by the node in the target federation chain for the service request. The preset threshold may be a value for comparison with the number of messages having the same message content, for example, the preset threshold may be one third or one half of the number of acknowledgement messages returned by each node, and so on. The processing result of the service request can be a result returned by each node of the target alliance chain according to the service request based on the consensus mechanism of the target alliance chain. For example, when the client C requests to access a certain DATA on a link point of the block, a service request for reading DATA is sent to the block chain, and after receiving the service request, the master node of the target federation chain returns a processing result of granting or denying the client access to the DATA.
Referring to fig. 2, fig. 2 schematically illustrates a consensus mechanism adopted in a target federation chain when a primary master node is in a normal operating state. In step S210, the client C sends a service request to the primary master node N0 and the standby master node N1; in step S220, after receiving the service request, the master node N0 may generate a sequence number allocation message for the service request, and send the sequence number allocation message to each slave service node to complete a sequence number allocation operation; in step S230, information interaction may be performed between the nodes with respect to the sequence number allocation message; in step S240, when each node receives the sequence number assignment message sent by another node, each node may generate a confirmation message for the received sequence number assignment message, and in step S250, each node sends its own confirmation message to the client C.
It should be noted that, in the network topology of the blockchain, if the number of the service nodes is 3m +1, the preset threshold is m +1, that is, only m +1 response messages are the same, and it can be considered that the consensus condition is satisfied. For example, the client C sends a service request of a data storage class to the master node, in fig. 2 and 3, m is 1, that is, there are 4 nodes, and finally, only 2 service nodes respond to the request of the client C, but it can be considered that the consensus is still achieved and the data is still received by the whole block chain.
In step S120, it is determined whether the master node has failed.
In some exemplary embodiments of the present disclosure, in the whole process, the standby master node may detect the operating state of the master node, and determine whether the master node is in a normal state. If the main host node is detected to be out of order, corresponding processing is required.
According to some exemplary embodiments of the present disclosure, a master-slave synchronization period with a master node is determined, and communication is performed with the master node based on the master-slave synchronization period; if the communication signal with the main master node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the master-slave synchronization period of the first preset number is detected, the master node is determined to be in a normal state; if not, determining that the main host node is in a fault state.
The synchronization period may be a corresponding period used when two nodes perform data synchronization. In this example embodiment, the master node starts backing up logs to other service nodes in the network topology; the log backup primary and standby synchronization period of the slave service node is 3 times that of the standby main node. The reason for such design is mainly to consider that the standby master node can synchronize the information of the master node faster than the slave service nodes, and simultaneously avoid the conflict with the backup of the slave service nodes as much as possible. The master-slave synchronization period between the master node and the slave master node may also be referred to as a "master-slave heartbeat" in this exemplary embodiment. The first preset number may be a preset number, the second preset number may also be a preset number, and the first preset number and the second preset number may be the same or different. The communication signal may be a communication signal generated when the primary master node and the standby master node communicate with each other. The log synchronization time identifier may be a synchronization identifier corresponding to the slave service node performing data synchronization operation based on the master node.
Referring to fig. 4, fig. 4 schematically illustrates a flow chart of primary and secondary master node failure detection. In step S410, a primary-backup synchronization period between the primary master node and the backup master node may be determined, and communication may be performed between the master nodes in each primary-backup synchronization period. In this exemplary embodiment, in each active-standby synchronization period, the active main node and the standby main node may perform mutual communication. And if the main node and the standby main node detect the communication signals between the main node and the standby main node and the opposite side, the communication signals between the main node and the standby main node are considered to be lost. Since it cannot be determined whether the primary master node fails or the standby master node itself fails only based on the loss of the communication signal, further determination is required to determine which master node fails.
In steps S420 to S440, if a communication signal with the master node is not detected in more than a first preset number of master-slave synchronization cycles, log synchronization time identifiers generated by a plurality of slave nodes performing data backup based on the master node may be obtained. If the update operation of the slave nodes of the second preset number has been completed in the master-slave synchronization period of the first preset number, the slave nodes are considered to complete the update operation based on the master node, so that the master node can be considered to be in a normal state, and the standby master node fails. The specific process of the main and standby main node fault detection is as follows: the master-slave master nodes can detect master-slave heartbeats and accumulate continuous loss numbers of communication signals, for example, when the master-slave heartbeat loss accumulation exceeds 13, the master-slave master nodes simultaneously detect the latest synchronous log time of slave nodes, if more than m-1 slave node logs in the network topology are updated in 13 master-slave heartbeat cycles, the master-slave master nodes can be considered to be normal, and the master-slave master nodes are in failure; otherwise, the master node may be considered to be failed.
According to another exemplary embodiment of the present disclosure, a period corresponding to a data backup operation performed based on the master node is used as a master-slave synchronization period. The data backup operation may be an operation in which the backup master node synchronizes node information of the master node when the backup master node starts to backup the log from the master node. The master-slave synchronization period may be a period used when the master node synchronizes node information in the master node with the slave master node. After determining the synchronization period between the standby master node and the master node as the master-slave synchronization period, whether the running state of the master node or the standby master node is normal or not can be detected according to the master-slave synchronization period.
In step S130, if yes, the master node is upgraded to a new master node to process the service request, and a new standby master node is determined from the nodes of the target federation chain.
In some exemplary embodiments of the present disclosure, the new primary master node may be a master node that automatically upgrades a standby master node to the primary master node when the primary master node fails, replacing a master node that the primary master node plays a role in the target federation chain. The new standby master node may be a standby master node that is elected from a plurality of service nodes after the standby master node is upgraded to the master node. If the main master node is detected to be failed, the standby master node is immediately upgraded to the main master node to replace the main master node which is failed previously so as to complete the processing process of the service request, meanwhile, the election broadcast of the standby master node needs to be issued in a plurality of service nodes of the target alliance chain, and a new service node is selected as the standby master node, so that at least one main master node and one standby master node are ensured to exist in the whole target alliance chain.
Referring to fig. 3, fig. 3 schematically illustrates a process of upgrading a standby master node to an active master node to complete a service request when the active master node fails. In fig. 3, from the perspective of data stringency, the three protocols used in this exemplary embodiment are subjected to architectural upgrade (for example, operations such as adding a standby main node are added), so as to ensure that data is not lost in the case of downtime in the process of receiving a client request by the main node but without sequence number allocation. Specifically, in step S310, the client C sends a service request to the master node N0 and the standby master node N1, and at this time, it is detected that the master node N0 fails, and therefore, the standby master node N1 is upgraded to a new master node; in step S320, after receiving the service request, the new master node N1 may generate a sequence number allocation message for the service request, and send the sequence number allocation message to each slave service node to complete the sequence number allocation operation; in step S330, information interaction may be performed between the nodes with respect to the sequence number allocation message; in step S340, when each node receives the sequence number assignment message sent by another node, each node may generate a confirmation message for the received sequence number assignment message, and in step S350, each node sends its own confirmation message to the client C. Through the steps, when the master node N0 fails, the standby master node N1 is upgraded to become a new master node, and the service request of the client C is still executed by the subsequent processes and the consensus is completed.
Referring to fig. 5, a request processing method based on node switching according to another embodiment of the present disclosure is applied to a master host node in a target federation chain, and the information processing method of the present disclosure may be implemented by using a server, and the method of the present disclosure may also be implemented by using a terminal device, where the terminal described in the present disclosure may include a mobile terminal such as a mobile phone, a tablet computer, a notebook computer, a PDA, and a fixed terminal such as a desktop computer. Fig. 5 schematically shows a schematic diagram of a flow of an information processing method according to another embodiment of the present disclosure. Referring to fig. 5, the information processing method may include the steps of:
step S510, detecting whether the standby master node fails.
Step S520, if yes, issue an election broadcast in the target alliance chain to select a node from the target alliance chain as a new standby master node.
Next, a request processing method based on node switching in the present exemplary embodiment will be further described.
In step S510, it is detected whether the backup master node has failed.
In some exemplary embodiments of the present disclosure, the standby master node may be a master node that replaces the primary master node and completes its processing work when the primary master node fails in the target federation chain. In the target alliance chain, a main node and a standby main node communicate with each other based on a main-standby synchronization period to judge whether the main nodes fail, and if any node fails, corresponding processing can be carried out to generate a new main node.
According to some exemplary embodiments of the present disclosure, a master-slave synchronization period with a master slave node is determined, and communication with the master slave node is performed based on the master-slave synchronization period; if the communication signal with the standby main node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the main-standby synchronous period of the first preset number is detected, the standby main node is determined to be in a fault state; if not, the standby main node is determined to be in a normal state. The process of determining whether the standby master node fails is similar to the process of determining whether the primary master node fails, but only the main body is determined to have a corresponding change, and this determination process is not described in detail in this embodiment.
In step S520, if yes, an election broadcast is issued in the target federation chain to select a node from the target federation chain as a new standby master node.
In some exemplary embodiments of the present disclosure, the election broadcast may be a broadcast issued by the primary master node in the target federation chain to election a new standby master node when the standby master node fails or the standby master node is upgraded to a new primary master node (i.e., the target federation chain does not have the standby master node at this time). The new standby master node may be a node in the target federation chain, and when the standby master node fails, or after the standby master node is upgraded to the primary master node, the new standby master node replaces the functional node of the standby master node.
When the standby master node of the target alliance chain fails, the main master node can issue election broadcasting in the target alliance chain, and one node is selected from a plurality of service nodes of the target alliance chain to serve as the standby master node. Further, when the original main master node fails, the standby master node is upgraded to the main master node to perform relevant service request processing, at this time, the target alliance chain lacks the standby master node, and at this time, the new main master node issues election broadcasting in the target alliance chain to select a new standby master node.
It should be noted that the terms "first", "second", etc. are used herein only for distinguishing different preset numbers, and should not be construed as limiting the present disclosure in any way.
In summary, according to the request processing method based on node switching disclosed by the present disclosure, the client may send service requests to the primary master node and the standby master node, detect the operating state of the primary master node, and determine whether the primary master node fails; if the main node fails, the standby main node is upgraded to the main node and replaces the main node to process the service request. Meanwhile, according to the fault detection method, whether the standby main node has a fault or not can be judged, and if the standby main node has the fault, the main node issues a election broadcast in the target alliance chain to determine a new standby main node. On one hand, data management is performed based on the block chain technology, for example, data processing such as data storage, management and access is performed by adopting a target alliance chain, so that the security of data access can be improved, and data tampering can be prevented. On the other hand, the main node and the standby node can mutually detect whether a main node fails based on the main heartbeat and the standby heartbeat, and timely detect the failed main node so as to perform corresponding processing. On the other hand, the standby main node is added in the target alliance chain, and when the main node fails, the standby main node can be started immediately, so that high availability and robustness of service are guaranteed.
It is noted that although the steps of the methods of the present invention are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
In addition, in the present exemplary embodiment, a request processing apparatus based on node switching is also provided. Referring to fig. 6, the node-switching-based request processing apparatus 600 may include: a state acquisition module 610, a judgment module 620 and a node switching module 630.
Specifically, the state obtaining module 610 may be configured to receive a service request sent by a client and obtain an operating state of the master host node; the judging module 620 may be configured to judge whether the master host node fails; the node switching module 630 may be configured to, if yes, upgrade to a new primary master node to process the service request, and determine a new standby master node from the nodes of the target federation chain.
The request processing device 600 based on node switching can obtain the operating state of the primary master node, and determine whether the primary master node fails, and if the primary master node fails, immediately start the standby master node and upgrade the standby master node to a new primary master node to complete operations such as processing service requests. The block chain technology is adopted for data management, so that the safety of data access can be improved, and data is prevented from being tampered; in addition, the standby main node is added, so that the standby main node can be started immediately when the main node fails, high availability and robustness of service can be ensured, and the device is an effective request processing device based on node switching.
In an exemplary embodiment of the present disclosure, based on the foregoing solution, the request processing device based on node switching further includes a node identity confirmation module, configured to obtain node identifiers corresponding to all nodes in the target federation chain, respectively; determining a master node and a slave node in a target alliance chain according to each node identifier; the main nodes comprise a main node and a standby main node.
In an exemplary embodiment of the present disclosure, based on the foregoing solution, the request processing apparatus based on node switching further includes a request processing module, configured to allocate, by using the master host node, a corresponding sequence number identifier for the service request, and generate a sequence number allocation message; sending the serial number distribution message to the slave node through the main master node; acquiring a confirmation message returned by each node aiming at the sequence number distribution message received by the client; and determining a processing result of the service request according to the confirmation message.
In an exemplary embodiment of the present disclosure, based on the foregoing, the request processing module includes a request processing unit for determining a target acknowledgement message based on the acknowledgement message; the message quantity of the target confirmation message is greater than a preset threshold value; the target acknowledgement message is taken as a result of the processing of the service request.
In an exemplary embodiment of the present disclosure, based on the foregoing solution, the determining module includes a determining unit, configured to determine a primary and secondary synchronization period between the master node and the primary master node, and communicate with the primary master node based on the primary and secondary synchronization period; if the communication signal with the main master node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the master-slave synchronization period of the first preset number is detected, the master node is determined to be in a normal state; if not, determining that the main host node is in a fault state.
In an exemplary embodiment of the present disclosure, based on the foregoing scheme, the determining unit includes a cycle determining subunit, configured to use a cycle corresponding to the data backup operation performed based on the master node as the master-slave synchronization cycle.
In another example embodiment, a device for processing a request based on node switching is also provided. Referring to fig. 7, the node-switching-based request processing apparatus 700 may include a failure detection module 710 and a node election module 720.
Specifically, the failure detection module 710 may be configured to detect whether the standby master node fails; the node election module 720 may be configured to, if yes, issue an election broadcast in the target federation chain to select a node from the target federation chain as a new standby master node.
The request processing device 700 based on node switching may detect whether a standby master node in a target federation chain fails, and when the standby master node fails, may issue a node election broadcast in the target federation chain, and determine a new standby master node from a plurality of nodes in the target federation chain, so that when the primary master node fails, the standby master node may be immediately enabled.
In an exemplary embodiment of the present disclosure, based on the foregoing solution, the fault detection module includes a fault detection unit, configured to determine a primary/secondary synchronization period between the master node and the secondary master node, and communicate with the secondary master node based on the primary/secondary synchronization period; if the communication signal with the standby main node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node; if the fact that the updating operation of the slave nodes exceeding the second preset number is completed in the main-standby synchronous period of the first preset number is detected, the standby main node is determined to be in a fault state; if not, the standby main node is determined to be in a normal state.
The specific details of each virtual node-switching-based request processing device module are already described in detail in the corresponding node-switching-based request processing method, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the node switch based request handling means are mentioned, this division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the present disclosure. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the above method is also provided.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 800 according to such an embodiment of the invention is described below with reference to fig. 8. The electronic device 800 shown in fig. 8 is only an example and should not bring any limitations to the function and scope of use of the embodiments of the present invention.
As shown in fig. 8, electronic device 800 is in the form of a general purpose computing device. The components of the electronic device 800 may include, but are not limited to: the at least one processing unit 810, the at least one memory unit 820, a bus 830 connecting different system components (including the memory unit 820 and the processing unit 810), and a display unit 840.
Wherein the storage unit stores program code that is executable by the processing unit 810 to cause the processing unit 810 to perform steps according to various exemplary embodiments of the present invention as described in the "exemplary methods" section above in this specification.
The storage unit 820 may include readable media in the form of volatile storage units, such as a random access storage unit (RAM)821 and/or a cache storage unit 822, and may further include a read only storage unit (ROM) 823.
The electronic device 800 may also communicate with one or more external devices 870 (e.g., keyboard, pointing device, bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 800, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 800 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 850. Also, the electronic device 800 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 860. As shown, the network adapter 860 communicates with the other modules of the electronic device 800 via the bus 830. It should be appreciated that although not shown, other hardware and/or software modules may be used in conjunction with the electronic device 800, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above-mentioned "exemplary methods" section of the present description, when said program product is run on the terminal device.
Referring to fig. 9, a program product 900 for implementing the above method according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program code, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
A computer readable signal medium may include a propagated data signal with readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A readable signal medium may also be any readable medium that is not a readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Furthermore, the above-described figures are merely schematic illustrations of processes involved in methods according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the present disclosure is to be limited only by the terms of the appended claims.
Claims (11)
1. A request processing method based on node switching is characterized in that the method is applied to a standby main node in a target alliance chain, the target alliance chain comprises a main node, and the method comprises the following steps:
receiving a service request sent by a client and acquiring the running state of the main host node;
judging whether the main host node fails or not;
and if so, upgrading the node to a new main master node to process the service request, and determining a new standby master node from the nodes of the target alliance chain.
2. The method of claim 1, wherein the target federation chain includes a slave node, and before the receiving a service request sent by a client and acquiring the operating state of the master node, the method further comprises:
acquiring node identifications corresponding to all nodes in the target alliance chain respectively;
determining a master node and a slave node in the target alliance chain according to each node identification; the master node comprises the main master node and the standby master node.
3. The method of claim 2, further comprising:
distributing a corresponding sequence number identifier for the service request through the main master node, and generating a sequence number distribution message;
sending the sequence number distribution message to the slave node through the master node;
acquiring a confirmation message returned by each node aiming at the sequence number distribution message received by the client;
and determining a processing result of the service request according to the confirmation message.
4. The method of claim 3, wherein the determining the processing result of the service request according to the acknowledgement message comprises:
determining a target acknowledgement message based on the acknowledgement message; the message quantity of the target confirmation message is greater than a preset threshold value;
and taking the target confirmation message as a processing result of the service request.
5. The method of claim 1, wherein the target federation chain includes a slave node, and the determining whether the master node fails comprises:
determining a master-slave synchronization period between the master node and the master node, and communicating with the master node based on the master-slave synchronization period;
if the communication signal with the main master node is not detected in the main-standby synchronization period exceeding a first preset number, acquiring a log synchronization time identifier of the slave node;
if the fact that the updating operation of the slave nodes exceeding a second preset number is completed in the master-slave synchronization period of the first preset number is detected, the master node is determined to be in a normal state;
if not, determining that the main host node is in a fault state.
6. A request processing method based on node switching is characterized in that the method is applied to a main master node in a target alliance chain, the target alliance chain comprises a standby master node, and the method comprises the following steps:
detecting whether the standby main node fails or not;
and if so, issuing election broadcasting in the target alliance chain so as to select one node from the target alliance chain as a new standby main node.
7. The method of claim 6, wherein the target federation chain includes a slave node, and the detecting whether the backup master node fails comprises:
determining a main and standby synchronization period between the master node and the standby main node, and communicating with the standby main node based on the main and standby synchronization period;
if the communication signal with the standby main node is not detected in the main and standby synchronization periods exceeding a first preset number, acquiring a log synchronization time identifier of the slave node;
if the fact that the updating operation of the slave nodes exceeding a second preset number is completed in the master-slave synchronization period of the first preset number is detected, the standby master node is determined to be in a fault state;
if not, determining that the standby main node is in a normal state.
8. A node-switching-based request processing apparatus, comprising:
the state acquisition module is used for receiving a service request sent by a client and acquiring the running state of the main host node;
the judging module is used for judging whether the main host node fails or not;
and the node switching module is used for upgrading the node to a new main master node to process the service request and determining a new standby master node from the nodes of the target alliance chain if the node switching module is used for upgrading the node to the new main master node to process the service request.
9. A node-switching-based request processing apparatus, comprising:
the fault detection module is used for detecting whether the standby main node has a fault;
and the node election module is used for issuing election broadcasting in the target alliance chain if the node election broadcasting is received, so that one node is selected from the target alliance chain to serve as a new standby main node.
10. An electronic device, comprising:
a processor; and
a memory having stored thereon computer readable instructions which, when executed by the processor, implement the method of node switch based request processing according to any of claims 1 to 7.
11. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, implements the node handover-based request processing method according to any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911249550.6A CN111028902A (en) | 2019-12-09 | 2019-12-09 | Request processing method, device, equipment and medium based on node switching |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911249550.6A CN111028902A (en) | 2019-12-09 | 2019-12-09 | Request processing method, device, equipment and medium based on node switching |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN111028902A true CN111028902A (en) | 2020-04-17 |
Family
ID=70208283
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911249550.6A Withdrawn CN111028902A (en) | 2019-12-09 | 2019-12-09 | Request processing method, device, equipment and medium based on node switching |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111028902A (en) |
Cited By (20)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111949833A (en) * | 2020-08-17 | 2020-11-17 | 北京字节跳动网络技术有限公司 | Index construction method, data processing method, device, electronic equipment and medium |
| CN111988202A (en) * | 2020-09-03 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Node switching method, device and storage medium |
| CN111988188A (en) * | 2020-09-03 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Transaction endorsement method, device and storage medium |
| CN112612851A (en) * | 2020-12-24 | 2021-04-06 | 南京三眼精灵信息技术有限公司 | Multi-center data synchronization method and device |
| CN112671589A (en) * | 2020-12-31 | 2021-04-16 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804089A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804090A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804087A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804091A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112822042A (en) * | 2020-12-31 | 2021-05-18 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112995278A (en) * | 2021-02-02 | 2021-06-18 | 曲阜师范大学 | Block chain device management method based on cloud computing platform and SDN controller |
| CN113268382A (en) * | 2021-04-19 | 2021-08-17 | 支付宝(杭州)信息技术有限公司 | Method and device for switching fragment nodes in block chain system |
| CN115905270A (en) * | 2023-01-06 | 2023-04-04 | 金篆信科有限责任公司 | Method and device for determining main data node in database and storage medium |
| CN116016129A (en) * | 2022-11-21 | 2023-04-25 | 深圳爱捷云科技有限公司 | Management method of cloud computing platform |
| CN116155900A (en) * | 2023-02-28 | 2023-05-23 | 中国建设银行股份有限公司 | Data processing method, device, equipment and storage medium |
| CN116302714A (en) * | 2022-12-30 | 2023-06-23 | 蚂蚁区块链科技(上海)有限公司 | A method and device for active/standby switching of blockchain nodes |
| CN117220884A (en) * | 2023-09-05 | 2023-12-12 | 上海雷龙信息科技有限公司 | Digital signature interactive verification method, system, equipment and medium |
| US11895185B2 (en) * | 2020-12-03 | 2024-02-06 | Inspur Suzhou Intelligent Technology Co., Ltd. | Node synchronization method and apparatus, device and storage medium |
| CN117666970A (en) * | 2024-01-30 | 2024-03-08 | 杭州阿里云飞天信息技术有限公司 | Data storage method and data storage device |
| CN118034750A (en) * | 2024-04-12 | 2024-05-14 | 成都赛力斯科技有限公司 | Upgrade control instruction response method and device, mobile terminal and readable storage medium |
-
2019
- 2019-12-09 CN CN201911249550.6A patent/CN111028902A/en not_active Withdrawn
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111949833A (en) * | 2020-08-17 | 2020-11-17 | 北京字节跳动网络技术有限公司 | Index construction method, data processing method, device, electronic equipment and medium |
| CN111988202A (en) * | 2020-09-03 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Node switching method, device and storage medium |
| CN111988188A (en) * | 2020-09-03 | 2020-11-24 | 深圳壹账通智能科技有限公司 | Transaction endorsement method, device and storage medium |
| CN111988202B (en) * | 2020-09-03 | 2022-05-03 | 深圳壹账通智能科技有限公司 | Node switching method, device and storage medium |
| US11895185B2 (en) * | 2020-12-03 | 2024-02-06 | Inspur Suzhou Intelligent Technology Co., Ltd. | Node synchronization method and apparatus, device and storage medium |
| CN112612851B (en) * | 2020-12-24 | 2024-03-08 | 南京三眼精灵信息技术有限公司 | Multi-center data synchronization method and device |
| CN112612851A (en) * | 2020-12-24 | 2021-04-06 | 南京三眼精灵信息技术有限公司 | Multi-center data synchronization method and device |
| CN112804089A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804089B (en) * | 2020-12-31 | 2023-07-25 | 北京百度网讯科技有限公司 | Operation realization method, device, equipment and storage medium of alliance network |
| CN112822042A (en) * | 2020-12-31 | 2021-05-18 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804087B (en) * | 2020-12-31 | 2023-07-25 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for realizing operation of alliance network |
| CN112804087A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804090A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804091B (en) * | 2020-12-31 | 2023-07-25 | 北京百度网讯科技有限公司 | Operation realization method, device, equipment and storage medium of alliance network |
| CN112804091A (en) * | 2020-12-31 | 2021-05-14 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112671589A (en) * | 2020-12-31 | 2021-04-16 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112822042B (en) * | 2020-12-31 | 2023-04-18 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112804090B (en) * | 2020-12-31 | 2023-04-18 | 北京百度网讯科技有限公司 | Operation implementation method, device, equipment and storage medium of alliance network |
| CN112671589B (en) * | 2020-12-31 | 2023-04-18 | 北京百度网讯科技有限公司 | Method, device, equipment and storage medium for realizing operation of alliance network |
| CN112995278B (en) * | 2021-02-02 | 2022-07-01 | 武汉温茂科技有限公司 | Block chain device management method based on cloud computing platform and SDN controller |
| CN112995278A (en) * | 2021-02-02 | 2021-06-18 | 曲阜师范大学 | Block chain device management method based on cloud computing platform and SDN controller |
| CN113268382B (en) * | 2021-04-19 | 2022-08-09 | 支付宝(杭州)信息技术有限公司 | Method and device for switching fragment nodes in block chain system |
| CN113268382A (en) * | 2021-04-19 | 2021-08-17 | 支付宝(杭州)信息技术有限公司 | Method and device for switching fragment nodes in block chain system |
| CN116016129A (en) * | 2022-11-21 | 2023-04-25 | 深圳爱捷云科技有限公司 | Management method of cloud computing platform |
| CN116302714A (en) * | 2022-12-30 | 2023-06-23 | 蚂蚁区块链科技(上海)有限公司 | A method and device for active/standby switching of blockchain nodes |
| CN115905270A (en) * | 2023-01-06 | 2023-04-04 | 金篆信科有限责任公司 | Method and device for determining main data node in database and storage medium |
| CN116155900A (en) * | 2023-02-28 | 2023-05-23 | 中国建设银行股份有限公司 | Data processing method, device, equipment and storage medium |
| CN117220884A (en) * | 2023-09-05 | 2023-12-12 | 上海雷龙信息科技有限公司 | Digital signature interactive verification method, system, equipment and medium |
| CN117666970A (en) * | 2024-01-30 | 2024-03-08 | 杭州阿里云飞天信息技术有限公司 | Data storage method and data storage device |
| CN117666970B (en) * | 2024-01-30 | 2024-05-07 | 杭州阿里云飞天信息技术有限公司 | Data storage method and data storage device |
| CN118034750A (en) * | 2024-04-12 | 2024-05-14 | 成都赛力斯科技有限公司 | Upgrade control instruction response method and device, mobile terminal and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN111028902A (en) | Request processing method, device, equipment and medium based on node switching | |
| US20230273937A1 (en) | Conditional master election in distributed databases | |
| US9753954B2 (en) | Data node fencing in a distributed file system | |
| CN105357038B (en) | Method and system for monitoring virtual machine cluster | |
| CN108958787B (en) | Block chain system upgrading method, device, equipment and storage medium | |
| US10346248B2 (en) | Failure resistant volume creation in a shared storage environment | |
| CN106843749B (en) | Write request processing method, device and equipment | |
| CN103201724A (en) | Providing application high availability in highly-available virtual machine environments | |
| CN103593266A (en) | ot standby method based on arbitration disk mechanism | |
| KR102665749B1 (en) | Method and apparatus for ensuring continued device operational reliability in cloud-degraded mode | |
| US10048978B2 (en) | Apparatus and method for identifying a virtual machine having changeable settings | |
| CN114281600B (en) | Disaster recovery and recovery method, device, equipment and storage medium | |
| WO2020232859A1 (en) | Distributed storage system, data writing method, device, and storage medium | |
| US10102088B2 (en) | Cluster system, server device, cluster system management method, and computer-readable recording medium | |
| CN110958287B (en) | Operation object data synchronization method, device and system | |
| US9930143B2 (en) | Client system communication with a member of a cluster of server systems | |
| CN119902932A (en) | A database synchronization method, device, equipment and storage medium | |
| CN113312209B (en) | Data hot standby method, device, server and storage medium | |
| US20210083931A1 (en) | Intention-based device component tracking system | |
| US20190124145A1 (en) | Method and apparatus for availability management | |
| US11669516B2 (en) | Fault tolerance for transaction mirroring | |
| US9710298B2 (en) | Information processing system, storage apparatus, and program | |
| JP5464449B2 (en) | Method for detecting inconsistency between processing units considering reboot due to failure, shared apparatus, and cluster system | |
| US10419390B2 (en) | Using dynamic host configuration protocol to protect data | |
| US20250291684A1 (en) | Automatic Recovery Of Nodes With Corrupted Logs In A Consensus Protocol |
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 | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20200417 |
|
| WW01 | Invention patent application withdrawn after publication |