30 results about "Leader election" patented technology

The invention provides an Internet of Vehicles data sharing and storage model based on a double-layer block chain, and aims to solve the problems of low data interaction efficiency, poor expansibility, insufficient security and the like in the traditional Internet of Vehicles. According to the model, road side units are grouped geographically, an optimized Raft protocol is adopted in each group to realize rapid consensus, and an improved PBFT protocol is adopted among the groups to ensure global consistency. Self-adaptive leader election, batch processing and assembly line mechanisms are introduced into the Raft protocol, so that the throughput and response speed of the system are improved; a reputation value-based VRF main node election mechanism and a BLS aggregation signature technology are introduced into the PBFT protocol, so that the communication complexity is reduced, and the system security and fault-tolerant capability are enhanced. According to the method, the fault-tolerant rate and the message complexity of the system are analyzed theoretically, the advantages of the system in the aspects of throughput, time delay and fault-tolerant performance are verified through simulation experiments, and the method is suitable for large-scale and high-concurrency car networking application scenes.

The invention relates to the technical field of communication, in particular to a Leader node election method and system based on a ZooKeeper cluster. The method comprises the following steps: acquiring a multi-dimensional hardware load index of each node in a cluster in real time, and calculating a resource comprehensive score of each node by using a fusion evaluation model; after the cluster is initialized and started, calculating a dynamic SID by using the environment influence coefficient and the resource comprehensive score of the node, and allowing the node with the dynamic SID greater than or equal to a preset threshold value to serve as a candidate node; and in a formal election stage, determining a priority election mechanism according to the dynamic SID, obtaining a voting result of other nodes in the cluster for each candidate node, and determining a Leader node according to the voting result. According to the method, the current nodes which are sufficient in resource, healthy in operation and small in environmental influence can be used as candidate nodes to participate in Leader election, and the stability of the Leader nodes is improved.

The invention provides an anti-recombination attack consensus method and system, and the method comprises the steps: carrying out the random leader election from verifiers through employing a verifiable random function constructed by a chain type random seed in each consensus process; the selected leader generates blocks, each verifier verifies the blocks after receiving the blocks of the round, and if the verification is passed, the corresponding blocks are sequentially put into a voting waiting sequence; each verifier obtains a voting waiting sequence and preferentially votes to the block with the minimum random binary hash sequence; and iteratively performing multiple rounds of voting, if the leader collects effective votes with a satisfactory number, generating a proof of a previous block and putting the proof into the block, and when two continuous blocks obtain the proof, reaching a final determined state. According to the method, chain recombination attacks can be resisted, it can be guaranteed that the block outlet sequence cannot be predicted, and meanwhile the leader election probability can be stable so as to reduce the block recombination rate.

The invention relates to the technical field of distributed computing and micro-service architecture, in particular to a micro-service leader election method and system based on distributed coordination, and the method comprises the steps: deploying a plurality of micro-service copies in a container environment, and carrying out the routing request through a load balancing server, all micro-service copies share a distributed coordination storage instance as a coordination center, and on this basis, the micro-service leader election method comprises the following steps: S1, all micro-service copies attempt to acquire a distributed lock through a distributed lock acquisition command of the coordination center at the same time; s2, successfully obtaining a micro-service copy of the distributed lock as a Leader copy, and taking other micro-service copies as Follower copies; and S3, the Leader copy renews the lock every fixed interval, and the free count is updated. According to the method, distributed coordination storage is used as a coordination mechanism, and it is ensured that only one micro-service copy provides service for the outside in a specific scene.

The invention discloses an auction record layering and domain-dividing consensus method for a computing power block chain network, and the method comprises the steps: constructing a comprehensive scoring system based on the activeness, creditworthiness and task adaptation degree of nodes, and dynamically electing a high-reliability leader node; dynamically dividing following nodes into different levels based on inter-node multi-dimensional communication indexes; averagely dividing data carried by the leader node into a plurality of data fields; establishing a follower node communication cost and storage cost model; establishing a node selection model based on communication cost and storage cost and considering backup times, and selecting a node to copy an auction record; and generating a dynamic key by using a hierarchical and domain-divided result and node spatio-temporal information, and performing encrypted storage on a node auction record. According to the method, the problems of low leader election efficiency, high node bearing pressure, insufficient expansion capability and the like of the global consensus method in a computing power resource transaction scene are solved, and the method has a wide application prospect.

This invention proposes a multi-committee parallel Byzantine fault-tolerant consensus method, GP-BFT. This method groups system replicas into multiple independent committees based on the minimum Byzantine fault tolerance parameter. Each committee executes consensus in parallel, effectively reducing intra-group communication. A two-level leader election is employed: each committee elects a first-level leader responsible for intra-group consensus, and a second-level leader is elected from among the first-level leaders using a threshold coin to coordinate globally. A dual timeout handling mechanism is designed: when less than half of the committees time out, cross-path collaborative commit is used, leveraging committees that have completed consensus to drive the timed-out committees to quickly resubmit; when more than half of the committees time out, aggregated timeout certificates are used to advance the global round. This method significantly reduces consensus latency and communication overhead in large-scale replica scenarios while ensuring security and liveness.

The present invention relates to the field of Internet of Things technology, and specifically to an Internet of Things leader election method and a broadcast method based on blockchain consensus. First, according to the proof-of-stake consensus mechanism, committee nodes of the Internet of Things blockchain are elected from several Internet of Things nodes; then, according to the hash value of the current block of the Internet of Things blockchain and the current stage number of the Internet of Things blockchain, a first random number corresponding to the block is generated; finally, according to the credibility of each committee node and the first random number, a leader node is elected from each committee node. Since the proof-of-stake consensus mechanism is only associated with the credibility of each Internet of Things node and does not involve other data, computing power can be saved.

A method for designating an active pod replica amongst a plurality of pod replicas operating in an active-passive configuration within a containerized application cluster. The method includes: implementing, by a master node of the containerized application cluster, an elected leader lease; making an attempt, by a leader election container executing in a pod replica of the plurality of pod replicas, to acquire the elected leader lease; making a determination, based on the attempt and by the leader election container, that the elected leader lease has been successfully acquired; and designating, based on the determination and by the leader election container, the pod replica as the active pod replica.

This invention discloses an asynchronous network consensus method and system based on a reputation model, belonging to the field of consensus algorithm technology. It aims to solve the problems of low efficiency, high latency, and frequent leader election failures in asynchronous network environments. The method is divided into a broadcast phase and a consensus phase: In the broadcast phase, broadcast nodes encode erasure codes into message fragments and distribute them; receiving nodes verify these fragments and store them in the corresponding priority queues. In the consensus phase, each node generates a binary value vector based on its priority queue and distributes it across the network. A leader is elected based on the reputation value calculated by each node. An asynchronous binary consensus protocol is used to reach a consensus on the leader's validity, determining a multi-value Byzantine consensus result. Finally, the original message is requested and restored from the node indicated by the result. Erasure coding reduces communication overhead, and the reputation model reduces the number of consensus failures, improving system throughput, reducing latency, and enhancing stability and efficiency in asynchronous network environments.

The invention discloses a method and a system for quickly electing a leader node. The method comprises the following steps: S1, dividing all consensus nodes in a block chain into m partitions according to a specific rule; s2, independently performing pre-election in each partition based on a Raft election algorithm to generate a pre-leader node of each partition; and S3, the pre-leader node generated by each partition participates in global leader node election based on a Raft election algorithm, and a leader node of the whole block chain network is generated. According to the method, global election is decomposed into two levels of partition pre-selection and global decision-selection, and one-time complex election needing a large number of nodes for coordination is converted into two-time election with much smaller scale. According to the hierarchical and partitioned election mode, the election time of the leader node is greatly saved.

The present invention discloses a memory fragmentation management method, device, and system, relating to the field of computer technology. A specific implementation of the method includes: upon receiving a management request issued by any node in a distributed system when memory fragmentation management conditions are met, determining whether a leader replica exists in the node; if a leader replica exists in the node, determining the follower replicas corresponding to each leader replica in the node on other nodes, and sending an election instruction to the follower replica; the election instruction instructs the follower replica and the leader replica to perform a leader election, and restricts the candidates for the leader election to be among the follower replicas; after obtaining the election result of the leader election, the node is restarted. This implementation can effectively manage memory fragmentation in distributed system nodes without affecting business.

A device for protecting an electrical power supply grid and for automating and controlling components of a substation, includes at least two intelligent electronic devices (IEDs) networked to one another and each connected via a preprocessing unit to at least one measuring sensor each configured to record a measured variable characterizing the state of the electrical power supply grid at a measuring point of a power supply grid. The preprocessing unit is connected to the measuring sensors at the input and is configured to transfer measured values provided at the output to at least one IED. Each IED is configured to perform predefined protection, control and / or automation functions (PCAFs). Orchestration software provides an orchestration method that dynamically distributes the PCAFs among the IEDs based on a leader election method, to make the device more cost-effective and simultaneously able to be operated with a high level of reliability.

Embodiments of the present invention provide a storage system, a leader preemption and data replication method, a device, a medium, and a program product. In a storage resource shared by a plurality of storage nodes, a synchronization state field for recording a synchronization state of data stored by master and slave nodes and a target master node field for recording an identifier of a master node closest to the current time are added, and a storage node queries the synchronization state field and the target master node field during leader election. When the value of the synchronization state field is a first identifier representing data asynchrony between the master and slave nodes, if the value of the target master node field is the value of the storage node, it indicates that the storage node is the master node when the storage system is abnormal, and the data stored in the storage node is the latest and complete. Therefore, the storage node is qualified as a master node to take over services, so as to reduce the probability of data loss in the storage system, and even avoid data loss in the storage system, thereby ensuring the reliability of the storage system.

The invention discloses a randomization method and a single secret leader election method, and belongs to the technical field of computer technology and information security. In order to solve the technical problems of unfair leader election and insufficient privacy caused by the fact that a decayed enemy can use a randomization process to interfere a system state, an approximately unique randomization component is constructed by using random factor commitment and hierarchical broadcast, and the component is used for driving a random shuffling process to generate a unique system state. A leader node is selected from the secret list based on the persistent random pointer and the system state is updated by the selected leader. According to the scheme, the consistency of randomization results and the approximate uniqueness of random factors can be realized, corruption opponents with any malicious behaviors can be resisted, and the fairness and privacy of election of a single secret leader can be ensured.

Systems and methods for dynamic leader election in telecommunications systems (e.g., 3GPP 5G or 6G systems). The dynamic leader election refers to selecting a device from a group of devices as a leader device and routing traffic to the selected leader device. This approach allows the leader election demand to be provided to the system by an external entity.

The present invention proposes a Raft leader election method and system in a heterogeneous environment, which relates to the field of distributed storage. The specific solution includes: after a slave node discovers that it meets the timeout heartbeat condition, it transforms into a candidate node and sends a request for vote message for election to other slave nodes in the cluster; after receiving the request for vote message, other slave nodes perform a voting operation and send a vote response message containing the voting result and their own priorities back to the candidate node; after receiving the vote response messages from other slave nodes, the candidate node transforms into a new master node when the voting result meets the conditions; the master node checks the priority information in the vote response message to determine whether to transfer the master node; after the master node fails, the newly elected master node will detect the status of other nodes according to the vote response message; if a node with higher performance is found, the master node will be transferred to this node, reducing the randomness of the leader election result, thereby improving the performance and stability of the cluster.

The invention discloses a passive Leader election method for satellite-borne multiple nodes, and belongs to the technical field of satellite communication and edge computing. The method comprises the following steps: pre-configuring the same ordered node list for all nodes in a satellite, and judging that the initial state of each node is a Leader node or an Agent node; the Agent node packages a local application request and then forwards the local application request to the Leader node, and the Leader node carries out priority ranking and convergence; if a certain Agent node fails to forward, the current Leader node is judged to be invalid, a new Leader index is calculated, and the state of each node is updated; each Agent node marks the initial state and the sent state of each message, and after the Leader node is updated, all the messages in the sent state are reset to be in the initial state and sent again. According to the invention, the load of the in-satellite network is reduced, the Leader node can be quickly switched, and the data is ensured not to be lost.

A load balancing method for use in conjunction with an application or service provided by a distributed computing system may begin by electing, from a group of participants, a leader for each of a plurality of tasks associated with the application or service. Responsive to detecting a signal or some other indication to run a particular task, the elected leader of the particular task may delegate responsibility to run the particular task to a particular participant. The particular participant, upon subsequently discovering that responsibility for the particular task has been delegated to it, responds by running the particular task. In some embodiments, the elected leader for a task may delegate responsibility for running the task to a least-loaded participant.

The application discloses a kind of passive Leader election methods of spaceborne multi-node, belong to satellite communication and edge computing technical field.The application includes: the same ordered node list is pre-configured for all nodes in satellite, each node judges initial state as Leader or Agent node;Agent node encapsulates local application request and forwards to Leader node, and priority sorting and convergence are carried out by Leader node;If some Agent node fails to forward, then judge that current Leader node is invalid, calculate new Leader index, and each node state is updated;Each Agent node marks each message with initial and sent state, and when Leader node is updated, all messages in sent state are reset to initial state and retransmitted.The application not only reduces the network load in satellite, but also quickly switches Leader node, ensures that data is not lost.

This invention provides a method and apparatus for implementing a dual-datacenter arbitration system based on a distributed key-value repository. The method includes: in response to the startup of the dual-datacenter arbitration system, obtaining configuration parameters, determining the role information of the arbitration nodes, broadcasting the role information of the arbitration nodes to a first node and a second node, receiving the role information of the first node and the second node, selecting a leader node from the first node and the second node based on the role information of the first node and the second node, obtaining a message permission list for the arbitration nodes based on the role information of the arbitration nodes, and filtering operation instruction messages sent by the leader node through the message permission list. This achieves the goal of optimizing the leader election process by adding a target role, allowing the arbitration nodes to only participate in voting for the leader without being elected as the leader, and eliminating the need for data storage and replication. It also saves bandwidth and computing and storage resources.

The invention discloses an unmanned cluster grey wolf simulation task dynamic scheduling method under severe communication, which comprises the following steps: firstly, constructing an unmanned cluster system model, a task demand and constraint model and a complex communication limited environment model, and providing a theoretical modeling basis for task dynamic scheduling; and finally, in a task redistribution stage, redistribution is started based on a time-event double-trigger mechanism, a load balancing strategy is adopted to construct a joint optimization target, and task dynamic adjustment is realized under the condition that constraint conditions are met. Based on the grey wolf society level, a three-level dynamic leader election mechanism is adopted, and an event-time double-trigger strategy is combined, so that the decision continuity in a high-interference environment is ensured, the task success rate is effectively improved, and the problem that an existing cluster task allocation method is insufficient in adaptability in extreme communication conditions and complex dynamic environments is solved.

The present invention belongs to the technical field of computer networks and relates to a method for quickly electing a hidden leader for a lightweight blockchain network. It includes: the server and nodes initialize the basic network information. The server broadcasts signals to all nodes in the network at a predetermined power; S3 The nodes calculate the path loss between them and the server according to the power of the received signal and the predetermined power. The nodes participate in the election with a certain probability, randomly and uniformly generate an ID within a predetermined range and send signals at a certain power; The server monitors the channel, calculates the sum of the received signal powers, and sends the sum of the received powers to all nodes, and monitors the election termination signal. If there is a termination signal, then the election stops; The nodes monitor the channel and determine whether they become the leader according to the sum of the powers. If they become the leader, then send a termination signal, otherwise continue with S3. The present invention considers realizing the quick election of a hidden leader in a lightweight blockchain network with limited performance.

The present invention relates to the field of distributed consistency and discloses an efficient Raft leader election method combining proof-of-work and proof-of-stake. The main purpose of the present invention is to solve the problem that the shortcomings of the existing technology affect the consensus efficiency and fault tolerance of the Raft consensus algorithm. The main scheme includes modifying the status field information of the Raft node and adding the required node status information; defining the proof-of-work problem of the node's equity value, and selecting an alternative leader node based on the proof-of-work and proof-of-stake; scoring the priority of the node according to the status indicator data, calculating the priority score, and the leader node establishing a node priority model based on the node's priority score; and providing an improved leader election mechanism based on the node priority model and combining proof-of-work and proof-of-stake.

The invention discloses an asynchronous network consensus method and system based on a reputation model, belongs to the technical field of consensus algorithms, and aims to solve the problems of low consensus protocol efficiency, high delay and frequent leader election failure in an asynchronous network environment. The broadcast node encodes erasure codes into message fragments and distributes the message fragments, and the receiving node verifies the message fragments and then stores the message fragments into a corresponding priority queue; in the consensus stage, each node generates binary value vectors according to the priority queue and disperses the binary value vectors to the whole network, a reputation value is calculated based on each node to elect a leader, consensus is carried out on the leader validity through an asynchronous binary consensus protocol to determine a multi-valued Byzantine consensus result, and finally the node indicated by the result requests and recovers an original message. The communication overhead is reduced through the erasure code, the consensus failure frequency is reduced through the reputation model, the system throughput is improved, the delay is reduced, and the stability and efficiency in the asynchronous network environment are enhanced.

The application relates to a blockchain consensus protocol based on a proof-of-stake mechanism, and proposes a new distributed random beacon (DRB) to select a leader for generating a block, which can resist attacks of malicious nodes and guarantee randomness and fairness of leader election. A new longest chain rule is proposed, so that honest nodes can select the same main chain for block synchronization, improve consensus efficiency and reduce chain bifurcation rate, and support dynamic availability. Compared with some previous blockchain consensus protocols, the blockchain consensus protocol based on the proof-of-stake mechanism has higher throughput, safety and consensus efficiency.

The invention provides a message authentication and leader election integrated block chain consensus method and system, and the method comprises the steps: enabling a node to use a private key and message content as input, and calculating a random value beta outputted by a verifiable random function VRF and a corresponding proof pi; the protocol selects leader nodes fairly and decentrally based on a comparison result of a verifiable random function VRF random value in a whole network consensus round by comparing the random value beta generated by the nodes; and all nodes verify a verifiable random function VRF to prove pi by using a node public key, and confirm the legality of the message and the authenticity of the election result.

The invention belongs to the technical field of computer networks, and relates to a quick secret leader election method for a lightweight block chain network. Comprising the steps that a server and nodes initialize network basic information; the server broadcasts signals to all nodes in the network at the agreed power; s3, the node calculates the path loss of the node and the server according to the power of the received signal and the agreed power, the node participates in election with a certain probability, and the node randomly and uniformly generates an ID according to the agreed range and sends the signal with a certain power; the server monitors the channel, calculates the power sum of the received signal, sends the received power sum to all nodes, monitors an election termination signal, and stops election if the termination signal exists; and S3, monitoring the channel by the node, judging whether the node becomes a leader or not according to the power sum, if so, sending a termination signal, otherwise, continuing S3. According to the method, rapid election of the secret leader in the lightweight block chain network with limited performance is considered.

The invention provides a dynamic communication perception and self-adaptive collaboration method for multiple industrial internetworks. In order to solve the problem of time sequence difference and locality of node state sensing in a network caused by communication delay and dynamic change of bandwidth among factor networks in multiple industrial internetworks, the invention provides a collaborative sensing model based on a time sequence hierarchical attention mechanism. And four key sub-modules are designed: leader election, network layer feature extraction, dynamic communication scheduling and cross-network feature fusion. In a model execution process, each sub-network dynamically elects a leader node to extract key features of the network, and adaptively selects a communication target according to a communication state to realize efficient data exchange. And finally, forming a global decision feature vector by fusing cross-network information. According to the method, multi-network state sensing synchronization can be realized under a dynamic communication condition, and the global sensing precision and the system cooperation performance are improved.

The invention mainly relates to the technical field of block chains, provides an improved Raft algorithm based on dynamic priority leader election and EdDSA digital signature, and mainly aims to solve the problem that low-quality or high-load nodes of an existing Raft algorithm fight for the position of a leader, and the system performance is affected. The core idea of the method is as follows: determining the local priority of each node based on a PR value, distributing shorter election duration for the node with the high local priority, setting a target priority, comparing the target priority of each node with the local priority, judging whether the local priority is greater than or equal to the target priority, and if so, executing the next step; the nodes are allowed to be converted into candidate nodes to initiate voting requests to other nodes, the nodes receiving the voting requests check whether the local priorities of the candidate nodes are larger than or equal to the target priorities of the nodes, if yes, the nodes vote candidates, the candidates compete to become leaders, and finally log copying is carried out based on EdDSA digital signatures. And the performance of the cluster system is ensured.

The present invention proposes a leader election method (Eleder algorithm) in a multi - person off - chain channel of a blockchain. A node scoring mechanism calculates the importance score of ordinary nodes by comprehensively analyzing various indicators of ordinary nodes. The election strategy mechanism that uses Algorand to convert the importance score into importance shares ensures the enthusiasm of ordinary nodes while electing high - quality leaders. At the same time, a confusion protection mechanism is designed where the current leader acts as a confounder, avoiding the premature disclosure of the new leader and playing a role in privacy protection.