System and method for enabling services chaining in a provider network

Patent metadata

Field	Value
Publication number	US-9825847-B2
Application number	US-201715415829-A
Country	US
Kind code	B2
Filing date	Jan 25, 2017
Priority date	Jul 24, 2012
Publication date	Nov 21, 2017
Grant date	Nov 21, 2017

Abstract

A system and method for chaining one or more services in a service provider network. A service chaining policy and associated Service Path Identifier (SPID) are determined at an ingress node with respect to a particular data packet flow. If the service chaining policy involves one or more service nodes to be traversed by the data packet flow, each service node's EIDs and RLOCs are determined. A sequential data exchange process with the service nodes is effectuated using encapsulation of data packets based on the EIDs and RLOCs for obtaining services in accordance with the order of services set forth in the chaining policy.

First claim

What is claimed is:

1. A method of chaining services in a service provider network, the method comprising:
determining a service chaining policy associated with a data packet flow, the service chaining policy defining a plurality of service nodes to be traversed by the data packet flow entering at an ingress node and emitting from an egress node;
determining a Service Path Identifier (SPID) associated with the service chaining policy; and
effectuating an oscillatory data exchange process according to the service chaining policy, wherein the oscillatory data exchange process is initiated at the ingress node receiving the data packet flow and oscillates between the ingress node and the egress node that emits the data packet flow after obtaining services at the plurality of service nodes and further wherein each service node returns serviced data packets of the data packet flow to a nearest one of the ingress and egress nodes after providing a service to the data packet flow, the ingress and egress nodes operating to steer the returned serviced data packets to a next service node of the service chain policy.

2. The method as recited in claim 1 , further comprising determining Endpoint Identifiers (EIDs) and Routing Locators (RLOCs) of each service node based on the SPID of the service chaining policy.

3. The method as recited in claim 2 , wherein the oscillatory data exchange process further comprises:
encapsulating an incoming data packet by appending (i) a destination EID field having the EID of a service node to be traversed for obtaining a service thereat and (ii) a source EID field having the SPID of the service chaining policy, resulting in an EID-encapsulated data packet;
encapsulating the EID-encapsulated data packet by appending (i) a source RLOC field having an RLOC of one of the ingress node and the egress node and (ii) a destination RLOC field having the RLOC of the service node, resulting in a double-encapsulated data packet having an RLOC encapsulation; and
sending the double-encapsulated data packet to the service node identified in the service chain policy.

4. The method as recited in claim 3 , wherein the data exchange process further comprises:
receiving the double-encapsulated data packet at the service node;
removing the EID encapsulation and the RLOC encapsulation from the double-encapsulated data packet;
forwarding the data packet to a service logic module configured to deliver a service; and
after obtaining service from the service logic module, re-encapsulating the data packet and sending the re-encapsulated data packet to one of the ingress node and the egress node based on optimizing a next service hop required in accordance with the service chaining policy.

5. The method as recited in claim 4 , wherein the re-encapsulation of the data packet further comprises;
appending a source EID field that includes the EID of the service node and a destination EID field that includes the SPID of the service chaining policy; and
appending a source RLOC field that includes the RLOC of the service node and a destination RLOC field that includes the RLOC of one of the ingress node and the egress node.

6. The method as recited in claim 1 , wherein the plurality of service nodes are provided as part of the service provider network configured as a Software-Defined Network (SDN) based on one of OpenFlow protocol and Forwarding and Control Element Separation (ForCES) protocol.

7. The method as recited in claim 1 , wherein the plurality of service nodes are provided as part of the service provider network configured as a locator/identifier separation network implemented using one of Locator/Identifier Separation Protocol (LISP) protocol, Identifier/Locator Network Protocol (ILNP) protocol, Host Identity Protocol (HIP) protocol and Site Multi-homing by IPv6 Intermediation (SHIM6) protocol.

8. A network node configured to operate with a service provider network, the network node comprising:
one or more processors; and
a persistent memory coupled to the one or more processors, wherein the persistent memory includes instructions executable by the one or more processors and configured to:
determine a service chaining policy associated with a data packet flow, the service chaining policy defining a plurality of service nodes to be traversed by the data packet flow;
determine a Service Path Identifier (SPID) associated with the service chaining policy; and
effectuate an oscillatory data exchange process according to the service chaining policy, wherein the oscillatory data exchange process is initiated at the network node operating as an ingress node that receives the data packet flow and oscillates between the ingress node and an egress node that emits the data packet flow after obtaining services at the plurality of service nodes and further wherein each service node returns serviced data packets of the data packet flow to a nearest one of the ingress and egress nodes after providing a service to the data packet flow, the ingress and egress nodes operating to steer the returned serviced data packets to a next service node of the service chain policy.

9. The network node as recited in claim 8 , wherein the persistent memory further comprises instructions for determining Endpoint Identifiers (EIDs) and Routing Locators (RLOCs) of each service node based on the SPID of the service chaining policy.

10. The network node as recited in claim 9 , wherein the persistent memory further comprises instructions configured to:
encapsulate an incoming data packet by appending (i) a destination EID field having the EID of a service node that must be traversed for obtaining a service thereat and (ii) a source EID field having the SPID of the service chaining policy, resulting in an EID-encapsulated data packet;
encapsulate the EID-encapsulated data packet by appending (i) a source RLOC field having an RLOC of the network node operating as the ingress node and (ii) a destination RLOC field having the RLOC of the service node, resulting in a double-encapsulated data packet having an RLOC encapsulation; and
send the double-encapsulated data packet to the service node identified in the service chain policy.

11. A service node configured to operate with a service provider network, the service node comprising:
one or more processors; and
a persistent memory coupled to the one or more processors, wherein the persistent memory includes instructions executable by one or more processors and configured to:
process a double-encapsulated data packet received from one of an ingress node and an egress node of the service provider network for a data packet flow requiring services at a plurality of service nodes in the service provider network in accordance with a service chaining policy, the processing comprising removing an encapsulation involving an Endpoint Identifier (EID) field and removing an encapsulation involving a Routing Locator (RLOC) field from the double-encapsulated data packet;
forward the data packet to a service logic module configured to deliver a service; and
re-encapsulate the data packet, upon delivery of service by the service logic module, and send the re-encapsulated data packet to one of the ingress node and the egress node as part of a data exchange process initiated at the ingress node and oscillates between the ingress node and the egress node, wherein each of the plurality of service nodes is configured to return serviced data packets of the data packet flow to a nearest one of the ingress and egress nodes after providing a service to the data packet flow, the ingress and egress nodes operating to steer the returned serviced data packets to a next service node of the service chain po

Assignees

• ERICSSON TELEFON AB L M (publ)

Inventors

• Haddad Wassim
• Tantsura Evgeny
• Halpern Joel

Classifications

• H04L45/306

  Route determination based on the nature of the carried application · CPC title

• H04L67/00

  Network arrangements or protocols for supporting network services or applications (user-to-user messaging H04L51/00; network arrangements, protocols or services for supporting real-time applications in data packet communications networks H04L65/00) · CPC title

• H04L45/72

  Routing based on the source address · CPC title

• H04L47/2483

  involving identification of individual flows · CPC title

• H04L69/22

  Parsing or analysis of headers · CPC title