Storage network structure based on the Peterson graph and data read-write method thereof

• US 8,219,707 B2
• Filed: 09/11/2009
• Issued: 07/10/2012
• Est. Priority Date: 09/12/2008
• Status: Active Grant

• Current Assignee: Beijing Acell Technology Company Limited, Institute Of Acoustics Chinese Academy Of Sciences (Chinese Academy of Sciences)
• Original Assignee: Beijing Acell Technology Company Limited, Institute Of Acoustics Chinese Academy Of Sciences (Chinese Academy of Sciences)
• Inventors: Wang, Jinlin, Wang, Lingfang, You, Jiali, Li, Tingyi, Qi, Xiangdong
• Primary Examiner(s): Chan, Wing
• Assistant Examiner(s): MIAH, RAZU A
• Application Number:
  US12/584,790
• Publication Number:
  US 20100077101A1
• Time in Patent Office: 1,033 Days
• Field of Search: 709/238, 370/252
• US Class Current: 709/238
• CPC Class Codes: H04L 67/104 Peer-to-peer [P2P] networks
• CPC Class Codes: H04L 67/1065 Discovery involving distributed pre-established resource-based relationships among peers, e.g. based on distributed hash tables [DHT] pre-configuration of logical or physical connections H04L67/1053
• CPC Class Codes: H04L 67/1076 Resource dissemination mechanisms or network resource keeping policies for optimal resource availability in the overlay network

Abstract

A storage network structure comprises a primary distributed storage network (a cluster distributed storage network or a DHT (Distributed Hash Table)-based peer-to-peer storage network) and a Peterson graph-based storage network. The storage network structure provides different reliability classes for applications and combines the advantages of a peer-to-peer based distributed network storage with Peterson graph-based network storage, solve the problem of a large quantity of data migrating by utilizing the better media data migrating non-movable property from the Peterson graph-based network storage, and screen the single failure of the cluster storage structure and avoid performance degradation of peer-to-peer wide area storage by combining with the availability and robustness of Distributed Hash Table.

Claims

1. A data read-write method of a storage network structure based on the Peterson graph, in which said storage network structure based on the Peterson graph includes a primary distributed storage network and a storage network based on the Peterson graph, is characterized by including a method used by applications to write data and a method used by applications to read data,

and said method used by the applications to write data includes following steps:

1) said applications send a data-write request including QoS (quality of service) parameters, data identity and data, said QoS parameters defined as two metrics, namely a data reliability metric and a data type metric, each of which may be defined into several levels or classes;

2) said storage network structure receives said data write request, which is received by one central node of the storage network based on the Peterson graph or one node of the distributed storage network,

wherein the said central node refers to a specific server addressed by dns (domain name service) or alternatively all data write requests are delivered to this central node;

3) said storage network structure resolves the said data write request, which includes resolving the QoS parameters into the data reliability metric R_application and the data type metric T_application; and

4) said storage network structure executes data-writing, which includes the operations of metadata writing and media data writing by the said primary distributed storage network, wherein in case of R_DHT<

R_application, the Peterson graph-based storage network executes both metadata writing and media data writing, where said R_DHT is the reliability metric of the primary distributed storage network,

wherein the said data read method includes;

1) the step of addressing and locating the metadata, which may be performed simultaneously in the primary distributed storage network and the Peterson graph-based storage network, wherein the node or nodes providing the first returned response is or are identified; and

2) the step of reading the media data, in which after obtaining the metadata, in the case that the media data contains multiple storage nodes, the performances in terms of the delay and available bandwidth among these storage nodes are compared, and the optimal node is chosen to fulfill media data reading.

2. The data read-write method of the storage network structure based on the Peterson graph according to the claim 1 is characterized in that

in the said step 1) of the said application data write method, the data reliability metric and the data type metric of the said QoS parameter are defined as the most significant 16 bits and subsequent 16 bits of a 32-bit word, respectively.

3. The data read-write methods of the storage network structure based on the Peterson graph according to the claim 1 is characterized in that,

in the said step 4) of the said application data write method,

in the case that the Peterson graph-based storage network executes metadata writing and media data writing so as to store the data, it determines whether the node ids of the storage nodes which are responsible for data that will be stored are equal between the primary distributed storage network and the Peterson graph-based storage network, wherein if equal, one of 6 nodes which are two hops away from the current node is selected from the Peterson graph to store data;

otherwise, data may be directly stored in the node which is computed from the Peterson graph-based storage network; and

in the case that T_application is the type of minimal data migration, one node in Peterson graph based storage network is selected according to measurement algorithm to store the media data.