×

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
First Claim
Patent Images

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 Rapplication and the data type metric Tapplication; 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 RDHT<

    Rapplication, the Peterson graph-based storage network executes both metadata writing and media data writing, where said RDHT 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.

View all claims
  • 1 Assignment
Timeline View
Assignment View
    ×
    ×