Node routing method for large-scale distributed storage system
What is Al technical title?
Al technical title is built by PatSnap Al team. It summarizes the technical point description of the patent document.
A technology of distributed storage and storage nodes, applied in the field of node routing of large-scale distributed storage systems, to achieve the effects of improving reliability, easy expansion, and small scale
Inactive Publication Date: 2017-05-31
ZHENGZHOU YUNHAI INFORMATION TECH CO LTD
View PDF7 Cites 7 Cited by
Summary
Abstract
Description
Claims
Application Information
AI Technical Summary
This helps you quickly interpret patents by identifying the three key elements:
Problems solved by technology
Method used
Benefits of technology
Problems solved by technology
[0003] The node routing method of a large-scale distributed storage system provided by the present invention overcomes the shortcomings and deficiencies in the prior art and solves the problem of ultra-large-scale storage
Method used
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more
Image
Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
Click on the blue label to locate the original text in one second.
Reading with bidirectional positioning of images and text.
Smart Image
Examples
Experimental program
Comparison scheme
Effect test
Embodiment 1
[0038] refer to figure 1 , a method for node routing of a large-scale distributed storage system of the present invention, comprising the following steps:
[0039] S101: When the storage node joins the distributed storage cluster, a node ID is automatically generated through a consistent hash algorithm;
[0040] S102: the storage node performs an iterative query in the network, and records the 10 nodes with the closest distance between the nodes found in the iterative query process and the node ID of the storage node into the storage node routing table;
[0041] S103: expanding the storage node routing table to obtain a routing tree;
[0042] S104: After the node leaves the distributed storage cluster, the storage node will delete the node in the routing tree. If the left node is an adjacent node, a search will be initiated at the same time. If the number of copies of the storage node in the current storage cluster is less than 3, then Copy your own storage node information ...
Embodiment 2
[0044] refer to figure 2 , a method for node routing of a large-scale distributed storage system of the present invention, comprising the following steps:
[0045] S201: When the storage node joins the distributed storage cluster, a node ID is automatically generated through a consistent hash algorithm.
[0046] S202: Searching for node IDs in the network, and re-calculating and generating storage node IDs through a consistent hash algorithm after finding a node ID conflict.
[0047] S203: the storage node performs an iterative query in the network, and records the 10 nodes with the closest distance between the nodes found in the iterative query process and the node ID of the storage node into the storage node routing table;
[0048] An iterative query consists of the following steps:
[0049] S2031: Send a search request to the A node closest to the storage node in the routing table of the storage node;
[0050] S2032: After node A receives the search request, it returns ...
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
PUM
Login to view more
Abstract
The invention relates to the field of software of distributed storage systems and discloses a node routing method for a large-scale distributed storage system. The node routing method comprises steps as follows: a node ID is automatically generated with a consistent hashing algorithm when a storage node is added to a distributed storage cluster; the storage node performs iterative query in a network, and ten nodes, nearest to the node ID of the storage node, of nodes found in the iterative query process are recorded in a storage node routing table; the storage node routing table is expanded, and a routing tree is obtained; after the node leaves the distributed storage cluster, the storage node deletes the node from the routing tree, if the node leaving the distributed storage cluster is an adjacent node, searching is started once, and if the number of copies of the storage node in the current storage cluster are smaller than 3, information of the storage node is replicated and sent to a substitute node of the adjacent node. The reliability, the usability and the access efficiency of the system are improved, and the system is easy to expand.
Description
technical field [0001] The invention relates to the software field of a distributed storage system, in particular to a node routing method of a large-scale distributed storage system. Background technique [0002] Traditional network storage systems use centralized storage servers to store all data. Once one of the storage servers fails, the data stored on the storage server cannot be used. As the amount of data increases, it becomes more difficult to manage and apply. The bottleneck of system performance is also the focus of reliability and security, which cannot meet the needs of large-scale storage applications. It is urgent to find a way to solve the storage problem of large-scale distributed data. Contents of the invention [0003] The node routing method of a large-scale distributed storage system provided by the present invention overcomes the shortcomings and deficiencies in the prior art and solves the problem of ultra-large-scale storage. [0004] In order to a...
Claims
the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more
Application Information
Patent Timeline
Application Date:The date an application was filed.
Publication Date:The date a patent or application was officially published.
First Publication Date:The earliest publication date of a patent with the same application number.
Issue Date:Publication date of the patent grant document.
PCT Entry Date:The Entry date of PCT National Phase.
Estimated Expiry Date:The statutory expiry date of a patent right according to the Patent Law, and it is the longest term of protection that the patent right can achieve without the termination of the patent right due to other reasons(Term extension factor has been taken into account ).
Invalid Date:Actual expiry date is based on effective date or publication date of legal transaction data of invalid patent.
Login to view more 
Login to view more