# US 2015/0106820 A1 · Method and apparatus for providing allocating resources

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

- Number: US 2015/0106820 A1
- Document ID: US20150106820A1
- Status: Published application
- Kind: A1
- Application number: 14/053,745
- Filed: 2013-10-15
- Published: 2015-04-16
- Earliest claimed: 2013-10-15
- Assignees: Alcatel-Lucent USA Inc.
- Applicants: Alcatel-Lucent USA-Inc.
- Inventors: Tirunell V. Lakshman; Fang Hao; Muralidharan Kodialam; Sarit Mukherjee
- Web page: https://patentgrep.com/patent/US20150106820A1

## CPC

- G06F 9/5011: {the resources being hardware resources other than CPUs, Servers and Terminals}
- G06F 9/505: {considering the load}
- G06F 9/5083: {Techniques for rebalancing the load in a distributed system}
- G06F 11/3433: {for load management (allocation of a server based on load conditions G06F9/505; load rebalancing G06F9/5083; redistributing the load in a network by a load balancer H04L67/1029)}
- G06F 9/5072: {Grid computing}
- G06F 9/5077: {Logical partitioning of resources; Management or configuration of virtualized resources (specific details on emulation or internal functioning of virtual machines G06F9/455)}
- G06F 2201/81: Threshold
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Various embodiments provide a method and apparatus for allocating resources to processes by using statistical allocation based on the determined maximum average resource demand at any time across all applications (“ μ”), and the determined maximum resource demand at any time by any application (“C”). In particular, resource allocation includes an auto-scaling scheme based on μ and C.

## Claims

### Claim 1

An apparatus for providing resource allocation, the apparatus comprising:
a data storage; and
a processor communicatively connected to the data storage, the processor being configured to:
determine a worst case average requirement;
determine a maximum resource requirement; and
determine a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement.

### Claim 2 (depends on 1)

The apparatus of claim 1, wherein the processor is further configured to:
determine a number of allocation steps;
wherein the set of allocation steps includes the determined number of allocation steps.

### Claim 3 (depends on 1)

The apparatus of claim 1, wherein the processor is further configured to:
collect a set of historical data;
wherein the worst case average requirement and the maximum resource requirement are based on at least a portion of the set of historical data.

### Claim 4 (depends on 3)

The apparatus of claim 3, wherein the processor is further configured to:
trigger determination of the resource allocation scheme based on a trigger event.

### Claim 5 (depends on 4)

The apparatus of claim 4, wherein the trigger event is based on resource utilization.

### Claim 6 (depends on 1)

The apparatus of claim 1, wherein the worst case average requirement=maxtμ(t); where μ(t) is the average amount of resources requested by an application at time t.

### Claim 7 (depends on 6)

The apparatus of claim 6, wherein the maximum resource requirement=maxi,thi(t); where hi(t) is the historical resource requirement for each application I at time t.

### Claim 8 (depends on 1)

The apparatus of claim 1, wherein the resource allocation scheme is based on a Markov inequality.

### Claim 9 (depends on 8)

The apparatus of claim 8, wherein the Markov inequality includes an objective to minimize an expected amount of resource allocation.

### Claim 10 (depends on 1)

The apparatus of claim 1, wherein the resource allocation scheme is based on an adversarial approach.

### Claim 11 (depends on 10)

The apparatus of claim 10, wherein the adversarial approach includes an adversary's objective to pick a density distribution that maximizes the expected amount of resources allocated to an application.

### Claim 12

A method for providing resource allocation, the method comprising:
at a processor communicatively connected to a data storage, determining a worst case average requirement;
determining, by the processor in cooperation with the data storage, a maximum resource requirement; and
determining, by the processor in cooperation with the data storage, a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement.

### Claim 13 (depends on 12)

The method of claim 12, wherein the method further comprises:
determining, by the processor in cooperation with the data storage, a number of allocation steps;
wherein the set of allocation steps includes the determined number of allocation steps.

### Claim 14 (depends on 12)

The method of claim 12, wherein the method further comprises:
collecting, by the processor in cooperation with the data storage, a set of historical data;
wherein the worst case average requirement and the maximum resource requirement are based on at least a portion of the set of historical data.

### Claim 15 (depends on 14)

The method of claim 14, wherein the method further comprises:
triggering, by the processor in cooperation with the data storage, determination of the resource allocation scheme based on a trigger event.

### Claim 16 (depends on 15)

The method of claim 15, wherein the trigger event is based on resource utilization.

### Claim 17 (depends on 12)

The method of claim 12, wherein the worst case average requirement=maxtμ(t); where μ(t) is the average amount of resources requested by an application at time t.

### Claim 18 (depends on 12)

The method of claim 12, wherein the maximum resource requirement=maxi,thi(t); where hi(t) is the historical resource requirement for each application i at time t.

### Claim 19 (depends on 12)

The method of claim 12, wherein the resource allocation scheme is based on a Markov inequality.

### Claim 20 (depends on 12)

The method of claim 12, wherein the resource allocation scheme is based on an adversarial approach.

### Claim 21

A non-transitory computer-readable storage medium storing instructions which, when executed by a computer, cause the computer to perform a method, the method comprising:
determining a worst case average requirement;
determining a maximum resource requirement; and
determining a resource allocation scheme for a set of allocation steps based on the worst case average requirement and the maximum resource requirement.
