Network traffic optimization using in-situ notification system

Information

  • Patent Grant
  • 10819571
  • Patent Number
    10,819,571
  • Date Filed
    Friday, June 29, 2018
    6 years ago
  • Date Issued
    Tuesday, October 27, 2020
    4 years ago
Abstract
Aspects of the disclosed technology address the problems of manually identifying and optimizing service function chaining (SFC) performance in response to changes in traffic profiles. In one aspect of the present disclosure, a method includes monitoring, by a first network component, incoming data packets; detecting, by the first network component, a change in a traffic profile of the incoming data packets; generating, by the first network component, in-band information on changes in the traffic profile; and transmitting, by the first network component, the in-band information with one or more data packets of the incoming data packets, the in-band information being used by a second network component to adjust one or more corresponding settings for servicing the incoming data packets.
Description
BACKGROUND
1. Technical Field

The subject technology relates to network traffic optimization and in particular, to methods for providing an advance notice of changes in incoming traffic profiles to network devices, which enables the network devices to dynamically modify various settings for servicing incoming packets.


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 general purpose-built hardware. Furthermore, NFV and SDN can provide micro services architecture, where it is common to see different services of an application distributed and serviced by different containers. For example, in service chaining environment, it is common to see different service functions instantiated as different containers over one or more physical hosts.


Services chains with container components provide flexibility. The individual containers and their parameters can be tuned and optimized. Sometimes traffic patterns change too rapidly for an entire new service chain to be spun up with components tweaked for that new traffic pattern. This is important for traffic patterns that require very low latency, such as high frequency trading. In such use cases, by the time the system has rebuilt a new optimized chain for the incoming traffic pattern, some packets have been dropped and the traffic pattern may have changed.





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, according to one or more example embodiments;



FIG. 2 conceptually illustrates a service chain, according to one or more example embodiments;



FIGS. 3A-D provide visual illustrations of example steps of an in-band notification process, according to one or more example embodiments;



FIG. 4 is an example iOAM information that may be included in a packet for transmission to a network device, according to one or more example embodiments;



FIG. 5 illustrates an example method of in-band notification process, according to one or more example embodiments; and



FIG. 6 illustrates an example network device, according to one or more example embodiments.





DETAILED DESCRIPTION

Various embodiments of the disclosure are discussed in detail below. While specific implementations are discussed, it should be understood that this is done for illustration purposes only. A person skilled in the relevant art will recognize that other components and configurations may be used without parting from the spirit and scope of the disclosure. Thus, the following description and drawings are illustrative and are not to be construed as limiting. Numerous specific details are described to provide a thorough understanding of the disclosure. However, in certain instances, well-known or conventional details are not described in order to avoid obscuring the description. References to one or an embodiment in the present disclosure can be references to the same embodiment or any embodiment; and, such references mean at least one of the embodiments.


Reference to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the disclosure. The appearances of the phrase “in one embodiment” in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Moreover, various features are described which may be exhibited by some embodiments and not by others.


The terms used in this specification generally have their ordinary meanings in the art, within the context of the disclosure, and in the specific context where each term is used. Alternative language and synonyms may be used for any one or more of the terms discussed herein, and no special significance should be placed upon whether or not a term is elaborated or discussed herein. In some cases, synonyms for certain terms are provided. A recital of one or more synonyms does not exclude the use of other synonyms. The use of examples anywhere in this specification including examples of any terms discussed herein is illustrative only, and is not intended to further limit the scope and meaning of the disclosure or of any example term. Likewise, the disclosure is not limited to various embodiments given in this specification.


Without intent to limit the scope of the disclosure, examples of instruments, apparatus, methods and their related results according to the embodiments of the present disclosure are given below. Note that titles or subtitles may be used in the examples for convenience of a reader, which in no way should limit the scope of the disclosure. Unless otherwise defined, technical and scientific terms used herein have the meaning as commonly understood by one of ordinary skill in the art to which this disclosure pertains. In the case of conflict, the present document, including definitions will control.


Additional features and advantages of the disclosure will be set forth in the description which follows, and in part will be obvious from the description, or can be learned by practice of the herein disclosed principles. The features and advantages of the disclosure can be realized and obtained by means of the instruments and combinations particularly pointed out in the appended claims. These and other features of the disclosure will become more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.


As referenced herein, a Function Router can include a service that provides for registration and management of execution endpoints, FaaS services, functions, clients, locations, and routing rules on an account. The Function Router can receive requests for function execution from clients and dynamically route them to the ‘best’ endpoint to execute that function based on defined rules.


An Execution Endpoint (EE) can include a compute-capable system that can run functions. Non-limiting examples can include computers, laptops, IoT devices, servers, switches, mobile phones, kiosks, workstations, etc. EEs can be registered in the Function Router for use in executing functions. Execution endpoints can run various FaaS runtime environments and services.


A client can include a device and/or application seeking to execute a function on an Execution Endpoint. Non-limiting examples of a client can include a robot arm, mobile phone, hand scanner, application, printer, kiosk, etc.


A function can include a piece of code. The piece of code can represent, for example, an ephemeral, self-contained set of business logic. Serverless functions can be compared to stored procedures in that they do a specific thing, and are called and executed when needed, only to go back to being dormant (but ready) when execution completes.


A location can include a physical location (e.g., a building, a floor, etc.) and/or a logical location. A location can be associated with specific latitude and longitude coordinates. For example, a location can refer to specific latitude and longitude coordinates corresponding to the manufacturing floor where a robot resides or a conference room where an FaaS device is plugged in, or a region associated with an environment.


Function routing rules can include policies and controls around who, what, when, where, why, and/or how for function execution. The rules can include IT-defined guardrails that affect the entire system, and other rules specified by IT or a development team for a specific function. Example rules can include: Function A can run on any endpoint but Function B must only run on a private endpoint; or Function A can be called by any client in a specific location, but function B can only be called by specific clients in any location.


Overview


Example embodiments described herein are directed to management of changes in traffic patterns in networks by providing an advance notice of incoming traffic flow changes to network devices, which enables the network devices to dynamically modify various service chain parameters to determine optimal service chain configuration settings for servicing the incoming traffic.


In one aspect of the present disclosure, a method includes monitoring, by a first network component, incoming data packets; detecting, by the first network component, a change in a traffic profile of the incoming data packets; generating, by the first network component, in-band information on changes in the traffic profile; and transmitting, by the first network component, the in-band information with one or more data packets of the incoming data packets, the in-band information being used by a second network component to adjust one or more corresponding settings for servicing the incoming data packets.


In one aspect of the present disclosure, a device includes memory having computer-readable instructions and one or more processors configured to execute the computer-readable instructions to monitor incoming data packets; detect a change in a traffic profile of the incoming data packets; generate in-band information on changes in the traffic profile; and transmit the in-band information with one or more data packets of the incoming data packets, the in-band information being used by a network component to adjust one or more corresponding settings for servicing the incoming data packets.


In one aspect of the present disclosure, one or more non-transitory computer-readable medium having computer-readable instructions stored therein, which when executed by one or more processors, cause the one or more processors to function as a network device to monitor incoming data packets; detect a change in a traffic profile of the incoming data packets; generate in-band information on changes in the traffic profile; and transmit the in-band information with one or more data packets of the incoming data packets, the in-band information being used by another network device to adjust one or more corresponding settings for servicing the incoming data packets.


DETAILED DESCRIPTION

Aspects of the disclosed technology address the problems of manually identifying and optimizing service function chaining (SFC) performance in response to changes in traffic profiles. In one aspect, an in-band messaging scheme is provided whereby, a network component (e.g., an ingress container in a service chain), notifies other network components (other containers in a service chain, which may be upstream or downstream relative to the ingress container) of changes in incoming data traffic profile so that the other network components can dynamically and proactively adjust their parameters for servicing the incoming data packets in anticipation of the incoming traffic.


As used herein, a service chain “device” can include physical and/or virtual devices and/or components. 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.


The disclosure begins with a brief description of an example system in which inventive concepts described herein may be implemented.



FIG. 1 illustrates an example network environment, according to one or more example embodiments. Example network environment 100 includes 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 FIG. 2, 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. 2 conceptually illustrates a service chain, according to one or more example embodiments. In particular, FIG. 2 depicts a service chain (“SC”) 201.


In operation, SC 201 represents a functional service chain, for example, that is implemented in a virtual network environment, such as a network data center (DC). SC 201 may be configured to provide and/or receive traffic from a connected host 200. Host 200 can be any type of known or to be developed host that is being serviced by SC 201 including, but not limited to, electronic devices of individual end users, enterprise servers, etc. Flows (data packets) traversing SC 201 are provided sequentially to each device or service in the chain. As illustrated in the example, traffic flows traversing SC 201 may flow through a router (e.g., QoS Router 202), an inline intrusion protection system (IPS) 204, a load balancer 206, and a server (e.g., HTTP Server 208). Each of the devices or services 202, 204, 206, and 208 is communicatively coupled via virtual switch 210, for example that is implemented using an Open vSwitch with the Data Plane Development Kit (OVS-DPDK).


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.


Having described an example network environment 100 and an example SC 201, the disclosure now turns to description of examples for in-band notification systems that provide advance notice(s) to other devices in a network (e.g., downstream or upstream devices in a network or a service chain) of upcoming changes in traffic profiles such that the other devices can immediately gain foreknowledge, and change their configurations to better deal with the higher rate of incoming data packets. The scheme allows one or more devices to take advantage of traffic flow detection capabilities of other network devices, and take actions to optimize their handling of the incoming data packets. Furthermore, such in-band notification system is intrinsically faster and more efficient than any out-of-band notification system, which makes the systems presented in this application ideal for quickly adjusting to traffic changes on established flows.



FIGS. 3A-D provide visual illustrations of example steps of an in-band notification process, according to one or more example embodiments. In FIGS. 3A-D, the connected host 200 of FIG. 2 is replaced with external network 300. External network 300 may be any known or to be developed network through which various types of hosts or other network components may send data to SC 201. This data may be referred to as incoming data traffic.


In FIG. 3A, devices 202, 204, 206, 208 and 210 are all the same as those described above with reference to FIG. 2. Device 202 in the example configuration of FIGS. 3A-D may be referred to as the ingress component because it is the first component on container in SC 201 at which data packets of the incoming data traffic packets arrive.



FIG. 3A also provides one example traffic handling parameter or setting for each of the devices 202, 204, 206 and 208 that indicates how each device treats an incoming packet. For example, QoS Router has 150 interface buffers. IPS 204 has a setting according to which its regex search depth per packet is set to 300 byes. Load balancer 206 has a CHASH (and/or any other generic HASH) lookup table that may have 30 entries. Furthermore, HTTP server 208 applies compression scheme GZIP to incoming data packets. The above are example settings with which one or more devices of SC 201 are configured. However, inventive concepts are not limited thereto and there may be more or less settings with which each device of SC 201 may be configured.



FIG. 3A illustrates a “steady state” of SC 201 in which the rate of packet flow is steady across SC 201. This is indicated by packets 302 flowing from one device to another across SC 201, where each device treats/processes a packet 302 upon arrival according to configured setting thereof.



FIG. 3B illustrates an example of SC 201 where a change in traffic profile is detected and a new flood of data packets (traffic flow 304) enter SC 201 to be processed. Traffic flow 304 may also be referred to new traffic profile 304 and/or new traffic pattern 304. This change in traffic profile or pattern may be due to various reasons including, but not limited to, a particular type of application being serviced by SC 201, spike in user inquiries and requests, etc. This change in traffic profile is first detected at ingress device 202 (QoS router in this example) and an in-band operations, administration and maintenance (iOAM) information is attached to one or more data packets of the traffic flow 304 such as packet 306 shown in FIG. 3C. This packet 306 may then be sent to one or more of downstream devices 204, 206 and/or 208.


In one example, information provided as part of iOAM information in packet 306 include, but are not limited to, average packet size and rate of the new detected traffic profile, an intra-packet gap of the new traffic profile (observed most recently), statistics about communication protocols of data included in the new detected traffic profile, sources and end points of data packets, etc.



FIG. 4 is an example iOAM information that may be included in a packet for transmission to a network device, according to one or more example embodiments. As can be seen from FIG. 4, this example iOAM information includes a stream information portion 400, a rate information portion 402 and a duration information portion 404.


Stream information portion 400 includes characteristics of the data stream that are used to identify the traffic flow 304. In the examples of FIGS. 3A-D and 4, the incoming stream may be coming from one host (e.g., source_ipv4 address shown in FIG. 4) via external network 300 to be transmitted to two destinations (e.g., two desitnation_ipv4 addresses shown in FIG. 4). The protocol is TCP(6) and the destination appears to be a combination of port 80 and 8443. In this example, the source port remains empty, which is indicative of a varied source in this example traffic.


Rate information portion 402 includes the current detected rate of the traffic both in packets per second and bytes per second. In this example, iOAM information also includes trends of packets per second and bytes per second rates. For example, the trend_pps is 17.4, which indicates that the packets per second has spiked to 1740% relative to a prior rate. This can constitute an indication of an attack and thus a change in traffic profile. Furthermore, the trend_bps is 1.02, which is indicative of the overall increase in bytes per second of only 102% relative to a prior rate. Considering trend_bps and/or trend_pps together, QoS router 202 can detect a sharp spike of small packet (e.g., a DoS attack), indicating a change in incoming traffic profile.


Duration information 404 may include details about how long traffic flow 304 has persisted, the total bytes and total packet counts seen by QoS router 202.


The above provides various examples of data that may be conveyed to other network devices of SC 201 via iOAM information included in a data packet of a series of data packets that constitute traffic flow 304. However, inventive concepts are not limited thereto and other types of known or to be developed data may also be included.


Upon receiving an iOAM as part of a received data packet such as data packet 306, a downstream network device such as IPS 204 may dynamically reconfigure its traffic handling setting(s) to accommodate the higher rate of influx of data packets. In describing FIG. 3A, it was mentioned that an example setting of IPS 204 may be the regex search depth per packet expressed in bytes (e.g., 300 bytes). In one example and as a result of receiving the iOAM as part of data packet 306, IPS 204 may reconfigure its example regex search depth to 100 bytes instead of 300 bytes to accommodate the higher rate of incoming data packets. This change is illustrated in FIG. 3D. Furthermore, FIG. 3D also illustrates an example where virtual switch 210 has swapped from OVS-DPDK to Vector Packet Processing (VPP) for handling data packets of the changed traffic profile because VPP may scale better for this particular traffic profile vs the other vSwitch types. For example, switching to VPP may decrease latency between devices of SC 201.


In another example, knowing the type of traffic profile and rate of traffic coming based on received iOAM information, load balancer 206 may be able to optimize its load-balancing algorithm to distribute the load more evenly to endpoint servers. Alternatively, load balancer 206 could signal to spin up additional endpoint servers to handle the traffic load.


In another example, an application may receive a request tagged with iOAM data indicating an incoming flood of data packets at higher rate. The application, which may be utilizing SC 201, can proactively start horizontally scaling its containers to a level that can appropriately handle the expected load increase without waiting for impact of the incoming flood of data packets to actually on data traffic handling of containers of SC 201.


In another example, SC 201 may have two IPS containers (e.g., an upstream IPC 204 and another downstream IPS (relative to IPS 204)). Upon receiving iOAM information as part of data packet 306, upstream IPS 204 can analyze the first few packets of the flow and determine that the flow 304 is safe and secure and mark the relevant data packets as so using iOAM data. Then, the downstream IPS would then detect that meta-data tagged on the flow 304 and bypass its own inspection of the traffic, since it has already been deemed safe by a trusted device (e.g., IPS 204) in the SC 201. In another example, the two IPS may not necessary be part of the same service chain but may each be part of a different service chain communicating with one another.



FIG. 5 illustrates an example method of in-band notification process, according to one or more example embodiments. FIG. 5 will be described from a perspective of a service chain and various devices thereof such as SC 201 and or one or more devices 202, 204, 206 and 208. However, it will be understood that there may be one or more processors executing computer-readable instructions to implement the functionalities of SC 201 and/or any one or more of its components.


At S500, an ingress device (component) of SC 201 (e.g., QoS router 202) monitors incoming traffic. At S502, the ingress device of SC 201 determines various statistics of the incoming traffic including, but not limited to, rate of packet arrival in packets per second, bytes per second, etc., as described above. In one example, the ingress device may perform S500 and S502 continuously.


At S504, the ingress device of SC 201 determines if the rate is equal to or greater than a threshold. The threshold may be a configurable parameter that can be determined based on experiments and/or empirical studies. For example, the threshold may be set to 100 packets per second, 1000 bytes per second, etc.


In one example, the ingress device of SC 201 may compare a single statistics (e.g., rate of packet arrival expressed in packets per second or bytes per second) to a single corresponding threshold. In another example, the ingress device of SC 201 may compare multiple statistics to multiple thresholds (e.g., rates and packet sizes) to multiple thresholds and then make the determination of S504 based on a weighted combination of all compared statistics to their corresponding thresholds.


If at S504, the ingress device of SC 201 determines the rate to be less than the threshold (this can be indicative of normal traffic flow and no significant change in the incoming traffic's profile), then the process reverts back to S500 and S500 to S504 are repeated.


However, if at S504, the ingress device of SC 201 determines the rate to be equal to or greater than the threshold (this can be indicative of a significant change in the incoming traffic's profile), then at S506, the ingress device of SC 201 generates iOAM information that describe the changed traffic pattern and is indicative of the higher rate of incoming data packets. This iOAM information can be as described above and can be embedded in one or more data packets of the incoming traffic flow.


At S508, the ingress device of SC 201 embeds the iOAM information into one or more of data packets constituting the incoming traffic flow (e.g., traffic flow 304). The one or more data packets may be randomly selected for iOAM information to be embedded therein. Alternatively, the ingress device of SC 201 creates one or more new data packet that includes the iOAM information. Packets (new or existing) that include the iOAM information may be referred to as the embedded data packet(s). An example of such packet is packet 306 described above with reference to FIG. 3C.


In one example, the embedding process of S508 may include tagging the underlying data packets with iOAM header to include the iOAM information.


Including this data in-situ provides an advantage over conventional out-of-band early warning systems because of its efficiency and relatively low complexity. Although the traffic path may initially be constrained by definition, the example JSON data above prepended in its raw form only adds ˜400 bytes to a stream that may already be in excess of, for example, 7 Giga Bytes. This could further be reduced to ˜230 bytes using GZIP compression provided by HTTP server 208 for example. Additionally, it requires no out-of-band signaling, which on its own would require a wholly supplemental network path, addressing, etc.


At S510, the ingress device of SC 201 sends (transmits) the embedded data packet(s) such as data packet 306 of FIG. 3C to other network device of SC 201 such as IPS 204, load balancer 206, HTTP server 208, etc., which may be referred to as the receiving device(s).


At S512 and upon receipt of the embedded data packet(s), the receiving device such as IPS 204 adjusts (reconfigures) its traffic setting parameter(s) to handle the higher rate of incoming packets.


In-situ notification system described herein differs from traditional auto-scaling schemes, which opt for constantly monitoring things like resource utilization or externally provided metrics and performing its scaling as a reaction to signs of in-progress system stress (e.g., higher rate of incoming data packets). The in-situ notification system described herein, enables network components to automatically scale in anticipation of the stress, rather than as a consequence of it, and does not require the extra overhead of continually polling an application programming interface to do so. Instead the signal to scale is already included ahead of the inbound traffic stream, in a place the system is already normally processing.


In example embodiments described above, reference is made to SC 201 which is a service chain with container components as an example of NFV. However, inventive concepts are not limited to NFV and virtual network components. For example, inventive concepts are equally applicable to physical nodes and components of a network, where one physical node may function as an ingress node for detecting a change in a traffic profile and subsequently notify downstream network components (and/or upstream network components) of the detected changes in traffic profiles so that the other network components can pro-actively adjust their traffic settings for handling the higher rate of incoming data packets.


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. 6 illustrates an example network device, according to one or more example embodiments. The more appropriate embodiment will be apparent to those of ordinary skill in the art when practicing the present technology. Persons of ordinary skill in the art will also readily appreciate that other system embodiments are possible



FIG. 6 illustrates system bus computing system architecture 600 wherein the components of the system are in electrical communication with each other using a connection 606. Exemplary system 600 includes a processing unit (CPU or processor) 604 and a system connection 606 that couples various system components including the system memory 620, such as read only memory (ROM) 618 and random access memory (RAM) 616, to the processor 604. The system 600 can include a cache of high-speed memory connected directly with, in close proximity to, or integrated as part of the processor 604. The system 600 can copy data from the memory 620 and/or the storage device 608 to the cache 602 for quick access by the processor 604. In this way, the cache can provide a performance boost that avoids processor 604 delays while waiting for data. These and other modules can control or be configured to control the processor 604 to perform various actions. Other system memory 620 may be available for use as well. The memory 620 can include multiple different types of memory with different performance characteristics. The processor 604 can include any general purpose processor and a service component, such as service 1610, service 2612, and service 3614 stored in storage device 608, configured to control the processor 604 as well as a special-purpose processor where software instructions are incorporated into the actual processor design. The processor 604 may essentially be a completely self-contained computing system, containing multiple cores or processors, a bus, memory controller, cache, etc. A multi-core processor may be symmetric or asymmetric.


To enable user interaction with the computing device 600, an input device 622 can represent any number of input mechanisms, such as a microphone for speech, a touch-sensitive screen for gesture or graphical input, keyboard, mouse, motion input, speech and so forth. An output device 624 can also be one or more of a number of output mechanisms known to those of skill in the art. In some instances, multimodal systems can enable a user to provide multiple types of input to communicate with the computing device 600. The communications interface 626 can generally govern and manage the user input and system output. There is no restriction on operating on any particular hardware arrangement and therefore the basic features here may easily be substituted for improved hardware or firmware arrangements as they are developed.


Storage device 608 is a non-volatile memory and can be a hard disk or other types of computer readable media which can store data that are accessible by a computer, such as magnetic cassettes, flash memory cards, solid state memory devices, digital versatile disks, cartridges, random access memories (RAMs) 616, read only memory (ROM) 618, and hybrids thereof.


The system 600 can include an integrated circuit 628, such as an application-specific integrated circuit (ASIC) configured to perform various operations. The integrated circuit 628 can be coupled with the connection 606 in order to communicate with other components in the system 600.


The storage device 608 can include software services 610, 612, 614 for controlling the processor 604. Other hardware or software modules are contemplated. The storage device 608 can be connected to the system connection 606. In one aspect, a hardware module that performs a particular function can include the software component stored in a computer-readable medium in connection with the necessary hardware components, such as the processor 604, connection 606, output device 624, and so forth, to carry out the function.


For clarity of explanation, in some instances the present technology may be presented as including individual functional blocks including functional blocks comprising devices, device components, steps or routines in a method embodied in software, or combinations of hardware and software.


In some example embodiments the computer-readable storage devices, mediums, and memories can include a cable or wireless signal containing a bit stream and the like. However, when mentioned, non-transitory computer-readable storage media expressly exclude media such as energy, carrier signals, electromagnetic waves, and signals per se.


Methods according to the above-described examples can be implemented using computer-executable instructions that are stored or otherwise available from computer readable media. Such instructions can comprise, for example, instructions and data which cause or otherwise configure a general purpose computer, special purpose computer, or special purpose processing device to perform a certain function or group of functions. Portions of computer resources used can be accessible over a network. The computer executable instructions may be, for example, binaries, intermediate format instructions such as assembly language, firmware, or source code. Examples of computer-readable media that may be used to store instructions, information used, and/or information created during methods according to described examples include magnetic or optical disks, flash memory, USB devices provided with non-volatile memory, networked storage devices, and so on.


Devices implementing methods according to these disclosures can comprise hardware, firmware and/or software, and can take any of a variety of form factors. Typical examples of such form factors include laptops, smart phones, small form factor personal computers, personal digital assistants, rackmount devices, standalone devices, and so on. Functionality described herein also can be embodied in peripherals or add-in cards. Such functionality can also be implemented on a circuit board among different chips or different processes executing in a single device, by way of further example.


The instructions, media for conveying such instructions, computing resources for executing them, and other structures for supporting such computing resources are means for providing the functions described in these disclosures.


Although a variety of examples and other information was used to explain aspects within the scope of the appended claims, no limitation of the claims should be implied based on particular features or arrangements in such examples, as one of ordinary skill would be able to use these examples to derive a wide variety of implementations. Further and although some subject matter may have been described in language specific to examples of structural features and/or method steps, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to these described features or acts. For example, such functionality can be distributed differently or performed in components other than those identified herein. Rather, the described features and steps are disclosed as examples of components of systems and methods within the scope of the appended claims.


Claim language reciting “at least one of” a set indicates that one member of the set or multiple members of the set satisfy the claim. For example, claim language reciting “at least one of A and B” means A, B, or A and B.


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 method comprising: servicing, by a first network component, incoming data packets utilizing a first packet processing framework;detecting, by the first network component, a change in a traffic profile of the incoming data packets;generating, by the first network component, in-band information on changes in the traffic profile;embedding, by the first network component, the in-band information within one or more first data packets of the incoming data packets;servicing, by a second network component, the one or more first data packets, including the in-band information, utilizing the first packet processing framework; andservicing, by the second network component, one or more second data packets of the incoming data packets utilizing a second packet processing framework based on the in-band information.
  • 2. The method of claim 1, wherein the first network component and the second network component are containers of a service chain configured to service the incoming data packets.
  • 3. The method of claim 1, wherein detecting the change in the traffic profile comprises: determining a characteristic of the incoming data packets;comparing the characteristic to a threshold; anddetecting the change in the traffic profile if the characteristic is equal to or greater than the threshold.
  • 4. The method of claim 3, wherein the characteristic includes a rate of incoming data packets expressed in packets per second or bytes per second.
  • 5. The method of claim 1, further comprising: tagging the one or more first data packets of the incoming data packets with an in-band operation, administration and maintenance (iOAM) header that includes the in-band information.
  • 6. The method of claim 1, wherein the one or more first data packets in which the in-band information are embedded comprise randomly selected packets of the incoming data packets.
  • 7. The method of claim 1, wherein the first network component and the second network component are nodes in a chain of network components servicing the incoming data packets and the second network component is a next destination of the incoming data packets after the first network component.
  • 8. A device comprising: memory having computer-readable instructions stored therein; andone or more processors configured to execute the computer-readable instructions to: service incoming data packets utilizing a first packet processing framework;detect a change in a traffic profile of the incoming data packets;generate in-band information on changes in the traffic profile;embed the in-band information within one or more first data packets of the incoming data packets;service, by a network component, the one or more first data packets, including the in-band information, utilizing the first packet processing framework; andservice, by the network component, one or more second data packets of the incoming data packets utilizing a second packet processing framework based on the in-band information.
  • 9. The device of claim 8, wherein the device and the network component are containers of a service chain configured to service the incoming data packets.
  • 10. The device of claim 8, wherein the computer-readable instructions to detect the change include instructions to: determine a characteristic of the incoming data packets;compare the characteristic to a threshold; anddetect the change in the traffic profile if the characteristic is equal to or greater than the threshold.
  • 11. The device of claim 10, wherein the characteristic includes a rate of incoming data packets expressed in packets per second or bytes per second.
  • 12. The device of claim 8, wherein the computer-readable instructions to detect the change include instructions to: tag the one or more first data packets of the incoming data packets with an in-band operation, administration and maintenance (iOAM) header that includes the in-band information.
  • 13. The device of claim 8, wherein the one or more first data packets in which the in-band information are embedded comprise randomly selected packets of the incoming data packets.
  • 14. The device of claim 8, wherein the device and the network component are nodes in a chain of network components servicing the incoming data packets and are at least one of a virtual component or a physical component.
  • 15. One or more non-transitory computer-readable medium having computer-readable instructions stored therein, which when executed by one or more processors, cause the one or more processors to function as a network device to: service incoming data packets utilizing a first packet processing framework;detect a change in a traffic profile of the incoming data packets;generate in-band information on changes in the traffic profile;embed the in-band information within one or more first data packets of the incoming data packets;service, by another network device, the one or more first data packets, including the in-band information, utilizing the first packet processing framework; andservice, by the other network device, one or more second data packets of the incoming data packets utilizing a second packet processing framework based on the in-band information.
  • 16. The one or more non-transitory computer-readable medium of claim 15, wherein the network device and the other network device are containers of a service chain configured to service the incoming data packets.
  • 17. The one or more non-transitory computer-readable medium of claim 15, wherein the computer-readable instructions to detect the change include instructions to: determine a characteristic of the incoming data packets;compare the characteristic to a threshold; anddetect the change in the traffic profile if the characteristic is equal to or greater than the threshold.
  • 18. The one or more non-transitory computer-readable medium of claim 17, wherein the characteristic include a rate of incoming data packets expressed in packets per second or bytes per second.
  • 19. The one or more non-transitory computer-readable medium of claim 15, wherein the computer-readable instructions to detect the change include instructions to: tag the one or more first data packets of the incoming data packets with an in-band operation, administration and maintenance (iOAM) header that includes the in-band information.
  • 20. The one or more non-transitory computer-readable medium of claim 15, wherein the one or more first data packets in which the in-band information are embedded comprise randomly selected packets of the incoming data packets.
US Referenced Citations (430)
Number Name Date Kind
5812773 Norin Sep 1998 A
5889896 Meshinsky et al. Mar 1999 A
6108782 Fletcher et al. Aug 2000 A
6178453 Mattaway et al. Jan 2001 B1
6298153 Oishi Oct 2001 B1
6343290 Cossins et al. Jan 2002 B1
6643260 Kloth et al. Nov 2003 B1
6683873 Kwok et al. Jan 2004 B1
6721804 Rubin et al. Apr 2004 B1
6733449 Krishnamurthy et al. May 2004 B1
6735631 Oehrke et al. May 2004 B1
6996615 McGuire Feb 2006 B1
7054930 Cheriton May 2006 B1
7058706 Lyer Shankar et al. Jun 2006 B1
7062571 Dale et al. Jun 2006 B1
7111177 Chauvel et al. Sep 2006 B1
7212490 Kao et al. May 2007 B1
7277948 Igarashi et al. Oct 2007 B2
7313667 Pullela et al. Dec 2007 B1
7379846 Williams et al. May 2008 B1
7480672 Hahn et al. Jan 2009 B2
7496043 Leong et al. Feb 2009 B1
7536476 Alleyne May 2009 B1
7567504 Darling et al. Jul 2009 B2
7583665 Duncan et al. Sep 2009 B1
7606147 Luft et al. Oct 2009 B2
7644437 Volpano Jan 2010 B2
7647594 Togawa Jan 2010 B2
7773510 Back et al. Aug 2010 B2
7808897 Mehta et al. Oct 2010 B1
7881957 Cohen et al. Feb 2011 B1
7917647 Cooper et al. Mar 2011 B2
7983170 Jackowski et al. Jul 2011 B2
8010598 Tanimoto Aug 2011 B2
8028071 Mahalingam et al. Sep 2011 B1
8041714 Aymeloglu et al. Oct 2011 B2
8121117 Amdahl et al. Feb 2012 B1
8171415 Appleyard et al. May 2012 B2
8234377 Cohn Jul 2012 B2
8244559 Horvitz et al. Aug 2012 B2
8250215 Stienhans et al. Aug 2012 B2
8280880 Aymeloglu et al. Oct 2012 B1
8284664 Aybay et al. Oct 2012 B1
8301746 Head et al. Oct 2012 B2
8345692 Smith Jan 2013 B2
8406141 Couturier et al. Mar 2013 B1
8407413 Yucel et al. Mar 2013 B1
8448171 Donnellan et al. May 2013 B2
8477610 Zuo et al. Jul 2013 B2
8495356 Ashok et al. Jul 2013 B2
8495725 Ahn Jul 2013 B2
8510469 Portolani Aug 2013 B2
8514868 Hill Aug 2013 B2
8532108 Li et al. Sep 2013 B2
8533687 Greifeneder et al. Sep 2013 B1
8547974 Guruswamy et al. Oct 2013 B1
8560639 Murphy et al. Oct 2013 B2
8560663 Baucke et al. Oct 2013 B2
8589543 Dutta et al. Nov 2013 B2
8590050 Nagpal et al. Nov 2013 B2
8611356 Yu et al. Dec 2013 B2
8612625 Andries et al. Dec 2013 B2
8630291 Shaffer et al. Jan 2014 B2
8639787 Lagergren et al. Jan 2014 B2
8656024 Krishnan et al. Feb 2014 B2
8660129 Brendel et al. Feb 2014 B1
8719804 Jain May 2014 B2
8775576 Hebert et al. Jul 2014 B2
8797867 Chen et al. Aug 2014 B1
8805951 Faibish et al. Aug 2014 B1
8850002 Dickinson et al. Sep 2014 B1
8850182 Fritz et al. Sep 2014 B1
8856339 Mestery et al. Oct 2014 B2
8861396 Schlenk et al. Oct 2014 B2
8909928 Ahmad et al. Dec 2014 B2
8918510 Gmach et al. Dec 2014 B2
8924720 Raghuram et al. Dec 2014 B2
8930747 Levijarvi et al. Jan 2015 B2
8938775 Roth et al. Jan 2015 B1
8959526 Kansal et al. Feb 2015 B2
8977754 Curry, Jr. et al. Mar 2015 B2
9009697 Breiter et al. Apr 2015 B2
9015324 Jackson Apr 2015 B2
9043439 Bicket et al. May 2015 B2
9049115 Rajendran et al. Jun 2015 B2
9063789 Beaty et al. Jun 2015 B2
9065727 Liu et al. Jun 2015 B1
9075649 Bushman et al. Jul 2015 B1
9130846 Szabo et al. Sep 2015 B1
9164795 Vincent Oct 2015 B1
9167050 Durazzo et al. Oct 2015 B2
9201701 Boldyrev et al. Dec 2015 B2
9201704 Chang et al. Dec 2015 B2
9203784 Chang et al. Dec 2015 B2
9223634 Chang et al. Dec 2015 B2
9244776 Koza et al. Jan 2016 B2
9251114 Ancin et al. Feb 2016 B1
9264478 Hon et al. Feb 2016 B2
9294408 Dickinson et al. Mar 2016 B1
9313048 Chang et al. Apr 2016 B2
9361192 Smith et al. Jun 2016 B2
9379982 Krishna et al. Jun 2016 B1
9380075 He et al. Jun 2016 B2
9432245 Sorenson, III et al. Aug 2016 B1
9432294 Sharma et al. Aug 2016 B1
9444744 Sharma et al. Sep 2016 B1
9473365 Melander et al. Oct 2016 B2
9503530 Niedzielski Nov 2016 B1
9558078 Farlee et al. Jan 2017 B2
9571570 Mutnuru Feb 2017 B1
9613078 Vermeulen et al. Apr 2017 B2
9628471 Sundaram et al. Apr 2017 B1
9658876 Chang et al. May 2017 B2
9692802 Bicket et al. Jun 2017 B2
9755858 Bagepalli et al. Sep 2017 B2
20010055303 Horton et al. Dec 2001 A1
20020073337 Ioele et al. Jun 2002 A1
20020143928 Maltz et al. Oct 2002 A1
20020166117 Abrams et al. Nov 2002 A1
20020174216 Shorey et al. Nov 2002 A1
20030018591 Komisky Jan 2003 A1
20030056001 Mate et al. Mar 2003 A1
20030161321 Karam Aug 2003 A1
20030228585 Inoko et al. Dec 2003 A1
20040004941 Malan et al. Jan 2004 A1
20040034702 He Feb 2004 A1
20040088542 Daude et al. May 2004 A1
20040095237 Chen et al. May 2004 A1
20040131059 Ayyakad et al. Jul 2004 A1
20040197079 Latvala et al. Oct 2004 A1
20040264481 Darling et al. Dec 2004 A1
20050060418 Sorokopud Mar 2005 A1
20050125424 Herriott et al. Jun 2005 A1
20060062187 Rune Mar 2006 A1
20060104286 Cheriton May 2006 A1
20060126665 Ward et al. Jun 2006 A1
20060146825 Hofstaedter et al. Jul 2006 A1
20060155875 Cheriton Jul 2006 A1
20060168338 Bruegl et al. Jul 2006 A1
20060233106 Achlioptas et al. Oct 2006 A1
20070174663 Crawford et al. Jul 2007 A1
20070223487 Kajekar et al. Sep 2007 A1
20070242830 Conrado et al. Oct 2007 A1
20080005293 Bhargava et al. Jan 2008 A1
20080080524 Tsushima et al. Apr 2008 A1
20080084880 Dharwadkar Apr 2008 A1
20080165778 Ertemalp Jul 2008 A1
20080198752 Fan et al. Aug 2008 A1
20080198858 Townsley et al. Aug 2008 A1
20080201711 Amir Husain Aug 2008 A1
20080235755 Blaisdell et al. Sep 2008 A1
20090006527 Gingell, Jr. et al. Jan 2009 A1
20090019367 Cavagnari et al. Jan 2009 A1
20090031312 Mausolf et al. Jan 2009 A1
20090083183 Rao et al. Mar 2009 A1
20090138763 Arnold May 2009 A1
20090177775 Radia et al. Jul 2009 A1
20090178058 Stillwell, III et al. Jul 2009 A1
20090182874 Morford et al. Jul 2009 A1
20090265468 Annambhotla et al. Oct 2009 A1
20090265753 Anderson et al. Oct 2009 A1
20090293056 Ferris Nov 2009 A1
20090300608 Ferris et al. Dec 2009 A1
20090313562 Appleyard et al. Dec 2009 A1
20090323706 Germain et al. Dec 2009 A1
20090328031 Pouyadou et al. Dec 2009 A1
20100036903 Ahmad et al. Feb 2010 A1
20100042720 Stienhans et al. Feb 2010 A1
20100061250 Nugent Mar 2010 A1
20100115341 Baker et al. May 2010 A1
20100131765 Bromley et al. May 2010 A1
20100138917 Xia Jun 2010 A1
20100149966 Achlioptas et al. Jun 2010 A1
20100191783 Mason et al. Jul 2010 A1
20100192157 Jackson et al. Jul 2010 A1
20100205601 Abbas et al. Aug 2010 A1
20100211782 Auradkar et al. Aug 2010 A1
20100293270 Augenstein et al. Nov 2010 A1
20100318609 Lahiri et al. Dec 2010 A1
20100325199 Park et al. Dec 2010 A1
20100325441 Laurie et al. Dec 2010 A1
20100333116 Prahlad et al. Dec 2010 A1
20110016214 Jackson Jan 2011 A1
20110035754 Srinivasan Feb 2011 A1
20110055396 Dehaan Mar 2011 A1
20110055398 Dehaan et al. Mar 2011 A1
20110055470 Portolani Mar 2011 A1
20110072489 Parann-Nissany Mar 2011 A1
20110075667 Li et al. Mar 2011 A1
20110110382 Jabr et al. May 2011 A1
20110116443 Yu et al. May 2011 A1
20110126099 Anderson et al. May 2011 A1
20110138055 Daly et al. Jun 2011 A1
20110145413 Dawson et al. Jun 2011 A1
20110145657 Bishop et al. Jun 2011 A1
20110173303 Rider Jul 2011 A1
20110185063 Head et al. Jul 2011 A1
20110185065 Stanisic et al. Jul 2011 A1
20110206052 Tan et al. Aug 2011 A1
20110213966 Fu et al. Sep 2011 A1
20110219434 Betz et al. Sep 2011 A1
20110231715 Kunii et al. Sep 2011 A1
20110231899 Pulier et al. Sep 2011 A1
20110239039 Dieffenbach et al. Sep 2011 A1
20110252327 Awasthi et al. Oct 2011 A1
20110261811 Battestilli et al. Oct 2011 A1
20110261828 Smith Oct 2011 A1
20110276675 Singh et al. Nov 2011 A1
20110276951 Jain Nov 2011 A1
20110283013 Grosser et al. Nov 2011 A1
20110295998 Ferris et al. Dec 2011 A1
20110305149 Scott et al. Dec 2011 A1
20110307531 Gaponenko et al. Dec 2011 A1
20110320870 Kenigsberg et al. Dec 2011 A1
20120005724 Lee Jan 2012 A1
20120036234 Staats et al. Feb 2012 A1
20120054367 Ramakrishnan et al. Mar 2012 A1
20120072318 Akiyama et al. Mar 2012 A1
20120072578 Alam Mar 2012 A1
20120072581 Tung et al. Mar 2012 A1
20120072985 Davne et al. Mar 2012 A1
20120072992 Arasaratnam et al. Mar 2012 A1
20120084445 Brock et al. Apr 2012 A1
20120084782 Chou et al. Apr 2012 A1
20120096134 Suit Apr 2012 A1
20120102193 Rathore et al. Apr 2012 A1
20120102199 Hopmann et al. Apr 2012 A1
20120131174 Ferris et al. May 2012 A1
20120137215 Kawara May 2012 A1
20120158967 Sedayao et al. Jun 2012 A1
20120159097 Jennas, II et al. Jun 2012 A1
20120167094 Suit Jun 2012 A1
20120173710 Rodriguez Jul 2012 A1
20120179909 Sagi et al. Jul 2012 A1
20120180044 Donnellan et al. Jul 2012 A1
20120182891 Lee et al. Jul 2012 A1
20120185913 Martinez et al. Jul 2012 A1
20120192016 Gotesdyner et al. Jul 2012 A1
20120192075 Ebtekar et al. Jul 2012 A1
20120201135 Ding et al. Aug 2012 A1
20120214506 Skaaksrud et al. Aug 2012 A1
20120222106 Kuehl Aug 2012 A1
20120236716 Anbazhagan et al. Sep 2012 A1
20120240113 Hur Sep 2012 A1
20120265976 Spiers et al. Oct 2012 A1
20120272025 Park et al. Oct 2012 A1
20120281706 Agarwal et al. Nov 2012 A1
20120281708 Chauhan et al. Nov 2012 A1
20120290647 Ellison et al. Nov 2012 A1
20120297238 Watson et al. Nov 2012 A1
20120311106 Morgan Dec 2012 A1
20120311568 Jansen Dec 2012 A1
20120324092 Brown et al. Dec 2012 A1
20120324114 Dutta et al. Dec 2012 A1
20130003567 Gallant et al. Jan 2013 A1
20130013248 Brugler et al. Jan 2013 A1
20130036213 Hasan et al. Feb 2013 A1
20130044636 Koponen et al. Feb 2013 A1
20130066940 Shao Mar 2013 A1
20130080509 Wang Mar 2013 A1
20130080624 Nagai et al. Mar 2013 A1
20130091557 Gurrapu Apr 2013 A1
20130097601 Podvratnik et al. Apr 2013 A1
20130104140 Meng et al. Apr 2013 A1
20130111540 Sabin May 2013 A1
20130117337 Dunham May 2013 A1
20130124712 Parker May 2013 A1
20130125124 Kempf et al. May 2013 A1
20130138816 Kuo et al. May 2013 A1
20130144978 Jain et al. Jun 2013 A1
20130152076 Patel Jun 2013 A1
20130152175 Hromoko et al. Jun 2013 A1
20130159097 Schory et al. Jun 2013 A1
20130159496 Hamilton et al. Jun 2013 A1
20130160008 Cawlfield et al. Jun 2013 A1
20130162753 Hendrickson et al. Jun 2013 A1
20130169666 Pacheco et al. Jul 2013 A1
20130179941 McGloin et al. Jul 2013 A1
20130182712 Aguayo et al. Jul 2013 A1
20130185433 Zhu et al. Jul 2013 A1
20130191106 Kephart et al. Jul 2013 A1
20130198374 Zalmanovitch et al. Aug 2013 A1
20130201989 Hu et al. Aug 2013 A1
20130204849 Chacko Aug 2013 A1
20130232491 Radhakrishnan et al. Sep 2013 A1
20130246588 Borowicz et al. Sep 2013 A1
20130250770 Zou et al. Sep 2013 A1
20130254415 Fullen et al. Sep 2013 A1
20130262347 Dodson Oct 2013 A1
20130283364 Chang et al. Oct 2013 A1
20130297769 Chang et al. Nov 2013 A1
20130318240 Hebert et al. Nov 2013 A1
20130318546 Kothuri et al. Nov 2013 A1
20130339949 Spiers et al. Dec 2013 A1
20140006481 Frey et al. Jan 2014 A1
20140006535 Reddy Jan 2014 A1
20140006585 Dunbar et al. Jan 2014 A1
20140040473 Ho et al. Feb 2014 A1
20140040883 Tompkins Feb 2014 A1
20140052877 Mao Feb 2014 A1
20140056146 Hu et al. Feb 2014 A1
20140059310 Du et al. Feb 2014 A1
20140068087 Spencer, IV Mar 2014 A1
20140074850 Noel et al. Mar 2014 A1
20140075048 Yuksel et al. Mar 2014 A1
20140075108 Dong et al. Mar 2014 A1
20140075357 Flores et al. Mar 2014 A1
20140075501 Srinivasan et al. Mar 2014 A1
20140089727 Cherkasova et al. Mar 2014 A1
20140098762 Ghai et al. Apr 2014 A1
20140108985 Scott et al. Apr 2014 A1
20140122560 Ramey et al. May 2014 A1
20140136779 Guha et al. May 2014 A1
20140140211 Chandrasekaran et al. May 2014 A1
20140141720 Princen et al. May 2014 A1
20140156557 Zeng et al. Jun 2014 A1
20140164486 Ravichandran et al. Jun 2014 A1
20140188825 Muthukkaruppan et al. Jul 2014 A1
20140189095 Lindberg et al. Jul 2014 A1
20140189125 Amies et al. Jul 2014 A1
20140215471 Cherkasova Jul 2014 A1
20140222953 Karve et al. Aug 2014 A1
20140244851 Lee Aug 2014 A1
20140245298 Zhou et al. Aug 2014 A1
20140281173 Im et al. Sep 2014 A1
20140282536 Dave et al. Sep 2014 A1
20140282611 Campbell et al. Sep 2014 A1
20140282889 Ishaya et al. Sep 2014 A1
20140289200 Kato Sep 2014 A1
20140295831 Karra et al. Oct 2014 A1
20140297569 Clark et al. Oct 2014 A1
20140297835 Buys Oct 2014 A1
20140310391 Sorenson, III et al. Oct 2014 A1
20140310417 Sorenson, III et al. Oct 2014 A1
20140310418 Sorenson, III et al. Oct 2014 A1
20140314078 Jilani Oct 2014 A1
20140317261 Shatzkamer et al. Oct 2014 A1
20140321278 Cafarelli et al. Oct 2014 A1
20140330976 van Bemmel Nov 2014 A1
20140330977 van Bemmel Nov 2014 A1
20140334488 Guichard et al. Nov 2014 A1
20140362682 Guichard et al. Dec 2014 A1
20140365680 van Bemmel Dec 2014 A1
20140366155 Chang et al. Dec 2014 A1
20140369204 Anand et al. Dec 2014 A1
20140372567 Ganesh et al. Dec 2014 A1
20140379938 Bosch et al. Dec 2014 A1
20150033086 Sasturkar et al. Jan 2015 A1
20150043576 Dixon et al. Feb 2015 A1
20150052247 Threefoot et al. Feb 2015 A1
20150052517 Raghu et al. Feb 2015 A1
20150058382 St. Laurent et al. Feb 2015 A1
20150058459 Amendjian et al. Feb 2015 A1
20150071285 Kumar et al. Mar 2015 A1
20150085870 Narasimha et al. Mar 2015 A1
20150089082 Patwardhan et al. Mar 2015 A1
20150100471 Curry, Jr. et al. Apr 2015 A1
20150103827 Quinn et al. Apr 2015 A1
20150106802 Ivanov et al. Apr 2015 A1
20150106805 Melander et al. Apr 2015 A1
20150117199 Chinnaiah Sankaran et al. Apr 2015 A1
20150117458 Gurkan et al. Apr 2015 A1
20150120914 Wada et al. Apr 2015 A1
20150124622 Kovvali et al. May 2015 A1
20150138973 Kumar et al. May 2015 A1
20150178133 Phelan et al. Jun 2015 A1
20150189009 van Bemmel Jul 2015 A1
20150215819 Bosch et al. Jul 2015 A1
20150227405 Jan et al. Aug 2015 A1
20150242204 Hassine et al. Aug 2015 A1
20150249709 Teng et al. Sep 2015 A1
20150263901 Kumar et al. Sep 2015 A1
20150280980 Bitar Oct 2015 A1
20150281067 Wu Oct 2015 A1
20150281113 Siciliano et al. Oct 2015 A1
20150309908 Pearson et al. Oct 2015 A1
20150319063 Zourzouvillys et al. Nov 2015 A1
20150326524 Tankala et al. Nov 2015 A1
20150339210 Kopp et al. Nov 2015 A1
20150358850 La Roche, Jr. et al. Dec 2015 A1
20150365324 Kumar et al. Dec 2015 A1
20150373108 Fleming et al. Dec 2015 A1
20160011925 Kulkarni et al. Jan 2016 A1
20160013990 Kulkarni et al. Jan 2016 A1
20160026684 Mukherjee et al. Jan 2016 A1
20160036837 Jain et al. Feb 2016 A1
20160062786 Meng et al. Mar 2016 A1
20160094389 Jain et al. Mar 2016 A1
20160094398 Choudhury et al. Mar 2016 A1
20160094453 Jain et al. Mar 2016 A1
20160094454 Jain et al. Mar 2016 A1
20160094455 Jain et al. Mar 2016 A1
20160094456 Jain et al. Mar 2016 A1
20160094480 Kulkarni et al. Mar 2016 A1
20160094643 Jain et al. Mar 2016 A1
20160099847 Melander et al. Apr 2016 A1
20160099853 Nedeltchev et al. Apr 2016 A1
20160099864 Akiya et al. Apr 2016 A1
20160105393 Thakkar et al. Apr 2016 A1
20160127184 Bursell May 2016 A1
20160134557 Steinder et al. May 2016 A1
20160156708 Jalan et al. Jun 2016 A1
20160164780 Timmons et al. Jun 2016 A1
20160164914 Madhav et al. Jun 2016 A1
20160182378 Basavaraja et al. Jun 2016 A1
20160188527 Cherian et al. Jun 2016 A1
20160234071 Nambiar et al. Aug 2016 A1
20160239399 Babu et al. Aug 2016 A1
20160253078 Ebtekar et al. Sep 2016 A1
20160254968 Ebtekar et al. Sep 2016 A1
20160261564 Foxhoven et al. Sep 2016 A1
20160277368 Narayanaswamy et al. Sep 2016 A1
20170005948 Melander et al. Jan 2017 A1
20170024260 Chandrasekaran et al. Jan 2017 A1
20170026294 Basavaraja et al. Jan 2017 A1
20170026470 Bhargava et al. Jan 2017 A1
20170041342 Efremov et al. Feb 2017 A1
20170054659 Ergin et al. Feb 2017 A1
20170097841 Chang et al. Apr 2017 A1
20170099188 Chang et al. Apr 2017 A1
20170104755 Arregoces et al. Apr 2017 A1
20170111209 Ward Apr 2017 A1
20170147297 Krishnamurthy et al. May 2017 A1
20170149878 Mutnuru May 2017 A1
20170163531 Kumar et al. Jun 2017 A1
20170171158 Hoy et al. Jun 2017 A1
20170264663 Bicket et al. Sep 2017 A1
20170324651 Penno Nov 2017 A1
20170339070 Chang et al. Nov 2017 A1
20170359255 Manghirmalani et al. Dec 2017 A1
Foreign Referenced Citations (14)
Number Date Country
101719930 Jun 2010 CN
101394360 Jul 2011 CN
102164091 Aug 2011 CN
104320342 Jan 2015 CN
105740084 Jul 2016 CN
2228719 Sep 2010 EP
2439637 Apr 2012 EP
2645253 Nov 2014 EP
10-2015-0070676 May 2015 KR
M394537 Dec 2010 TW
WO 2009155574 Dec 2009 WO
WO 2010030915 Mar 2010 WO
WO 2013158707 Oct 2013 WO
2017186070 Nov 2017 WO
Non-Patent Literature Citations (67)
Entry
Amedro, Brian, et al., “An Efficient Framework for Running Applications on Clusters, Grids and Cloud,” 2010, 17 pages.
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., Jul. 25, 2012, XP055141645, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud.
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages.
Author Unknown, “A Look at DeltaCloud: The Multi-Cloud API,” Feb. 17, 2012, 4 pages.
Author Unknown, “About Deltacloud,” Apache Software Foundation, Aug. 18, 2013, 1 page.
Author Unknown, “Architecture for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0102, Jun. 18, 2010, 57 pages.
Author Unknown, “Cloud Infrastructure Management Interface—Common Information Model (CIMI-CIM),” Document No. DSP0264, Version 1.0.0, Dec. 14, 2012, 21 pages.
Author Unknown, “Cloud Infrastructure Management Interface (CIMI) Primer,” Document No. DSP2027, Version 1.0.1, Sep. 12, 2012, 30 pages.
Author Unknown, “cloudControl Documentation,” Aug. 25, 2013, 14 pages.
Author Unknown, “Interoperable Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0101, Nov. 11, 2009, 21 pages.
Author Unknown, “Microsoft Cloud Edge Gateway (MCE) Series Appliance,” Iron Networks, Inc., 2014, 4 pages.
Author Unknown, “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, 18 pages.
Author Unknown, “Real-Time Performance Monitoring on Juniper Networks Devices, Tips and Tools for Assessing and Analyzing Network Efficiency,” Juniper Networks, Inc., May 2010, 35 pages.
Author Unknown, “Use Cases and Interactions for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS00103, Jun. 16, 2010, 75 pages.
Author Unknown, “Apache Ambari Meetup What's New,” Hortonworks Inc., Sep. 2013, 28 pages.
Author Unknown, “Introduction,” Apache Ambari project, Apache Software Foundation, 2014, 1 page.
Baker, F., “Requirements for IP Version 4 Routers,” Jun. 1995, 175 pages, Network Working Group, Cisco Systems.
Beyer, Steffen, “Module “Data::Locations?!”,” YAPC::Europe, London, UK,ICA, Sep. 22-24, 2000, XP002742700, 15 pages.
Blanchet, M., “A Flexible Method for Managing the Assignment of Bits of an IPv6 Address Block,” Apr. 2003, 8 pages, Network Working Group, Viagnie.
Borovick, Lucinda, et al., “Architecting the Network for the Cloud,” IDC White Paper, Jan. 2011, 8 pages.
Bosch, Greg, “Virtualization,” last modified Apr. 2012 by B. Davison, 33 pages.
Broadcasters Audience Research Board, “What's Next,” http://Iwww.barb.co.uk/whats-next, accessed Jul. 22, 2015, 2 pages.
Cisco Systems, Inc. “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” Cisco White Paper, Apr. 2011, 36 pages, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9902/white_paper_c11-558242.pdf.
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” Cisco White Paper, Jan. 2011, 6 pages.
Cisco Systems, Inc., “Cisco Intercloud Fabric: Hybrid Cloud with Choice, Consistency, Control and Compliance,” Dec. 10, 2014, 22 pages.
Cisco Technology, Inc., “Cisco Expands Videoscape TV Platform Into the Cloud,” Jan. 6, 2014, Las Vegas, Nevada, Press Release, 3 pages.
Citrix, “Citrix StoreFront 2.0” White Paper, Proof of Concept Implementation Guide, Citrix Systems, Inc., 2013, 48 pages.
Citrix, “CloudBridge for Microsoft Azure Deployment Guide,” 30 pages.
Citrix, “Deployment Practices and Guidelines for NetScaler 10.5 on Amazon Web Services,” White Paper, citrix.com, 2014, 14 pages.
CSS Corp, “Enterprise Cloud Gateway (ECG)—Policy driven framework for managing multi-cloud environments,” original published on or about Feb. 11, 2012; 1 page; http://www.css-cloud.com/platform/enterprise-cloud-gateway.php.
Fang K., “LISP MAC-EID-TO-RLOC Mapping (LISP based L2VPN),” Network Working Group, Internet Draft, CISCO Systems, Jan. 2012, 12 pages.
Ford, Bryan, et al., Peer-to-Peer Communication Across Network Address Translators, In USENIX Annual Technical Conference, 2005, pp. 179-192.
Gedymin, Adam, “Cloud Computing with an emphasis on Google App Engine,” Sep. 2011, 146 pages.
Good, Nathan A., “Use Apache Deltacloud to administer multiple instances with a single API,” Dec. 17, 2012, 7 pages.
Herry, William, “Keep It Simple, Stupid: OpenStack nova-scheduler and its algorithm”, May 12, 2012, IBM, 12 pages.
Hewlett-Packard Company, “Virtual context management on network devices”, Research Disclosure, vol. 564, No. 60, Apr. 1, 2011, Mason Publications, Hampshire, GB, Apr. 1, 2011, 524.
Juniper Networks, Inc., “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Dec. 2011, 3 pages.
Kenhui, “Musings on Cloud Computing and IT-as-a-Service: [Updated for Havana] Openstack Computer for VSphere Admins, Part 2: Nova-Scheduler and DRS”, Jun. 26, 2013, Cloud Architect Musings, 12 pages.
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, XP055141648, 5 pages, https://web.archive.org/web/20070120205111/http://download.openvz.org/doc/openvz-intro.pdf.
Kumar, S., et al., “Infrastructure Service Forwarding for NSH,” Service Function Chaining Internet Draft, draft-kumar-sfc-nsh-forwarding-00, Dec. 5, 2015, 10 pages.
Kunz, Thomas, et al., “OmniCloud—The Secure and Flexible Use of Cloud Storage Services,” 2014, 30 pages.
Lerach, S.R.O., “Golem,” http://www.lerach.cz/en/products/golem, accessed Jul. 22, 2015, 2 pages.
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages.
Logan, Marcus, “Hybrid Cloud Application Architecture for Elastic Java-Based Web Applications,” F5 Deployment Guide Version 1.1, 2016, 65 pages.
Lynch, Sean, “Monitoring cache with Claspin” Facebook Engineering, Sep. 19, 2012, 5 pages.
Meireles, Fernando Miguel Dias, “Integrated Management of Cloud Computing Resources,” 2013-2014, 286 pages.
Meraki, “meraki releases industry's first cloud-managed routers,” Jan. 13, 2011, 2 pages.
Mu, Shuai, et al., “uLibCloud: Providing High Available and Uniform Accessing to Multiple Cloud Storages,” 2012 IEEE, 8 pages.
Naik, Vijay K., et al., “Harmony: A Desktop Grid for Delivering Enterprise Computations,” Grid Computing, 2003, Fourth International Workshop on Proceedings, Nov. 17, 2003, pp. 1-11.
Nair, Srijith K. et al., “Towards Secure Cloud Bursting, Brokerage and Aggregation,” 2012, 8 pages, www.flexiant.com.
Nielsen, “SimMetry Audience Measurement—Technology,” http://www.nielsen-admosphere.eu/products-and-services/simmetry-audience-measurement-technology/, accessed Jul. 22, 2015, 6 pages.
Nielsen, “Television,” http://www.nielsen.com/us/en/solutions/measurement/television.html, accessed Jul. 22, 2015, 4 pages.
Open Stack, “Filter Scheduler,” updated Dec. 17, 2017, 5 pages, accessed on Dec. 18, 2017, https://docs.openstack.org/nova/latest/user/filter-scheduler.html.
Quinn, P., et al., “Network Service Header,” Internet Engineering Task Force Draft, Jul. 3, 2014, 27 pages.
Quinn, P., et al., “Service Function Chaining (SFC) Architecture,” Network Working Group, Internet Draft, draft-quinn-sfc-arch-03.txt, Jan. 22, 2014, 21 pages.
Rabadan, J., et al., “Operational Aspects of Proxy-ARP/ND in EVPN Networks,” BESS Worksgroup Internet Draft, draft-snr-bess-evpn-proxy-arp-nd-02, Oct. 6, 2015, 22 pages.
Saidi, Ali, et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages.
Shunra, “Shunra for HP Software; Enabling Confidence in Application Performance Before Deployment,” 2010, 2 pages.
Son, Jungmin, “Automatic decision system for efficient resource selection and allocation in inter-clouds,” Jun. 2013, 35 pages.
Sun, Aobing, et al., “IaaS Public Cloud Computing Platform Scheduling Model and Optimization Analysis,” Int. J. Communications, Network and System Sciences, Apr. 2011, 803-811, 9 pages.
Szymaniak, Michal, et al., “Latency-Driven Replica Placement”, vol. 47 No. 8, IPSJ Journal, Aug. 2006, 12 pages.
Toews, Everett, “Introduction to Apache jclouds,” Apr. 7, 2014, 23 pages.
Von Laszewski, Gregor, et al., “Design of a Dynamic Provisioning System for a Federated Cloud and Bare-metal Environment,” 2012, 8 pages.
Wikipedia, “Filter (software)”, Wikipedia, Feb. 8, 2014, 2 pages, https://en.wikipedia.org/w/index.php?title=Filter_%28software%29&oldid=594544359.
Wikipedia; “Pipeline (Unix)”, Wikipedia, May 4, 2014, 4 pages, https://en.wikipedia.org/w/index.php?title=Pipeline2/028Unix%29&oldid=606980114.
Ye, Xianglong, et al., “A Novel Blocks Placement Strategy for Hadoop,” 2012 IEEE/ACTS 11th International Conference on Computer and Information Science, 2012 IEEE, 5 pages.
International Search Report and Written Opinion from the International Searching Authority, dated Aug. 21, 2017, 15 pages, for corresponding International Patent Application No. PCT/US2019/038417.
Related Publications (1)
Number Date Country
20200007388 A1 Jan 2020 US