Node performance detection system and method for decentralized storage network
A storage network and decentralization technology, applied in the field of distributed networks, can solve the problem of no node performance detection mechanism performance detection mechanism application optimization, etc., to achieve distributed detection and update, improve performance, and optimize distributed storage applications. Effect
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0038] A node performance detection system of a decentralized storage network, the system includes: several peer-to-peer network nodes; the network nodes are connected through a point-to-point network; the nodes include: a node detection unit, a random data access unit, a detection Response unit, data statistics recording unit and control unit; the node detection unit is used for periodic active detection of reachability and availability between nodes in the point-to-point decentralized storage network; the random data access unit is used for Perform storage access performance detection between nodes in a point-to-point decentralized storage network; the detection response unit is used to receive detection messages and respond in time; the data statistics recording unit: used for data exchange and data process, and record the process to form a statistical report of node performance; the control unit is used to construct a node ID, encrypt and sign the detection data, and the const
Embodiment 2
[0055] On the basis of the previous embodiment, the node further includes a node connection unit for:
[0056] making the node periodically obtain node ID information of other nodes;
[0057] making the node determine the degree of ID coincidence with other nodes, and retain the ID information of the relevant nodes whose ID coincidence degree is greater than a preset threshold;
[0058] determining the proximity of the node to each of the related nodes according to the ID information of the related nodes;
[0059] The nodes are made to sequentially select the related nodes with the largest proximity to connect until the maximum connection number of the nodes is reached.
[0060] Specifically, when the node ID is determined, point-to-point connection node selection: how each node selects other nodes to be connected, including the following steps:
[0061] a) Each node can set the size of the distributed hash table to store the state of some nodes in the network;
[0062] b) The
Embodiment 3
[0069] On the basis of the previous embodiment, the node detection unit is specifically used for:
[0070] Randomly select a preset number of nodes to be detected from the nodes in the distributed hash table inside the node;
[0071] From the nodes to be detected, the node to be detected with the highest detectability is sequentially selected for detection.
[0072] Specifically, point-to-point detection node selection: how each node selects the node to be detected in each round, including the following steps:
[0073] a) Selection of detection nodes From the nodes in the distributed hash table inside the node, note that this does not refer to the connected nodes;
[0074] b) Each round is selected separately and a random factor is added. This random factor can consider the time factor to ensure the randomness and detectability of each round of detection:
[0075]
[0076] select V detect The larger one is detected, and the number of detections in each round is configurable
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap