DATA STORAGE METHOD WITH (D, K) MOORE GRAPH-BASED NETWORK STORAGE STRUCTURE

摘要

A data storage method of a (d, k) Moore graph-based network storage structure is provided. The method arranges formula (I) storage nodes in a wide area network (WAN) environment in accordance to a (d, k) Moore graph to form a network structure of a strongly regular graph, and utilizes implementation methods of different stand-alone redundant array of independent disks (RAID) techniques of various degrees of reliability, thereby enabling data storage supported by network-RAIDs (NRAID) of various degrees of reliability in a network environment; said network structure of a strongly regular graph makes an arbitrary accessed storage node a control node, and uses other d+d(d-1) storage nodes as the neighboring nodes of said control node, wherein d nodes are one-hop neighboring nodes, and d(d-1) nodes are two-hop neighboring nodes; said control node stores metadata of stored data, and sends information of accessing data; said neighboring nodes provide data storage services. The present invention combines the special characteristics of a (d, k) Moore graph with RAID technology, thereby enhancing the reliability of data storage in a network condition.