Data Storage Method with (D,K) Moore Graph-Based Network Storage Structure
Number of patents in Portfolio can not be more than 2000
United States of America Patent
Stats
-
N/A
Issued Date -
Jul 12, 2012
app pub date -
Nov 20, 2011
filing date -
May 20, 2009
priority date (Note) -
Abandoned
status (Latency Note)
Importance
Abstract
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.
First Claim
Family
International Classification(s)
Cited Art Landscape
Patent Citation Ranking
Recipient Email Address
Recipient Email Address
Comment
Recipient Email Address
Add to Portfolio(s)
To add this patent to one, or more, of your portfolios, simply click the add button.
This Patent is in these Portfolios:
Add to additional portfolios:
Last Refreshed On:
Changes done successfully