Data storage systems

• US 20060031230A1
• Filed: 07/20/2005
• Published: 02/09/2006
• Est. Priority Date: 07/21/2004
• Status: Abandoned Application

• Current Assignee: Sinha Manish Kumar
• Original Assignee: Sinha Manish Kumar
• Inventors: Kumar, Sinha Manish
• Application Number:
  US11/185,469
• Publication Number:
  US 20060031230A1
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/182 Distributed file systems

Abstract

The invention discloses an apparatus for storage of data in a distributed storage environment and a method of efficiently storing data in such an environment which includes a set of client nodes, a set of storage nodes, meta data nodes and an administrator node, each node having processing and memory capability. The client nodes can directly access data files stored in the form of “stripes” across the storage nodes without querying the meta data node by using specially created file identifiers and storage identifiers.

Claims

1. A distributed computing environment system comprising:

a first set of a plurality of nodes (Client Nodes) each such node being defined by processing means including a “

requester”

means, a “

locator”

means, a “

transmitter”

means and a “

data-splitter”

means;

data storage means;

memory means;

input/output means and each said node being further defined and addressed by a globally unique identifier hereafter referred to as the “

parameters”

for each of said client node;

a second set of a plurality of nodes (Storage Nodes) differentiated form the first set by having enhanced data-storage capabilities and further defined by memory means;

Input/output means; and

processing means including “

receiver”

means, “

data-retrieval”

means and a “

transmitter”

means;

each said node of the second set being further defined by a plurality of variable identifiers, a measurement of the total storage space and a measurement of the total available storage space in the node, together hereafter referred to as the “

parameters”

for each of said storage nodes;

at least one meta-data node adapted to manage data, including data in the form of data files, being inputted into and outputted form the second set of nodes [storage nodes] and having a database of all data files and their respective identifier stored in the said environment, processing means including “

prefix generation”

means, “

file-identifier generation”

means adapted to generate a globally unique identifier for a data file;

said file identifier being defined by

a “

head”

element that'"'"'s derived from a hash of a pre-determined set of properties of the file

a “

next-prefix”

element that is derived from the “

prefix-generation”

means

a pre-determined “

striping”

element

a pre-determined “

sizing”

element

at least one Administrative node having tool and utilities for accessing and configuring abovementioned parameters associated with each of said nodes and disseminating modified parameters of one node to all other nodes irrespective of their set;

an interconnect means that is connected to the Input/Output means of the first set of nodes [client nodes], the second set of nodes [storage nodes], the meta-data node and the Administrative node; and

adapted to facilitate one-to-one, one-to-many, many-to-one and many-to-many data communication between the nodes;

said nodes in the first set adapted to initiate file operations within the computing environment;

said file operation including file-create, file-read and file-write operations;

said “

data splitter”

means within the each node of the first set adapted to split a file into smaller “

stripes”

of size defined by the “

sizing”

element dependent upon the file-identifier generated for that file;

said “

locator”

means within each node of the first set adapted to receive a “

file-identifier”

of a file and further adapted to provide the “

requestor” and

“

transmitter”

means within the node with a designated sequence of nodes from the second set to which the requestor or transmitter means respectively must request from or transmit data to respectively;

said “

transmitter”

means within the each node of the first set adapted to receive the stripes of the file from the “

data-splitter” and

the sequence of nodes in the second set from the “

locator” and

to transmit entire data contained in a file to a designated sequence of nodes from the second set;

said “

requestor”

means within the each node of the first set adapted to receive a designated sequence of nodes from the second set from the “

locator”

means and further adapted to send a request for file stripe to an appropriate node in the second set;

said “

prefix-generation”

means at the meta-data node adapted to generate a “

next-prefix”

element for each node in the second set by using the parameters associated with that individual node;

said “

identifier-generation”

means at the meta-data node adapted to generate a unique identifier for a file and transmitting the identifier to the node within the first set responsible for creating a file;

said “

receiver”

means within the each node of the second set adapted to receive a request for data from the “

requester”

or stripes of new or modified data form the “

transmitter”

within a node in the first set;

said “

retrieval”

means, upon trigger from the “

receiver”

means adapted to retrieve data form the storage media associated with the storage nodes and to deliver it to the “

transmitter”

means of the second set;

said “

storage”

means adapted to receive data from the “

receiver” and

store data onto a storage media; and

said “

transmitter”

means adapted to receive data from the “

retrieval”

means and further adapted to transmit data to the “

requestor”

means of the node from the first set that requested for that data.

2. The apparatus as claimed in claim 1 wherein the meta-data node comprises a combination of more than one nodes that cooperate with each other to provide the said meta date node.

3. The apparatus as claimed in claim 1 wherein the Administrative node is the meta-data node.

4. The apparatus as claimed in claim 1 wherein the Storage media of the storage node is external to the second set of nodes and is externally connected to the nodes.

5. The apparatus as claimed in claim 1 wherein there are more than one instances of the “

requester” and

“

transmitter”

means in the first set of nodes to allow for parallel execution of requests from applications being executed on the node.

6. The apparatus as claimed in claim 1 wherein there are more than one instances of the “

receiver” and

“

transmitter”

means in the second set of nodes to allow for parallel execution of requests from multiple nodes in the first set.

7. The apparatus as claimed in claim 1 wherein the “

requestor” and

the “

transmitter”

means in the first set of nodes are coupled into a single component.

8. The apparatus as claimed in claim 1 wherein the “

receiver” and

the “

transmitter”

means in the second set of nodes are coupled into a single component.

9. The apparatus as claimed in claim 1 wherein the “

identifier generation” and

the “

prefix-generation”

means are coupled into a single component on the meta-data node.

10. The apparatus as claimed in claim 1 wherein the interconnect includes multiple devices that are directly interconnected to allow bi-directional communication between all of the nodes connected to any of the device.

11. The apparatus as claimed in claim 1 wherein the interconnect includes multiple devices that are indirectly connected via a secondary network such as the Internet and allow for bi-directional communication between all of the said nodes.

12. The apparatus as claimed in claim 1 wherein the meta-data node is one of the nodes in the first set of nodes.

13. The apparatus as claimed in claim 1 wherein the client nodes are characterized by more than one globally unique identifier.

14. The apparatus as claimed in claim 1 wherein the Storage nodes are characterized by more than one set of variable identifiers.

15. A method of storing a data file in a distributed computing environment using the apparatus in accordance claims 1 comprising the following steps:

I. Providing an environment comprising a first set of a plurality of client nodes each said client node having data splitter means, locator means, requestor, transmitter means, a second set of plurality of nodes (Storage nodes) each said node being defined by a a range of identifiers and comprising a transmitter means, a receiver means, a storage means and a retrieval means, said storage means associated with storage media;

at least one meta-data node, said meta-data node comprising a identifier generation means and a prefix generation means and an interconnect for communication between the said nodes;

II. sending a request from the requester means of a client node in possession of the said data file in need of storage, to the identifier generation means of a meta-data node for generating a identifier for the said data file;

III. receiving by the identifier generation means a next-prefix from the Prefix generation means and generating a unique identifier, said identifier consisting of a next-prefix element, a hash element, a striping element and a stripe size element;

the said striping and stripe size elements being predetermined;

IV. sending, from the identifier generation means, the generated identifier to the requestor at the client node and forwarding the said identifier to the data splitter means within the same node;

V. splitting the said data file by the data splitter means into stripes of data as per the stripe size element interpreted from the said identifier;

VI. sending the identifier together with the stripes to the locator means and generating a a list containing set of destination storage nodes for the said stripes by matching the next prefix and hash elements of the said file identifier with the range of identifiers of each storage nodes;

VII. sending the said list and the said stripes to the transmitter means

VIII. transmitting the said data file at least one stripe at a time sequentially to each destination Storage node present in the said list looping across the list in a round robin manner.

16. A method of accessing stored data from a data file in a distributed computing environment using the apparatus as claimed in claim 1 comprising the following steps:

I. Providing an environment comprising a first set of a plurality of client nodes each said client node having data splitter means, locator means, requester, transmitter means, a second set of plurality of nodes (Storage nodes) each said node being defined by a a range of identifiers and comprising a transmitter means, a receiver means, a storage means and a retrieval means, said storage means associated with storage media;

at least one meta-data node, said meta-data node comprising a identifier generation means and a prefix generation means and a database of all files and their respective identifier stored in the said environment, and an interconnect for communication between the said nodes;

II. Sending a request to the meta data node for a file identifier of the said data file receiving by the requester means the identifier for the said file;

III. sending from the requestor means, the identifier for the said file to the locator means within the same node and receiving a list of a set of Storage nodes that store stripes of the said file

IV. sending a requesting from the requester means to the receiver means of one of the Storage nodes of the said set;

V. receiving the request at each of the storage nodes in the set and processing the request for retrieving at least one stripe of the said data stored in the said storage nodes;

VI. transmitting of the rerieved at least one stripe by the transmitter means of the storage node to the client node

17. The method of claim 16, which includes the step of storing the file identifier associated with a data file for future access of the same data file thereby eliminating need for the client node the access the meta data node for subsequent access to said file.

18. A method of modifying a data file stored in a distributed storage environment using the apparatus as claimed in claim 1, comprising the steps of:

I. acccesing the file in accordance with the method as claimed in claim 16;

II. carrying out in the client node modification of the data;

III. storing the modified data file in accordance with the method as claimed in claim 15.