# US 2015/0103646 A1 · Allocating network bandwith

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

- Number: US 2015/0103646 A1
- Document ID: US20150103646A1
- Status: Published application
- Kind: A1
- Application number: 14/395,625
- Filed: 2012-04-30
- Published: 2015-04-16
- Earliest claimed: 2012-04-30
- Assignees: Hewlett-Packard Development Company, L.P.
- Inventors: Jean Tourrilhes; Kevin Christopher Webb; Sujata Banerjee
- Web page: https://patentgrep.com/patent/US20150103646A1

## CPC

- H04L 47/762: triggered by the network
- H04L 43/0882: Utilisation of link capacity
- H04L 47/10: Flow control; Congestion control
- H04L 47/125: by balancing the load, e.g. traffic engineering
- H04L 47/783: Distributed allocation of resources, e.g. bandwidth brokers
- H04L 47/22: Traffic shaping
- H04L 47/29: {using a combination of thresholds}
- H04W 8/04: Registration at HLR or HSS [Home Subscriber Server]
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)
- H04W: WIRELESS COMMUNICATION NETWORKS (broadcast communication H04H; communication systems using wireless links for non-selective communication, e.g. wireless extensions H04M1/72)

## Abstract

As an example, a system and method is provided for allocating network bandwidth. The method includes identifying congested and uncongested links using a tenant demand for each link and a tenant bandwidth cap. A portion of the tenant bandwidth cap may be allocated to each uncongested link based on the tenant demand on the uncongested link and the tenant bandwidth cap. Additionally, the remainder of the tenant bandwidth cap may be allocated to the tenants congested links based on a link capacity.

## Claims

### Claim 1

A method for allocating bandwidth in a network, comprising:
identifying congested and uncongested links for a tenant using a tenant demand for each link and a tenant bandwidth cap;
allocating a portion of the tenant bandwidth cap to each uncongested link based on the tenant demand on the uncongested link and the tenant bandwidth cap; and
allocating the remainder of the tenant bandwidth cap to the tenant's congested links based on a link capacity.

### Claim 2 (depends on 1)

The method of claim 1, wherein the congested and uncongested links are identified using distributed rate limiting comprising:
calculating a distributed rate limiting assignment for each tenant;
finding the sum of all distributed rate limiting assignments for each link;
identifying a link as uncongested if the sum of all distributed rate limiting assignments for the link is less than the link capacity; and
identifying a link as congested if the sum of all distributed rate limiting assignments for the link is greater than the link capacity.

### Claim 3 (depends on 1)

The method of claim 1, wherein a tenant owed bandwidth is calculated as a global tenant owed bandwidth multiplied by the link capacity and divided by a sum of the capacity of all the congested links where the tenant has a demand.

### Claim 4 (depends on 1)

The method of claim 1, wherein a tenant owed bandwidth for each tenant is proportionally scaled down when the sum of the tenant owed bandwidth for all tenants using the link is greater than the link capacity.

### Claim 5 (depends on 1)

The method of claim 1, wherein a tenant unused bandwidth is shared across tenants on a same congested link when a demand of a tenant on a congested link is lower than a distributed rate limiting assignment of the tenant.

### Claim 6 (depends on 1)

The method of claim 1, wherein the tenant is alllocated bandwidth on a congested link based on a per-link tenant owed bandwidth.

### Claim 7 (depends on 1)

The method of claim 1, wherein a remaining global owed bandwidth is distributed across all congested links where the tenant has a demand.

### Claim 8

A system for global tenant segregation, comprising:
a processor that is adapted to execute stored instructions; and
a storage device that stores instructions, the storage device comprising processor executable code that, when executed by the processor, is adapted to:
identify congested and uncongested links for a tenant using a tenant demand for each link and a tenant bandwidth cap;
allocate a portion of the tenant bandwidth cap to each uncongested link based on the tenant demand on the uncongested link and the tenant bandwidth cap; and
allocate the remainder of the tenant bandwidth cap to the tenant's congested links based on a link capacity.

### Claim 9 (depends on 8)

The system of claim 8, wherein the congested and uncongested links are identified using distributed rate limiting comprising:
calculating a distributed rate limiting assignment for each tenant;
finding the sum of all distributed rate limiting assignments for each link;
identifying a link as uncongested if the sum of all distributed rate limiting assignments for the link is less than the link capacity; and
identifying a link as congested if the sum of all distributed rate limiting assignments for the link is greater than the link capacity.

### Claim 10 (depends on 8)

The system of claim 8, wherein a tenant owed bandwidth is calculated as a global tenant owed bandwidth multiplied by the link capacity and divided by a sum of the capacity of all the congested links where the tenant has a demand.

### Claim 11

The system of claim, wherein a tenant owed bandwidth for each tenant is proportionally scaled down when the sum of the tenant owed bandwidth for all tenants is using the link is greater than the link capacity.

### Claim 12 (depends on 8)

The system of claim 8, wherein a tenant unused bandwidth is shared across tenants on a same congested link when a demand of a tenant on a congested link is lower than a distributed rate limiting assignment of the tenant.

### Claim 13 (depends on 8)

The system of claim 8, wherein the tenant is allocated bandwidth on a congested link based on a per-link tenant owed bandwidth.

### Claim 14 (depends on 8)

The system of claim 8, wherein a remaining global owed bandwidth is distributed across all congested links where the tenant has a demand.

### Claim 15

A tangible, non-transitory, computer-readable medium comprising code to direct a processor to
identify congested and uncongested links for a tenant using a tenant demand for each link and a tenant bandwidth cap;
allocate a portion of the tenant bandwidth cap to each uncongested link based on the tenant demand on the uncongested link and the tenant bandwidth cap; and
allocate the remainder of the tenant bandwidth cap to the tenant's congested links based on a link capacity.
