# US 2020/0394080 A1 · Load distribution for integration scenarios

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

- Number: US 2020/0394080 A1
- Document ID: US20200394080A1
- Status: Published application
- Kind: A1
- Application number: 17/004,597
- Filed: 2020-08-27
- Published: 2020-12-17
- Earliest claimed: 2018-10-01
- Assignees: Sap SE
- Applicants: Sap SE
- Inventors: Ulf Fildebrandt; Madhav Bhargava; Sapreen Ahuja; Sripad J
- Web page: https://patentgrep.com/patent/US20200394080A1

## CPC

- G06F 9/5088: {involving task migration}
- G06Q 10/06312: {Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling}
- G06F 2209/503: Resource availability
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

The disclosure generally describes methods, software, and systems for handling integration flows. A set of flows is initially deployed to a single worker set. A load balancing issue is identified that is associated with initial runtime interactions by workers with the single worker set. In response to identifying the load balancing issue, the load balancing issue is analyzed to determine whether to autoscale or generate a new worker set. Load balancing is performed to initiate at least one new worker set. At least one flow to be moved to the at least one new worker set is identified. Movement of the identified at least one flow from a current worker set to a new worker set is performed.

## Claims

### Claim 1

A computer-implemented method comprising:
deploying a set of flows initially to a single worker set;
identifying a load balancing issue associated with initial runtime interactions by workers with the single worker set;
in response to identifying the load balancing issue, analyzing the load balancing issue to determine whether to autoscale or generate a new worker set;
performing load balancing to initiate at least one new worker set;
identifying at least one flow to be moved to the at least one new worker set, wherein identifying the at least one flow to be moved to the at least one new worker set comprises randomly moving at least one flow to the at least one new worker set; and
performing movement of the identified at least one flow from a current worker set to a new worker set.

### Claim 2 (depends on 1)

The computer-implemented method of claim 1, wherein the load balancing issues include out-of-memory exceptions.

### Claim 3 (depends on 1)

The computer-implemented method of claim 1, wherein the flow represents an integration scenario.

### Claim 4

A system comprising:
memory storing tables of information for integration scenarios, load balancer rules, and historical information; and
a server performing operations comprising:
deploying a set of flows initially to a single worker set;
identifying a load balancing issue associated with initial runtime interactions by workers with the single worker set;
in response to identifying the load balancing issue, analyzing the load balancing issue to determine whether to autoscale or generate a new worker set;
performing load balancing to initiate at least one new worker set;
identifying at least one flow to be moved to the at least one new worker set, wherein identifying the at least one flow to be moved to the at least one new worker set comprises randomly moving at least one flow to the at least one new worker set; and
performing movement of the identified at least one flow from a current worker set to a new worker set.

### Claim 5 (depends on 4)

The system of claim 4, wherein load balancing issues include out-of-memory exceptions.

### Claim 6 (depends on 4)

The system of claim 4, wherein the flow represents an integration scenario.

### Claim 7

A non-transitory computer-readable media encoded with a computer program, the program comprising instructions that when executed by one or more computers cause the one or more computers to perform operations comprising:
deploying a set of flows initially to a single worker set;
identifying a load balancing issue associated with initial runtime interactions by workers with the single worker set;
in response to identifying the load balancing issue, analyzing the load balancing issue to determine whether to autoscale or generate a new worker set;
performing load balancing to initiate at least one new worker set;
identifying at least one flow to be moved to the at least one new worker set, wherein identifying the at least one flow to be moved to the at least one new worker set comprises randomly moving at least one flow to the at least one new worker set; and
performing movement of the identified at least one flow from a current worker set to a new worker set.

### Claim 8 (depends on 7)

The non-transitory computer-readable media of claim 7, wherein the load balancing issues include out-of-memory exceptions.

### Claim 9 (depends on 7)

The non-transitory computer-readable media of claim 7, wherein the flow represents an integration scenario.
