3 results about "Election algorithm" patented technology

Disclosed in the present application a method for electing a master node in a cluster. The method comprises the following steps: on the basis of a hyper-converged cloud platform, creating a storage cluster, and configuring a status detection program and a full response operation function; performing active node screening on the storage cluster, so as to obtain an active node set and a candidate node set; setting a first data situation, detecting a second data situation of the active node set, and executing a determination step on the basis of the first data situation and the second data situation, so as to obtain a determination result; when the determination result is a first result, setting an arrangement sequence and a first selection position, and electing a first master node according to the arrangement sequence, the first selection position and the active node set; and when the determination result is a second result, configuring a consistency election algorithm and a distributed election algorithm, and electing a second master node on the basis of the candidate node set, the consistency election algorithm and the distributed election algorithm. By means of the present application, an excessively long election time of a master node and unsuccessful election of the master node are avoided, thereby improving the deployment efficiency of a cluster.

This invention seeks protection for a consensus method for vehicle-to-everything (V2X) networks based on a two-layer blockchain, belonging to the field of V2X security technology. It includes: S1, constructing a two-layer architecture of a bottom-layer sharded chain and a top-layer main chain; S2, selecting vehicle nodes participating in the sharded chain consensus through a multi-dimensional consensus node election algorithm; S3, determining the sharded chain consensus master node using a hidden master node election mechanism; S4, completing consensus within the sharded chains using a practical Byzantine fault-tolerant algorithm; S5, the main chain adopts a directed acyclic graph consensus mechanism and introduces a dynamic verification quantity calculation model. The advantages of this invention are: (1) The multi-dimensional election algorithm selects high-quality nodes, improving consensus stability and security; (2) The layered architecture divides the V2X network into parallel consensus domains, with the bottom layer handling local consensus in parallel to reduce communication complexity, and the top layer coordinating cross-shard transactions to improve scalability; (3) The dynamic verification quantity calculation model adaptively adjusts the verification quantity according to network load, significantly improving system throughput.

An information handling system may include at least one processor and a memory. The information handling system may be configured to: perform a first primary node election among a plurality of nodes of an information handling system cluster to determine a first primary node, wherein the first election is based on a common election algorithm; determine a cloud intent associated with the plurality of nodes; in response to a determination that the cloud intent is associated with an additional primary node requirement, perform a second primary node election among the plurality of nodes to determine a second primary node different from the first primary node, wherein the second election is based on a vertical election algorithm; and cause the second primary node to act as a primary node of the cluster of information handling systems.