System and method for assigning multi-instance services in a provider network

• US 9,584,371 B2
• Filed: 07/21/2014
• Issued: 02/28/2017
• Est. Priority Date: 07/24/2012
• Status: Active Grant

• Current Assignee: Telefonaktiebolaget LM Ericsson
• Original Assignee: Telefonaktiebolaget LM Ericsson
• Inventors: Zhang, Ying, Beheshti-Zavareh, Neda
• Primary Examiner(s): Lazaro, David
• Assistant Examiner(s): Khurshid, Zia
• Application Number:
  US14/336,990
• Publication Number:
  US 20150081855A1
• Time in Patent Office: 953 Days
• Field of Search: 709/220
• US Class Current: 1/1
• CPC Class Codes: H04L 41/12 Discovery or management of network topologies
• CPC Class Codes: H04L 41/122 of virtualised topologies, e.g. software-defined networks [SDN] or network function virtualisation [NFV]
• CPC Class Codes: H04L 41/40 using virtualisation of network functions or resources, e.g. SDN or NFV entities
• CPC Class Codes: H04L 41/5045 Making service definitions prior to deployment
• CPC Class Codes: H04L 41/5054 Automatic deployment of services triggered by the service manager, e.g. service implementation by automatic configuration of network components
• CPC Class Codes: H04L 63/00 Network architectures or network communication protocols for network security cryptographic mechanisms or cryptographic arrangements for secret or secure communication H04L9/00; network architectures or network communication protocols for wireless network security H04W12/00; security arrangements for protecting computers or computer systems against unauthorised activity G06F21/00
• CPC Class Codes: H04Q 3/0029 Provisions for intelligent networking

Abstract

A system and method for placing inline services having multiple instances in a service provider network. In one implementation, a topology of the service provider network and services to be placed therein are defined, wherein a network node may include a data forwarding functionality and a control plane functionality. Using service chaining policy requirements, the number of service instances, etc. as input, services and their multiple instances are placed within the network such that an overall network metric is optimized for all subscriber data flows.

Claims

1. A network management node configured to operate with a service provider network, the network management 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;

define a topology of the service provider network having a plurality of network nodes, each network node including a data forwarding plane module and a control plane module in a coupled configuration for providing integrated data plane and control plane functionality;

define a set of inline services to be placed within the service provider network, wherein at least one inline service is provided in multiple instances as service replicas;

obtain a set of service chaining requirements for a plurality of subscriber data flows entering the service provider network at one or more ingress nodes, wherein each service chaining requirement is defined as a particular ordered sequence of inline services to be traversed for each subscriber data flow before exiting from one or more egress nodes; and

assign the inline services including the at least one inline service having multiple instances to one or more network nodes of the service provider network such that a network metric associated with the service provider network is optimized for all subscriber data flows.

2. The network management node as recited in claim 1, wherein the network metric to be optimized comprises at least one of a bandwidth metric, a total delay, a total distance and a total number of hops for all subscriber data flows.

3. The network management node as recited in claim 2, wherein the instructions to assign the inline services further comprise:

instructions for defining service dependencies for each inline service and ranking the service dependencies;

instructions for determining a weight for each inline service based on at least one of the ranking of the service dependencies and number of instances of the inline service to be placed; and

instructions for iteratively placing each inline service including its instances relative to one or more network nodes of the service provider network based on optimizing the network metric, the iterative assignment starting with the inline service having a largest weight value among all weights of the services.

4. The network management node as recited in claim 3, wherein the network metric is optimized based on a local optimization mechanism determined at each iterative assignment of the inline services.

5. The network management node as recited in claim 1, wherein one or more of the inline services are hosted on respective dedicated hardware machines supported by corresponding network nodes.

6. The network management node as recited in claim 1, wherein one or more of the inline services are implemented as virtual service appliances supported by corresponding network nodes.

7. The network management node as recited in claim 1, wherein the inline services comprise one or more instances of Deep Packet Inspection (DPI), Virus Scanning (VS), Intrusion Detection and Prevention (IDP), Firewall (FW) filtering, and Network Address Translation (NAT).

8. The network management node as recited in claim 1, wherein at least one service chaining requirement comprises a chaining policy involving placement of one or more instances of a particular inline service at an ingress node of the service provider network.

9. The network management node as recited in claim 1, wherein at least one service chaining requirement comprises a chaining policy involving placement of one or more instances of a particular inline service at an egress node of the service provider network.

10. A method for assigning inline services in a service provider network, the method comprising:

defining a topology of the service provider network having a plurality of network nodes, each network node including a data forwarding plane module and a control plane module in a coupled configuration for providing integrated data plane and control plane functionality;

defining a set of inline services to be placed within the service provider network, wherein at least one inline service is provided in multiple instances as service replicas;

obtaining a set of service chaining requirements for a plurality of subscriber data flows entering the service provider network at one or more ingress nodes, wherein each service chaining requirement is defined as a particular ordered sequence of inline services to be traversed for each subscriber data flow before exiting from one or more egress nodes; and

assigning the inline services including the at least one inline service having multiple instances to one or more network nodes of the service provider network such that a network metric associated with the service provider network is optimized for all subscriber data flows.

11. The method as recited in claim 10, wherein the network metric to be optimized comprises at least one of a bandwidth metric, a total delay, a total distance and a total number of hops for all subscriber data flows.

12. The method as recited in claim 10, wherein assigning the inline services further comprises:

defining service dependencies for each inline service and ranking the service dependencies;

determining a weight for each inline service based on at least one of the ranking of the service dependencies and number of instances of the inline service to be placed; and

iteratively placing each inline service including its instances relative to one or more network nodes of the service provider network based on optimizing the network metric, the iterative assignment starting with the inline service having a largest weight value among all weights of the inline services.

13. The method as recited in claim 12, wherein the network metric is optimized based on a local optimization mechanism determined at each iterative assignment of the inline services.

14. The method as recited in claim 10, wherein one or more of the inline services are hosted on respective dedicated hardware machines supported by corresponding network nodes.

15. The method as recited in claim 10, wherein one or more of the inline services are implemented as virtual service appliances supported by corresponding network nodes.

16. The method as recited in claim 10, wherein the inline services comprise one or more instances of Deep Packet Inspection (DPI), Virus Scanning (VS), Intrusion Detection and Prevention (IDP), Firewall (FW) filtering, and Network Address Translation (NAT).

17. The method as recited in claim 10, wherein at least one service chaining requirement comprises a chaining policy involving placement of one or more instances of a particular inline service at an ingress node of the service provider network.

18. The method as recited in claim 10, wherein at least one service chaining requirement comprises a chaining policy involving placement of one or more instances of a particular inline service at an egress node of the service provider network.

19. A non-transitory computer-readable medium containing instructions stored thereon which, when executed by a computer system configured to operate as an network management node associated with a service provider network, perform the acts:

defining a topology of the service provider network having a plurality of network nodes, each network node including a data forwarding plane module and a control plane module in a coupled configuration for providing integrated data plane and control plane functionality;

defining a set of inline services to be placed within the service provider network, wherein at least one inline service is provided in multiple instances as service replicas;

obtaining a set of service chaining requirements for a plurality of subscriber data flows entering the service provider network at one or more ingress nodes, wherein each service chaining requirement is defined as a particular ordered sequence of inline services to be traversed for each subscriber data flow before exiting from one or more egress nodes; and

assigning the inline services including the at least one inline service having multiple instances to one or more network nodes of the service provider network such that a network metric associated with the service provider network is optimized for all subscriber data flows.

20. The non-transitory computer-readable medium as recited in claim 19, wherein the instructions for assigning the inline services further comprise:

instructions for defining service dependencies for each inline service and ranking the service dependencies;

instructions for determining a weight for each inline service based on at least one of the ranking of the service dependencies and number of instances of the inline service to be placed; and

instructions for iteratively placing each inline service including its instances relative to one or more network nodes of the service provider network based on optimizing the network metric, the iterative assignment starting with the inline service having a largest weight value among all weights of the services.