Adaptive service chain management

US2016337202A1 · US · A1

Patent metadata
FieldValue
Publication numberUS-2016337202-A1
Application numberUS-201514711823-A
CountryUS
Kind codeA1
Filing dateMay 14, 2015
Priority dateMay 14, 2015
Publication dateNov 17, 2016
Grant date

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

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.

First claim

Opening claim text (preview).

What is claimed is: 1 . A method for fulfilling a service chain request, the method comprising: collecting, by one or more computer processors, network data of a plurality of instances of services and connections between the plurality of instances of services; receiving, by one or more computer processors, a service chain request requiring a first service chain; and 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. 2 . 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. 3 . 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. 4 . 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. 5 . 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. 6 . 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. 7 . 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. 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 collect network data of a plurality of instances of services and connections between the plurality of instances of services; program instructions to receive a service chain request requiring a first service chain; and 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. 9 . 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. 10 . 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. 11 . 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. 12 . 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. 13 . 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. 14 . 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 instructio

Assignees

Inventors

Classifications

  • for graphical visualisation of monitoring data · CPC title

  • H04L41/20Primary

    Network management software packages · CPC title

  • Address table lookup; Address filtering · CPC title

  • Peripheral units, e.g. input or output ports · CPC title

  • H04L41/40Primary

    using virtualisation of network functions or resources, e.g. SDN or NFV entities · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US2016337202A1 cover?
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 respo…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification H04L41/20. Mapped technology areas include Electricity.
When was this patent published?
Publication date Thu Nov 17 2016 00:00:00 GMT+0000 (Coordinated Universal Time) (A1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).