This disclosure pertains to identify a cause of a packet drop, and in particular, to detecting and differentiating a packet drop due to policy versus a packet drop due to a malfunctioning service function, in a service function chain environment.
In computer networking, network administrators are often concerned with how to best route traffic flows from one end point to another end point across a network. When provisioning a route for a traffic flow, administrators may implement policies to ensure that certain service functions are applied to the packet or the traffic flow as it traverses across the network. Service functions can provide security, wide area network (WAN) acceleration, and loadbalancing. These service functions can be implemented at various points in the network infrastructure, such as the wide area network, data center, campus, etc. Network elements providing these service functions are generally referred to as “service nodes.”
Traditionally, service node deployment is dictated by the network topology. For instance, firewalls are usually deployed at the edge of an administrative zone for filtering traffic leaving or entering the particular zone according to a policy for that zone. With the rise of virtual platforms and more agile networks, service node deployment can no longer be bound by the network topology. To enable service nodes to be deployed anywhere on a network, a solution called Service Function Chaining (SFC) Architecture (IETF draft-ietf-sfc-architecture-04, Sep. 20, 2014) and Network Service Header (NSH) (IETF draft-quinn-sfc-nsh-03, Jul. 3, 2014) have been provided to encapsulated packets or frames to prescribe service paths for traffic flows through the appropriate service nodes. Specifically, Network Service Headers provide data plane encapsulation that utilizes the network overlay topology used to deliver packets to the requisite services.
To provide a more complete understanding of the present disclosure and features and advantages thereof, reference is made to the following description, taken in conjunction with the accompanying figures, wherein like reference numerals represent like parts.
Aspects of the embodiments are directed to a method for packet drop handling in a service function chain environment, the method including receiving a data packet from a service function, the data packet comprising a bit set to indicate that a packet drop is to be monitored; generating an Internet Control Message Protocol (ICMP) message, the ICMP message comprising a destination address for the ICMP message identified from the data packet; transmitting the ICMP message to the destination address; and dropping the data packet from the service function chain.
Aspects of the embodiments are directed to a service function forwarder network element of a service function chain, the service function forwarder including at least one memory element having instructions stored thereon and at least one processors coupled to the at least one memory element and configured to execute the instructions to cause the service function forwarder network element to receive a data packet from a service function, the data packet comprising a bit set to indicate that a packet drop is to be monitored; generate an Internet Control Message Protocol (ICMP) message, the ICMP message comprising a destination address for the ICMP message identified from the data packet; transmit the ICMP message to the destination address; and drop the data packet from the service function chain.
Aspects of the embodiments are directed to a computer-readable non-transitory medium comprising one or more instructions for handling packet drops in a service function chain, the instructions when executed on a processor are operable to receive, from a service function forwarder network element, a data packet comprising a bit field to indicate that a packet drop is to be monitored; apply one or more policies for the data packet; determine that the data packet is to be dropped based on at least one of the one or more policies; set a drop-propagate bit in a header of the data packet; and transmit the data packet to the service function forwarder network element.
Aspects of the embodiments are directed to a computer-readable non-transitory medium comprising one or more instructions for handling packet drops in a service function chain, the instructions when executed on a processor are operable to receive, from a service function forwarder network element, a data packet comprising a bit field to indicate that a packet drop is to be monitored; apply one or more policies for the data packet; determine that the data packet is to be dropped based on at least one of the one or more policies; set a drop-propagate bit in a header of the data packet; and transmit the data packet to the service function forwarder network element.
Aspects of the embodiments are directed to a method performed at a service function of a service function chain, the method including receiving, from a service function forwarder network element, a data packet comprising a bit field to indicate that a packet drop is to be monitored; applying one or more policies for the data packet; determining that the data packet is to be dropped based on at least one of the one or more policies; setting a drop-propagate bit in a header of the data packet; and transmitting the data packet to the service function forwarder network element.
Aspects of the embodiments are directed to a computer-readable non-transitory medium comprising one or more instructions for handling packet drops in a service function chain, the instructions when executed on a processor are operable to receive a data packet from a service function, the data packet comprising a bit set to indicate that a packet drop is to be monitored; generate an Internet Control Message Protocol (ICMP) message, the ICMP message comprising a destination address for the ICMP message identified from the data packet; transmit the ICMP message to the destination address; and drop the data packet from the service function chain.
Some embodiments also include receiving a data packet destined for the service function, the data packet comprising the bit set to indicate that the packet drop is to be monitored; and forwarding the data packet to the service function.
In some embodiments, generating the ICMP message comprises generating the ICMP message with the data packet payload and the destination address from a reply-to field from the data packet header.
In some embodiments, generating the ICMP message comprises generating the ICMP message with an error code identifying one or more policies causing the drop of the packet.
In some embodiments, the instructions further operable when executed to receive a data packet destined for the service function, the data packet comprising the bit set to indicate that the packet drop is to be monitored; and forward the data packet to the service function.
In some embodiments, wherein generating the ICMP message comprises generating the ICMP message with the data packet payload and the destination address from a reply-to field from the data packet header.
In some embodiments, wherein generating the ICMP message comprises generating the ICMP message with an error code identifying one or more policies causing the drop of the packet.
In some embodiments, the instructions are further operable when executed to receive a data packet destined for the service function, the data packet comprising the bit set to indicate that the packet drop is to be monitored; and forward the data packet to the service function.
In some embodiments, generating the ICMP message comprises generating the ICMP message with the data packet payload and the destination address from a reply-to field from the data packet header.
In some embodiments, generating the ICMP message comprises generating the ICMP message with an error code identifying one or more policies causing the drop of the packet.
In some embodiments, the instructions are further operable to apply one or more service functions to the data packet.
In some embodiments, the instructions are further operable to determine whether the bit field that indicates that a packet drop is to be monitored is set, and if the bit field is set, then set the drop-propagate bit in the header of the data packet.
In some embodiments, the instructions are further operable to determine that the bit field that indicates that a packet drop is to be monitored is not set, and drop the packet.
Some embodiments also include applying one or more service functions to the data packet.
Some embodiments also include determining whether the bit field that indicates that a packet drop is to be monitored is set, and if the bit field is set, then setting the drop-propagate bit in the header of the data packet.
Some embodiments also include determining that the bit field that indicates that a packet drop is to be monitored is not set, and dropping the packet.
In a service function chain (SFC) environment, a packet can flow over a set of Service Functions (SFs) for packet treatment. A packet flowing over a specific service function path (SFP) might be dropped due to different reasons, such as:
Service Functions like Firewall drop a packet due 1. to firewall policy;
2. Service Functions like DPI, Anomaly detection, etc., might drop a packet on detecting certain signature etc.;
3. Malfunctioning Service Function (abruptly dropping it).
This disclosure describes detecting and differentiating whether a packet drop is due to policy (expected) or a malfunctioning SF (unexpected).
This disclosure describes leveraging a header bit added into the data plane traffic packet that can be used between a service function forwarder (SFF) and an SF so that an Operator can differentiate such failures. The use of an indicator bit can facilitate troubleshooting activities within the service function path.
This disclosure describes an source (such as an operator or other cloud-computing operator) selecting to know about whether to receive specific drop errors and causes. An operator can elect to check if data traffic is dropped due to policy or unexpected behavior, and can set a Validation bit (V), an O bit, or another bit in header, that serves as a flag to an SF to provide information on a policy-based drop. The validation bit, O bit, or other bit, can be set by a classifier network element or a mid-stream SFF. In embodiments, the V-bit can be one of the reserved bits from the packet header. The SF that is instructed by local policy to drop the packet will set a new bit (DP or Drop Propagate bit) in the header and forward back to SFF. SFF will drop the packet and will generate error message stating “Drop due to policy.” In case of unexpected or malfunctioning drop, the initiator (OAM server or Classifier) will not receive any such error message that differentiates such two types of drops.
Basics of Network Service Chaining or Service Function Chains in a Network
To accommodate agile networking and flexible provisioning of network nodes in the network, Service Function Chains (SFC) can be used to ensure an ordered set of Service Functions (SF) to be applied to packets and/or frames of a traffic flow. SFCs provides a method for deploying SFs in a way that enables dynamic ordering and topological independence of those SFs. A service function chain can define an ordered set of service functions that is applied to packets and/or frames of a traffic flow, where the ordered set of service functions are selected as a result of classification. The implied order may not be a linear progression as the architecture allows for nodes that copy to more than one branch. The term service chain is often used as shorthand for service function chain.
A service function can be responsible for specific treatment of received packets. A service function can act at the network layer or other OSI layers (e.g., application layer, presentation layer, session layer, transport layer, data link layer, and physical link layer). A service function can be a virtual instance or be embedded in a physical network element such as a service node. When a service function or other modules of a service node is executed by the at least one processors of the service node, the service function or other modules can be configured to implement any one of the methods described herein. Multiple service functions can be embedded in the same network element. Multiple instances of the service function can be enabled in the same administrative SFC-enabled domain. A non-exhaustive list of SFs includes: firewalls, WAN and application acceleration, Deep Packet Inspection (DPI), server load balancers, NAT44, NAT64, HOST_ID injection, HTTP Header Enrichment functions, TCP optimizer, etc. An SF may be SFC encapsulation aware, that is it receives, and acts on information in the SFC encapsulation, or unaware in which case data forwarded to the service does not contain the SFC encapsulation.
A Service Node (SN) can be a physical network element (or a virtual element embedded on a physical network element) that hosts one or more service functions (SFs) and has one or more network locators associated with it for reachability and service delivery. In many standardization documents, “service functions” can refer to the service nodes described herein as having one or more service functions hosted thereon. Service Function Path (SFP) (or sometimes referred simply as service path) relates to the instantiation of a SFC in the network. Packets follow a service path from a classifier through the requisite service functions.
Network Service Header (NSH) Encapsulation
Generally speaking, an NSH includes service path information, and NSH is added to a packet or frame. For instance, an NSH can include a data plane header added to packets or frames. Effectively, the NSH creates a service plane. The NSH includes information for service chaining, and in some cases, the NSH can include metadata added and/or consumed by service nodes or service functions. The packets and NSH are encapsulated in an outer header for transport. To implement a service path, a network element such as a service classifier (SCL) or some other suitable SFC-aware network element can process packets or frames of a traffic flow and performs NSH encapsulation according to a desired policy for the traffic flow.
The service classification function 208 can process a packet of a traffic flow and determine whether the packet requires servicing and correspondingly which service path to follow to apply the appropriate service. The determination can be performed based on business policies and/or rules stored in memory 206. Once the determination of the service path is made, service header encapsulator 210 generates an appropriate NSH having identification information for the service path and adds the NSH to the packet. The service header encapsulator 210 provides an outer encapsulation to forward the packet to the start of the service path. Other SFC-aware network elements are thus able to process the NSH while other non-SFC-aware network elements would simply forward the encapsulated packets as is. Besides inserting an NSH, network element 202 can also remove the NSH if the service classification function 208 determines the packet does not require servicing.
Network Service Headers
A network service header (NSH) can include a (e.g., 64-bit) base header, and one or more context headers. Generally speaking, the base header provides information about the service header and service path identification (e.g., a service path identifier), and context headers can carry opaque metadata (such as the metadata described herein reflecting the result of classification). For instance, an NSH can include a 4-byte base header, a 4-byte service path header, and optional context headers. The base header can provide information about the service header and the payload protocol. The service path header can provide path identification and location within a path. The (variable length) context headers can carry opaque metadata and variable length encoded information. The one or more optional context headers make up a context header section in the NSH. For instance, the context header section can include one or more context header fields having pieces of information therein, describing the packet/frame. Based on the information in the base header, a service function of a service node can derive policy selection from the NSH. Context headers shared in the NSH can provide a range of service-relevant information such as traffic classification. Service functions can use NSH to select local service policy.
Service Nodes and Proxy Nodes
Once properly encapsulated, the packet having the NSF is then forwarded to one or more service nodes where service(s) can be applied to the packet/frame.
This disclosure describes a Service Function (such as a Firewall, DPI, etc.) that when the SF is expected to drop a packet due to policy and if a new bit is set by the classifier (e.g., a Data Validation bit or an O bit), the SF will set a new bit (e.g., Drop-Propagate bit) set in the header of the packet, and forward the packet to the SFF.
The SFF can generate an Internet Control Message Protocol (ICMP) message and forward to the relevant node (Classifier/Initiator/Server, etc.) using a new ICMP code and include the header from the to-be-dropped packet.
The classifier will be instructed to include Validation bit (or the O bit) in traffic flows that needs drop monitoring and differentiate if the missing packets are due to policy or unexpected drop. The classifier in addition will include a “reply-to” address in Metadata. This address is used to send the ICMP reply back from the SFF.
Upon receiving the packet 406, the SFF 402 can process the packet 406 based on the intended SF 404 from the SFP and SI information from the packet header. The SF 404 can process the packet in accordance to the SF's function. In some embodiments, the SF 404 can determine that policy enforcement indicates that the SF 404 should drop the packet. The SF 404 can set another bit in the packet header that indicates to the SFF 402 that the SFF 402 should generate an Internet Control Message Protcol (ICMP) message. This bit can be a drop propagate (DP) bit in the packet header. The SF 404 can then forward the packet back to the SFF 402.
In embodiments where a data validation bit or O bit (or other bit) is not set, then the SF 404 can drop the packet and forgo setting the DP bit and forgo forwarding the packet to the SFF 402.
In
The concepts described herein are applicable for probe packets and data packets and is scalable as it is not required to be done on all flows/packets.
A service function forwarder (SFF) can receive the data packet and forward the packet to a service function (606). The service function (SF) can process the data packet based on the information from the data packet header; the SF can also apply one or more policies for the data packet based on the information from the data packet header (608). In embodiments, the policy or policies implemented can indicate that the data packet should be dropped (610).
The SF can determine from the data packet header whether the validation bit or the O bit (or other bit flag is set that indicates the operator's election to monitor causes of dropped packets, but for ease, this bit is referred to here as a validation bit) (612). If the SF determines that the validation bit is not set, then the SF can drop the data packet and take no further action for that data packet (618).
If the SF determines that the validation bit is set, then the SF can set a drop-propagate (DP) bit in the data packet header (614). The SF can then send the data packet with the DP bit set to the SFF (616).
In some embodiments, the last SFF in a service function chain can decapsulate the data packet's NSH header, and can send a positive notification message (ICMP with a new code) when the Validation bit is set, that confirms that the packet has successfully flowed through the service function chain. When an operator sets the validation bit in a data traffic, the operator can receive the following:
1. If allowed by policies will receive a positive response from last SFF.
2. If dropped by policies, will receive an error code from connected SFF.
3. If dropped abruptly, will not receive any response.
If the packet drops, but the source that requested the monitoring does not receive the ICMP message, then the source can determine that the packet drop was in error (e.g., due to a malfunctioning SF or other issue with the service function chain, or with the packet itself). If the source does receive the ICMP message, then the source can determine the cause of the packet drop, such as which policy was enforced and where in the service function chain the policy was enforced.
Variations and Implementations
Within the context of the disclosure, a network used herein represents a series of points, nodes, or network elements of interconnected communication paths for receiving and transmitting packets of information that propagate through a communication system. A network offers communicative interface between sources and/or hosts, and may be any local area network (LAN), wireless local area network (WLAN), metropolitan area network (MAN), Intranet, Extranet, Internet, WAN, virtual private network (VPN), or any other appropriate architecture or system that facilitates communications in a network environment depending on the network topology. A network can comprise any number of hardware or software elements coupled to (and in communication with) each other through a communications medium.
In one particular instance, the architecture of the present disclosure can be associated with a service provider deployment. In other examples, the architecture of the present disclosure would be equally applicable to other communication environments, such as an enterprise wide area network (WAN) deployment. The architecture of the present disclosure may include a configuration capable of transmission control protocol/internet protocol (TCP/IP) communications for the transmission and/or reception of packets in a network.
As used herein in this Specification, the term ‘network element’ is meant to encompass any of the aforementioned elements, as well as servers (physical or virtually implemented on physical hardware), machines (physical or virtually implemented on physical hardware), end user devices, routers, switches, cable boxes, gateways, bridges, loadbalancers, firewalls, inline service nodes, proxies, processors, modules, or any other suitable device, component, element, proprietary appliance, or object operable to exchange, receive, and transmit information in a network environment. These network elements may include any suitable hardware, software, components, modules, interfaces, or objects that facilitate the network service header features/operations thereof. This may be inclusive of appropriate algorithms and communication protocols that allow for the effective exchange of data or information.
In one implementation, nodes with NSH capabilities may include software to achieve (or to foster) the functions discussed herein for providing the NSH-related features/functions where the software is executed on one or more processors to carry out the functions. This could include the implementation of instances of service functions, service header processors, metadata augmentation modules and/or any other suitable element that would foster the activities discussed herein. Additionally, each of these elements can have an internal structure (e.g., a processor, a memory element, etc.) to facilitate some of the operations described herein. In other embodiments, these functions may be executed externally to these elements, or included in some other network element to achieve the intended functionality. Alternatively, these nodes may include software (or reciprocating software) that can coordinate with other network elements in order to achieve the functions described herein. In still other embodiments, one or several devices may include any suitable algorithms, hardware, software, components, modules, interfaces, or objects that facilitate the operations thereof.
In certain example implementations, the NSH-related functions outlined herein may be implemented by logic encoded in one or more non-transitory, tangible media (e.g., embedded logic provided in an application specific integrated circuit [ASIC], digital signal processor [DSP] instructions, software [potentially inclusive of object code and source code] to be executed by one or more processors, or other similar machine, etc.). In some of these instances, one or more memory elements can store data used for the operations described herein. This includes the memory element being able to store instructions (e.g., software, code, etc.) that are executed to carry out the activities described in this Specification. The memory element is further configured to store databases or metadata disclosed herein. The processor can execute any type of instructions associated with the data to achieve the operations detailed herein in this Specification. In one example, the processor could transform an element or an article (e.g., data) from one state or thing to another state or thing. In another example, the activities outlined herein may be implemented with fixed logic or programmable logic (e.g., software/computer instructions executed by the processor) and the elements identified herein could be some type of a programmable processor, programmable digital logic (e.g., a field programmable gate array [FPGA], an erasable programmable read only memory (EPROM), an electrically erasable programmable ROM (EEPROM)) or an ASIC that includes digital logic, software, code, electronic instructions, or any suitable combination thereof.
Any of these elements (e.g., the network elements, service nodes, etc.) can include memory elements for storing information to be used in achieving the NSH-related features, as outlined herein. Additionally, each of these devices may include a processor that can execute software or an algorithm to perform the NSH-related features as discussed in this Specification. These devices may further keep information in any suitable memory element [random access memory (RAM), ROM, EPROM, EEPROM, ASIC, etc.], software, hardware, or in any other suitable component, device, element, or object where appropriate and based on particular needs. Any of the memory items discussed herein should be construed as being encompassed within the broad term ‘memory element.’ Similarly, any of the potential processing elements, modules, and machines described in this Specification should be construed as being encompassed within the broad term ‘processor.’ Each of the network elements can also include suitable interfaces for receiving, transmitting, and/or otherwise communicating data or information in a network environment.
Additionally, it should be noted that with the examples provided above, interaction may be described in terms of two, three, or four network elements. However, this has been done for purposes of clarity and example only. In certain cases, it may be easier to describe one or more of the functionalities of a given set of flows by only referencing a limited number of network elements. It should be appreciated that the systems described herein are readily scalable and, further, can accommodate a large number of components, as well as more complicated/sophisticated arrangements and configurations. Accordingly, the examples provided should not limit the scope or inhibit the broad techniques of using and augmenting NSH metadata, as potentially applied to a myriad of other architectures.
It is also important to note that the various steps described herein illustrate only some of the possible scenarios that may be executed by, or within, the nodes with NSH capabilities described herein. Some of these steps may be deleted or removed where appropriate, or these steps may be modified or changed considerably without departing from the scope of the present disclosure. In addition, a number of these operations have been described as being executed concurrently with, or in parallel to, one or more additional operations. However, the timing of these operations may be altered considerably. The preceding operational flows have been offered for purposes of example and discussion. Substantial flexibility is provided by nodes with NSH capabilities in that any suitable arrangements, chronologies, configurations, and timing mechanisms may be provided without departing from the teachings of the present disclosure.
It should also be noted that many of the previous discussions may imply a single client-server relationship. In reality, there is a multitude of servers in the delivery tier in certain implementations of the present disclosure. Moreover, the present disclosure can readily be extended to apply to intervening servers further upstream in the architecture, though this is not necessarily correlated to the ‘m’ clients that are passing through the ‘n’ servers. Any such permutations, scaling, and configurations are clearly within the broad scope of the present disclosure.
Numerous other changes, substitutions, variations, alterations, and modifications may be ascertained to one skilled in the art and it is intended that the present disclosure encompass all such changes, substitutions, variations, alterations, and modifications as falling within the scope of the appended claims. In order to assist the United States Patent and Trademark Office (USPTO) and, additionally, any readers of any patent issued on this application in interpreting the claims appended hereto, Applicant wishes to note that the Applicant: (a) does not intend any of the appended claims to invoke paragraph six (6) of 35 U.S.C. section 112 as it exists on the date of the filing hereof unless the words “means for” or “step for” are specifically used in the particular claims; and (b) does not intend, by any statement in the specification, to limit this disclosure in any way that is not otherwise reflected in the appended claims.
This application is a Continuation of U.S. application Ser. No. 15/244,369 filed on Aug. 23, 2016, the content of which is incorporated herein by reference in its entirety.
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 |
7596097 | McCowan et al. | Sep 2009 | B1 |
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 |
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 |
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 | Balasubramanian | 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 |
8238241 | Samuels | Aug 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 |
20060221844 | Subramanian et al. | Oct 2006 | A1 |
20060233106 | Achlioptas et al. | Oct 2006 | A1 |
20060233155 | Srivastava | Oct 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 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 |
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 |
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 |
20150163150 | Beheshti-Zavareh 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 |
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 |
20160149784 | Zhang 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 |
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 |
Number | Date | Country |
---|---|---|
10376123 | Apr 2014 | CN |
103716137 | Apr 2014 | CN |
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 |
Entry |
---|
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/overflow. |
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=519749189. |
Author Unknown, “GStreamer and in-band metadata,” from RidgeRun Developer Connection, Jun. 19, 2012, 5 pages. https://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. |
Bottorff, P., et al., “Ethernet MAC Chaining,” draft-fedyk-sfc-mac-chain-01.txt, Network Working Group, Broadcom, Jan. 20, 2016, pp. 1-23. |
Boucadair, M., et al., “Service Function Chaining: Framework & Architecture,” Internet Draft draft-boucadair-sfc-framework-02, Feb. 12, 2014, 25 pages. |
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, J., et al., “Service Function Chaining (SFC) Architecture,” Internet Engineering Task Force (IETF) RFC 7665, 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. |
Katsikas, Goergios P., et al., “Profiling and accelerating commodity NFV service chains with SCC,” The Journal of Systems and Software, vol. 127, Jan. 2017, pp. 12-27. |
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/02/22/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 IDS for HTTP Live Streaming, draft-smpte-id3-http-live-streaming-00,” Informational Internet Draft, Jun. 2012, 7 pages http://ietf.org/htnnl/draft-snnpte-id3-http-live-streaming-00. |
Xu, X., et al., “Service Function Chaining Using MPLS-SPRING,” draft-xu-sfc-using-mpls-spring-01, Network Working Group, Telefonica I+D, Oct. 8, 2014, pp. 1-7. |
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/. |
You, J., et al., “Service Function Chaining OAM in MPLS-SPRING Networks,” draft-you-mpls-spring-sfc-oam-01, MPLS Working Group, Huawei, Jan. 11, 2015, pp. 1-9. |
Zhang, Cathy, et al., “L4-L7 Service Function Chaining Solution Architecture,” Open Networking Foundation, Version 1.0, Jun. 14, 2015, pp. 1-36. |
Zhang, Ying, et al. “StEERING: A Software-Defined Networking for Inline Service Chaining,” IEEE, 2013, IEEE, p. 10 pages. |
Number | Date | Country | |
---|---|---|---|
20190149441 A1 | May 2019 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15244369 | Aug 2016 | US |
Child | 16247048 | US |