Service function chain optimization using live testing

Information

  • Patent Grant
  • 11115276
  • Patent Number
    11,115,276
  • Date Filed
    Tuesday, May 26, 2020
    4 years ago
  • Date Issued
    Tuesday, September 7, 2021
    3 years ago
Abstract
Aspects of the disclosed technology address the problems of manually identifying and optimizing service chain (SC) performance bottlenecks by providing solutions for automatically identifying and tuning various SC parameters. In some aspects, a SC optimization process of the disclosed technology includes the replication or cloning of a SC for which traffic flow is to be optimized. Traffic flows for the production chain can then be simulated over one or more SC clones to identify and tune individual system parameters, for example, to determine if the simulated changes produce a positive, negative, or neutral change in flow performance. Systems and machine-readable media are also provided.
Description
BACKGROUND
1. Technical Field

The subject technology relates to the optimization of flows over service chains in a virtual network environment and in particular, to methods for cloning service chains and modifying various service chain parameters to determine optimal service chain configuration settings.


2. Introduction

Network Function Virtualization (NFV) technology, in combination with Software Defined Networking (SDN), promises to help transform today's carrier networks. It will transform how they are deployed and managed, and the way services are delivered. Some ultimate goals are to enable service providers to reduce costs, increase business agility, and accelerate the time to market of new services.


The utilization of NFV and SDN technologies allows the decoupling of network functions from underlying hardware so they run as software images or logical modules on commercial off-the-shelf and purpose-built hardware. NFV does so by using virtualization technologies (computers, networks, and storage media) to virtualize network functions. The objective is to reduce the dependence on physical devices by allocating and using physical and virtual resources only when and where needed. With such approaches, service providers can reduce overall costs by shifting components to a common physical infrastructure while optimizing its use, allowing them to respond more dynamically to changing market demands by deploying new applications and services as needed. The virtualization of network functions accelerates the time to market for new services by allowing for more automated and streamlined approaches to service delivery.





BRIEF DESCRIPTION OF THE DRAWINGS

In order to describe the manner in which the above-recited and other advantages and features of the disclosure can be obtained, a more particular description of the principles briefly described above will be rendered by reference to specific embodiments thereof which are illustrated in the appended drawings. Understanding that these drawings depict only example aspects of the disclosure and are not therefore to be considered to be limiting of its scope, the principles herein are described and explained with additional specificity and detail through the use of the accompanying drawings in which:



FIG. 1 illustrates an example network environment in which some aspects of the technology can be implemented.



FIGS. 2A and 2B conceptually illustrate examples of service chain cloning and tuning, according to some aspects of the technology.



FIG. 3 illustrates steps of an example process for cloning and mutating various configurable parameters of a production service chain, according to some aspects of the technology.



FIG. 4 illustrates an example network device on which some aspects of the technology can be implemented.





DETAILED DESCRIPTION

The detailed description set forth below is intended as a description of various configurations of the subject technology and is not intended to represent the only configurations in which the subject technology can be practiced. The appended drawings are incorporated herein and constitute a part of the detailed description. The detailed description includes specific details for the purpose of providing a more thorough understanding of the subject technology. However, it will be clear and apparent that the subject technology is not limited to the specific details set forth herein and may be practiced without these details. In some instances, structures and components are shown in block diagram form in order to avoid obscuring the concepts of the subject technology.


Overview:


With the proliferation of network function virtualization (NFV) technologies, many network functionalities that were previously performed by hardware devices are now routinely implemented by virtual components. Some networks implement ordered chains of virtual components in what is known as network service chaining (SC) or service function chaining (SFC) to create ordered sequences of connected network services, e.g., firewalls, network address translation [NAT], intrusion protection, etc. This capability can be used by network operators to set up suites or catalogs of connected services that enable the use of a single network connection for many services with different characteristics.


One advantage of service chaining is to automate the way virtual network connections can be set up to handle traffic flows for connected services. For example, an SDN controller could take a chain of services and apply them to different traffic flows depending on the source, destination or type of traffic. The SFC capability automates what conventional network administrators do when they connect up a series of physical devices to process incoming and out coming network traffic, which may require a number of manual steps.


Due to trends in increasing network virtualization and abstraction, for example, with virtual machines and container networking, it has become increasingly difficult to diagnose and optimize traffic flow problems. Conventionally, traffic flow optimization in SFC environments is an arduous process that involves a time consuming manual trial-and-error style effort to tune individual system parameters, and requires cross-domain knowledge to predict how changes may impact flow performance.


Description


Aspects of the disclosed technology address the problems of manually identifying and optimizing SFC performance bottlenecks by providing solutions for automatically identifying and tuning SFC component parameters. In some aspects, an SFC optimization solution of the disclosed technology includes the replication or cloning of a selected SFC (i.e., a “production SFC” or “production chain”) for which traffic flow is to be optimized. Traffic flows for the production chain can then be simulated over one or more SFC clones to identify and tune individual system parameters, for example, to determine if the simulated changes produce a positive, negative, or neutral change in flow performance. Simulated SFC configurations that are determined to positively impact traffic flows can be automatically pushed to the various production chain devices, for example, by automatically updating data-path parameters of the chain's containers, virtual machines, and/or virtual switches or other routing devices (e.g., “vswitches”), etc. Alternatively, in some aspects, traffic flows for the production chain may be redirected over the simulated SFC, effectively making it the new production chain.


As used herein, a service chain “device” can include physical and/or virtual devices. For example, the data-path of a service chain can include a mix of physical and virtual devices that are associated with a particular network operation or service function. Additionally, service chain or service function path “parameters” can include any configurable aspect of service chain and/or device operation. For example, a service chain parameter can relate to a particular function type, software version, protocol, or any other aspect of device operation.


As discussed in further detail below, a method of the disclosed technology can include steps for measuring a first set of performance metrics for a traffic flow directed over a production service chain (SC), where the production SC includes one or more physical and/or virtual devices, cloning the production SC to produce a cloned SC, where the cloned SC includes at least one configurable parameter or device that is different from the production SC, and measuring a second set of performance metrics for a second traffic flow directed over the cloned SC. In some aspects, the method can further include steps for identifying at least one configuration change for the production SC that is likely to improve flow performance for the traffic flow directed over the production SC, e.g., based on the first set of performance metrics and the second set of performance metrics, and automatically tuning the production SC to implement the configuration change.



FIG. 1 illustrates a diagram of an example network environment 100 in which various network function virtualization (NFV) devices can be implemented to form a service chain (SC). Fabric 112 can represent the underlay (i.e., the physical network) of environment 100. Fabric 112 includes spine switches 1-N (102A-N) (collectively “102”) and leaf switches 1-N (104A-N) (collectively “104”). Leaf switches 104 can reside at the edge of fabric 112, and can represent the physical network edges. Leaf switches 104 can be, for example, top-of-rack (“ToR”) switches, aggregation switches, gateways, ingress and/or egress switches, provider edge devices, and/or any other type of routing or switching device.


Leaf switches 104 can be responsible for routing and/or bridging tenant or endpoint packets and applying network policies. Spine 102 can perform switching and routing within fabric 112. Thus, network connectivity in fabric 112 can flow from spine switches 102 to leaf switches 104, and vice versa.


Leaf switches 104 can include servers 1-4 (106A-D) (collectively “106”), hypervisors 1-3 (108A-108C) (collectively “108”), virtual machines (VMs) 1-4 (110A-110D) (collectively “110”). For example, leaf switches 104 can encapsulate and decapsulate packets to and from servers 106 in order to enable communications throughout environment 100. Leaf switches 104 can also connect other network-capable device(s) or network(s), such as a firewall, a database, a server, etc., to the fabric 112. Leaf switches 104 can also provide any other servers, resources, endpoints, external networks, VMs, services, tenants, or workloads with access to fabric 112.


Servers 106 can include hardware and software necessary to implement a network function virtualization (NFV) platform of the subject technology. An NFV platform may be implemented using hypervisors 108 to support various virtual network devices, for example, that are instantiated as one or more of VMs 110, and/or one or more network containers (not illustrated).


As discussed in further detail below with respect to FIGS. 2A and 2B, service chains that include various virtual network device types (and configurations) may be formed through, connection to a virtual switch, e.g., a ‘vswitch.’



FIG. 2A conceptually illustrates an example of service chain cloning, according to some aspects of the technology. In particular, FIG. 2A depicts a production service chain (or “production SC”) 201, and two clones of the production SC, i.e., a first cloned service chain (or “first cloned SC”) 203, and a second cloned service chain (or “second cloned SC”) 205.


Production SC 201 is configured to provide and/or receive traffic from a connected host 200A. Flows traversing production SC 201 are provided sequentially to each device or service in the chain. As illustrated in the example, traffic flows traversing production SC 201 must flow through a router (e.g., QoS Router 204A), an inline intrusion protection system (IPS) 206A, load balancer 208A, and a server (e.g., HTTP Server 210A). Each of the devices (204A, 206A, 208A, and 210A) is communicatively coupled via virtual switch 212A, for example, that is implemented using an Open vSwitch with the Data Plane Development Kit (OVS-DPDK).


Production SC 201 can include a greater (or fewer) number of devices, and/or devices of a different function/type, without departing from the technology. Additionally, as discussed in further detail below, various settings for each device, as well as any data-path parameters for the service chain, can vary depending on the desired implementation.


In operation, production SC 201 represents a functional service chain, for example, that is implemented in a virtual network environment, such as a network data center (DC). In some implementations, the production SC is cloned (duplicated), for example, in by instantiating similar (or identical) devices that are organized and configured in substantially the same way. By duplicating the production SC, changes can be made to certain device and/or data-path parameters in order to measure the overall effect on traffic flow performance for the cloned chain that is due to the parameter changes. As such, multiple different SC configurations can be used to test optimal data-path parameters, without the need to interfere with flows being processed by the production SC. Configuration changes determined to increase flow performance in a cloned SC can either be implemented in the original production service chain, or traffic flows may be redirected over a newly instantiated (cloned) SC, effectively designating it as the new “production SC.”


Further to the example illustrated in FIG. 2A, production SC 201 is cloned to produce first cloned SC 203, and second cloned SC 205, which are coupled to host devices 200B and 200C, respectively. First cloned SC 203, and second cloned SC 205 represent service chains that are substantially similar to production chain 201, but with specific configuration changes. For example, first cloned SC 203 contains devices with associated device configurations that are similar to production SC 201. That is, first cloned SC 203 contains a QoS Router 204B, Inline IPS 206B, load balancer 208B, and server 210B. However, first cloned SC 203 is implemented using a different virtual switch, i.e., using vector packet processing (VPP), rather than OVS-DPDK.


Similarly, second cloned SC 205 contains a series of similar devices (e.g., 204C, 206C, and 208C), and a virtual switch 212C that is similar to production SC 201 (OVS-DPDK). However, second cloned SC 205 includes a HTTP Server 216 that uses a different compression protocol (i.e., “deflate”), than that of production SC 201.


With first cloned SC 203, and second cloned SC 205 each representing configuration changes with respect to production SC 201, traffic flows over the cloned SCs (203, 205) can be measured to determine if the configuration changes provide any performance benefits. To measure the performance of the cloned SCs, traffic flows for production SC 201 can be duplicated and routed over each of the cloned SCs (203, 205). Various metrics for the traffic flows are collected to determine what impact the changes had on flow performance. By way of example, end-to-end times for each packet to traverse its respective SC can be measured, and/or processing durations at each device in the SC can be determined.


If modification of the virtual switch (e.g., from OVS-DPDK 212A to VPP in virtual switch 214) results in a decreased latency between devices, it may be determined that changes to virtual switch 212A can improve traffic flow performance in production SC 201. Similarly, if configuration changes in HTTP Server 216 (e.g., to implement Deflate compression in server 216) result in latency reductions, it may be determined that modifications of the compression scheme implemented in HTTP Server 210A are likely to improve flow performance in production SC 201. In some implementations, mutated parameters that are determined to improve flow characteristics in a cloned SC can be used to provide automatic configuration updates to the production SC.


By way of further example, the virtual switch settings for first cloned SC 203, and HTTP Server compression settings for second cloned SC 205 can be saved and/or automatically pushed as network changes (e.g., by a network controller) to update production SC 201. In some approaches, production SC cloning and configuration mutation can be performed to automatically determine new configuration settings for the production SC. Depending on implementation, parameter tuning for a production SC can be performed periodically, or in response to one or more predetermined events, such as updates/changes made in the network environment.



FIG. 2B conceptually illustrates another example of a production SC mutation that can be implemented using the disclosed technology. In the example of FIG. 2B, production SC 207 is identically duplicated (with no parameter changes) as cloned SC 209, and duplicated (with changes) as cloned SC 211. In such implementations, true A/B testing (i.e., “split-run testing”) can be performed, for example, by observing how traffic flows behave in a cloned SC that is functionally identical to the selected production SC.


In practice, production SC 207 and cloned SC 209 contain substantially identical devices and configuration parameters (e.g., QoS Routers 218, Inline IPS 220, Load Balancer 222, and HTTP Server 224, connected by vSwitch 226). However, SC 211 contains HTTP server 228, which implements a compression scheme (Deflate) that is different from that of cloned SC 209 (GZIP). Using an identical copy of production SC 207 (i.e., cloned SC 209), and a modified version (i.e., cloned SC 211), A/B testing can be performed, for example, by determining how identical traffic flow performance may differ between clones 209, and 211.


Similar to the example of FIG. 2A, configuration changes that are determined to improve traffic flow performance on cloned SC 211 can be automatically pushed to production SC 207, for example, by a network controller for other configuration device. In some instances, new network settings may be first provided to a user (e.g., a system administrator) for approval, before being pushed out to the network. As understood by those of skill in the art, parameter changes to a production SC can be made on a device-by-device basis, for example, using an application programming interface (API) of the respective device.


Although the examples, illustrated in FIGS. 2A and 2B only depict two duplications of a production SC, it is understood that any number of clones can be made. Additionally, each cloned SC can include multiple configuration changes, without departing from the scope of the technology. Accordingly, through the systematic SC duplication and parameter mutation, optimal configuration settings can be determined for a selected production SC. As discussed in further detail below, optimal configuration parameters for a given service chain can be stored to a database, for example, and used to initialize (or inform) configuration changes for similarly implemented SCs in other networking contexts, and/or for similar traffic flows with similar profiles.


In some aspects, parameter tuning for a selected production SC can be automatically performed on an ongoing basis, such as at predetermined time intervals. In other aspects, production SC tuning may be performed in response to one or more network events, such as an update or configuration change made to one or more devices, the instantiation/removal of a device from the network fabric, and/or changes in traffic flow characteristics, e.g., changes in traffic destination, type, bandwidth usage, or quality-of-service requirements.



FIG. 3 illustrates steps of an example process 300 for implementing an automatic production service chain parameter tuning solution. Process 300 begins with step 302, in which a first set of performance metrics are measured for traffic directed over a production service chain. As discussed above, the production service chain (SC) can contain essentially any type/arrangement of virtual network devices, for example, such as illustrated in FIGS. 2A and 2B, discussed above.


The type of performance metric/s measured for traffic flows over the production SC may vary with implementation. For example, end-to-end times for one or more packets traversing the SC can be measured. Additionally, processing times and/or throughput for one or more devices in the chain, and/or packet latency for transmissions between devices may also be measured.


It is understood that various speed and quality metrics for the production SC can be determined to assess performance. As discussed in greater detail below, these performance metrics can be used to determine if modified parameters for one or more cloned SC provide traffic flow performance enhancements.


In step 304, the production SC is cloned to produce a (first) cloned SC, for example, in which one or more parameters have been modified. A non-exhaustive summary of example parameters that can be modified is provided in further detail below; however, one of skill in the art will recognize that essentially any change in configuration or arrangement, to one or more of the devices in the cloned SC, can count as a parameter change or SC mutation.


In practice, traffic flows that traverse the production SC are duplicated, for example at a head-end node, and provided to the cloned SC. In this manner, the cloned SC is subject to the same traffic load as the production SC.


Subsequently, in step 306, a second set of performance metrics is measured for traffic directed over the cloned SC. Although the second set of performance metrics can include essentially any measurable quality of traffic throughput/transfer, in some aspect the second set of performance metrics includes essentially the same measurements as were determined in the first set (step 302), for comparison purposes.


The second set of performance metrics are compared to the first set of performance metrics to determine if parameter changes in the cloned SC resulted in an improvement for the processed traffic flow. In instances where the second set of performance metrics represent potential improvements over the first set of performance metrics (i.e., reduced end-to-end times, reduced processing time for one or more device in the cloned SC, and/or reduced packet transfer delays between devices), it may be inferred that similar changes would produce similar improvements in traffic flows over the production SC.


Configuration changes determined to likely improve flow performance can be saved, for example, to a database that correlates SC data-path settings with various network and traffic-flow characteristics. In some approaches, a database may be configured to correlate sets of traffic characteristics (e.g., a traffic profile) with service chain configuration characteristics (e.g., a service chain profile). Based on corresponding traffic profiles and service chain profiles, the database may be used to identify candidate parameter mutations to be tested in one or more subsequent cloned SC instantiations, for example, in the same (or a different) network environment.


In step 308, at least one configuration change that is determined to likely improve traffic flow performance for the production SC is identified. The identified configuration change/s can be automatically pushed, so that the configuration of the production SC is automatically tuned for optimal traffic flow performance. Alternatively, one or more configuration update recommendations may be provided to a user (e.g., a network administrator) to verify that the network changes should be implemented before the new configuration is pushed out to the network. As discussed above, process 300 can be performed for a selected production SC on a periodic basis, or in response to certain detected changes in the network fabric.


By way of non-limiting example, production SC tuning can be performed in response to network changes, such as when: a new service function or device is added to (or removed from) an existing chain, a service chain is newly added to (or removed from) a NFV platform, a service function chain is moved to a new data center or underlying platform, a significantly new traffic profile is added to the network, and/or an existing traffic profile changes significantly. Parameter tuning can also be performed in response to an exceeded resource threshold for one or more devices in the service chain. By way of example, SC tuning can be performed if CPU usage exceeds a predetermined amount (e.g., 75% of total CPU capacity), if memory utilization exceeds a predetermined threshold (e.g., 80% of total memory capacity), of if a monitored threshold is reached (e.g., more than three packets sitting in an ingress queue), etc. Additionally, SC tuning can be performed in response to determinations that various performance thresholds have been met, or exceeded. For example, tuning can be performed in response to a determination that an end-to-end transaction time has exceeded a predetermined threshold (e.g., 3 ms), or that processing time for a particular type of function in the chain has exceeded a predetermined duration (e.g., a DPI function that exceeds 6 ms), etc.


In some aspects, parameter tuning of cloned SCs can be performed using a machine-learning (ML) approach. For example, one or more ML algorithms can be used to monitor traffic flow performance over production and cloned SCs, and to update the configurable parameters of the cloned SCs to identify configuration combinations that result in improved performance. As understood by those of skill in the art, virtually any number of production/cloned SCs may be monitored using a ML approach, for example, such that hundreds or thousands of active cloned SCs are monitored at any time, each with different parameters set by the ML algorithm.


As understood by those of skill in the art, virtually any parameter relating to a device or entire service chain (e.g., data path) may be altered, for example, in one or more SC clones. For example, parameters relating to RAM, CPU, or storage allocations to VM endpoints can be altered between various production SCs and SC clones. In some instances, providing additional resources to VM endpoints can increase performance, but often leads to diminishing returns as the bottleneck moves farther down the list; additionally, due to the finite nature of compute resources, increasing VM allocations may cause contention with other instances on the host.


In some aspects, parameters relating to RAM, CPU, or storage allocations to NFV devices can be altered between various production SCs and SC clones. Such parameters can affect allocation of resources to one or more virtualized device, such as a virtual router. As with VM allocations, increased NFV resource allocations can provide diminishing returns, especially in cases where throughput for a device is restricted by software license.


In some aspects, parameters corresponding to configurations for multi-queue support for one or more virtual network interface cards (NICs) can be altered between various production SCs and SC clones. For instance, a VM's virtual NIC may only have a single receive buffer. Adding multi-queue support can increase receive capacity in cases where one or more vCPUs are idle enough to service additional receive queues.


In some aspects, parameters relating to test access point (TAP) interface transmit queue lengths can be altered between production SCs and SC clones. For example, in some kernel-based virtual machines (KVMs)/OpenStack implementations, the TAP interface provides a virtual link from the host's kernel to the VM's virtual NIC. The default queue length in some deployments is relatively low by modern network standards (e.g., 500 packets). Increasing the queue length can increase the processing capacity of the link. However, careful tuning can be required as a queue size that is too large may increase latency, which is a concern for sensitive applications such as voice and video.


In some aspects, parameter tuning can be used to implement either Linux vEth pairs or OVS patch ports. By default, many deployments using Open vSwitch (OVS) to provide link layer connectivity to VMs (particularly in OpenStack environments) utilize Linux vEth pairs to deliver packets between OVS bridges. However, such implementations can cause performance bottlenecks as it involves switching packets in and out of user-space. In some implementations, a more efficient solution can be to replace vEth pairs with OVS patch ports to keep all packets processed within the kernel. Without a clone of the in-service data path, all networking on the host must be brought down to test this change, thus impacting traffic.


In some aspects, parameter tuning can be used to alter resources available to host hardware. Increasing resources (e.g., CPU, RAM, etc.), either by quantity or speed/efficiency, on host hardware typically improves performance. Parameter tuning can involve hosting all (or portions of the service chain functions) on the same or different hardware.


In some aspects, parameter tuning can be used to affect upgrades/downgrades of a host kernel version. Upgrading or downgrading the kernel of the host can result in performance differences, for example, to various guests (virtual services) running on them, since the host's kernel is still responsible for delivering packets to/from the guests.


In some aspects, one or more parameters can be manipulated to affect physical link aggregation between various production SCs and SC clones. For example, changes to link aggregation algorithms, such as Link Aggregation Control Protocol (LACP), can affect performance, depending on how well traffic is load balanced across physical links. Optimal load balancing can be highly context specific and therefore the load balancing algorithm depends heavily on the type of traffic to be processed by the environment. For example, an environment that deals in many small Transmission Control Protocol (TCP) and/or User Datagram Protocol (UDP) connections between similar endpoints could most benefit from L4-based algorithms, e.g., since the source and destination Internet Protocol (IP) addresses will often be the same for every flow.


In some aspects, one or more parameters can be manipulated to affect buffer capacity and/or processing capability of one or more network interface cards (NICs). Depending on implementation, parameter tuning can be used to affect a size of one or more packet buffers (e.g., similar to TAP interface transmit queue length tuning), and/or to upgrade a driver for more efficient processing.


In some aspects, one or more parameters can be manipulated to affect a type of packet forwarding technology that is implemented. In cloud environments, there are many options for packet forwarding technologies and each have advantages and disadvantages. For example, some deployments may have guests using the host's kernel as an intermediary between the virtual NIC and a physical NIC of the host to give them access to the physical network. This can often be a performance bottleneck depending on the speed and available resources of the host. Newer technologies such as vector packet processing (VPP), which can also be built on top of Data Plane Development Kit (DPDK) to provide more direct access to hardware, can help alleviate these bottlenecks and allow for better performance for packets that didn't enter or leave a particular node.


It is understood that the foregoing examples of tunable device parameters are not exhaustive, and that other service chain qualities or configurations can be modified without departing from the scope of the technology.



FIG. 4 illustrates an example network device 410 that can be used to implement one or more service chains (SCs), as discussed above. Network device 410 includes master central processing unit (CPU) 462, interfaces 468, and a bus 415 e.g., a Peripheral Computer Interconnect (PCI) bus. CPU 462 can be configured to perform monitoring for one or more virtual network functions under the control of software including an operating system and any appropriate applications software. CPU 462 can include one or more processors 463, such as processors from the Intel, ARM, and/or Motorola family of microprocessors or the MIPS family of microprocessors. In an alternative embodiment, processor 463 is specially designed hardware for controlling the operations of network device 410. In a specific embodiment, a memory 461 (such as non-volatile RAM and/or ROM) also forms part of CPU 462. However, there are many different ways in which memory could be coupled to the system.


Interfaces 468 can be provided as interface cards (sometimes referred to as “network interface cards” (NICs) or “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with device 410. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, Digital Subscriber Line (DSL) interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces can be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, Asynchronous Transfer Mode (ATM) interfaces, High Speed Serial Interfaces (HSSIs), Point of Sale (POS) interfaces, Fiber Distributed Data Interface (FDDIs), and the like. Generally, these interfaces can include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 462 to efficiently perform routing computations, network diagnostics, security functions, etc.


Although the system shown in FIG. 4 is one specific network device of the present invention, it is by no means the only network device architecture on which the present invention can be implemented. For example, an architecture having a single processor that handles communications as well as routing computations, etc. is often used. Further, other types of interfaces and media could also be used with the router.


Regardless of the network device's configuration, it may employ one or more non-transitory memories or memory modules (including memory 461) configured to store program instructions for general-purpose network operations and mechanisms necessary to implement one or more steps of a service chain auto-tuning process of the subject technology.


For example, memory 461 can include a non-transitory computer-readable medium that includes instructions for causing CPU 462 to execute operations for measuring a first set of performance metrics for a first traffic flow directed over a production service chain (SC), wherein the production SC comprises one or more devices, and cloning the production SC to produce a first cloned SC, wherein the first cloned SC comprises at least one parameter or device that is different from the production SC. In some aspects, the operations can further include steps for measuring a second set of performance metrics for a second traffic flow directed over the cloned SC, and based on the first set of performance metrics and the second set of performance metrics, identifying at least one configuration change for the production SC that is likely to improve flow performance for the first traffic flow directed over the production SC.


It is understood that any specific order or hierarchy of steps in the processes disclosed is an illustration of exemplary approaches. Based upon design preferences, it is understood that the specific order or hierarchy of steps in the processes may be rearranged, or that only a portion of the illustrated steps be performed. Some of the steps may be performed simultaneously. For example, in certain circumstances, multitasking and parallel processing may be advantageous. Moreover, the separation of various system components in the embodiments described above should not be understood as requiring such separation in all embodiments, and it should be understood that the described program components and systems can generally be integrated together in a single software product or packaged into multiple software products.


The previous description is provided to enable any person skilled in the art to practice the various aspects described herein. Various modifications to these aspects will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other aspects. Thus, the claims are not intended to be limited to the aspects shown herein, but are to be accorded the full scope consistent with the language claims, wherein reference to an element in the singular is not intended to mean “one and only one” unless specifically so stated, but rather “one or more.”


A phrase such as an “aspect” does not imply that such aspect is essential to the subject technology or that such aspect applies to all configurations of the subject technology. A disclosure relating to an aspect may apply to all configurations, or one or more configurations. A phrase such as an aspect may refer to one or more aspects and vice versa. A phrase such as a “configuration” does not imply that such configuration is essential to the subject technology or that such configuration applies to all configurations of the subject technology. A disclosure relating to a configuration may apply to all configurations, or one or more configurations. A phrase such as a configuration may refer to one or more configurations and vice versa.


The word “exemplary” is used herein to mean “serving as an example or illustration.” Any aspect or design described herein as “exemplary” is not necessarily to be construed as preferred or advantageous over other aspects or designs.

Claims
  • 1. A computer-implemented method comprising: implementing a production service chain (SC) with a plurality of devices, the production service chain defining a sequence of functions to perform on traffic flow using the plurality of devices, the production SC having a first set of performance metrics for a first traffic flow directed over the production SC;cloning the production SC to produce a cloned SC, wherein the cloned SC comprises a cloned plurality of devices corresponding to the plurality of devices, the cloned SC having a second set of performance metrics for a second traffic flow directed over the cloned SC, wherein at least one of the devices of the cloned plurality of devices has at least one parameter that is different from the plurality of devices; andbased on the first set of performance metrics and the second set of performance metrics and in response to a predetermined event, applying the at least one parameter that is different from the at least one of the devices of the cloned plurality of devices to a respective one of the plurality of devices.
  • 2. The computer-implemented method of claim 1, wherein the predetermined event is a time interval.
  • 3. The computer-implemented method of claim 1, wherein the predetermined event is one or more network events.
  • 4. The computer-implemented method of claim 1, wherein the first set and second set of performances metrics measure, in the first and second traffic flows, a type.
  • 5. The computer-implemented method of claim 1, wherein the first set and second set of performances metrics measure, in the first and second traffic flows, bandwidth usage.
  • 6. The computer-implemented method of claim 1, wherein the first set and second set of performances metrics are measured over a time interval.
  • 7. The computer-implemented method of claim 1, further comprising: based on the first set of performance metrics and the second set of performance metrics and in response to a second predetermined event, resetting the at least one parameter that is different from the at least one of the devices of the plurality of devices is the first cloned SC to a respective one of the plurality of devices of the production SC.
  • 8. A system comprising: one or more processors; anda non-transitory computer-readable medium comprising instructions stored therein, which when executed by the one or more processors, cause the one or more processors to: implement a production service chain (SC) with a plurality of devices, the production service chain defining a sequence of functions to perform on traffic flow using the plurality of devices, the production SC having a first set of performance metrics for a first traffic flow directed over the production SC;clone the production SC to produce a cloned SC, wherein the cloned SC comprises a cloned plurality of devices corresponding to the plurality of devices, the cloned SC having a second set of performance metrics for a second traffic flow directed over the cloned SC, wherein at least one of the devices of the cloned plurality of devices has at least one parameter that is different from the plurality of devices; andbased on the first set of performance metrics and the second set of performance metrics and in response to a predetermined event, apply the at least one parameter that is different from the at least one of the devices of the cloned plurality of devices to a respective one of the plurality of devices.
  • 9. The system of claim 8, wherein the predetermined event is a time interval.
  • 10. The system of claim 8, wherein the predetermined event is one or more network events.
  • 11. The system of claim 8, wherein the first set and second set of performances metrics measure, in the first and second traffic flows, a type.
  • 12. The system of claim 8, wherein the first set and second set of performances metrics measure, in the first and second traffic flows, bandwidth usage.
  • 13. The system of claim 8, wherein the first set and second set of performances metrics are measured over a time interval.
  • 14. The system of claim 8, further comprising instructions, which when executed by the one or more processors, causes the one or more processors to: based on the first set of performance metrics and the second set of performance metrics and in response to a second predetermined event, reset the at least one parameter that is different from the at least one of the devices of the plurality of devices is the first cloned SC to a respective one of the plurality of devices of the production SC.
  • 15. A non-transitory computer-readable medium comprising instructions stored therein, which when executed by one or more processors, cause the one or more processors to: implement a production service chain (SC) with a plurality of devices, the production service chain defining a sequence of functions to perform on traffic flow using the plurality of devices, the production SC having a first set of performance metrics for a first traffic flow directed over the production SC;clone the production SC to produce a cloned SC, wherein the cloned SC comprises a cloned plurality of devices corresponding to the plurality of devices, the cloned SC having a second set of performance metrics for a second traffic flow directed over the cloned SC, wherein at least one of the devices of the cloned plurality of devices has at least one parameter that is different from the plurality of devices; andbased on the first set of performance metrics and the second set of performance metrics and in response to a predetermined event, apply the at least one parameter that is different from the at least one of the devices of the cloned plurality of devices to a respective one of the plurality of devices.
  • 16. The non-transitory computer-readable medium of claim 15, wherein the predetermined event is a time interval.
  • 17. The non-transitory computer-readable medium of claim 15, wherein the predetermined event is one or more network events.
  • 18. The non-transitory computer-readable medium of claim 15, wherein the first set and second set of performances metrics measure, in the first and second traffic flows, a type.
  • 19. The non-transitory computer-readable medium of claim 15, wherein the first set and second set of performances metrics measure, in the first and second traffic flows, bandwidth usage.
  • 20. The non-transitory computer-readable medium of claim 15, wherein the first set and second set of performances metrics are measured over a time interval.
CROSS-REFERENCE TO RELATED APPLICATION

This application is a Continuation of, and claims priority to, U.S. Non-Provisional patent application Ser. No. 15/656,607, filed Jul. 21, 2017, the content of which is incorporated herein by reference in its entirety.

US Referenced Citations (359)
Number Name Date Kind
3629512 Yuan Dec 1971 A
4769811 Eckberg, Jr. et al. Sep 1988 A
5408231 Bowdon Apr 1995 A
5491690 Alfonsi et al. Feb 1996 A
5557609 Shobatake et al. Sep 1996 A
5600638 Bertin et al. Feb 1997 A
5687167 Bertin et al. Nov 1997 A
6115384 Parzych Sep 2000 A
6167438 Yates et al. Dec 2000 A
6400681 Bertin et al. Jun 2002 B1
6661797 Goel et al. Dec 2003 B1
6687229 Kataria et al. Feb 2004 B1
6799270 Bull et al. Sep 2004 B1
6888828 Partanen et al. May 2005 B1
6993593 Iwata Jan 2006 B2
7027408 Nabkel et al. Apr 2006 B2
7062567 Benitez et al. Jun 2006 B2
7095715 Buckman et al. Aug 2006 B2
7096212 Tribble et al. Aug 2006 B2
7139239 Mcfarland et al. Nov 2006 B2
7165107 Pouyoul et al. Jan 2007 B2
7197008 Shabtay et al. Mar 2007 B1
7197660 Liu et al. Mar 2007 B1
7209435 Kuo et al. Apr 2007 B1
7227872 Biswas et al. Jun 2007 B1
7231462 Berthaud et al. Jun 2007 B2
7333990 Thiagarajan et al. Feb 2008 B1
7443796 Albert et al. Oct 2008 B1
7458084 Zhang et al. Nov 2008 B2
7472411 Wing et al. Dec 2008 B2
7486622 Regan et al. Feb 2009 B2
7536396 Johnson et al. May 2009 B2
7552201 Areddu et al. Jun 2009 B2
7558261 Arregoces et al. Jul 2009 B2
7567504 Darling et al. Jul 2009 B2
7571470 Arregoces et al. Aug 2009 B2
7573879 Narad et al. Aug 2009 B2
7610375 Portolani et al. Oct 2009 B2
7643468 Arregoces et al. Jan 2010 B1
7644182 Banerjee et al. Jan 2010 B2
7647422 Singh et al. Jan 2010 B2
7657898 Sadiq Feb 2010 B2
7657940 Portolani et al. Feb 2010 B2
7668116 Wijnands et al. Feb 2010 B2
7684321 Muirhead et al. Mar 2010 B2
7738469 Shekokar et al. Jun 2010 B1
7751409 Carolan Jul 2010 B1
7774440 Bagrodia Aug 2010 B1
7793157 Bailey et al. Sep 2010 B2
7814284 Glass et al. Oct 2010 B1
7831693 Lai Nov 2010 B2
7852785 Lund et al. Dec 2010 B2
7860095 Forissier et al. Dec 2010 B2
7860100 Khalid et al. Dec 2010 B2
7895425 Khalid et al. Feb 2011 B2
7899012 Ho et al. Mar 2011 B2
7899861 Feblowitz et al. Mar 2011 B2
7907595 Khanna et al. Mar 2011 B2
7908480 Firestone et al. Mar 2011 B2
7925729 Bush Apr 2011 B2
7983174 Monaghan et al. Jul 2011 B1
7990847 Leroy et al. Aug 2011 B1
8000329 Fendick et al. Aug 2011 B2
8018938 Fromm et al. Sep 2011 B1
8094575 Vadlakonda et al. Jan 2012 B1
8095683 Balasubramaniam Chandra Jan 2012 B2
8116307 Thesayi et al. Feb 2012 B1
8166465 Feblowitz et al. Apr 2012 B2
8180909 Hartman et al. May 2012 B2
8191119 Wing et al. May 2012 B2
8195774 Lambeth et al. Jun 2012 B2
8280354 Smith et al. Oct 2012 B2
8281302 Durazzo et al. Oct 2012 B2
8291108 Raja et al. Oct 2012 B2
8305900 Bianconi Nov 2012 B2
8311045 Quinn et al. Nov 2012 B2
8316457 Paczkowski et al. Nov 2012 B1
8355332 Beaudette et al. Jan 2013 B2
8442043 Sharma et al. May 2013 B2
8451817 Cheriton May 2013 B2
8464336 Wei et al. Jun 2013 B2
8473981 Gargi Jun 2013 B1
8479298 Keith et al. Jul 2013 B2
8498414 Rossi Jul 2013 B2
8520672 Guichard et al. Aug 2013 B2
8601152 Chou Dec 2013 B1
8605588 Sankaran et al. Dec 2013 B2
8612612 Dukes et al. Dec 2013 B1
8627328 Mousseau et al. Jan 2014 B2
8645952 Biswas et al. Feb 2014 B2
8676965 Gueta Mar 2014 B2
8676980 Kreeger et al. Mar 2014 B2
8700892 Bollay et al. Apr 2014 B2
8724466 Kenigsberg et al. May 2014 B2
8730980 Bagepalli et al. May 2014 B2
8743885 Khan et al. Jun 2014 B2
8751420 Hjelm et al. Jun 2014 B2
8762534 Hong et al. Jun 2014 B1
8762707 Killian et al. Jun 2014 B2
8792490 Jabr et al. Jul 2014 B2
8793400 Mcdysan et al. Jul 2014 B2
8812730 Vos et al. Aug 2014 B2
8819419 Carlson et al. Aug 2014 B2
8825070 Akhtar et al. Sep 2014 B2
8830834 Sharma et al. Sep 2014 B2
8904037 Haggar et al. Dec 2014 B2
8984284 Purdy, Sr. et al. Mar 2015 B2
9001827 Appenzeller Apr 2015 B2
9071533 Hui et al. Jun 2015 B2
9077661 Andreasen et al. Jul 2015 B2
9088584 Feng et al. Jul 2015 B2
9130872 Kumar et al. Sep 2015 B2
9143438 Khan et al. Sep 2015 B2
9160797 Mcdysan Oct 2015 B2
9178812 Guichard et al. Nov 2015 B2
9189285 Ng et al. Nov 2015 B2
9203711 Agarwal et al. Dec 2015 B2
9253274 Quinn et al. Feb 2016 B2
9300579 Frost et al. Mar 2016 B2
9300585 Kumar et al. Mar 2016 B2
9311130 Christenson et al. Apr 2016 B2
9319324 Beheshti-Zavareh et al. Apr 2016 B2
9325565 Yao et al. Apr 2016 B2
9338097 Anand et al. May 2016 B2
9344337 Kumar et al. May 2016 B2
9374297 Bosch et al. Jun 2016 B2
9379931 Bosch et al. Jun 2016 B2
9385950 Quinn et al. Jul 2016 B2
9398486 La Roche, Jr. et al. Jul 2016 B2
9407540 Kumar et al. Aug 2016 B2
9413655 Shatzkamer et al. Aug 2016 B2
9424065 Singh et al. Aug 2016 B2
9436443 Chiosi et al. Sep 2016 B2
9444675 Guichard et al. Sep 2016 B2
9473570 Bhanujan et al. Oct 2016 B2
9479443 Bosch et al. Oct 2016 B2
9491094 Patwardhan et al. Nov 2016 B2
9537836 Maller et al. Jan 2017 B2
9558029 Behera et al. Jan 2017 B2
9559970 Kumar et al. Jan 2017 B2
9571405 Pignataro et al. Feb 2017 B2
9608896 Kumar et al. Mar 2017 B2
9614739 Kumar et al. Apr 2017 B2
9660909 Guichard et al. May 2017 B2
9723106 Shen et al. Aug 2017 B2
9774533 Zhang et al. Sep 2017 B2
9794379 Kumar et al. Oct 2017 B2
9882776 Aybay et al. Jan 2018 B2
9929945 Schultz et al. Mar 2018 B2
10003530 Zhang et al. Jun 2018 B2
20010023442 Masters Sep 2001 A1
20020085562 Hufferd et al. Jul 2002 A1
20020131362 Callon Sep 2002 A1
20020156893 Pouyoul et al. Oct 2002 A1
20020167935 Nabkel et al. Nov 2002 A1
20030023879 Wray Jan 2003 A1
20030026257 Xu et al. Feb 2003 A1
20030037070 Marston Feb 2003 A1
20030088698 Singh et al. May 2003 A1
20030110081 Tosaki et al. Jun 2003 A1
20030120816 Berthaud et al. Jun 2003 A1
20030214913 Kan et al. Nov 2003 A1
20030226142 Rand Dec 2003 A1
20040109412 Hansson et al. Jun 2004 A1
20040148391 Shannon, Sr. et al. Jul 2004 A1
20040199812 Earl Oct 2004 A1
20040213160 Regan et al. Oct 2004 A1
20040264481 Darling et al. Dec 2004 A1
20040268357 Joy et al. Dec 2004 A1
20050044197 Lai Feb 2005 A1
20050058118 Davis Mar 2005 A1
20050060572 Kung Mar 2005 A1
20050086367 Conta et al. Apr 2005 A1
20050120101 Nocera Jun 2005 A1
20050152378 Bango et al. Jul 2005 A1
20050157645 Rabie et al. Jul 2005 A1
20050160180 Rabje et al. Jul 2005 A1
20050204042 Banerjee et al. Sep 2005 A1
20050210096 Bishop et al. Sep 2005 A1
20050257002 Nguyen Nov 2005 A1
20050281257 Yazaki et al. Dec 2005 A1
20050286540 Hurtta et al. Dec 2005 A1
20050289244 Sahu et al. Dec 2005 A1
20060005240 Sundarrajan et al. Jan 2006 A1
20060031374 Lu et al. Feb 2006 A1
20060045024 Previdi et al. Mar 2006 A1
20060074502 Mcfarland Apr 2006 A1
20060092950 Arregoces et al. May 2006 A1
20060095960 Arregoces et al. May 2006 A1
20060112400 Zhang et al. May 2006 A1
20060155862 Kathi et al. Jul 2006 A1
20060168223 Mishra et al. Jul 2006 A1
20060233106 Achlioptas et al. Oct 2006 A1
20060233155 Srivastava Oct 2006 A1
20060271673 Christodoulou Nov 2006 A1
20070061441 Landis et al. Mar 2007 A1
20070067435 Landis et al. Mar 2007 A1
20070094397 Krelbaum et al. Apr 2007 A1
20070143851 Nicodemus et al. Jun 2007 A1
20070237147 Quinn et al. Oct 2007 A1
20070250836 Li et al. Oct 2007 A1
20080056153 Liu Mar 2008 A1
20080080509 Khanna et al. Apr 2008 A1
20080080517 Roy et al. Apr 2008 A1
20080170542 Hu Jul 2008 A1
20080177896 Quinn et al. Jul 2008 A1
20080181118 Sharma et al. Jul 2008 A1
20080196083 Parks et al. Aug 2008 A1
20080209039 Tracey et al. Aug 2008 A1
20080219287 Krueger et al. Sep 2008 A1
20080225710 Raja et al. Sep 2008 A1
20080291910 Tadimeti, Sr. et al. Nov 2008 A1
20090003364 Fendick et al. Jan 2009 A1
20090006152 Timmerman et al. Jan 2009 A1
20090037713 Khalid et al. Feb 2009 A1
20090094684 Chinnusamy et al. Apr 2009 A1
20090204612 Keshavarz-nia et al. Aug 2009 A1
20090271656 Yokota et al. Oct 2009 A1
20090300207 Giaretta et al. Dec 2009 A1
20090305699 Deshpande et al. Dec 2009 A1
20090328054 Paramasivam et al. Dec 2009 A1
20100058329 Durazzo et al. Mar 2010 A1
20100063988 Khalid Mar 2010 A1
20100080226 Khalid Apr 2010 A1
20100165985 Sharma et al. Jul 2010 A1
20100191612 Raleigh Jul 2010 A1
20100211658 Hoogerwerf et al. Aug 2010 A1
20110023090 Asati et al. Jan 2011 A1
20110032833 Zhang et al. Feb 2011 A1
20110055845 Nandagopal et al. Mar 2011 A1
20110131338 Hu Jun 2011 A1
20110137991 Russell Jun 2011 A1
20110142056 Manoj Jun 2011 A1
20110161494 Mcdysan et al. Jun 2011 A1
20110222412 Kompella Sep 2011 A1
20110255538 Srinivasan et al. Oct 2011 A1
20110267947 Dhar et al. Nov 2011 A1
20110282642 Kruger Nov 2011 A1
20120131662 Kuik et al. May 2012 A1
20120147894 Mulligan et al. Jun 2012 A1
20120324442 Barde Dec 2012 A1
20120331135 Alon et al. Dec 2012 A1
20130003735 Chao et al. Jan 2013 A1
20130003736 Szyszko et al. Jan 2013 A1
20130040640 Chen et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130121137 Feng et al. May 2013 A1
20130124708 Lee et al. May 2013 A1
20130163594 Sharma et al. Jun 2013 A1
20130163606 Bagepalli et al. Jun 2013 A1
20130238806 Moen Sep 2013 A1
20130272305 Lefebvre et al. Oct 2013 A1
20130311675 Kancherla Nov 2013 A1
20130329584 Ghose et al. Dec 2013 A1
20140010083 Hamdi et al. Jan 2014 A1
20140010096 Kamble et al. Jan 2014 A1
20140036730 Nellikar et al. Feb 2014 A1
20140050223 Foo et al. Feb 2014 A1
20140067758 Boldyrev et al. Mar 2014 A1
20140105062 McDysan et al. Apr 2014 A1
20140181267 Wadkins et al. Jun 2014 A1
20140254603 Banavalikar et al. Sep 2014 A1
20140259012 Nandlall et al. Sep 2014 A1
20140279863 Krishnamurthy et al. Sep 2014 A1
20140280836 Kumar et al. Sep 2014 A1
20140317261 Shatzkamer et al. Oct 2014 A1
20140321459 Kumar et al. Oct 2014 A1
20140334295 Guichard et al. Nov 2014 A1
20140344439 Kempf et al. Nov 2014 A1
20140362682 Guichard et al. Dec 2014 A1
20140362857 Guichard et al. Dec 2014 A1
20140369209 Khurshid et al. Dec 2014 A1
20140376558 Rao et al. Dec 2014 A1
20150003455 Haddad et al. Jan 2015 A1
20150012584 Lo et al. Jan 2015 A1
20150012988 Jeng et al. Jan 2015 A1
20150029871 Frost et al. Jan 2015 A1
20150032871 Allan et al. Jan 2015 A1
20150051893 Ratcliffe, III Feb 2015 A1
20150052516 French et al. Feb 2015 A1
20150071285 Kumar et al. Mar 2015 A1
20150074276 DeCusatis et al. Mar 2015 A1
20150082308 Kiess et al. Mar 2015 A1
20150085635 Wijnands et al. Mar 2015 A1
20150085870 Narasimha et al. Mar 2015 A1
20150089082 Patwardhan et al. Mar 2015 A1
20150092564 Aldrin Apr 2015 A1
20150103827 Quinn et al. Apr 2015 A1
20150117308 Kant Apr 2015 A1
20150124622 Kovvali et al. May 2015 A1
20150131484 Aldrin May 2015 A1
20150131660 Shepherd et al. May 2015 A1
20150156035 Foo et al. Jun 2015 A1
20150180725 Varney et al. Jun 2015 A1
20150180767 Tam et al. Jun 2015 A1
20150181309 Shepherd et al. Jun 2015 A1
20150188949 Mahaffey et al. Jul 2015 A1
20150195197 Yong et al. Jul 2015 A1
20150222516 Deval et al. Aug 2015 A1
20150222533 Birrittella et al. Aug 2015 A1
20150236948 Dunbar et al. Aug 2015 A1
20150319078 Lee et al. Nov 2015 A1
20150319081 Kasturi et al. Nov 2015 A1
20150326473 Dunbar et al. Nov 2015 A1
20150333930 Aysola et al. Nov 2015 A1
20150334027 Bosch et al. Nov 2015 A1
20150341285 Aysola et al. Nov 2015 A1
20150365495 Fan et al. Dec 2015 A1
20150381465 Narayanan et al. Dec 2015 A1
20150381557 Fan et al. Dec 2015 A1
20160028604 Chakrabarti et al. Jan 2016 A1
20160028640 Zhang et al. Jan 2016 A1
20160043944 Felstaine Feb 2016 A1
20160043952 Zhang et al. Feb 2016 A1
20160050117 Voellmy et al. Feb 2016 A1
20160050132 Zhang Feb 2016 A1
20160080263 Park et al. Mar 2016 A1
20160080496 Falanga et al. Mar 2016 A1
20160099853 Nedeltchev et al. Apr 2016 A1
20160119159 Zhao et al. Apr 2016 A1
20160119253 Kang et al. Apr 2016 A1
20160127139 Tian et al. May 2016 A1
20160134518 Callon et al. May 2016 A1
20160134535 Callon May 2016 A1
20160139939 Bosch et al. May 2016 A1
20160164776 Biancaniello Jun 2016 A1
20160165014 Nainar et al. Jun 2016 A1
20160173373 Guichard et al. Jun 2016 A1
20160173464 Wang et al. Jun 2016 A1
20160182336 Doctor et al. Jun 2016 A1
20160182342 Singaravelu et al. Jun 2016 A1
20160182684 Connor et al. Jun 2016 A1
20160212017 Li et al. Jul 2016 A1
20160226742 Apathotharanan et al. Aug 2016 A1
20160248685 Pignataro et al. Aug 2016 A1
20160277250 Maes Sep 2016 A1
20160285720 Mäenpää et al. Sep 2016 A1
20160323165 Boucadair et al. Nov 2016 A1
20160352629 Wang et al. Dec 2016 A1
20160380966 Gunnalan et al. Dec 2016 A1
20170019303 Swamy et al. Jan 2017 A1
20170031804 Ciszewski et al. Feb 2017 A1
20170078175 Xu et al. Mar 2017 A1
20170187609 Lee et al. Jun 2017 A1
20170208000 Bosch et al. Jul 2017 A1
20170214627 Zhang et al. Jul 2017 A1
20170237656 Gage et al. Aug 2017 A1
20170250917 Ruckstuhl et al. Aug 2017 A1
20170272470 Gundamaraju et al. Sep 2017 A1
20170279712 Nainar et al. Sep 2017 A1
20170308503 Somohano Oct 2017 A1
20170310611 Kumar et al. Oct 2017 A1
20170331741 Fedyk et al. Nov 2017 A1
20180013841 Nainar et al. Jan 2018 A1
20180026884 Nainar et al. Jan 2018 A1
20180026887 Nainar et al. Jan 2018 A1
20180041470 Schultz et al. Feb 2018 A1
20180062991 Nainar et al. Mar 2018 A1
20190028347 Johnston Jan 2019 A1
Foreign Referenced Citations (13)
Number Date Country
103716123 Apr 2014 CN
103716137 Apr 2014 CN
2750331 Jul 2014 EP
3160073 Apr 2017 EP
2016149686 Aug 2016 JP
WO 2011029321 Mar 2011 WO
WO 2012056404 May 2012 WO
WO 2015065353 May 2015 WO
WO 2015180559 Dec 2015 WO
WO 2015187337 Dec 2015 WO
WO 2016004556 Jan 2016 WO
WO 2016058245 Apr 2016 WO
WO 2017011607 Jan 2017 WO
Non-Patent Literature Citations (61)
Entry
International Search Report and Written Opinion from the International Searching Authority, dated Oct. 9, 2018, 15 pages, for the corresponding International Application PCT/US2018/043010.
Katsikas et al., “Profiling and accelerating commodity NFV service chains with SCC,” The Journal of Systems and Software, vol. 127, Jan. 2017, pp. 12-27.
Aldrin, S., et al. “Service Function Chaining Operation, Administration and Maintenance Framework,” Internet Engineering Task Force, Oct. 26, 2014, 13 pages.
Alizadeh, Mohammad, et al., “CONGA: Distributed Congestion-Aware Load Balancing for Datacenters,” SIGCOMM '14, Aug. 17-22, 2014, 12 pages.
Author Unknown, “ANSI/SCTE 35 2007 Digital Program Insertion Cueing Message for Cable,” Engineering Committee, Digital Video Subcommittee, American National Standard, Society of Cable Telecommunications Engineers, ©Society of Cable Telecommunications Engineers, Inc. 2007 All Rights Reserved, 140 Philips Road, Exton, PA 19341; 42 pages.
Author Unknown, “AWS Lambda Developer Guide,” Amazon Web Services Inc., May 2017, 416 pages.
Author Unknown, “CEA-708,” from Wikipedia, the free encyclopedia, Nov. 15, 2012; 16 pages http://en.wikipedia.org/w/index.php?title=CEA-708&oldid=523143431.
Author Unknown, “Cisco and Intel High-Performance VNFs on Cisco NFV Infrastructure,” White Paper, Cisco and Intel, Oct. 2016, 7 pages.
Author Unknown, “Cloud Functions Overview,” Cloud Functions Documentation, Mar. 21, 2017, 3 pages; https://cloud.google.com/functions/docs/concepts/overview.
Author Unknown, “Cloud-Native VNF Modelling,” Open Source Mano, ©ETSI 2016, 18 pages.
Author Unknown, “Digital Program Insertion,” from Wikipedia, the free encyclopedia, Jan. 2, 2012; 1 page http://en.wikipedia.org/w/index.php?title=Digital_Program_Insertion&oldid=469076482.
Author Unknown, “Dynamic Adaptive Streaming over HTTP,” from Wikipedia, the free encyclopedia, Oct. 25, 2012; 3 pages, http://en.wikipedia.org/w/index.php?title=Dynannic_Adaptive_Streanning_over_HTTP&oldid=519749169.
Author Unknown, “GStreamer and in-band metadata,” from RidgeRun Developer Connection, Jun. 19, 2012, 5 pages http://developersidgerun.conn/wiki/index.php/GStreanner_and_in-band_nnetadata.
Author Unknown, “IEEE Standard for the Functional Architecture of Next Generation Service Overlay Networks, IEEE Std. 1903-2011,” IEEE, Piscataway, NJ, Oct. 7, 2011; 147 pages.
Author Unknown, “ISO/IEC JTC 1/SC 29, Information Technology—Dynamic Adaptive Streaming over HTTP (DASH)—Part 1: Media Presentation Description and Segment Formats,” International Standard ©ISO/IEC 2012—All Rights Reserved; Jan. 5, 2012; 131 pages.
Author Unknown, “M-PEG 2 Transmission,” ©Dr. Gorry Fairhurst, 9 pages [Published on or about Jan. 12, 2012] http://www.erg.abdn.ac.uk/future-net/digital-video/mpeg2-trans.html.
Author Unknown, “MPEG Transport Stream,” from Wikipedia, the free encyclopedia, Nov. 11, 2012; 7 pages, http://en.wikipedia.org/w/index.php?title=MPEG_transport_streann&oldid=522468296.
Author Unknown, “Network Functions Virtualisation (NFV); Use Cases,” ETSI, GS NFV 001 v1.1.1, Architectural Framework, © European Telecommunications Standards Institute, Oct. 2013, 50 pages.
Author Unknown, “OpenNebula 4.6 User Guide,” Jun. 12, 2014, opennebula.org, 87 pages.
Author Unknown, “Understanding Azure, A Guide for Developers,” Microsoft Corporation, Copyright © 2016 Microsoft Corporation, 39 pages.
Author Unknown, “3GPP TR 23.803 V7.0.0 (Sep. 2005) Technical Specification: Group Services and System Aspects; Evolution of Policy Control and Charging (Release 7),” 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Val bonne—France, Sep. 2005; 30 pages.
Author Unknown, “3GPP TS 23.203 V8.9.0 (Mar. 2010) Technical Specification: Group Services and System Aspects; Policy and Charging Control Architecture (Release 8),” 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Val bonne—France, Mar. 2010; 116 pages.
Author Unknown, “3GPP TS 23.401 V13.5.0 (Dec. 2015) Technical Specification: 3rd Generation Partnership Project; Technical Specification Group Services and System Aspects; General Packet Radio Service (GPRS) enhancements for Evolved Universal Terrestrial Radio Access Network (E-UTRAN) access (Release 13),” 3GPP, 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Dec. 2015, 337 pages.
Author Unknown, “3GPP TS 23.401 V9.5.0 (Jun. 2010) Technical Specification: Group Services and Systems Aspects; General Packet Radio Service (GPRS) Enhancements for Evolved Universal Terrestrial Radio Access Network (E-UTRAN) Access (Release 9),” 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Jun. 2010; 259 pages.
Author Unknown, “3GPP TS 29.212 V13.1.0 (Mar. 2015) Technical Specification: 3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Policy and Charging Control (PCC); Reference points (Release 13),” 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Mar. 2015; 230 pages.
Author Unknown, “Service-Aware Network Architecture Based on SDN, NFV, and Network Intelligence,” 2014, 8 pages.
Baird, Andrew, et al. “AWS Serverless Multi-Tier Architectures; Using Amazon API Gateway and AWS Lambda,” Amazon Web Services Inc., Nov. 2015, 20 pages.
Bi, Jing, et al., “Dynamic Provisioning Modeling for Virtualized Multi-tier Applications in Cloud Data Center,” 2010 IEEE 3rd International Conference on Cloud Computing, Jul. 5, 2010, pp. 370-377, IEEE Computer Society.
Bitar, N., et al., “Interface to the Routing System (I2RS) for the Service Chaining: Use Cases and Requirements,” draft-bitar-i2rs-service-chaining-01, Feb. 14, 2014, pp. 1-15.
Boucadair, Mohamed, et al., “Differentiated Service Function Chaining Framework,” Network Working Group Internet Draft draft-boucadair-network-function-chaining-03, Aug. 21, 2013, 21 pages.
Bremler-Barr, Anat, et al., “Deep Packet Inspection as a Service,” CoNEXT '14, Dec. 2-5, 2014, pp. 271-282.
Cisco Systems, Inc. “Cisco NSH Service Chaining Configuration Guide,” Jul. 28, 2017, 11 pages.
Cisco Systems, Inc. “Cisco VN-LINK: Virtualization-Aware Networking,” 2009, 9 pages.
Dunbar, et al., “Architecture for Chaining Legacy Layer 4-7 Service Functions,” IETF Network Working Group Internet Draft, draft-dunbar-sfc-legacy-14-17-chain-architecture-03.txt, Feb. 10, 2014; 17 pages.
Ersue, Mehmet, “ETSI NFV Management and Orchestration—An Overview,” Presentation at the IETF# 88 Meeting, Nov. 3, 2013, 14 pages.
Farrel, A., et al., “A Path Computation Element (PCE)—Based Architecture,” RFC 4655, Network Working Group, Aug. 2006, 40 pages.
Fayaz, Seyed K., et al., “Efficient Network Reachability Analysis using a Succinct Control Plane Representation,” 2016, ratul.org, pp. 1-16
Halpern, Joel, et al., “Service Function Chaining (SFC) Architecture,” Internet Engineering Task Force (IETF), Cisco, Oct. 2015, 32 pages.
Hendrickson, Scott, et al. “Serverless Computation with OpenLambda,” Elastic 60, University of Wisconson, Madison, Jun. 20, 2016, 7 pages, https://www.usenix.org/system/files/conference/hotcloud16/hotcloud16_hendrickson.pdf.
Jiang, Y., et al., “An Architecture of Service Function Chaining,” IETF Network Working Group Internet Draft, draft-jiang-sfc-arch-01.txt, Feb. 14, 2014; 12 pages.
Jiang, Yuanlong, et al., “Fault Management in Service Function Chaining,” Network Working Group, China Telecom, Oct. 16, 2015, 13 pages.
Kumar, Surendra, et al., “Service Function Path Optimization: draft-kumar-sfc-sfp-optimization-00.txt,” Internet Engineering Task Force, IETF; Standard Working Draft, May 10, 2014, 14 pages.
Kumbhare, Abhijit, et al., “Opendaylight Service Function Chaining Use-Cases,” Oct. 14, 2014, 25 pages.
Li, Hongyu, “Service Function Chaining Use Cases”, IETF 88 Vancouver, Nov. 7, 2013, 7 pages.
Mortensen, A., et al., “Distributed Denial of Service (DDoS) Open Threat Signaling Requirements,” DOTS, Mar. 18, 2016, 16 pages; https://tools.ietf.org/pdf/draft-ietf-dots-requirements-01.pdf.
Newman, David, “Review: FireEye fights off multi-stage malware,” Network World, May 5, 2014, 7 pages.
Nguyen, Kim-Khoa, et al. “Distributed Control Plane Architecture of Next Generation IP Routers,” IEEE, 2009, 8 pages.
Penno, Reinaldo, et al. “Packet Generation in Service Function Chains,” draft-penno-sfc-packet-03, Apr. 29, 2016, 25 pages.
Penno, Reinaldo, et al. “Services Function Chaining Traceroute,” draft-penno-sfc-trace-03, Sep. 30, 2015, 9 pages.
Pierre-Louis, Marc-Arhtur, “OpenWhisk: A quick tech preview,” DeveloperWorks Open, IBM, Feb. 22, 2016, modified Mar. 3, 2016, 7 pages; https://developer.ibm.com/open/2016/02122/openwhisk-a-quick-tech-preview/.
Pujol, Pua Capdevila, “Deployment of NFV and SFC scenarios,” EETAC, Master Thesis, Advisor: David Rincon Rivera, Universitat Politecnica De Catalunya, Feb. 17, 2017, 115 pages.
Quinn, P., et al., “Network Service Header,” Network Working Group, Mar. 24, 2015, 42 pages; https://tools.ietf.org/pdf/draft-ietf-sfc-nsh-00.pdf.
Quinn, P., et al., “Network Service Chaining Problem Statement,” draft-quinn-nsc-problem-statement-03.txt, Aug. 26, 2013, 18 pages.
Quinn, Paul, et al., “Network Service Header,” Network Working Group, draft-quinn-sfc-nsh-02.txt, Feb. 14, 2014, 21 pages.
Quinn, Paul, et al., “Network Service Header,” Network Working Group, draft-quinn-nsh-00.txt, Jun. 13, 2013, 20 pages.
Quinn, Paul, et al., “Network Service Header,” Network Working Group Internet Draft draft-quinn-nsh-01, Jul. 12, 2013, 20 pages.
Quinn, Paul, et al., “Service Function Chaining (SFC) Architecture,” Network Working Group Internet Draft draft-quinn-sfc-arch-05.txt, May 5, 2014, 31 pages.
Quinn, Paul, et al., “Service Function Chaining: Creating a Service Plane via Network Service Headers,” IEEE Computer Society, 2014, pp. 38-44.
Wong, Fei, et al., “SMPTE-TT Embedded in ID3 for HTTP Live Streaming, draft-smpte-id3-http-live-streaming-00,” Informational Internet Draft, Jun. 2012, 7 pages http://tools.ietf.org/htnnl.draft-snnpte-ide-http-live-streaming-00.
Yadav, Rishi, “What Real Cloud-Native Apps Will Look Like,” Crunch Network, posted Aug. 3, 2016, 8 pages; https://techcrunch.com/2016/08/03/what-real-cloud-native-apps-will-look-like/.
Zhang, Ying, et al. “StEERING: A Software-Defined Networking for Inline Service Chaining,” IEEE, 2013, IEEE, p. 10 pages.
Related Publications (1)
Number Date Country
20200287792 A1 Sep 2020 US
Continuations (1)
Number Date Country
Parent 15656607 Jul 2017 US
Child 16883170 US