US 2023/0155941 A1 · ADAPTIVE CLOUD-NATIVE SERVICE CHAINING

Abstract

Techniques for a computing resource network to send a packet through a processing flow (e.g., a service chain) according to an order of processing workloads (e.g., services) included in the processing flow, configured as an optimized service chain. In some examples, the computing resource network may include a policy evaluation engine configured to determine the best probabilistic outcome of an order of routing between the services that results in the lowest computational costs based on the probability that a given packet will be terminated/modified at one of the earlier processing workloads in the service chain, a prediction engine configured to determine the order of the processing workloads included in the processing flow based on a policy and/or telemetry data associated with the processing workloads, and/or an intelligent routing engine configured to route a packet between the one or more processing workloads included in a processing flow according to the order.

Claims20

Dependent claims

A method comprising:

determining that a packet will enter a processing flow comprising one or more processing workloads to be performed on the packet;
determining a first likelihood that the packet will terminate at a first processing workload of the one or more processing workloads;
determining a second likelihood that the packet will terminate at a second processing workload of the one or more processing workloads;
determining an order for the first processing workload and the second processing workload in the processing flow based at least in part on the first likelihood and the second likelihood;
and
sending the packet through the processing flow.

3 more elements

A system comprising:

one or more processors;
and
one or more computer-readable media storing computer-executable instructions that, when executed by the one or more processors, cause the one or more processors to perform operations comprising:
determining that a packet will enter a processing flow comprising one or more processing workloads to be performed on the packet;
determining a first likelihood that the packet will be modified at a first processing workload of the one or more processing workloads;
determining a second likelihood that the packet will be modified at a second processing workload of the one or more processing workloads;
determining an order for the first processing workload and the second processing workload in the processing flow based at least in part on the first likelihood and the second likelihood;
and
sending the packet through the processing flow.

6 more elements

A method comprising:

identifying a policy associated with a packet that will enter a processing flow comprising one or more processing workloads to be performed on the packet, the policy indicating a first likelihood that the packet will terminate at a first processing workload of the one or more processing workloads and a second likelihood that the packet will terminate at a second processing workload of the one or more processing workloads;
determining an order for the first processing workload and the second processing workload in the processing flow based at least in part on the first likelihood and the second likelihood;
and
sending, based at least in part on the order, the packet to the first processing workload.

1 more element

Dependencies are inferred from the claim text.

Adaptive cloud-native service chaining

Life of this patent

Adaptive cloud-native service chaining

Life of this patent

Abstract

Claims20