# US 2023/0401105 A1 · Computer-based service chain node adequacy framework

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

- Number: US 2023/0401105 A1
- Document ID: US20230401105A1
- Status: Published application
- Kind: A1
- Application number: 17/806,201
- Filed: 2022-06-09
- Published: 2023-12-14
- Earliest claimed: 2022-06-09
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Harish Bharti; Rajesh Kumar Saxena; Sandeep Sukhija; Deepak Bajaj
- Web page: https://patentgrep.com/patent/US20230401105A1

## CPC

- G06F 9/5083: {Techniques for rebalancing the load in a distributed system}
- H04L 41/0823: characterised by the purposes of a change of settings, e.g. optimising configuration for enhancing reliability (for optimising operational conditions of wireless networks H04W24/02)
- H04L 41/12: Discovery or management of network topologies
- 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

In an approach to improve service chain node adequacy, embodiments utilize fifth-generation technology standard (5G) for broadband cellular networks architecture for creating relevant network slices for dedicated business processes, to ensure that each node within the network slice has stabilized operations. Embodiments employ an optimization technique, maximize a model of network adequacy to ensure there is a predetermined amount of adequacy to handle a request, and introduce the model for pre-processor without impacting existing functionality. Embodiments apply one or more constraints to one or more systems to balance the one or more queues; and implement a rapid packet delivery to a subsequent entity comprising decongested queues.

## Claims

### Claim 1

A computer-implemented method for employing an optimization technique, the computer-implemented method comprising:
maximizing a model of network adequacy to ensure there is a predetermined amount of adequacy to handle a request, wherein one or more models constrains one or more queues from becoming unstable;
introducing the model for pre-processor without impacting existing functionality, wherein the model ensures that a calculated decision are taken at a service processor to make sure that a stabilization of one or more network slices;
applying one or more constraints to one or more systems to balance the one or more queues; and
implementing a rapid packet delivery to a subsequent entity comprising decongested queues.

### Claim 2 (depends on 1)

The computer implemented method of claim 1, wherein the optimization technique is an adaptive queuing Lyapunov optimization technique for optimizing time average.

### Claim 3 (depends on 1)

The computer implemented method of claim 1, wherein the one or more model constraints comprise: average time flow, rate stability of one or more queues, average resource constraints.

### Claim 4 (depends on 1)

The computer implemented method of claim 1, further comprising:
responsive to determining one or more queue constraints are met, applying the model of network adequacy to the one or more queues, wherein one or more predetermined limits are applied to find superior values and identify that a service node rate is stable.

### Claim 5 (depends on 4)

The computer implemented method of claim 4, wherein the one or more queue constraints comprise:
identifying, at a given slot of time, that the one or more queues are available for work;
identifying one or more outputs of the one or more queues stable;
identifying one or more resource requirements for remaining jobs of a service chain are available at a node; and
executing a previously executed subroutine to ensure the system is not being jeopardized with unknown resource requests.

### Claim 6 (depends on 1)

The computer implemented method of claim 1, further comprising:
responsive to determining a queue has reached a predetermined depth threshold, placing a packet in a data buffer to stabilize the one or more network slices.

### Claim 7 (depends on 1)

The computer implemented method of claim 1, further comprising:
utilizing fifth generation (5G) architecture to create relevant network slices for dedicated business processes, to ensure that each node within the one or more network slices comprises stabilized operations.

### Claim 8

A computer system for employing an optimization technique, the computer system comprising:
one or more computer processors;
one or more computer readable storage devices;
program instructions stored on the one or more computer readable storage devices for execution by at least one of the one or more computer processors, the stored program instructions comprising:
program instructions to employ an optimization technique;
program instructions to maximize a model of network adequacy to ensure there is a predetermined amount of adequacy to handle a request, wherein one or more models constrains one or more queues from becoming unstable;
program instructions to introduce the model for pre-processor without impacting existing functionality, wherein the model ensures that a calculated decision are taken at a service processor to make sure that a stabilization of one or more network slices;
program instructions to apply one or more constraints to one or more systems to balance the one or more queues; and
program instructions to implement a rapid packet delivery to a subsequent entity comprising decongested queues.

### Claim 9 (depends on 8)

The computer system of claim 8, wherein the optimization technique is an adaptive queuing Lyapunov optimization technique for optimizing time average.

### Claim 10 (depends on 8)

The computer system of claim 8, wherein the one or more model constraints comprise: average time flow, rate stability of one or more queues, average resource constraints.

### Claim 11 (depends on 8)

The computer system of claim 8, further comprising:
responsive to determining one or more queue constraints are met, program instructions to apply the model of network adequacy to the one or more queues, wherein one or more predetermined limits are applied to find superior values and identify that a service node rate is stable.

### Claim 12 (depends on 11)

The computer system of claim 11, wherein the one or more queue constraints comprise:
program instructions to identify, at a given slot of time, that the one or more queues are available for work;
program instructions to identify one or more outputs of the one or more queues stable;
program instructions to identify one or more resource requirements for remaining jobs of a service chain are available at a node; and
program instructions to execute a previously executed subroutine to ensure the system is not being jeopardized with unknown resource requests.

### Claim 13 (depends on 8)

The computer system of claim 8, further comprising:
responsive to determining a queue has reached a predetermined depth threshold, program instructions to place a packet in a data buffer to stabilize the one or more network slices.

### Claim 14 (depends on 8)

The computer system of claim 8, further comprising:
program instructions to utilize fifth generation (5G) architecture to create relevant network slices for dedicated business processes, to ensure that each node within the one or more network slices comprises stabilized operations.

### Claim 15

A computer program product for employing an optimization technique, the computer program product comprising:
one or more computer readable storage devices and program instructions stored on the one or more computer readable storage devices, the stored program instructions comprising:
program instructions to employ an optimization technique;
program instructions to maximize a model of network adequacy to ensure there is a predetermined amount of adequacy to handle a request, wherein one or more models constrains one or more queues from becoming unstable;
program instructions to introduce the model for pre-processor without impacting existing functionality, wherein the model ensures that a calculated decision are taken at a service processor to make sure that a stabilization of one or more network slices;
program instructions to apply one or more constraints to one or more systems to balance the one or more queues; and
program instructions to implement a rapid packet delivery to a subsequent entity comprising decongested queues.

### Claim 16 (depends on 15)

The computer program product of claim 15, wherein the optimization technique is an adaptive queuing Lyapunov optimization technique for optimizing time average.

### Claim 17 (depends on 15)

The computer program product of claim 15, wherein the one or more model constraints comprise: average time flow, rate stability of one or more queues, average resource constraints.

### Claim 18 (depends on 15)

The computer program product of claim 15, further comprising:
responsive to determining one or more queue constraints are met, program instructions to apply the model of network adequacy to the one or more queues, wherein one or more predetermined limits are applied to find superior values and identify that a service node rate is stable and, wherein the one or more queue constraints comprise:
program instructions to identify at a given slot of time that the one or more queues are available for work;
program instructions to identify one or more outputs of the one or more queues stable;
program instructions to identify one or more resource requirements for remaining jobs of a service chain are available at a node; and
program instructions to execute a previously executed subroutine to ensure the system is not being jeopardized with unknown resource requests.

### Claim 19 (depends on 15)

The computer program product of claim 15, further comprising:
responsive to determining a queue has reached a predetermined depth threshold, program instructions to place a packet in a data buffer to stabilize the one or more network slices.

### Claim 20 (depends on 15)

The computer program product of claim 15, further comprising:
program instructions to utilize fifth generation (5G) architecture to create relevant network slices for dedicated business processes, to ensure that each node within the one or more network slices comprises stabilized operations.
