15 results about "Election algorithm" patented technology

According to the intelligent traffic charging data consensus system based on the block chain, a dynamically optimized hybrid consensus mechanism is adopted, a node election algorithm and a fragment consensus strategy are designed in combination with traffic flow features, and high concurrent processing capacity is achieved. The system ensures non-tampering and traceability of charging data through technologies such as credible data acquisition, intelligent contract automatic execution, hierarchical storage architecture and the like, and meets the real-time supervision requirement at the same time. A specially designed privacy protection module protects sensitive information of a user on the premise of ensuring supervision transparency, and a proposed cross-chain reconciliation protocol effectively solves the problem of multi-region collaborative charging.

The invention provides a multi-agent collaborative decision-making method, system and device, a medium and a product, and belongs to the field of business support, and the method comprises the steps: carrying out the registration and role distribution of multiple agents based on a member registration and election algorithm, and determining a round table member and a round table chairman; acquiring an external decision demand based on the round table chairman, selecting a round table member corresponding to the external decision demand as an expert group member, sending the external decision demand to the expert group member, and generating a proposal corresponding to the external decision demand by the expert group member; summarizing proposals fed back by the members of the expert group based on the round table chairman, distributing the summarized proposals to the members of the expert group, and voting the summarized proposals by the members of the expert group to obtain a voting result; voting results fed back by the members of each expert group are obtained based on the round table chairman, an optimal proposal is determined according to the voting results, and the optimal proposal is used as a decision scheme. The democratic votes are processed in parallel through multiple agents, the advantages of multi-agent decision making are exerted, and the decision making risk is reduced.

The invention relates to a dynamic collaborative deployment method and system for unmanned cluster tasks. The nodes of a cluster are divided into main nodes and sub-nodes; each node comprises a cluster communication module, a task component management module, a task component and a task component distribution table, and the method comprises the following steps: a cluster initialization stage: firstly, selecting a certain node as a main node through an election algorithm, distributing the task component by the main node according to a random algorithm, entering a task deployment stage, and executing a task deployment stage; the method comprises the following steps: determining a required task component by a child node according to the task requirement, safely deleting part of the task component from the node according to an elimination algorithm after the task is completed, updating a task component distribution table of the node, and entering a main and child node re-backup stage if the main and child nodes are lost. The problem of how to keep high efficiency, reliability and fault-tolerant capability in the unmanned cluster task deployment method under the weak communication condition is solved, and automatic, intelligent and efficient deployment of the task of the unmanned cluster under the weak communication condition is realized.

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.

The invention relates to the technical field of wireless communication, and discloses a network-free video transmission scheme implementation method, which comprises the following steps of: firstly, calculating a fitness score according to comprehensive performance parameters such as residual electric quantity and computing resources of nodes through a distributed election algorithm, and electing a unique main control device; then, the main control equipment collects neighbor list information of nodes of the whole network, constructs a weighted global network topological graph, and calculates an optimal relay path with the lowest link cost for a video transmission task based on the topological graph; and finally, the main control equipment generates and broadcasts a global unified time division multiple access time slot allocation table, and accurately allocates conflict-free sending and relay time slots for each node on the optimal path. According to the method, the flexibility of distributed election and the certainty of centralized scheduling are combined, network data collision is effectively avoided, and the reliability and the real-time performance of video transmission in a dynamic and network-free environment are remarkably improved.

The embodiment of the application provides a policy processing method and device, equipment and medium, and belongs to the technical field of databases. The method comprises the following steps: allocating task instances to a plurality of settlement databases through a target task instance, and executing the unsettled policies in the corresponding settlement databases through the task instances in parallel; for a first settlement database for which the unsettled policies have been executed, recording the task instance corresponding to the first settlement database as an idle task instance, finding a second settlement database for which the unsettled policies have not been executed through a preset election algorithm, allocating the idle task instance to the second settlement database, and executing the unsettled policies of the second settlement database through the idle task instance in parallel until the unsettled policies of all the settlement databases are executed. The embodiment can guarantee the consistency of the allocation of the task instances, and through the dynamic allocation of the task instances, the multiple utilization of the task instances is realized, and the overall settlement efficiency of the settlement databases is improved.

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 invention relates to the field of organization and scheduling of computing resources, in particular to a computing resource scheduling allocation method based on self-organization. The method comprises the following steps that a resource tree network model based on self-organization is constructed, computing resources in the resource tree network model are spontaneously added into a resource set according to the processing capacity and availability of the computing resources, management nodes are generated through a distributed election algorithm, and a system updates a scheduling allocation strategy in real time according to dynamic changes of the computing resources. According to the self-organization-based computing resource scheduling and allocation method provided by the invention, the self-organization-based resource tree network model is constructed, the management nodes and the index nodes are utilized to efficiently schedule and allocate the computing resources, and meanwhile, each computing resource is dynamically maintained in real time; and fault-tolerant processing is carried out on abnormal situations possibly occurring in the resource scheduling and allocation process, so that efficient positioning, scheduling and allocation and collaborative sharing of the computing resources are realized.

The invention discloses a transaction management system and method based on a convertible consensus protocol on an alliance chain, and belongs to the technical field of block chains and consensus protocols, and the system comprises: a consensus node monitoring committee selection module selects monitoring committee nodes from a node pool by adopting a node election algorithm based on beta distribution; the consensus protocol initialization module is used for collecting network and node information and selecting an initialization consensus algorithm; the consensus monitoring module performs state detection on nodes in a transaction process by adopting a Q-learning algorithm on the basis of monitoring committee nodes, and selects an optimal consensus algorithm from initialized consensus algorithms based on a detection result; and the consensus protocol conversion module is used for detecting the uplink transaction and the unfinished transaction, performing consensus algorithm conversion based on the unfinished transaction, and then recovering the unfinished transaction by using the converted new consensus algorithm.

The invention provides a dynamic access method and system for a wireless ad hoc network system, and the method comprises the steps: obtaining a central control node through a preset election algorithm based on a plurality of pre-obtained node parameters; based on pre-acquired initial position information of each node, calibrating the initial position information of each node through a preset ranging algorithm, and constructing a node physical space topology; obtaining real-time traffic data of each node based on a preset statistical period, and obtaining predicted traffic data of each node through a preset prediction algorithm and the real-time traffic data; sending the node physical space topology and the predicted flow data to a central control node, and performing time slot allocation on node resources through a preset resource allocation algorithm to obtain a resource allocation strategy; and sending the resource allocation strategy to each node so as to control the dynamic access of the nodes according to the resource allocation strategy. According to the invention, the space position information of the node is fully considered to carry out time slot allocation, and the access reliability of the wireless ad hoc network is improved.

The invention discloses a dynamic network adaptive multi-party quantum key exchange method based on a GHZ state, and belongs to the field of quantum cryptography. The method mainly comprises the following steps: introducing an election algorithm to fairly select an initial leader, taking a four-particle GHZ state as a core resource, and flexibly switching to use a three-particle GHZ state and a Bell state according to the number of actual participants. In a quantum key agreement QKA stage, four initial leaders are elected through an election algorithm, and quantum key agreement is realized by adopting a four-particle GHZ state and Pauli operation; in a quantum key distribution QKD stage, a four-particle GHZ state is preferentially considered, different quantum resources are adaptively adopted according to the number of participants, and consumption of the quantum resources is reduced. Quantum key exchange QKE is realized by using QKA and QKD, and a simulation result shows that the method does not need to share a key in advance and supports Ngt; 4, the number of participants is dynamically expanded, and the number can be further expanded to a multi-particle GHZ state.

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.

The application discloses a video and related information lightweight credible on-chain method based on an optimized consensus algorithm, and the method comprises the following steps: serializing a video and related attribute information into a JSON document, calculating the Hash of the video and related information by using a Hash algorithm to obtain a content digest, uploading the JSON document to an IPFS to generate a content address, taking the content digest and the content address as a blockchain transaction, verifying the blockchain transaction by each node in the blockchain, performing consensus, and on-chaining by using a smart contract, determining a node role type, constructing a confidence evaluation mechanism, periodically updating the confidence according to the reward and punishment mechanism of the consensus behavior of the node, constructing a node election algorithm, storing the transaction after the consensus by each node in the blockchain into the account book of the node, and completing the lightweight information credible on-chain process. The application optimizes the storage space, reduces the broadcast times in the consensus protocol, and improves the consensus efficiency.