# US 2019/0245808 A1 · Adaptive service chain management

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

- Number: US 2019/0245808 A1
- Document ID: US20190245808A1
- Status: Published application
- Kind: A1
- Application number: 16/388,942
- Filed: 2019-04-19
- Published: 2019-08-08
- Earliest claimed: 2015-05-14
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Yaniv Ben-Itzhak; Amitabha Biswas; Anna Levin; Eran Raichstein
- Web page: https://patentgrep.com/patent/US20190245808A1

## CPC

- H04L 41/40: using virtualisation of network functions or resources, e.g. SDN or NFV entities
- H04L 41/5025: by proactively reacting to service quality change, e.g. by reconfiguration after service quality degradation or upgrade
- H04L 41/5051: Service on demand, e.g. definition and deployment of services in real time
- H04L 41/5058: {Service discovery by the service manager}
- H04L 45/28: using route fault recovery
- H04L 45/64: using an overlay routing layer
- H04L 49/30: {Peripheral units, e.g. input or output ports}
- H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M)

## Abstract

Embodiments of the present invention provide methods, computer program products, and systems for fulfilling a service chain request. Embodiments of the present invention can be used to collect network data of a plurality of instances of services and connections between the plurality of instances of services and redefine service chains to direct flow to an alternative instance of a service responsive to determining that an instance of a service in a service chain has become inaccessible. Embodiments of the present invention can be used to fulfill a service chain request and avoid one or more instances of services (and/or connections there between) that could cause a delay between transmitting data packets through the service chain.

## Claims

### Claim 1

A method for fulfilling a service chain request, the method comprising:
receiving, by one or more computer processors, a service chain request requiring a first service chain from a group of service chains;
responsive to determining that an instance of a service in the first service chain is inaccessible, dynamically redefining, by one or more computer processors, the first service chain to direct flow to an alternative instance of the service; and
removing the instance of the service from a second service chain using the instance of the service and directing flow to the alternative instance of the service.

### Claim 2 (depends on 1)

The method of claim 1, wherein responsive to determining that an instance of a service in the first service chain is inaccessible, dynamically redefining, by one or more computer processors, the first service chain to direct flow to an alternative instance of the service comprises:
invalidating, by one or more computer processors, the inaccessible instance of the service in the first service chain;
excluding, by one or more computer processors, the inaccessible instance of the service in the first service chain from future service chain calculations; and
identifying, by one or more computer processors, an alternative instance of the service in the plurality of instances of services.

### Claim 3 (depends on 2)

The method of claim 2, wherein invalidating, by one or more computer processors, the inaccessible instance of the service in the first service chain comprises:
transmitting, by one or more computer processors, an instruction to one or more of the plurality of instances of services to remove the inaccessible instance of the service from flow tables of the one or more of the plurality of instances of services.

### Claim 4 (depends on 2)

The method of claim 2, wherein identifying, by one or more computer processors, an alternative instance of the service in the plurality of instances of services comprises:
generating, by one or more computer processors, a weighted graph, wherein instances of services that are assigned a greater point value are weighted more heavily in the weighted graph than instances of services that are assigned a lesser point value, and connections that are assigned a greater point value are weighted more heavily in the weighted graph than connections that are assigned a lesser point value; and
selecting, by one or more computer processors, an alternative instance of the service having a greatest weight in the weighted graph.

### Claim 5 (depends on 3)

The method of claim 3, further comprising:
receiving, by one or more computer processors, a query from a first instance of service having a first flow table from which the inaccessible instance of the service was removed; and
responsive to receiving the query, transmitting, by one or more computer processors, an instruction to the first instance of service to install the alternative instance of the service in the first flow table.

### Claim 6 (depends on 1)

The method of claim 1, wherein determining that an instance of a service in the first service chain is inaccessible comprises:
receiving, by one or more computer processors, an error message from a first instance of service of the plurality of instances of services; and
responsive to receiving the error message, determining, by one or more computer processors, that the first instance of service is inaccessible.

### Claim 7 (depends on 1)

The method of claim 1, wherein determining that an instance of a service in the first service chain is inaccessible comprises:
specifying, by one or more computer processors, a threshold for network data of a first instance of service of the plurality of instances of services; and
responsive to determining that usage details of the first instance of service satisfy the specified threshold, determining, by one or more computer processors, that the first instance of service is inaccessible.

### Claim 8

A computer program product for fulfilling a service chain request, the computer program product comprising:
one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising:
program instructions to receive a service chain request requiring a first service chain from a group of service chains;
program instructions to, responsive to determining that an instance of a service in the first service chain is inaccessible, dynamically redefine the first service chain to direct flow to an alternative instance of the service; and
program instructions to remove the instance of the service from a second service chain using the instance of the service and directing flow to the alternative instance of the service.

### Claim 9 (depends on 8)

The computer program product of claim 8, wherein the program instructions to, responsive to determining that an instance of a service in the first service chain is inaccessible, dynamically redefine the first service chain to direct flow to an alternative instance of the service comprise:
program instructions to invalidate the inaccessible instance of the service in the first service chain;
program instructions to exclude the inaccessible instance of the service in the first service chain from future service chain calculations; and
program instructions to identify an alternative instance of the service in the plurality of instances of services.

### Claim 10 (depends on 9)

The computer program product of claim 9, wherein the program instructions to invalidate the inaccessible instance of the service in the first service chain comprise:
program instructions to transmit an instruction to one or more of the plurality of instances of services to remove the inaccessible instance of the service from flow tables of the one or more of the plurality of instances of services.

### Claim 11 (depends on 9)

The computer program product of claim 9, wherein the program instructions to identify an alternative instance of the service in the plurality of instances of services comprise:
program instructions to generate a weighted graph, wherein instances of services that are assigned a greater point value are weighted more heavily in the weighted graph than instances of services that are assigned a lesser point value, and connections that are assigned a greater point value are weighted more heavily in the weighted graph than connections that are assigned a lesser point value; and
program instructions to select an alternative instance of the service having a greatest weight in the weighted graph.

### Claim 12 (depends on 10)

The computer program product of claim 10, wherein the program instructions stored on the one or more computer readable storage media further comprise:
program instructions to receive a query from a first instance of service having a first flow table from which the inaccessible instance of the service was removed; and
program instructions to, responsive to receiving the query, transmit an instruction to the first instance of service to install the alternative instance of the service in the first flow table.

### Claim 13 (depends on 8)

The computer program product of claim 8, wherein the program instructions to determine that an instance of a service in the first service chain is inaccessible comprise:
program instructions to receive an error message from a first instance of service of the plurality of instances of services; and
program instructions to, responsive to receiving the error message, determine that the first instance of service is inaccessible.

### Claim 14 (depends on 8)

The computer program product of claim 8, wherein the program instructions to determine that an instance of a service in the first service chain is inaccessible comprise:
program instructions to specify a threshold for network data of a first instance of service of the plurality of instances of services; and
program instructions to, responsive to determining that usage details of the first instance of service satisfy the specified threshold, determine that the first instance of service is inaccessible.

### Claim 15

A computer system for fulfilling a service chain request, the computer system comprising:
one or more computer processors;
one or more computer readable storage media; and
program instructions stored on the one or more computer readable storage media for execution by at least one of the one or more computer processors, the program instructions comprising:
program instructions to receive a service chain request requiring a first service chain from a group of service chains;
program instructions to, responsive to determining that an instance of a service in the first service chain is inaccessible, dynamically redefine the first service chain to direct flow to an alternative instance of the service; and
program instructions to remove the instance of the service from a second service chain using the instance of the service and directing flow to the alternative instance of the service.

### Claim 16 (depends on 15)

The computer system of claim 15, wherein the program instructions to, responsive to determining that an instance of a service in the first service chain is inaccessible, dynamically redefine the first service chain to direct flow to an alternative instance of the service comprise:
program instructions to invalidate the inaccessible instance of the service in the first service chain;
program instructions to exclude the inaccessible instance of the service in the first service chain from future service chain calculations; and
program instructions to identify an alternative instance of the service in the plurality of instances of services.

### Claim 17 (depends on 16)

The computer system of claim 16, wherein the program instructions to invalidate the inaccessible instance of the service in the first service chain comprise:
program instructions to transmit an instruction to one or more of the plurality of instances of services to remove the inaccessible instance of the service from flow tables of the one or more of the plurality of instances of services.

### Claim 18 (depends on 16)

The computer system of claim 16, wherein the program instructions to identify an alternative instance of the service in the plurality of instances of services comprise:
program instructions to generate a weighted graph, wherein instances of services that are assigned a greater point value are weighted more heavily in the weighted graph than instances of services that are assigned a lesser point value, and connections that are assigned a greater point value are weighted more heavily in the weighted graph than connections that are assigned a lesser point value; and
program instructions to select an alternative instance of the service having a greatest weight in the weighted graph.

### Claim 19 (depends on 17)

The computer system of claim 17, wherein the program instructions stored on the one or more computer readable storage media further comprise:
program instructions to receive a query from a first instance of service having a first flow table from which the inaccessible instance of the service was removed; and
program instructions to, responsive to receiving the query, transmit an instruction to the first instance of service to install the alternative instance of the service in the first flow table.

### Claim 20 (depends on 15)

The computer system of claim 15, wherein the program instructions to determine that an instance of a service in the first service chain is inaccessible comprise:
program instructions to receive an error message from a first instance of service of the plurality of instances of services; and
program instructions to, responsive to receiving the error message, determine that the first instance of service is inaccessible.
