# US 2023/0403319 A1 · Capacity-aware layer-4 load balancer

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

- Number: US 2023/0403319 A1
- Document ID: US20230403319A1
- Status: Published application
- Kind: A1
- Application number: 18/227,304
- Filed: 2023-07-28
- Published: 2023-12-14
- Earliest claimed: 2022-05-17
- Assignees: VMware, Inc.
- Applicants: VMware, Inc.
- Inventors: Sachin Pandey; Rohan Gandhi; Sreeram Iyer; Santosh Pallagatti Kotrabasappa; Sairam Veeraswamy
- Web page: https://patentgrep.com/patent/US20230403319A1

## CPC

- H04L 67/1008: based on parameters of servers, e.g. available memory or workload (monitoring of computer activity G06F11/30)
- H04L 67/1001: for accessing one among a plurality of replicated servers
- H04L 67/101: based on network conditions
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Some embodiments provide a method of implementing capacity-aware load balancing across a set of data compute nodes (DCNs) by reducing latency for the set of DCNs. From the set of DCNs, the method identifies (1) a first subset of DCNs including DCNs that have a latency that is higher than an average latency computed for the set of DCNs and (2) a second subset of DCNs including DCNs that have a latency that is lower than the average latency computed for the set of DCNs. For each DCN in the first subset of DCNs, the method assigns to the DCN a weight value that corresponds to a target latency computed for the set of DCNs. Based on the assigned weight values for the first subset of DCNs, the method computes an excess weight value to be redistributed across the second subset of DCNs. The method redistributes the computed excess weight value across the second subset of DCNs.

## Claims

### Claim at position 1

1-20. (canceled)

### Claim 21

A method of performing capacity-aware load balancing across a set of compute nodes, the method comprising:
from the set of compute nodes, identifying (i) a first subset of compute nodes comprising compute nodes that have a latency that is higher than an average latency computed for the set of compute nodes and (ii) a second subset of compute nodes comprising compute nodes that have a latency that is lower than the average latency computed for the set of compute nodes;
for each compute node in the first subset of compute nodes, assigning, to the compute node, a reduced weight value based on a target latency computed for the set of compute nodes, in order to reduce data traffic forwarded by a set of load balancers to the first subset of compute nodes;
increasing one or more weight values assigned to one or more of the compute nodes in the second subset of compute nodes in order to increase data traffic forwarded by the set of load balancers to the second subset of compute nodes;
distributing the reduced and increased weight values to the set of load balancers.

### Claim 22 (depends on 21)

The method of claim 21, wherein the average latency computed for the set of compute nodes is computed by (i) computing, for each compute node in the set of compute nodes, a rolling average latency for the compute node based on a set of ten most recent recorded latencies for the compute node at a current weight value assigned to the compute node, and (ii) using the computed rolling average latencies for each compute node in the set of compute nodes to compute an average latency for the set of compute nodes.

### Claim 23 (depends on 21)

The method of claim 21, wherein the target latency is equal to the average latency computed for the set of compute nodes.

### Claim 24 (depends on 21)

The method of claim 21 further comprising based on the reduced weight values assigned to the compute nodes in the first subset of compute nodes, computing an excess weight value to be redistributed across the second subset of compute nodes, wherein said increasing comprises redistributing the computed excess weight value across the second subset of compute nodes.

### Claim 25 (depends on 24)

The method of claim 24, wherein the excess weight value comprises a sum of excess weight values computed for each compute node in the first subset of compute nodes by subtracting the reduce weight value of the compute node from the weight value that was assigned to the compute node when the compute node had the latency higher than the average latency.

### Claim 26 (depends on 21)

The method of claim 21, wherein the weight value assigned to each compute node corresponds to a percentage of traffic that is directed toward the compute node.

### Claim 27 (depends on 26)

The method of claim 26, wherein the weight value assigned to each compute node further corresponds to a computing capacity of the compute node, such that compute nodes having higher computing capacities are assigned higher weight values and compute nodes having lower computing capacities are assigned lower weight values.

### Claim 28 (depends on 21)

The method of claim 21, wherein each compute node in the set of compute nodes comprises one of a virtual machine (VM), a container, and a physical computer.

### Claim 29 (depends on 21)

The method of claim 21, wherein each compute node in the set of compute nodes is assigned a direct IP (DIP) address, wherein the set of load balancers receives packets addressed to a virtual IP (VIP) address associated with the set of compute nodes, and performs a load balancing operation to load balance the network traffic across the DIP addresses of the compute nodes based on the weight values assigned to the compute nodes.

### Claim 30 (depends on 29)

The method of claim 29, wherein the load balancing operation is a weighted round-robin operation.

### Claim 31

A non-transitory machine readable medium storing a program for execution by a set of processing units to perform capacity-aware load balancing across a set of compute nodes, the program comprising sets of instructions for:
from the set of compute nodes, identifying (i) a first subset of compute nodes comprising compute nodes that have a latency that is higher than an average latency computed for the set of compute nodes and (ii) a second subset of compute nodes comprising compute nodes that have a latency that is lower than the average latency computed for the set of compute nodes;
for each compute node in the first subset of compute nodes, assigning, to the compute node, a reduced weight value based on a target latency computed for the set of compute nodes, in order to reduce data traffic forwarded by a set of load balancers to the first subset of compute nodes;
increasing one or more weight values assigned to one or more of the compute nodes in the second subset of compute nodes in order to increase data traffic forwarded by the set of load balancers to the second subset of compute nodes;
distributing the reduced and increased weight values to the set of load balancers.

### Claim 32 (depends on 31)

The non-transitory machine readable medium of claim 31, wherein the average latency computed for the set of compute nodes is computed by (i) computing, for each compute node in the set of compute nodes, a rolling average latency for the compute node based on a set of ten most recent recorded latencies for the compute node at a current weight value assigned to the compute node, and (ii) using the computed rolling average latencies for each compute node in the set of compute nodes to compute an average latency for the set of compute nodes.

### Claim 33 (depends on 31)

The non-transitory machine readable medium of claim 31, wherein the target latency is equal to the average latency computed for the set of compute nodes.

### Claim 34 (depends on 31)

The non-transitory machine readable medium of claim 31, the program further comprising a set of instructions for based on the reduced weight values assigned to the compute nodes in the first subset of compute nodes, computing an excess weight value to be redistributed across the second subset of compute nodes, wherein the set of instructions for said increasing comprises a set of instructions for redistributing the computed excess weight value across the second subset of compute nodes.

### Claim 35 (depends on 34)

The non-transitory machine readable medium of claim 34, wherein the excess weight value comprises a sum of excess weight values computed for each compute node in the first subset of compute nodes by subtracting the reduce weight value of the compute node from the weight value that was assigned to the compute node when the compute node had the latency higher than the average latency.

### Claim 36 (depends on 31)

The non-transitory machine readable medium of claim 31, wherein the weight value assigned to each compute node corresponds to a percentage of traffic that is directed toward the compute node.

### Claim 37 (depends on 36)

The non-transitory machine readable medium of claim 36, wherein the weight value assigned to each compute node further corresponds to a computing capacity of the compute node, such that compute nodes having higher computing capacities are assigned higher weight values and compute nodes having lower computing capacities are assigned lower weight values.

### Claim 38 (depends on 31)

The non-transitory machine readable medium of claim 31, wherein each compute node in the set of compute nodes comprises one of a virtual machine (VM), a container, and a physical computer.

### Claim 39 (depends on 31)

The non-transitory machine readable medium of claim 31, wherein each compute node in the set of compute nodes is assigned a direct IP (DIP) address, wherein the set of load balancers receives packets addressed to a virtual IP (VIP) address associated with the set of compute nodes, and performs a load balancing operation to load balance the network traffic across the DIP addresses of the compute nodes based on the weight values assigned to the compute nodes.

### Claim 40 (depends on 39)

The non-transitory machine readable medium of claim 39, wherein the load balancing operation is a weighted round-robin operation.
