13 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 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.

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.

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.

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 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.

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.

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 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.