# US 2019/0171371 A1 · Tenant-level sharding of disks with tenant-specific storage modules to enable policies per tenant in a distributed storage system

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

- Number: US 2019/0171371 A1
- Document ID: US20190171371A1
- Status: Published application
- Kind: A1
- Application number: 16/268,397
- Filed: 2019-02-05
- Published: 2019-06-06
- Earliest claimed: 2015-05-15
- Assignees: Cisco Technology, Inc.
- Applicants: Cisco Technology, Inc.
- Inventors: Johnu George; Kai Zhang; Yathiraj B. Udupi; Debojyoti Dutta
- Web page: https://patentgrep.com/patent/US20190171371A1

## CPC

- G06F 3/0608: {Saving storage space on storage systems}
- G06F 3/0605: {by facilitating the interaction with a user or administrator}
- G06F 3/0631: {by allocating resources to storage systems}
- G06F 3/0644: {Management of space entities, e.g. partitions, extents, pools}
- 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 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 16/84: Mapping; Conversion
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments include receiving an indication of a data storage module to be associated with a tenant of a distributed storage system, allocating a partition of a disk for data of the tenant, creating a first association between the data storage module and the disk partition, creating a second association between the data storage module and the tenant, and creating rules for the data storage module based on one or more policies configured for the tenant. Embodiments further include receiving an indication of a type of subscription model selected for the tenant, and selecting the disk partition to be allocated based, at least in part, on the subscription model selected for the tenant. More specific embodiments include generating a storage map indicating the first association between the data storage module and the disk partition and indicating the second association between the data storage module and the tenant.

## Claims

### Claim 1

A method comprising:
receiving a request for data storage for a tenant;
selecting a partition of a disk to be dedicated to the tenant based, at least in part, on one or more policies including a distribution requirement and/or a replication requirement for data of the tenant, the replication requirement being a number of replicas desired for at least a portion of the data, and the distribution requirement being how far apart or how close together the replicas can be stored relative to each other; and
allocating the partition for the data of the tenant.

### Claim 2 (depends on 1)

The method of claim 1, further comprising:
receiving an indication of a type of subscription model selected for the tenant.

### Claim 3 (depends on 2)

The method of claim 2, wherein the subscription model includes a tenant-specific policy of the one or more policies used to select the partition.

### Claim 4 (depends on 1)

The method of claim 1, further comprising:
storing at least some of the data in a data storage module based, at least in part, on rules created for the data storage module.

### Claim 5 (depends on 1)

The method of claim 1, further comprising:
generating a storage map indicating assignment of data storage module to the partition.

### Claim 6 (depends on 5)

The method of claim 5, further comprising:
generating a unique identifier of the data storage module, wherein the unique identifier of the data storage module is mapped to the tenant in the storage map, and wherein the unique identifier is not mapped to any other tenants in the storage map.

### Claim 7 (depends on 5)

The method of claim 5, wherein the storage map includes a first mapping of a unique identifier of the data storage module to the tenant and a second mapping of the unique identifier of the data storage module to the partition.

### Claim 8 (depends on 1)

The method of claim 1, wherein one or more other partitions of the disk are associated with one or more other data storage modules, respectively, and wherein the one or more other data storage modules are associated with one or more other tenants, respectively, of a distributed storage system.

### Claim 9 (depends on 1)

The method of claim 1,
wherein,
the one or more policies are related to the distribution requirement for the data and the replication requirement for the data, and
the number of replicas is for only the portion of the data.

### Claim 10 (depends on 1)

The method claim 1, further comprising:
selecting a second partition of the disk to be dedicated to the tenant;
allocating the second partition for other data of the tenant;
assigning a second data storage module of one or more data storage modules to the second partition;
assigning the second data storage module to the tenant; and
creating other rules for the second data storage module based on one or more other tenant-specific policies configured for storing the other data of the tenant.

### Claim 11

At least one non-transitory machine readable storage medium comprising instructions that, when executed by at least one processor, cause the at least one processor to:
receive a request for data storage for a tenant;
select a partition of a disk to be dedicated to the tenant based, at least in part, on one or more policies including a distribution requirement and/or a replication requirement for data of the tenant, the replication requirement being a number of replicas desired for at least a portion of the data, and the distribution requirement being how far apart or how close together the replicas can be stored relative to each other; and
allocate the partition for the data of the tenant.

### Claim 12 (depends on 11)

The at least one non-transitory machine readable storage medium of claim 11,
wherein the instructions when executed by the at least one processor cause the at least one processor to:
receive an indication of a type of subscription model selected for the tenant.

### Claim 13 (depends on 12)

The at least one non-transitory machine readable storage medium of claim 12, wherein the subscription model selected for the tenant includes a tenant-specific policy of the one or more policies used to select the partition.

### Claim 14 (depends on 11)

The at least one non-transitory machine readable storage medium of claim 11, wherein a data storage module stores at least some data of the tenant in the partition based, at least in part, on rules.

### Claim 15 (depends on 11)

The at least one non-transitory machine readable storage medium of claim 11,
wherein the instructions when executed by the at least one processor cause the at least one processor to:
generate a storage map indicating an assignment of a data storage module to the partition and indicating the assignment of the data storage module to the tenant.

### Claim 16

An apparatus comprising:
at least one processor; and
at least one memory element comprising instructions that when executed by the at least one processor perform operations comprising:
receiving a request for data storage for a tenant;
selecting a partition of a disk to be dedicated to the tenant based, at least in part, on one or more policies including a distribution requirement and/or a replication requirement for data of the tenant, the replication requirement being a number of replicas desired for at least a portion of the data, and the distribution requirement being how far apart or how close together the replicas can be stored relative to each other; and
allocating the partition of the disk for the data of the tenant.

### Claim 17 (depends on 16)

The apparatus of claim 16, wherein the instructions when executed by the at least one processor cause the apparatus to:
generating a unique identifier of a data storage module, the unique identifier mapped to the tenant in a storage map, the unique identifier not mapped to any other tenants in the storage map.

### Claim 18 (depends on 16)

The apparatus of claim 16, wherein the data includes one of objects, files or blocks.

### Claim 19 (depends on 16)

The apparatus of claim 16, wherein one or more other data storage modules are assigned to one or more other partitions of the disk, respectively, and wherein the one or more other data storage modules are assigned to one or more other tenants, respectively, of a distributed storage system.

### Claim 20 (depends on 16)

The apparatus of claim 16, wherein the apparatus includes a distributed storage system with a storage cluster having at least one metadata server configured to store metadata associated with objects.
