首页>
外国专利>
Data Storage Method with (D,K) Moore Graph-Based Network Storage Structure
Data Storage Method with (D,K) Moore Graph-Based Network Storage Structure
展开▼
机译:(D,K)Moore基于图的网络存储结构的数据存储方法
展开▼
页面导航
摘要
著录项
相似文献
摘要
A data storing method of a (d, k) Moore graph-based network storage structure is provided. The method arranges a number of formula(I) storing nodes in a wide area network (WAN) environment in accordance with a (d, k) Moore graph to form a strongly regular network structure, and utilizes implementation methods of different separate redundant array of independent disks (RAID) techniques of multiple degrees of reliability, thereby enabling data storing supported by network-RAIDs (NRAID) of multiple degrees of reliability in a network environment; said network structure of a strongly regular graph makes an arbitrarily accessed storing node as a controlling node, and uses other d+d(d−1) storing nodes as neighboring nodes of the controlling node, wherein d is the number of one-hop neighboring nodes; and d(d−1) are the number of two-hop neighboring nodes; the controlling node stores metadata of stored data, and sends information of accessing data; the neighboring nodes provide data storing services. The present invention combines the special characteristics of a (d, k) Moore graph with RAID technology, thereby enhancing the reliability of data storing in a network environment.; ]]>
展开▼