Method of distributed data redundancy storage using consistent hashing

A method of distributed data redundancy storage using consistent hashing, comprising:

• a node creating step:
• establishing a logical topology between hash subspace(s) and each storage node in a distributed storage system, and determining a position of each node in a storage node sequence corresponding to each hash subspace by using consistent hashing;
• wherein establishing the logical topology comprises:
• defining node properties which includes at least one of:
• node identity, node type, node weight, child node list and child node weight list;
• the node identity including at least one of:
• storage identity, host identity, rack identity and data center identity;
• the node type including at least one of:
• storage node, host node, rack node, data center node and root node,
• constructing logical topology based on hierarchical architecture of cluster(s) of physical storage device(s) and defining node type according to a position of the physical storage device in the hierarchical architecture of cluster(s);
• the physical storage device including a memory, a host controlling the memory, a rack in which the host is placed, and a data center to which the rack subordinate,
• defining the root node as a representative of the hierarchical architecture of cluster(s);
• and
• defining the memory as a leaf node located at a bottom-most layer of the hierarchical architecture of cluster(s);
• a data writing step:
• determining a number of data copies and each piece of stored data according to a redundant storage policy of pre-stored data;
• and
• storing each piece of stored data in a different storage node according to storage rules.