# US 2017/0251058 A1 · Application Centric Distributed Storage System and Method

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2017/0251058 A1
- Document ID: US20170251058A1
- Status: Published application
- Kind: A1
- Application number: 15/506,334
- Filed: 2015-09-04
- Published: 2017-08-31
- Earliest claimed: 2014-09-04
- Assignees: ioFabric Inc.
- Applicants: ioFabric Inc.
- Inventors: Rayan Zachariassen; Steven Lamb
- Web page: https://patentgrep.com/patent/US20170251058A1

## CPC

- H04L 67/1097: for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
- G06F 3/0607: {by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0617: {in relation to availability}
- G06F 3/0647: {Migration mechanisms}
- G06F 3/0665: {at area level, e.g. provisioning of virtual or logical volumes}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- H04L 41/20: {Network management software packages}
- H04L 41/5009: Determining service level performance parameters or violations of service level contracts, e.g. violations of agreed response time or mean time between failures [MTBF]
- H04L 49/901: using storage descriptor, e.g. read or write pointers
- H04L 67/1095: Replication or mirroring of data, e.g. scheduling or transport for data synchronisation between network nodes
- H04L 67/51: Discovery or management thereof, e.g. service location protocol [SLP] or web services
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A software defined storage network comprising one or more storage nodes, each storage node including a computer processor and one or more data storage devices; the one or more storage devices including a computer readable medium storing data partitioned into one or more volumes; wherein the one or more volumes are visible to at least a subset of the storage nodes and to non-storage nodes on the network; and a computer system in communication with the network having a computer processor executing instructions stored on a computer readable medium to define a plurality of actors providing a storage service; wherein each actor defines a virtual representation of at least one of the volumes and acts as a controller for each of the at least one data storage devices; wherein each of the plurality of actors places data for each volume on the storage devices according to at least one policy.

## Claims

### Claim 1

A software defined storage network comprising:
one or more storage nodes, each storage node including a computer processor and one or more data storage devices;
said one or more storage devices including a computer readable medium storing data partitioned into one or more volumes;
wherein said one or more volumes are visible to at least a subset of said storage nodes and to non-storage nodes on the network;
a computer system in communication with the network having a computer processor executing instructions stored on a computer readable medium to define a plurality of actors providing a storage service; wherein each actor defines a virtual representation of one volume and acts as an exclusive or non-exclusive controller for each of said at least one data storage devices where part or all of the one volume is stored;
wherein each of said plurality of actors places data for each volume on said storage devices according to at least one policy.

### Claim 2 (depends on 1)

The storage network of claim 1, wherein the at least one policy includes one of optimizing for a target, maintaining restrictions on latency, input/output operations per second and/or bandwidth.

### Claim 3 (depends on 1)

The storage network of claim 1, wherein said software service determines performance characteristics of each storage device based in part on the experience of one or more users of a volume accessing each of the storage devices.

### Claim 4 (depends on 3)

The storage network of claim 3, wherein the storage service implements the placement of data for each volume on said storage devices based on the performance target for each volume and on the determined performance characteristics for each storage device available to the volume.

### Claim 5 (depends on 4)

The storage system of claim 4, wherein multiple storage services are amalgamated into a single storage service.

### Claim 6 (depends on 1)

The storage system of claim 1, wherein the storage service pelt tits replicated data to be placed on storage devices violating the performance target determined for each volume, wherein a copy of the replicated data is available to maintain the performance target.

### Claim 7 (depends on 1)

The storage system of claim 1, wherein the software service provides a name of each volume consistent among each node where the volume is visible to applications.

### Claim 8 (depends on 1)

The storage system of claim 1, wherein placement information required to access or store data on each of the storage devices is in part available to the storage service and in part determined through a discovery protocol.

### Claim 9 (depends on 8)

The storage system of claim 8, wherein the software service provides the capability to determine whether the placement information determined through the discovery protocol is accurate, and upon determining the placement information is inaccurate, reinitializing the discovery protocol or otherwise determining correct placement information.

### Claim 10 (depends on 1)

The storage system of claim 1, wherein more than one actor defines a virtual representation of the same volume.

### Claim 11 (depends on 1)

The storage system of claim 1, wherein two or more of said plurality of actors are merged into a single process.

### Claim 12

A method for storing computer data on a storage network, the storage network comprising one or more storage nodes, each node including a computer processor and one or more storage device and each storage device including a computer readable medium storing data partitioned into one or more volumes visible to storage and non-storage nodes on the network, the method comprising:
implementing via computer executable instructions that when executed by a processor define a plurality of actors providing a storage service; wherein each actor defines a virtual representation of one volume and acts as an exclusive or non-exclusive controller for each of said at least one data storage devices where the one volume is stored;
placing, via at least one of said plurality of actors, data for each volume on said storage devices according to at least one policy.

### Claim 13 (depends on 12)

The method of claim 12, wherein the at least one policy includes one of optimizing for a target, maintaining restrictions on latency, input/output operations per second and/or bandwidth.

### Claim 14 (depends on 12)

The method of claim 12, further comprising determining performance characteristics of each storage device based in part on the experience of one or more users of a volume accessing each of the storage devices.

### Claim 15 (depends on 14)

The method network of claim 14, further comprising storing data for each volume on said storage devices based on the performance policy for each volume and on the determined performance characteristics for each storage device available to the volume.

### Claim 16 (depends on 12)

The method of claim 12, further comprising violating the performance policy determined for each volume when storing replicated data, provided a copy of the replicated data is available to maintain compliance with the performance policy.

### Claim 17 (depends on 12)

The method of claim 12, wherein the software service provides a name of each volume consistent among each node where the volume is visible to applications.

### Claim 18 (depends on 12)

The method of claim 12, wherein placement information required to access or store data on each of the storage devices is in part available to the storage service and in part determined through a discovery protocol.

### Claim 19 (depends on 16)

The method of claim 16, wherein the software service provides the capability to determine whether the placement information determined through the discovery protocol is accurate, and upon determining the placement information is inaccurate, reinitializing the discovery protocol or otherwise determining correct placement information.

### Claim 20 (depends on 12)

The method of claim 12, wherein more than one actor defines a virtual representation of the same volume.

### Claim 21 (depends on 12)

The method of claim 12, wherein two or more of said plurality of actors are merged into a single process.
