WO2018192533A1 - Procédé d'exploitation de dispositifs de nœuds, dispositif de changement d'état de fonctionnement, dispositif de nœud, et support - Google Patents

Procédé d'exploitation de dispositifs de nœuds, dispositif de changement d'état de fonctionnement, dispositif de nœud, et support Download PDF

Info

Publication number
WO2018192533A1
WO2018192533A1 PCT/CN2018/083594 CN2018083594W WO2018192533A1 WO 2018192533 A1 WO2018192533 A1 WO 2018192533A1 CN 2018083594 W CN2018083594 W CN 2018083594W WO 2018192533 A1 WO2018192533 A1 WO 2018192533A1
Authority
WO
WIPO (PCT)
Prior art keywords
node device
state
node
running
voting request
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.)
Ceased
Application number
PCT/CN2018/083594
Other languages
English (en)
Chinese (zh)
Inventor
郭锐
李茂材
梁军
屠海涛
赵琦
王宗友
张建俊
朱大卫
刘斌华
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Tencent Technology Shenzhen Co Ltd
Original Assignee
Tencent Technology Shenzhen Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Tencent Technology Shenzhen Co Ltd filed Critical Tencent Technology Shenzhen Co Ltd
Priority to EP18787276.7A priority Critical patent/EP3562123B1/fr
Publication of WO2018192533A1 publication Critical patent/WO2018192533A1/fr
Priority to US16/510,723 priority patent/US10833919B2/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0751Error or fault detection not based on redundancy
    • G06F11/0754Error or fault detection not based on redundancy by exceeding limits
    • G06F11/0757Error or fault detection not based on redundancy by exceeding limits by exceeding a time limit, i.e. time-out, e.g. watchdogs
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/004Error avoidance
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0706Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment
    • G06F11/0709Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation the processing taking place on a specific hardware platform or in a specific software environment in a distributed system consisting of a plurality of standalone computer nodes, e.g. clusters, client-server systems
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0766Error or fault reporting or storing
    • G06F11/0772Means for error signaling, e.g. using interrupts, exception flags, dedicated error registers
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L41/00Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
    • H04L41/06Management of faults, events, alarms or notifications
    • H04L41/0654Management of faults, events, alarms or notifications using network fault recovery
    • H04L41/0668Management of faults, events, alarms or notifications using network fault recovery by dynamic selection of recovery network elements, e.g. replacement by the most appropriate element after failure
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1044Group management mechanisms 
    • H04L67/1051Group master selection mechanisms
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L67/00Network arrangements or protocols for supporting network services or applications
    • H04L67/01Protocols
    • H04L67/10Protocols in which an application is distributed across nodes in the network
    • H04L67/104Peer-to-peer [P2P] networks
    • H04L67/1059Inter-group management mechanisms, e.g. splitting, merging or interconnection of groups
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/32Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials
    • H04L9/3236Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions
    • H04L9/3239Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols including means for verifying the identity or authority of a user of the system or for message authentication, e.g. authorization, entity authentication, data integrity or data verification, non-repudiation, key authentication or verification of credentials using cryptographic hash functions involving non-keyed hash functions, e.g. modification detection codes [MDCs], MD5, SHA or RIPEMD
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L9/00Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols
    • H04L9/50Cryptographic mechanisms or cryptographic arrangements for secret or secure communications; Network security protocols using hash chains, e.g. blockchains or hash trees
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00Error detection; Error correction; Monitoring
    • G06F11/07Responding to the occurrence of a fault, e.g. fault tolerance
    • G06F11/0703Error or fault processing not based on redundancy, i.e. by taking additional measures to deal with the error or fault not making use of redundancy in operation, in hardware, or in data representation
    • G06F11/0793Remedial or corrective actions
    • GPHYSICS
    • G06COMPUTING OR CALCULATING; COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F2201/00Indexing scheme relating to error detection, to error correction, and to monitoring
    • G06F2201/83Indexing scheme relating to error detection, to error correction, and to monitoring the solution involving signatures

Definitions

  • the present application relates to the field of network technologies, and in particular, to a node device operation method, a working state switching device, a node device, and a medium.
  • the BFT-Raft (Byzantine Fault Tolerance algorithm-Raft) algorithm can be applied to the node device.
  • the working state of the node device can be divided into three types: following state follower, candidate state candidate, and leader state leader.
  • following state follower When any of the node devices a is in the following state, it can be determined that the node device b is operating normally according to the heartbeat information broadcasted by the node device b running in the leader state in the cluster, and the log is copied based on the indication of the node device b.
  • the node device a does not receive the heartbeat information of the node device b for a period of time, it may be determined that the operation of the node device b has failed, the node device a may switch to the candidate state operation, and broadcast the voting request to each node in the cluster.
  • the device once receiving the voting of more than half of the node devices in the cluster, can switch to the state of the leader. It should be noted that, when the node device a running in the leadership state is running normally, if a voting request or heartbeat information is received, it is automatically ignored.
  • the cluster device may be split into two sub-clusters that are isolated from the network, such as sub-cluster A and sub-cluster B.
  • the sub-cluster A includes the node device a running in the leader state in the cluster, and the number of node devices in the sub-cluster A is smaller than The number of node devices in the sub-cluster B, the node devices in the sub-cluster B can vote for a new node device b in the lead state, and when the operation of the node device b fails, the sub-cluster B is in the candidate.
  • the node device in the state broadcasts the voting request again.
  • the voting request is ignored, even if a node device c in the sub-cluster B switches to the leader.
  • the node device a also ignores the heartbeat information of the node device c, and the node device a cannot work together with the sub-cluster B as a system, and the system has low operational reliability.
  • the embodiment of the present application provides a node device operation method, a working state switching device, a node device, and a medium, which can solve the problem of low work reliability.
  • the technical solution is as follows:
  • a method for operating a node device which is applied to a first node device, where the method includes:
  • the first node device receives a voting request of a plurality of second node devices, where the number of the plurality of second node devices is greater than a half of the number of node devices in the system; wherein the plurality of second node devices are the system a node device other than the first node device;
  • the latest log index in the voting request of the multiple second node devices switches the working state of the first node device from the leading state to the following state or candidate state.
  • a working state switching device is provided, the device being applied to a first node device, including:
  • a receiving module configured to receive a voting request of multiple second node devices, where the number of the multiple second node devices is greater than half of the number of node devices in the system;
  • An obtaining module configured to obtain, from the voting request of the multiple second node devices, the running cycle information and the latest log index if the first node device is running in the leader state;
  • a running module if the running period information in the voting request of the multiple second node devices is greater than the running period information of the first node device, and the latest one of the voting requests of the multiple second node devices
  • the log index is not less than the latest log index of the first node device, and the working state of the first node device is switched from the leading state to the following state or the candidate state.
  • a node device comprising:
  • One or more processors are One or more processors;
  • One or more memories for storing instructions executed by the one or more processors
  • the one or more processors are configured to execute the instructions to perform the steps of the node device operation method described below:
  • the running cycle information in the voting request of the multiple node devices is greater than the running cycle information of the node device, and the latest log index in the voting request of the multiple node devices is not less than the latest state of the node device. a log index that switches an operating state of the node device from the leading state to a following state or a candidate state.
  • a computer readable storage medium storing instructions executable by a processor in a device to perform the method of operating the node device.
  • the embodiment of the present application obtains the running cycle information and the latest log index in the voting request, and obtains the running cycle information if the node device receives multiple voting requests when the system is restored from the split to the normal. If the latest log records of the current node device are not smaller than the latest log index of the current node device, the operation is performed in the following state or in the candidate state, so that the node device running in the leader state in the first sub-cluster is configured.
  • the node state can be downgraded to a follow state or a candidate state, so that any node device in the first sub-cluster can participate in the election together with the node device in the second sub-cluster until the appearance of the node device in the new leader state.
  • a sub-cluster can work together with the second sub-cluster to work together as a system, improving the reliability of the system.
  • FIG. 1A is a schematic diagram of an implementation environment of a node device operation according to an embodiment of the present application
  • 1B is a schematic diagram of switching of an operating state of a node device according to an embodiment of the present application
  • FIG. 2 is a flowchart of a method for operating a node device according to an embodiment of the present application
  • FIG. 3 is a flowchart of a method for operating a node device according to an embodiment of the present application
  • FIG. 4 is a schematic block diagram of a working state switching device according to an embodiment of the present application.
  • FIG. 5 is a schematic block diagram of a working state switching apparatus according to an embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of a node device according to an embodiment of the present application.
  • FIG. 1A is a schematic diagram of an implementation environment of a node device running according to an embodiment of the present application.
  • the implementation environment is a system composed of a plurality of node devices, and the system is also equivalent to a cluster.
  • the node device 1 is a node device running in a leadership state in the system.
  • the heartbeat information such as the node device 2, the node device 3, and the node device 4 is periodically broadcast to each node device running in the following state, and each node device running in the following state can determine the node device 1 when receiving the heartbeat information. It runs normally and resets the timer (usually a random value between 0.5 and 1 second. This prevents the timers of each node device from being the same as the timer may cause repeated elections) and waits for the next heartbeat message.
  • the timer usually a random value between 0.5 and 1 second. This prevents the timers of each node device from being the same as the timer may cause repeated elections
  • the working state of each node device in the system can be dynamically switched.
  • FIG. 1B the embodiment of the present application provides a schematic diagram of switching the working state of the node device.
  • the node device running in the follow state does not receive the heartbeat information when the timer expires, it can be determined that the operation of the node device running in the leader state has failed, and the node device can be switched to the candidate state (candidate) Running; further, the node device can reset the timer and broadcast the voting request until more than half of the voting confirmation messages in the system are received to switch to a leader operation or receive a node device running in the leadership state.
  • the candidate state is maintained to start a new round of election; the node device running in the leadership state can discover the node device having higher running period information than itself. Switch to follow state operation.
  • the service command may be redirected to the node device 1, and the node device 1 broadcasts a log to each node device.
  • the request, the log addition request is used to request to add the service command to the log, and if the node device 1 can receive the confirmation message of the log request of each node device, the service command can be added to the service command of the client.
  • a log copy instruction is broadcast to each node device, so that each node device copies the service command into the log.
  • the system may be a transaction system based on blockchain technology.
  • the service command may be transaction information of the client, and the log stored by each node device may correspond to a blockchain, when adding transaction information. When it is in the log, the transaction information is actually stored in the next block of the current block. Since the data stored in the blockchain cannot be changed, the transaction information can be effectively prevented from being tampered and the transaction information can be improved. Sex.
  • Each node device in the system may form a sub-cluster separated by two networks, that is, the first sub-cluster and the second sub-cluster, and the number of node devices in the first sub-cluster is smaller than the first The number of node devices in the second sub-cluster, and the first sub-cluster includes node 1 running in the leadership state in the system. Further, the node device running in the following state in the first sub-cluster can continue to work normally according to the heartbeat information periodically broadcasted by the node device 1; the second sub-cluster is interrupted by the network of the node device 1, and the node running in the following state The device cannot receive the heartbeat information of the node device 1 when the timer expires.
  • a node device running in the following state switches to the candidate state and runs its own running cycle information.
  • the node device in the second sub-cluster receiving a voting request that is greater than half of the number of node devices in the system may switch to a leadership state operation, and broadcast the heartbeat information of the node device itself, the heartbeat information Carrying the running period information of the node device running in the leadership state, when the node running in the candidate state receives the heartbeat information, it can switch to the following state operation, and synchronize its own running cycle information into the running cycle carried by the heartbeat information.
  • each node device in the second sub-cluster will switch to the candidate state and perform the election again. If the second sub-cluster performs the election, the first sub-cluster and the second sub-cluster restore the network.
  • each node device in the first sub-cluster ignores the voting request from the node device in the second sub-cluster, even if the second sub-cluster is selected a node device of the new leader state, and the node device in the second sub-cluster can work according to the heartbeat information of the node device of the new leader state, but each node device in the first sub-cluster ignores the new leader state
  • the heartbeat information of the node device continues to work according to the heartbeat information of the node device 1, so that the first sub-cluster and the second sub-cluster cannot be restored into one system to work together, and the system has poor operational reliability.
  • FIG. 2 is a flowchart of a method for operating a node device according to an embodiment of the present application. Referring to FIG. 2, the method can be applied to the first node device 1 of the embodiment shown in FIG. 1A, including the following steps:
  • the first node device 1 receives a voting request of multiple second node devices, where the number of the multiple second node devices is greater than half of the number of node devices in the system.
  • the multiple second node devices may be node devices in the second sub-cluster in the embodiment shown in FIG. 1A.
  • the node device in the second sub-cluster is faulty, and the second node device does not receive the heartbeat information when the timer expires. Therefore, multiple Some or all of the node devices in the second node device are running in a candidate state, and generate a voting request based on information such as their own running cycle information, a last log index, and a node device identifier, and broadcast the voting request to the system.
  • the node device that receives the voting request determines whether the heartbeat information is received if the timer has not timed out, and if so, determines that the node device in the leader state is operating normally, and ignores the voting request, and if not, extracts
  • the running cycle information and the latest log index in the voting request are compared, and the extracted information is compared with the information of the own, and if the two are respectively greater than or equal to the information of the user, the node device corresponding to the node device identifier in the voting request is sent. Vote confirmation message, otherwise the voting request will be ignored. Once a node device has been voted, it will not vote for other node devices during the operation period.
  • the node device running in the leadership state in the first sub-cluster can work together with the second sub-cluster to improve the operational reliability of the cluster, and the following steps are performed.
  • the step may also be specifically: when the first node device 1 receives the first voting request, the timer is started to be timed; during the running process of the timer In the middle, continue to receive voting requests from other node devices, and stop receiving voting requests after the timer expires.
  • the first node device 1 can receive the voting request within the timer duration, and the timing duration can be the duration of one round of elections, if the number of voting requests received by the first node device 1 within the timing period is greater than If the number of node devices in the system is half, indicating that the system has split, and the first sub-cluster and the second sub-cluster have resumed network connection, and the second sub-cluster is performing election, proceed to step 202. Otherwise, the above situation Can not be confirmed, can ignore the received voting request, and continue to broadcast heartbeat information.
  • the first node device 1 acquires the operation cycle information and the latest log index from the voting requests of the plurality of second node devices.
  • the running period information refers to the running cycle number of the node device that sends the voting request.
  • the operation period information of the node device that is switched from the following state to the candidate state is incremented, and the node device that eventually becomes the leader state can carry the operation cycle information in the heartbeat information and broadcast it to other node devices, and receive the
  • the node device of the candidate state of the heartbeat information may switch to the following state operation, and synchronize its own running cycle information to the running cycle information in the heartbeat information, and may be based on the latest log index of the latest log index and the heartbeat information in the heartbeat information. Determine the log that is missing from itself and request the node device in the leader state to return the log that is missing from itself. Therefore, the run cycle information can characterize whether a node device is always in sync with the node device running in the lead state and is operating normally.
  • the latest log index refers to the index of the latest stored log of the node device that sends the voting request.
  • the log copy instruction may be broadcast to other node devices, so that the node device receiving the log copy instruction may synchronize the log of the node device of the leader state and the latest log index, and therefore, the latest log index may represent the log integrity of a node device.
  • the node device running in the leadership state is the node device with the best log integrity in its system.
  • the first node device 1 may separately extract the running cycle information and the latest log index of the corresponding protocol field location from the voting request according to the running cycle information and the latest log index in the protocol field position in the voting request.
  • the first node device 1 determines whether the running period information in the voting request of the multiple second node devices is greater than the running period information of the first node device 1, and if yes, performs step 204, if not, ignores multiple voting requests. .
  • the second sub-cluster is in the process of performing the election. Considering that the second sub-cluster has undergone an election after the split, the operation information of the second node in the second sub-cluster is compared with the first sub-cluster. The operation cycle information has one more information. Therefore, the operation cycle information can be used as one of the verification basis of the foregoing implementation scenario. If the operation cycle information in the voting request is greater than the operation cycle information of the first node device 1, the above implementation scenario is verified.
  • the first node device 1 may ignore Multiple voting requests and continue to broadcast heartbeat information.
  • the first node device 1 determines whether the latest log index in the voting request of the multiple second node devices is not less than the latest log index of the first node device 1, and if yes, switches the current working state from the leading state to the following state. If no, ignore multiple voting requests.
  • the second sub-cluster restores the network connection in the two sub-cluster after serving the client for a period of time.
  • the log stored by the node device in the second sub-cluster should be no less than the log stored by the node device in the first sub-cluster, and therefore the latest log index can be used as one of the basis for verifying the foregoing implementation scenario.
  • the latest log index in the voting request of the plurality of second node devices is not less than the latest log index of the first node device 1, indicating that the amount of logs stored by the node device corresponding to the voting request is equal to or greater than the first node device 1
  • the first node device 1 switches to the following state operation, and stops broadcasting the heartbeat information. If the latest log index in the voting request is smaller than its latest log index, the above implementation scenario If not confirmed, the multiple voting requests can be ignored and the heartbeat information can continue to be broadcast.
  • the heartbeat information can be stopped, the timer is reset, and the heartbeat information of the node device of the new leader state is waited, and if the heartbeat is not received even if the timer expires
  • the information can then be switched to the candidate state operation, and the voting request is broadcasted until it becomes the node device of the leader state, or switches to the following state when receiving the heartbeat information of the node device of the new leader state.
  • the first node device 1 can also switch the current working state to the candidate state operation, stop broadcasting the heartbeat information, and broadcast the voting request until it becomes the node device of the leader state, or receives the node device of the new leader state.
  • the heartbeat information When the heartbeat information is switched, it switches to the following state.
  • the node device running in the following state in the first sub-cluster can actively switch to the candidate state after the timer expires until it becomes the leader state in the system.
  • the node device switches to the following state when receiving the heartbeat information of the node device running in the leadership state in the system. Therefore, the foregoing node device operation method can also restore the first sub-cluster and the second sub-cluster to work in the original system, thereby improving the operational reliability of the system.
  • the embodiment of the present application does not specifically limit the timings of the steps 203 and 204 performed by the first node device 1.
  • the first node device 1 may also first judge the latest log index, and then run the operation. The period information is judged, or, in order to improve the judgment efficiency, and the first sub-cluster and the second sub-cluster are combined into one system work as soon as possible, the first node device 1 can also judge the latest log index and the operation cycle information at the same time, as long as The two respectively satisfy the above respective judgment conditions, and the first node device 1 can switch the current working state to the following state (or candidate state).
  • the embodiment of the present application obtains the running cycle information and the latest log index in the voting request when the plurality of voting requests are received, and if the obtained running cycle information is greater than the running cycle information of the current node device, and the latest log obtained is obtained. Not less than the latest log index of the current node device, running in the following state or candidate state, so that the node device running in the leader state in the first sub-cluster can be demoted to the following state or the candidate state, thereby making the first sub-cluster
  • the node device can participate in the election together with the node device in the second sub-cluster, and when the node device of the new leader state appears, the first sub-cluster can work together with the second sub-cluster as a system, thereby improving the system. The reliability of the work.
  • the first node device 1 determines the target node device according to the voting request of the multiple second node devices.
  • the target node device refers to the second node device that the first node device 1 tends to vote.
  • the second node device corresponding to any voting request satisfies the qualification of the node device that becomes the leader state, and therefore, the first node The device 1 may use the node device corresponding to the voting request in the preceding order as the target node device according to the receiving order of the voting request.
  • the first node device 1 may also adopt other determining methods when determining the target node device, which is not specifically limited in this embodiment of the present application.
  • the first node device 1 sends a voting confirmation message to the target node device in response to the voting request of the target node device.
  • the first node device 1 may generate a voting confirmation message based on its own node device identifier, and send a voting confirmation message to the target node device according to the node device identifier of the target node device.
  • the first node device 1 may send a signed vote confirmation message to the target node device.
  • Each node device in the system can be configured with its own private key and the public key of each node device. Therefore, when the target node device receives the voting confirmation message, the signature of the first node device 1 may be extracted, and the signature of the first node device 1 is verified by using the configured public key of the first node device 1. .
  • steps 205 and 206 are optional steps of the embodiment of the present application.
  • the first node device 1 may also not respond to any voting request, and the system may also select a leader state.
  • the node device when receiving the heartbeat information of the node device of the leader state, synchronizes its own running cycle information with the running cycle information carried by the heartbeat information, thereby re-combining with the second sub-cluster as a system operation.
  • the first node device 1 receives heartbeat information broadcast by a node device running in a leadership state.
  • the node device of any candidate state in the system can switch to the leadership state operation and broadcast its own heartbeat information, so that the first node device 1 can receive The heartbeat information.
  • the heartbeat information may carry the signature of each node device in the system in response to the voting request of the node device that is switched to the leader state, in order to prevent the node device from masquerading as the node device in the leadership state and improve the security of the system. . Therefore, when the first node device 1 receives the heartbeat information, the signature of each node device may be extracted, and the signature of the node device is verified by using the public key of any configured node device, if the signature of each node device is Both of them are verified, and the number of signatures passed by the verification is greater than half of the number of node devices in the system. This indicates that the heartbeat information is indeed from the node device running in the leadership state, and the timer can be reset and wait for the next heartbeat information.
  • the node device running in the leadership state can broadcast a log copy instruction, so that the first node device 1 can receive the log copy instruction broadcasted by the node device running in the leadership state, based on the log copy.
  • the instruction copies the log to add the most recently received service instructions to the log.
  • bft-raft not only solves node device consistency but also solves the problem of node device fraud, data being tampered with, lost or disordered.
  • the log copy instruction needs to carry each node device in the system in response to the running state in the leadership state. The signature of the node device when voting is requested, so that the first node device 1 can verify the log copy instruction and perform log copy after the verification is passed.
  • the node device running in the following state in the first sub-cluster does not receive the heartbeat information after the timer expires, so the handover is performed. Runs for the candidate state.
  • the node device that is switched to the candidate state in the first sub-cluster is equivalent to participating in the election with the node device in the second sub-cluster; when any of the node devices receives the greater than the When half of the node devices of the system vote, they can switch to the state of the leader and broadcast the heartbeat information. When other node devices in the system receive the heartbeat information, they can confirm the end of the election, switch to the following state, and switch to the state.
  • the running cycle information is synchronized with the running cycle information in the heartbeat information, and may subsequently work based on the heartbeat information or the log copying instruction of the node device of the leader state.
  • the election of the second sub-cluster is ended, and the node device in the second sub-cluster that is in the lead state can periodically broadcast the heartbeat information, and the second sub-cluster
  • the node device that has run in the candidate state can switch to the following state when receiving the heartbeat information for the first time, and synchronize its own running cycle information with the running cycle information in the heartbeat information; the first sub-cluster has no leadership state
  • the node device, the node device running in the following state may keep the following state when receiving the heartbeat information for the first time, and synchronize its own running cycle information with the running cycle information in the heartbeat information, and the node device running in the candidate state may When the heartbeat information is received for the first time, it switches to the following state, and synchronizes its own running cycle information with the running cycle information in the heartbeat information.
  • FIG. 2 is described by taking the first first node device 1 running in the leadership state as the execution subject in the first sub-cluster as an example. After the first node device 1 stops broadcasting the heartbeat information, the first sub-cluster is caused.
  • the node device (named first node device 5) running in the following state can be passively combined with the second sub-cluster into one system, in fact, in order to enable the first node device 5 to efficiently merge with the second sub-cluster A system works to improve the reliability of the cluster.
  • the first node device 5 can also apply the node device operation method provided by the embodiment of the present application.
  • FIG. 3 is a flowchart of a method for operating a node device according to an embodiment of the present application. . Referring to Figure 3, the method includes:
  • the first node device 5 receives a voting request of multiple second node devices, where the number of the multiple second node devices is greater than half of the number of node devices in the system.
  • step 201 The same as step 201, and will not be described here.
  • the first node device 5 acquires the running cycle information and the latest log index from the voting requests of the plurality of second node devices.
  • step 202 The same as step 202, and will not be described here.
  • the first node device 5 determines whether the running period information in the voting request of the multiple second node devices is greater than the running period information of the first node device 5, and if yes, step 204 is performed, and if not, multiple voting requests are ignored. .
  • step 203 The same as step 203, and will not be described here.
  • the first node device 5 determines whether the latest log index in the voting request of the multiple second node devices is not less than the latest log index of the first node device 5, and if yes, switches the current working state from the following state to the following Candidate status, if no, ignore multiple voting requests.
  • the first node device 5 needs to switch to the candidate state and broadcast the voting request until the heartbeat information of the node device of the new leader state is received, or switch to the following state, or until more than half of the node devices in the system are received. Switch to leadership status when voting for a request.
  • the first node device 5 can also maintain the following state.
  • the timer expires, it can automatically switch to the candidate state, until the heartbeat information of the node device of the new leader state is received, and the state is switched to the following state, or until the received greater than Half of the voting requests of the node devices in the system are switched to the leadership state.
  • the embodiment of the present application obtains the running cycle information and the latest log index in the voting request when the plurality of voting requests are received, and if the obtained running cycle information is greater than the running cycle information of the current node device, and the latest log obtained is obtained. Not less than the latest log index of the current node device, running in the following state or candidate state, so that the node device running in the leader state in the first sub-cluster can be demoted to the following state or the candidate state, thereby making the first sub-cluster
  • the node device can participate in the election together with the node device in the second sub-cluster, and the first sub-cluster can be re-combined with the second sub-cluster as a system when the node device of the new leader state appears. The reliability of the system.
  • the first node device 5 determines the target node device according to the voting request of the multiple second node devices.
  • step 205 The same as step 205, and will not be described here.
  • the first node device 5 sends a voting confirmation message to the target node device in response to the voting request of the target node device.
  • step 206 The same as step 206, and will not be described here.
  • the first node device 5 receives the heartbeat information broadcast by the node device running in the leadership state.
  • step 207 The same as step 207, and will not be described here.
  • the node device can continue to participate in the election to ensure the fairness of the overall election of the system.
  • FIG. 4 is a block diagram of a working state switching device according to an embodiment of the present application.
  • the working state switching device is applied to a first node device.
  • the device includes:
  • the receiving module 401 is configured to receive a voting request of multiple second node devices, where the number of the multiple second node devices is greater than half of the number of node devices in the system;
  • the obtaining module 402 is configured to: obtain the running cycle information and the latest log index from the voting requests of the multiple second node devices if the first node device is running in the leadership state;
  • the running module 403 is configured to: if the running period information in the voting request of the multiple second node devices is greater than the running period information of the first node device, and the latest log index in the voting request of the multiple second node devices is not less than The latest log index of the first node device switches the working state of the first node device from the leader state to the following state or candidate state.
  • the embodiment of the present application obtains the running cycle information and the latest log index in the voting request when the multiple voting requests are received, and if the acquired running cycle information is greater than the running cycle information of the first node device, and the latest log obtained is obtained. If the latest log index of the first node device is not less than, the node running in the following state or the candidate state is run, so that the node device running in the leader state in the first sub-cluster can be demoted to the following state or the candidate state, thereby making the first sub-cluster
  • the node devices in the second sub-cluster can participate in the election together with the node devices in the second sub-cluster. When the node device of the new leader state appears, the first sub-cluster can work together with the second sub-cluster to work together as one system. The reliability of the system.
  • the receiving module 401 is configured to: when receiving the first voting request, start a timer to perform timing; during the running of the timer, continue to receive the voting request until the timer expires, stopping Receive a voting request.
  • the obtaining module 402 is further configured to: obtain the running cycle information and the latest log index from the voting requests of the multiple second node devices if the first node device is running in the following state;
  • the running module 403 is further configured to: if the running cycle information in the voting request of the multiple second node devices is greater than the running cycle information of the first node device, and the latest log indexes in the voting requests of the multiple second node devices are not The latest log index smaller than the first node device switches the working state of the first node device from the following state to the candidate state or the following state.
  • the node device further includes:
  • a determining module 404 configured to determine, according to a voting request of multiple second node devices, a target node device
  • the sending module 405 is configured to send a voting confirmation message to the target node device in response to the voting request of the target node device.
  • the receiving module 401 is further configured to receive heartbeat information broadcast by a node device running in a leadership state; or
  • the receiving module 401 is further configured to receive a log copy instruction broadcast by the node device running in the leader state, and copy the log based on the log copy instruction.
  • the device provided by the foregoing embodiment performs the method for operating the node device
  • only the division of the foregoing functional modules is illustrated.
  • the function distribution may be completed by different functional modules as needed.
  • the internal structure of the device is divided into different functional modules to perform all or part of the functions described above.
  • the device provided by the foregoing embodiment and the node device operation method embodiment are in the same concept, and the specific implementation process is described in detail in the method embodiment, and details are not described herein again.
  • FIG. 6 is a schematic structural diagram of a node device according to an embodiment of the present invention.
  • the node device 600 can be provided as a server.
  • Node device 600 includes a processing component 622 that further includes one or more processors, and memory resources represented by memory 632 for storing instructions executable by processing component 622, such as an application.
  • An application stored in memory 632 can include one or more modules each corresponding to a set of instructions.
  • processing component 622 is configured to execute instructions to perform the node device operation method described below.
  • the running cycle information in the voting request of the multiple node devices is greater than the running cycle information of the node device, and the latest log index in the voting request of the multiple node devices is not less than the latest state of the node device. a log index that switches an operating state of the node device from the leading state to a following state or a candidate state.
  • the one or more processors are configured to execute the instructions to perform the steps of:
  • the voting request continues to be received until the timer expires, and the receiving of the voting request is stopped.
  • the one or more processors are configured to execute the instructions to perform the steps of:
  • the running cycle information in the voting request of the multiple node devices is greater than the running cycle information of the node device, and the latest log index in the voting request of the multiple node devices is not less than the latest state of the node device.
  • the one or more processors are configured to execute the instructions to perform the steps of:
  • a voting confirmation message is sent to the target node device in response to the voting request of the target node device.
  • the one or more processors are configured to execute the instructions to perform the steps of:
  • Node device 600 may also include a power component 626 configured to perform power management of node device 600, a wired or wireless network interface 650 configured to connect node device 600 to the network, and an input/output (I/O) interface 658 .
  • Node device 600 may operate based on an operating system stored in the memory 632, for example, Windows Server TM, Mac OS X TM , Unix TM, Linux TM, FreeBSD TM or the like.
  • a computer readable storage medium storing instructions executable by a processor in a device to perform the node device operating method of the above embodiments.
  • the computer readable storage medium can be a ROM, a random access memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, and an optical data storage device.
  • a person skilled in the art may understand that all or part of the steps of implementing the above embodiments may be completed by hardware, or may be instructed by a program to execute related hardware, and the program may be stored in a computer readable storage medium.
  • the storage medium mentioned may be a read only memory, a magnetic disk or an optical disk or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Signal Processing (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Quality & Reliability (AREA)
  • General Physics & Mathematics (AREA)
  • Mathematical Physics (AREA)
  • Computing Systems (AREA)
  • Computer Security & Cryptography (AREA)
  • Computer Hardware Design (AREA)
  • Hardware Redundancy (AREA)
  • Small-Scale Networks (AREA)
  • Mobile Radio Communication Systems (AREA)
  • Selective Calling Equipment (AREA)

Abstract

La présente invention se rapporte au domaine technique des réseaux. L'invention concerne un procédé d'exploitation de dispositifs de nœuds, un dispositif de changement d'état de fonctionnement, un dispositif de nœud, et un support. Le procédé comporte les étapes consistant à: recevoir des demandes de vote de multiples dispositifs de nœuds, le nombre des multiples dispositifs de nœuds étant supérieur à la moitié du nombre de dispositifs de nœuds dans un système; si le dispositif de nœud actuel fonctionne dans un état de dirigeant, obtenir des informations de période de fonctionnement et les index de journal les plus récents à partir des demandes de vote des multiples dispositifs de nœuds; et si les périodes de fonctionnement dans les demandes de vote des multiples dispositifs de nœuds sont toutes plus grandes que la période de fonctionnement du dispositif de nœud actuel et les index de journal les plus récents figurant dans les demandes de vote des multiples dispositifs de nœuds sont tous au moins égaux à l'index de journal le plus récent du dispositif de nœud actuel, faire passer l'état de fonctionnement actuel de l'état de dirigeant à un état de suiveur ou à un état de candidat. Au moyen de la présente invention, un premier sous-groupe et un second sous-groupe sont combinés en un seul système pour fonctionner ensemble, améliorant ainsi la fiabilité du système.
PCT/CN2018/083594 2017-04-20 2018-04-18 Procédé d'exploitation de dispositifs de nœuds, dispositif de changement d'état de fonctionnement, dispositif de nœud, et support Ceased WO2018192533A1 (fr)

Priority Applications (2)

Application Number Priority Date Filing Date Title
EP18787276.7A EP3562123B1 (fr) 2017-04-20 2018-04-18 Procédé d'exploitation de dispositifs de noeuds, dispositif de changement d'état de fonctionnement, dispositif de noeud, et support
US16/510,723 US10833919B2 (en) 2017-04-20 2019-07-12 Node device operation method, work status switching apparatus, node device, and medium

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201710262463.9 2017-04-20
CN201710262463.9A CN107105032B (zh) 2017-04-20 2017-04-20 节点设备运行方法及节点设备

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/510,723 Continuation US10833919B2 (en) 2017-04-20 2019-07-12 Node device operation method, work status switching apparatus, node device, and medium

Publications (1)

Publication Number Publication Date
WO2018192533A1 true WO2018192533A1 (fr) 2018-10-25

Family

ID=59656639

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/083594 Ceased WO2018192533A1 (fr) 2017-04-20 2018-04-18 Procédé d'exploitation de dispositifs de nœuds, dispositif de changement d'état de fonctionnement, dispositif de nœud, et support

Country Status (4)

Country Link
US (1) US10833919B2 (fr)
EP (1) EP3562123B1 (fr)
CN (2) CN110233905B (fr)
WO (1) WO2018192533A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021012930A1 (fr) * 2019-07-23 2021-01-28 中南民族大学 Procédé et système de configuration de nœud de vote

Families Citing this family (37)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110233905B (zh) 2017-04-20 2020-12-25 腾讯科技(深圳)有限公司 节点设备运行方法、节点设备及存储介质
CN110377570B (zh) * 2017-10-12 2021-06-11 腾讯科技(深圳)有限公司 节点切换方法、装置、计算机设备及存储介质
CN109729129B (zh) 2017-10-31 2021-10-26 华为技术有限公司 存储集群系统的配置修改方法、存储集群及计算机系统
CN107995029B (zh) * 2017-11-28 2019-12-13 新华三信息技术有限公司 选举控制方法及装置、选举方法及装置
CN108134712B (zh) * 2017-12-19 2020-12-18 海能达通信股份有限公司 一种分布式集群脑裂的处理方法、装置及设备
CN108306760A (zh) * 2017-12-28 2018-07-20 中国银联股份有限公司 用于在分布式系统中使管理能力自恢复的方法和装置
CN110162511B (zh) * 2018-02-08 2023-09-01 华为技术有限公司 一种日志传输方法及相关设备
EP3777111B1 (fr) 2018-05-07 2025-01-22 Convida Wireless, Llc Interfonctionnement entre des systèmes de couche de service ido et des systèmes de registre distribué
CN109150971B (zh) * 2018-06-29 2020-10-23 腾讯科技(深圳)有限公司 超级节点投票和选举方法、装置和网络节点
CN109409828A (zh) * 2018-10-11 2019-03-01 绵阳网安科技有限公司 一种基于区块链技术的合同管理方法
CN109660367B (zh) * 2018-11-21 2021-03-26 语联网(武汉)信息技术有限公司 基于改进Raft算法的共识达成方法、装置与电子设备
CN109726211B (zh) * 2018-12-27 2020-02-04 无锡华云数据技术服务有限公司 一种分布式时序数据库
CN109947733A (zh) * 2019-03-29 2019-06-28 众安信息技术服务有限公司 数据存储装置与方法
CN111835534B (zh) * 2019-04-15 2022-05-06 华为技术有限公司 一种用于集群控制的方法,网络设备,主控节点装置及计算机可读存储介质
US11586614B2 (en) * 2019-07-30 2023-02-21 Oracle International Corporation Native persistent store support for blockchains
CN112347184B (zh) 2019-08-07 2024-07-19 华为技术有限公司 分叉处理方法以及区块链节点
CN112835748B (zh) * 2019-11-22 2025-01-17 上海宝信软件股份有限公司 基于scada系统的多中心冗余仲裁方法及系统
US12099997B1 (en) 2020-01-31 2024-09-24 Steven Mark Hoffberg Tokenized fungible liabilities
CN113515408B (zh) * 2020-04-10 2026-01-23 华为云计算技术有限公司 一种数据容灾方法、装置、设备及介质
CN111818159B (zh) * 2020-07-08 2024-04-05 腾讯科技(深圳)有限公司 数据处理节点的管理方法、装置、设备及存储介质
US11178002B1 (en) * 2020-07-10 2021-11-16 Abl Ip Holding Llc Autonomous adaptive controller for active wireless lighting communication
US11875178B2 (en) 2020-07-30 2024-01-16 Oracle International Corporation Using multiple blockchains for applying transactions to a set of persistent data objects in persistent storage systems
CN112019380B (zh) * 2020-08-12 2022-07-22 西华大学 一种基于权益激励的结合Raft和PBFT算法的区块链共识方法
CN112118305B (zh) * 2020-09-11 2023-04-21 北京易安睿龙科技有限公司 一种减少区块链共识系统中无效请求的方法
CN112261135B (zh) * 2020-10-22 2025-03-28 腾讯科技(深圳)有限公司 基于一致性协议的节点选举方法、系统、装置及设备
CN113742336B (zh) * 2021-02-09 2025-01-14 北京沃东天骏信息技术有限公司 一种数据处理方法及设备、存储介质
CN113420323B (zh) * 2021-06-04 2022-06-03 国网河北省电力有限公司信息通信分公司 数据共享方法及终端设备
US11789800B2 (en) * 2021-10-01 2023-10-17 Vmware, Inc. Degraded availability zone remediation for multi-availability zone clusters of host computers
CN114089744B (zh) * 2021-11-01 2023-11-21 南京邮电大学 一种基于改进Raft算法选择车辆队列领航车的方法
CN114268532B (zh) * 2021-11-24 2024-08-30 华人运通(上海)云计算科技有限公司 一种基于Raft协议的竞选方法、分布式系统及存储介质
CN114442523B (zh) * 2021-12-28 2025-01-07 中控技术股份有限公司 一种分布式冗余控制系统执行器的控制方法
US12137172B2 (en) 2022-01-26 2024-11-05 Oracle International Corporation Deferred and secure data signing
CN114726867B (zh) * 2022-02-28 2023-09-26 重庆趣链数字科技有限公司 一种基于Raft的热备多主方法
CN116389220B (zh) * 2023-04-07 2026-04-03 上海哔哩哔哩科技有限公司 分布式系统的业务处理方法及相关设备
US12373424B2 (en) 2023-04-14 2025-07-29 Oracle International Corporation Supporting two phase commit protocol in blockchain system
CN116340431B (zh) * 2023-05-24 2023-09-01 阿里云计算有限公司 一种分布式系统、数据同步方法、电子设备及存储介质
CN116886543A (zh) * 2023-07-25 2023-10-13 北谷电子(无锡)有限公司 物联网动态组网方法

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104679796A (zh) * 2013-12-03 2015-06-03 方正信息产业控股有限公司 一种选举方法、装置及数据库镜像集群节点
CN104933132A (zh) * 2015-06-12 2015-09-23 广州巨杉软件开发有限公司 基于操作序列号的分布式数据库有权重选举方法
WO2016127580A1 (fr) * 2015-02-10 2016-08-18 华为技术有限公司 Procédé, dispositif et système pour traiter une anomalie dans au moins un groupe distribué
CN107105032A (zh) * 2017-04-20 2017-08-29 腾讯科技(深圳)有限公司 节点设备运行方法及节点设备

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6671821B1 (en) * 1999-11-22 2003-12-30 Massachusetts Institute Of Technology Byzantine fault tolerance
US9230000B1 (en) * 2012-06-04 2016-01-05 Google Inc. Pipelining Paxos state machines
CN103152434A (zh) * 2013-03-27 2013-06-12 江苏辰云信息科技有限公司 一种分布式云系统中的领导节点更替方法
US10103801B2 (en) * 2015-06-03 2018-10-16 At&T Intellectual Property I, L.P. Host node device and methods for use therewith
CN105512266A (zh) * 2015-12-03 2016-04-20 曙光信息产业(北京)有限公司 一种实现分布式数据库操作一致性的方法及装置
CN105511987A (zh) * 2015-12-08 2016-04-20 上海爱数信息技术股份有限公司 一种强一致性且高可用的分布式任务管理系统
CN105743995B (zh) * 2016-04-05 2019-10-18 北京轻元科技有限公司 一种可移植高可用部署和管理容器集群的系统和方法
CN106060036B (zh) * 2016-05-26 2019-07-16 布比(北京)网络技术有限公司 去中心化共识方法及装置
CN106899648B (zh) * 2016-06-20 2020-02-14 阿里巴巴集团控股有限公司 一种数据处理方法和设备

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104679796A (zh) * 2013-12-03 2015-06-03 方正信息产业控股有限公司 一种选举方法、装置及数据库镜像集群节点
WO2016127580A1 (fr) * 2015-02-10 2016-08-18 华为技术有限公司 Procédé, dispositif et système pour traiter une anomalie dans au moins un groupe distribué
CN104933132A (zh) * 2015-06-12 2015-09-23 广州巨杉软件开发有限公司 基于操作序列号的分布式数据库有权重选举方法
CN107105032A (zh) * 2017-04-20 2017-08-29 腾讯科技(深圳)有限公司 节点设备运行方法及节点设备

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3562123A4 *

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2021012930A1 (fr) * 2019-07-23 2021-01-28 中南民族大学 Procédé et système de configuration de nœud de vote

Also Published As

Publication number Publication date
EP3562123A1 (fr) 2019-10-30
CN107105032B (zh) 2019-08-06
CN110233905A (zh) 2019-09-13
EP3562123B1 (fr) 2021-08-11
EP3562123A4 (fr) 2020-08-05
US20190342149A1 (en) 2019-11-07
CN110233905B (zh) 2020-12-25
CN107105032A (zh) 2017-08-29
US10833919B2 (en) 2020-11-10

Similar Documents

Publication Publication Date Title
WO2018192533A1 (fr) Procédé d'exploitation de dispositifs de nœuds, dispositif de changement d'état de fonctionnement, dispositif de nœud, et support
WO2018192534A1 (fr) Procédé d'exploitation de dispositifs de nœuds, dispositif de changement d'état de fonctionnement, dispositif de nœud et support
KR102170345B1 (ko) 뷰 변경 프로토콜을 종료하기 위한 시스템 및 방법
CN107295080B (zh) 应用于分布式服务器集群的数据存储方法和服务器
CN109151045B (zh) 一种分布式云系统及监控方法
US8671218B2 (en) Method and system for a weak membership tie-break
WO2016070375A1 (fr) Système et procédé de réplication de stockage distribué
CN114048517A (zh) 区块链的双通道共识系统和方法、计算机可读存储介质
CN110032478B (zh) 一种主备中心数据实时同步方法、装置、系统及存储介质
EP2902922A1 (fr) Système de fichiers distribué et procédé de sauvegarde de données pour système de fichiers distribué
US20240054054A1 (en) Data Backup Method and System, and Related Device
CN112380064A (zh) 一种区块链中的共识节点容错方法、装置及系统
CN106789291A (zh) 一种集群成员控制方法和装置
WO2023024821A1 (fr) Procédé, système et appareil de traitement de données, dispositif informatique et support de stockage
CN105323271B (zh) 一种云计算系统以及云计算系统的处理方法和装置
US11609824B2 (en) Byzantine fault tolerant view change processing
CN113852590A (zh) 一种大容量设备支持tcp动态迁移的方法、装置、设备和存储介质
CN116414915A (zh) 分布式数据库集群的管控方法、装置和数据库管控平台
KR102740298B1 (ko) 블록체인 네트워크에서의 합의 노드 정보 동기화 장치 및 방법
CN113727052B (zh) 一种会议恢复方法、装置、电子设备及存储介质
CN116010174A (zh) 切换服务器的方法及装置、存储介质、电子装置
HK40009213A (en) Node device operation method, node device and storage medium
HK40009213B (en) Node device operation method, node device and storage medium
Shi et al. Distributed file system multilevel fault-tolerant high availability mechanism
CN115134220B (zh) 主备服务器切换方法及装置、计算设备和存储介质

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18787276

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2018787276

Country of ref document: EP

Effective date: 20190725

NENP Non-entry into the national phase

Ref country code: DE