The present technology pertains to implementing the operations, administration, and management (OAM) protocol in an overlay environment, and more specifically to facilitating the transport of OAM communications across different overlay network types.
Operations, administration, and management (OAM) is a toolset available for MPLS (multiprotocol label switching), IP (Internet protocol), and Ethernet networks. Some example OAM tools and protocols include ICMP (Internet control message protocol), LSP (label switched path) ping and traceroute, BFD (bidirectional forwarding detection), VCCV (virtual circuit connection verification), IPPM (IP performance metrics), MPLS OAM, and Ethernet OAM. These OAM tools and protocols can be extremely powerful, as they provide various fault detection, fault verification, and performance monitoring capabilities in MPLS, IP, and Ethernet networks, at various layers of the networking stack.
Overlay networks are extremely extensible and increasingly popular networks based on a new layer 2 overlay scheme over a layer 3 network. Overlay networks, such as virtual extensible LAN (VXLAN), support a flexible, large-scale multitenant environment over a shared common physical infrastructure.
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 exemplary embodiments 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:
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 can be used without parting from the spirit and scope of the disclosure.
Additional features and advantages of the disclosure are 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 are more fully apparent from the following description and appended claims, or can be learned by the practice of the principles set forth herein.
A computer network can include a system of hardware, software, protocols, and transmission components that collectively allow separate devices to communicate, share data, and access resources, such as software applications. More specifically, a computer network is a geographically distributed collection of nodes interconnected by communication links and segments for transporting data between endpoints, such as personal computers and workstations. Many types of networks are available, ranging from local area networks (LANs) and wide area networks (WANs) to overlay and software-defined networks, such as virtual extensible local area networks (VXLANs), and virtual networks such as virtual LANs (VLANs) and virtual private networks (VPNs).
LANs typically connect nodes over dedicated private communications links located in the same general physical location, such as a building or campus. WANs, on the other hand, typically connect geographically dispersed nodes over long-distance communications links, such as common carrier telephone lines, optical lightpaths, synchronous optical networks (SONET), or synchronous digital hierarchy (SDH) links. LANs and WANs can include layer 2 (L2) and/or layer 3 (L3) networks and devices.
The Internet is an example of a public WAN that connects disparate networks throughout the world, providing global communication between nodes on various networks. The nodes typically communicate over the network by exchanging discrete frames or packets of data according to predefined protocols, such as the Transmission Control Protocol/Internet Protocol (TCP/IP). In this context, a protocol can refer to a set of rules defining how the nodes interact with each other. Computer networks may be further interconnected by intermediate network nodes, such as routers, switches, hubs, or access points (APs), which can effectively extend the size or footprint of the network.
Networks can be segmented into subnetworks to provide a hierarchical, multilevel routing structure. For example, a network can be segmented into subnetworks using subnet addressing to create network segments. This way, a network can allocate various groups of IP addresses to specific network segments and divide the network into multiple logical networks.
In addition, networks can be divided into logical segments called virtual networks, such as VLANs, which connect logical segments. For example, one or more LANs can be logically segmented to form a VLAN. A VLAN allows a group of machines to communicate as if they were in the same physical network, regardless of their actual physical location. Thus, machines located on different physical LANs can communicate as if they were located on the same physical LAN. Interconnections between networks and devices can also be created using routers and tunnels, such as VPN or secure shell (SSH) tunnels. Tunnels can encrypt point-to-point logical connections across an intermediate network, such as a public network like the Internet. This allows secure communications between the logical connections and across the intermediate network. By interconnecting networks, the number and geographic scope of machines interconnected, as well as the amount of data, resources, and services available to users can be increased.
Further, networks can be extended through network virtualization. Network virtualization allows hardware and software resources to be combined in a virtual network. For example, network virtualization can allow multiple numbers of VMs to be attached to the physical network via respective VLANs. The VMs can be grouped according to their respective VLAN, and can communicate with other VMs as well as other devices on the internal or external network.
To illustrate, overlay networks generally allow virtual networks to be created and layered over a physical network infrastructure. Overlay network protocols, such as VXLAN, Network Virtualization using Generic Routing Encapsulation (NVGRE), and Stateless Transport Tunneling (STT), provide a traffic encapsulation scheme which allows network traffic to be carried across L2 and L3 networks over a logical tunnel. Such logical tunnels can be originated and terminated through virtual tunnel end points (VTEPs). The VTEPs can tunnel the traffic between an underlay network and any overlay network, such as a VXLAN, an NVGRE, or a STT, for example.
Moreover, overlay networks can include virtual segments, such as VXLAN segments in a VXLAN overlay network, which can include virtual L2 and/or L3 overlay networks over which VMs communicate. The virtual segments can be identified through a virtual network identifier (VNI), such as a VXLAN network identifier, which can specifically identify an associated virtual segment or domain.
Operations, administration, and management (OAM) is a toolset available for MPLS, IP, and Ethernet networks. Some example OAM tools and protocols include ICMP, LSP ping and traceroute, BFD, VCCV, IPPM, MPLS OAM, and Ethernet OAM. These OAM tools and protocols can provide various fault detection, fault verification, and performance monitoring capabilities in MPLS, IP, and Ethernet networks, at various layers of the networking stack.
With the proliferation of various overlay technologies (e.g., VXLN-GPE, VXLAN, MPLS, GRE, etc.), have come a variety of independent OAM solutions, each of which operates according to requirements specific to the respective overlay technology. However, are no common tools that provide end-to-end OAM functionality, for example, to enable an operator to manage network operations across multiple different overlay and/or underlay networks. In some network deployments, a transit node that receives an OAM packet may de-encapsulate the OAM packet, however, if the transit node cannot understand the overlay OAM header (as is common if the packet is intended for a different overlay type), the packet is dropped.
Aspects of the subject technology address the foregoing need by providing an OAM packet communications framework that facilitates packet transport across different overlay types. In particular, aspects of the OAM framework enable overlay and underlay nodes to perform validation and look up irrespective of overlay type.
The OAM framework of the subject technology utilizes a method for encapsulating overlay network traffic with a transport OAM header that includes a pointer to an underlying OAM TLV payload. In particular, the pointer provided in the transport OAM header can include a “OAM TLV offset” that indicates (to a receiving/transmitting node), how many bits of packet data should be skipped to get to the OAM TLV, which carries the TLVs necessary for OAM functionality. By providing a pointer to the OAM TLV, the encapsulation method permits transit nodes of various overlay types to forward traffic (without packet drops), or to perform a desired OAM function as indicated by the TLV payload.
The overlay network 100 can include a network 102, which can represent the core, physical network and/or fabric. In some cases, network 102 can include an IP and/or MPLS network. Moreover, network 102 can be a service provider network. For example, network 102 can be an IP and/or MPLS service provider network.
Overlay network 100 can include devices 106A-D interconnected via network 102. Devices 106A-D can include virtual tunnel end points 108A-D, which can be physical or virtual nodes or switches configured to encapsulate and de-encapsulate data traffic according to a specific overlay protocol of the network 100, for the various virtual network identifiers (VNIDs) 110A-D. Devices 106A-D can include servers containing a VTEP functionality, hypervisors, and physical network devices, such as switches, configured with a virtual tunnel endpoint functionality. For example, devices 106A and 106B can be physical switches, such as top-of-rack (ToR) switches, configured to run VTEPs 108A-B. Here, devices 106A and 106B can be connected to servers 104A-D which, in some cases, can include virtual workloads through VMs loaded on the servers.
In some embodiments, network 100 can be a VXLAN network, and virtual tunnel end points 108A-D can be VXLAN tunnel end points (VTEPs). However, as one of ordinary skill in the art will readily recognize, overlay network 100 can represent any type of overlay or software-defined network, as previously mentioned.
The VNIDs can represent the segregated virtual networks in overlay network 100. Each of the overlay tunnels (VTEPs 108A-D) can be coupled with one or more VNIDs. For example, VTEP 108A can be coupled with virtual or physical devices or workloads residing in VNIDs 1 and 2; VTEP 108B can be coupled with virtual or physical devices or workloads residing in VNIDs 1 and 3; VTEP 108C can be coupled with virtual or physical devices or workloads residing in VNIDs 1 and 2; and VTEP 108D can be coupled with virtual or physical devices or workloads residing in VNIDs 1, 2, and 3. As one of ordinary skill in the art will readily recognize, any particular VTEP can, in other embodiments, be coupled with more or less VNIDs than the VNIDs illustrated in
The traffic in overlay network 100 can be segregated logically according to specific VNIDs. This way, traffic intended for VNID 1 can be accessed by devices residing in VNID 1, while other devices residing in other VNIDs (e.g., VNIDs 2 and 3) can be prevented from accessing such traffic. In other words, devices or endpoints in specific VNIDs can communicate with other devices or endpoints in the same specific VNIDs, while traffic from separate VNIDs can be isolated to prevent devices or endpoints in other specific VNIDs from accessing traffic in different VNIDs.
Each of the servers 104A-D and VMs 104E-L can be associated with a respective VNID or virtual segment, and communicate with other servers or VMs residing in the same VNID or virtual segment. For example, server 104A can communicate with server 104C and VM 104E because they all reside in the same VNID, viz., VNID 1. Similarly, server 101B can communicate with VMs 104F, 104H, and 104L because they all reside in VNID 2.
Each of the servers 104A-D and VMs 104E-L can represent a single server or VM, but can also represent multiple servers or VMs, such as a cluster of servers or VMs. Moreover, VMs 104E-L can host virtual workloads, which can include application workloads, resources, and services, for example. On the other hand, servers 104A-D can host local workloads on a local storage and/or a remote storage, such as a remote database. However, in some cases, servers 104A-D can similarly host virtual workloads through VMs residing on the servers 104A-D.
VTEPs 108A-D can encapsulate packets directed at the various VNIDs 1-3 in the overlay network 100 according to the specific overlay protocol implemented, such as VXLAN, so traffic can be properly transmitted to the correct VNID and recipient(s) (i.e., server or VM). Moreover, when a switch, router, VTEP, or any other network device receives a packet to be transmitted to a recipient in the overlay network 100, it can consult a routing table or virtual routing and forwarding (VRF) table, such as a lookup table, to determine where such packet needs to be transmitted so the traffic reaches the appropriate recipient. For example, if VTEP 108A receives a packet from an endpoint that is intended for VM 104E, VTEP 108A can consult a routing table that maps the intended VM, VM 104E, to a specific network device (e.g., VTEP 108C) that is configured to handle communications intended for endpoint that VM (e.g., VM 104E). VTEP 108A might not initially know, when it receives the packet from the endpoint, that such packet should be transmitted to VTEP 108C in order to reach VM 104E. Thus, by consulting the routing table, VTEP 108A can lookup VM 104E, which is the intended recipient, and determine that the packet should be transmitted to VTEP 108C, as specified in the routing table based on endpoint-to-switch mappings or bindings, so the packet can be transmitted to, and received by, VM 104E as expected.
As one of ordinary skill in the art will readily recognize, the examples provided above are non-limiting examples provided for explanation purposes, and can include other variations of protocols, topologies, or devices.
In practice, network node R1 receives OAM packet 210 that is addressed for destination node R4. As illustrated, OAM packet 210 includes a variety of data fields including: a transport encapsulation layer, an overlay header, an overlay OAM header, and an OAM TLV field. In this example, OAM packet 210 is configured to cause the transit nodes to perform a traceroute function. As such, once OAM packet 210 is received by node R1, the TTL is decremented (e.g., to 0) and the packet is decapsulated such that R2 can read the overlay header. However, in scenarios wherein a transit node (e.g., R2) correspond with an overlay type different from that of the packet's overlay header, the transit node cannot read the overlay header and the packet is dropped. Therefore, in the illustrated scenario, transit node R2 drops OAM packet 210 without issuing a reply to R1, and without forwarding OAM packet 210 toward its intended destination at R4.
As discussed in further detail below, aspects of the subject technology employ an encapsulation method that inserts a transport OAM header into the OAM packet, providing instructions to a receiving transit node as to how to read the requisite data fields.
In the OAM packet transit scenario illustrated by
In the illustrated example, an OAM trace route function is performed by R2, with a reply sent to R1 and a forwarding of OAM packet 212 to the next transit node, e.g., R3. By providing OAM packet 212 with an encapsulation (e.g., a transport OAM header encapsulation), intermediate transit nodes of are able to access the OAM TLV irrespective of their overlay implementation type.
It is understood that additional (or fewer) data fields can be included in OAM packet without departing from the scope of the subject technology. For example overlay metadata 306 may be optionally included.
In the illustrated example transfer OAM header 315 includes multiple data segments including “ver,” “flags,” “OAM TLV offset,” “NextProto”, and one or more optional TLVs. It is understood that a greater (or fewer) number of data segments can be included in transport OAM header 315 without departing from the scope of the technology. In the example depicted by in
Subsequently, in step 404 the OAM packet is encapsulated with a transport header (e.g., a transport OAM header) that is configured to be read by transit nodes of different overlay types. As discussed above, the transport OAM header can include a pointer for indicating a location of the packets OAM TLV data field to a transit node. That is, in some aspects, the pointer of the transport header contain data indicating asize (or bit length) of the OAM packet header.
The interfaces 568 are typically provided as interface cards (sometimes referred to as “line cards”). Generally, they control the sending and receiving of data packets over the network and sometimes support other peripherals used with the router 510. Among the interfaces that may be provided are Ethernet interfaces, frame relay interfaces, cable interfaces, DSL interfaces, token ring interfaces, and the like. In addition, various very high-speed interfaces may be provided such as fast token ring interfaces, wireless interfaces, Ethernet interfaces, Gigabit Ethernet interfaces, ATM interfaces, HSSI interfaces, POS interfaces, FDDI interfaces and the like. Generally, these interfaces may include ports appropriate for communication with the appropriate media. In some cases, they may also include an independent processor and, in some instances, volatile RAM. The independent processors may control such communications intensive tasks as packet switching, media control and management. By providing separate processors for the communications intensive tasks, these interfaces allow the master microprocessor 562 to efficiently perform routing computations, network diagnostics, security functions, etc.
Although the system shown in
Regardless of the network device's configuration, it may employ one or more memories or memory modules (including memory 561) configured to store program instructions for the general-purpose network operations and mechanisms for roaming, route optimization and routing functions described herein. The program instructions may control the operation of an operating system and/or one or more applications, for example. The memory or memories may also be configured to store tables such as mobility binding, registration, and association tables, etc.
To enable user interaction with the computing device 600, an input device 645 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 635 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 640 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 630 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) 625, read only memory (ROM) 620, and hybrids thereof.
The storage device 630 can include software modules 632, 634, 636 for controlling the processor 610. Other hardware or software modules are contemplated. The storage device 630 can be connected to the system bus 605. 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 610, bus 605, display 635, and so forth, to carry out the function.
Chipset 660 can also interface with one or more communication interfaces 690 that can have different physical interfaces. Such communication interfaces can include interfaces for wired and wireless local area networks, for broadband wireless networks, as well as personal area networks. Some applications of the methods for generating, displaying, and using the GUI disclosed herein can include receiving ordered datasets over the physical interface or be generated by the machine itself by processor 655 analyzing data stored in storage 670 or 675. Further, the machine can receive inputs from a user via user interface components 685 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 655.
It can be appreciated that example systems 600 and 650 can have more than one processor 610 or be part of a group or cluster of computing devices networked together to provide greater processing capability.
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 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. Moreover, 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.
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 | Sep 1996 | A |
5600638 | Bertin et al. | Feb 1997 | A |
5687167 | Bertin et al. | Nov 1997 | A |
6115384 | Parzych | Sep 2000 | A |
6167438 | Yates et al. | Dec 2000 | A |
6400681 | Bertin et al. | Jun 2002 | B1 |
6661797 | Goel et al. | Dec 2003 | B1 |
6687229 | Kataria et al. | Feb 2004 | B1 |
6799270 | Bull et al. | Sep 2004 | B1 |
6888828 | Partanen et al. | May 2005 | B1 |
6993593 | Iwata | Jan 2006 | B2 |
7027408 | Nabkel et al. | Apr 2006 | B2 |
7062567 | Benitez et al. | Jun 2006 | B2 |
7095715 | Buckman et al. | Aug 2006 | B2 |
7096212 | Tribble et al. | Aug 2006 | B2 |
7139239 | Mcfarland et al. | Nov 2006 | B2 |
7165107 | Pouyoul et al. | Jan 2007 | B2 |
7197008 | Shabtay et al. | Mar 2007 | B1 |
7197660 | Liu et al. | Mar 2007 | B1 |
7209435 | Kuo et al. | Apr 2007 | B1 |
7227872 | Biswas et al. | Jun 2007 | B1 |
7231462 | Berthaud et al. | Jun 2007 | B2 |
7333990 | Thiagarajan et al. | Feb 2008 | B1 |
7443796 | Albert et al. | Oct 2008 | B1 |
7458084 | Zhang et al. | Nov 2008 | B2 |
7472411 | Wing et al. | Dec 2008 | B2 |
7486622 | Regan et al. | Feb 2009 | B2 |
7536396 | Johnson et al. | May 2009 | B2 |
7552201 | Areddu et al. | Jun 2009 | B2 |
7558261 | Arregoces et al. | Jul 2009 | B2 |
7567504 | Darling et al. | Jul 2009 | B2 |
7571470 | Arregoces et al. | Aug 2009 | B2 |
7573879 | Narad et al. | Aug 2009 | B2 |
7610375 | Portolani et al. | Oct 2009 | B2 |
7643468 | Arregoces et al. | Jan 2010 | B1 |
7644182 | Banerjee et al. | Jan 2010 | B2 |
7647422 | Singh et al. | Jan 2010 | B2 |
7657898 | Sadiq | Feb 2010 | B2 |
7657940 | Portolani et al. | Feb 2010 | B2 |
7668116 | Wijnands et al. | Feb 2010 | B2 |
7684321 | Muirhead et al. | Mar 2010 | B2 |
7738469 | Shekokar et al. | Jun 2010 | B1 |
7751409 | Carolan | Jul 2010 | B1 |
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 | Balasubramaniam Chandra | Jan 2012 | B2 |
8116307 | Thesayi et al. | Feb 2012 | B1 |
8166465 | Feblowitz et al. | Apr 2012 | B2 |
8180909 | Hartman et al. | May 2012 | B2 |
8191119 | Wing et al. | May 2012 | B2 |
8195774 | Lambeth et al. | Jun 2012 | B2 |
8280354 | Smith et al. | Oct 2012 | B2 |
8281302 | Durazzo et al. | Oct 2012 | B2 |
8291108 | Raja et al. | Oct 2012 | B2 |
8305900 | Bianconi | Nov 2012 | B2 |
8311045 | Quinn et al. | Nov 2012 | B2 |
8316457 | Paczkowski et al. | Nov 2012 | B1 |
8355332 | Beaudette et al. | Jan 2013 | B2 |
8442043 | Sharma et al. | May 2013 | B2 |
8451817 | Cheriton | May 2013 | B2 |
8464336 | Wei et al. | Jun 2013 | B2 |
8473981 | Gargi | Jun 2013 | B1 |
8479298 | Keith et al. | Jul 2013 | B2 |
8498414 | Rossi | Jul 2013 | B2 |
8520672 | Guichard et al. | Aug 2013 | B2 |
8601152 | Chou | Dec 2013 | B1 |
8605588 | Sankaran et al. | Dec 2013 | B2 |
8612612 | Dukes et al. | Dec 2013 | B1 |
8627328 | Mousseau et al. | Jan 2014 | B2 |
8645952 | Biswas et al. | Feb 2014 | B2 |
8676965 | Gueta | Mar 2014 | B2 |
8676980 | Kreeger et al. | Mar 2014 | B2 |
8700892 | Bollay et al. | Apr 2014 | B2 |
8724466 | Kenigsberg et al. | May 2014 | B2 |
8730980 | Bagepalli et al. | May 2014 | B2 |
8743885 | Khan et al. | Jun 2014 | B2 |
8751420 | Hjelm et al. | Jun 2014 | B2 |
8762534 | Hong et al. | Jun 2014 | B1 |
8762707 | Killian et al. | Jun 2014 | B2 |
8792490 | Jabr et al. | Jul 2014 | B2 |
8793400 | Mcdysan et al. | Jul 2014 | B2 |
8812730 | Vos et al. | Aug 2014 | B2 |
8819419 | Carlson et al. | Aug 2014 | B2 |
8825070 | Akhtar et al. | Sep 2014 | B2 |
8830834 | Sharma et al. | Sep 2014 | B2 |
8904037 | Haggar et al. | Dec 2014 | B2 |
8984284 | Purdy, Sr. et al. | Mar 2015 | B2 |
9001827 | Appenzeller | Apr 2015 | B2 |
9071533 | Hui et al. | Jun 2015 | B2 |
9077661 | Andreasen et al. | Jul 2015 | B2 |
9088584 | Feng et al. | Jul 2015 | B2 |
9130872 | Kumar et al. | Sep 2015 | B2 |
9143438 | Khan et al. | Sep 2015 | B2 |
9160797 | Mcdysan | Oct 2015 | B2 |
9178812 | Guichard et al. | Nov 2015 | B2 |
9189285 | Ng et al. | Nov 2015 | B2 |
9203711 | Agarwal et al. | Dec 2015 | B2 |
9253274 | Quinn et al. | Feb 2016 | B2 |
9300579 | Frost et al. | Mar 2016 | B2 |
9300585 | Kumar et al. | Mar 2016 | B2 |
9311130 | Christenson et al. | Apr 2016 | B2 |
9319324 | Beheshti-Zavareh et al. | Apr 2016 | B2 |
9325565 | Yao et al. | Apr 2016 | B2 |
9338097 | Anand et al. | May 2016 | B2 |
9344337 | Kumar et al. | May 2016 | B2 |
9374297 | Bosch et al. | Jun 2016 | B2 |
9379931 | Bosch et al. | Jun 2016 | B2 |
9385950 | Quinn et al. | Jul 2016 | B2 |
9398486 | La Roche, Jr. et al. | Jul 2016 | B2 |
9407540 | Kumar et al. | Aug 2016 | B2 |
9413655 | Shatzkamer et al. | Aug 2016 | B2 |
9424065 | Singh et al. | Aug 2016 | B2 |
9436443 | Chiosi et al. | Sep 2016 | B2 |
9444675 | Guichard et al. | Sep 2016 | B2 |
9473570 | Bhanujan et al. | Oct 2016 | B2 |
9479443 | Bosch et al. | Oct 2016 | B2 |
9491094 | Patwardhan et al. | Nov 2016 | B2 |
9537836 | Maller et al. | Jan 2017 | B2 |
9558029 | Behera et al. | Jan 2017 | B2 |
9559970 | Kumar et al. | Jan 2017 | B2 |
9571405 | Pignataro et al. | Feb 2017 | B2 |
9608896 | Kumar et al. | Mar 2017 | B2 |
9614739 | Kumar et al. | Apr 2017 | B2 |
9660909 | Guichard et al. | May 2017 | B2 |
9723106 | Shen et al. | Aug 2017 | B2 |
9774533 | Zhang et al. | Sep 2017 | B2 |
9794379 | Kumar et al. | Oct 2017 | B2 |
9882776 | Aybay et al. | Jan 2018 | B2 |
9929945 | Schultz et al. | Mar 2018 | B2 |
10003530 | Zhang et al. | Jun 2018 | B2 |
20010023442 | Masters | Sep 2001 | A1 |
20020085562 | Hufferd | 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 | Lake, Sr. et al. | Jul 2004 | A1 |
20040199812 | Earl | Oct 2004 | A1 |
20040213160 | Regan et al. | Oct 2004 | A1 |
20040264481 | Darling et al. | Dec 2004 | A1 |
20040268357 | Joy et al. | Dec 2004 | A1 |
20050044197 | Lai | Feb 2005 | A1 |
20050058118 | Davis | Mar 2005 | A1 |
20050060572 | Kung | Mar 2005 | A1 |
20050086367 | Conta et al. | Apr 2005 | A1 |
20050120101 | Nocera | Jun 2005 | A1 |
20050152378 | Bango et al. | Jul 2005 | A1 |
20050157645 | Rabie et al. | Jul 2005 | A1 |
20050160180 | Rabje et al. | Jul 2005 | A1 |
20050204042 | Banerjee et al. | Sep 2005 | A1 |
20050210096 | Bishop et al. | Sep 2005 | A1 |
20050257002 | Nguyen | Nov 2005 | A1 |
20050281257 | Yazaki et al. | Dec 2005 | A1 |
20050286540 | Hurtta et al. | Dec 2005 | A1 |
20050289244 | Sahu et al. | Dec 2005 | A1 |
20060005240 | Sundarrajan et al. | Jan 2006 | A1 |
20060031374 | Lu et al. | Feb 2006 | A1 |
20060045024 | Previdi et al. | Mar 2006 | A1 |
20060074502 | Mcfarland | Apr 2006 | A1 |
20060092950 | Arregoces et al. | May 2006 | A1 |
20060095960 | Arregoces et al. | May 2006 | A1 |
20060112400 | Zhang et al. | May 2006 | A1 |
20060155862 | Kathi et al. | Jul 2006 | A1 |
20060168223 | Mishra et al. | Jul 2006 | A1 |
20060233106 | Achlioptas et al. | Oct 2006 | A1 |
20060233155 | Srivastava | Oct 2006 | A1 |
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 |
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 |
20160099853 | Nedeltchev et al. | Apr 2016 | A1 |
20160119159 | Zhao et al. | Apr 2016 | A1 |
20160119253 | Kang et al. | Apr 2016 | A1 |
20160127139 | Tian et al. | May 2016 | A1 |
20160134518 | Callon et al. | May 2016 | A1 |
20160134535 | Callon | May 2016 | A1 |
20160139939 | Bosch et al. | May 2016 | A1 |
20160164776 | Biancaniello | Jun 2016 | A1 |
20160165014 | Nainar et al. | Jun 2016 | A1 |
20160173373 | Guichard et al. | Jun 2016 | A1 |
20160173464 | Wang et al. | Jun 2016 | A1 |
20160182336 | Doctor et al. | Jun 2016 | A1 |
20160182342 | Singaravelu et al. | Jun 2016 | A1 |
20160182684 | Connor et al. | Jun 2016 | A1 |
20160212017 | Li et al. | Jul 2016 | A1 |
20160226742 | Apathotharanan et al. | Aug 2016 | A1 |
20160248685 | Pignataro et al. | Aug 2016 | A1 |
20160277250 | Maes | Sep 2016 | A1 |
20160285720 | Mäenpää et al. | Sep 2016 | A1 |
20160323165 | Boucadair et al. | Nov 2016 | A1 |
20160352629 | Wang et al. | Dec 2016 | A1 |
20160380966 | Gunnalan et al. | Dec 2016 | A1 |
20170019303 | Swamy et al. | Jan 2017 | A1 |
20170031804 | Ciszewski et al. | Feb 2017 | A1 |
20170078175 | Xu et al. | Mar 2017 | A1 |
20170187609 | Lee et al. | Jun 2017 | A1 |
20170208000 | Bosch et al. | Jul 2017 | A1 |
20170214627 | Zhang et al. | Jul 2017 | A1 |
20170237656 | Gage et al. | Aug 2017 | A1 |
20170250917 | Ruckstuhl et al. | Aug 2017 | A1 |
20170272470 | Gundamaraju et al. | Sep 2017 | A1 |
20170279712 | Nainar et al. | Sep 2017 | A1 |
20170310611 | Kumar et al. | Oct 2017 | A1 |
20170331741 | Fedyk et al. | Nov 2017 | A1 |
20180013841 | 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 |
---|---|---|
103716123 | 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 |
---|
3GPP TR 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. |
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. |
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. |
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. |
3GPP TS 29.212 V13.1.0 (Mar. 2015) Technical Specification: 3rd Generation Partnership Project; Technical Specification Group Core Network and Terminals; Policy and Chargig Control (PCC); Reference points (Release 13), 3rd Generation Partnership Project (3GPP), 650 Route des Lucioles—Sophia Antipolis Valbonne—France, Mar. 2015; 230 pages. |
U.S. Appl. No. 15/252,028, filed Aug. 30, 2016, entitled “System and Method for Managing Chained Services in a Network Environment,” Inventor(s): Hendrikus G.P. Bosch, et al. |
P. Quinn, et al., “Network Service Header,” Network Working Group, Feb. 14, 2014, 21 pages; https://svn.tools.ietf.org/html/draft-quinn-sfc-nsh-02. |
P. Quinn, et al., “Service Function Chaining (SFC) Architecture,” Network Working Group, May 5, 2014, 31 pages; https://svn.tools.ietf.org/html/draft-quinn-sfc-arch-05. |
International Search Report and Written Opinion from the International Searching Authority, dated Aug. 30, 2017, for the corresponding International Application No. PCT/US2017/040575, 13 pages. |
Aldrin, S., et al. “Service Function Chaining Operation, Administration and Maintenance Framework,” Internet Engineering Task Force, Oct. 26, 2014, 13 pages. |
Author Unknown, “ANSI/SCTE 35 2007 Digital Program Insertion Cueing Message for Cable,” Engineering Committee, Digital Video Subcommittee, American National Standard, Society of Cable Telecommunications Engineers, © Society of Cable Telecommunications Engineers, Inc. 2007 All Rights Reserved, 140 Philips Road, Exton, PA 19341; 42 pages. |
Author Unknown, “AWS Lambda Developer Guide,” Amazon Web Services Inc., May 2017, 416 pages. |
Author Unknown, “CEA-708,” from Wikipedia, the free encyclopedia, Nov. 15, 2012; 16 pages http://en.wikipedia.org/w/index.php?title=CEA-708&oldid=523143431. |
Author Unknown, “Cisco and Intel High-Performance VNFs on Cisco NFV Infrastructure,” White Paper, Cisco and Intel, Oct. 2016, 7 pages. |
Author Unknown, “Cloud Functions Overview,” Cloud Functions Documentation, Mar. 21, 2017, 3 pages; https://cloud.google.com/functions/docs/concepts/overview. |
Author Unknown, “Cloud-Native VNF Modelling,” Open Source Mano, © ETSI 2016, 18 pages. |
Author Unknown, “Digital Program Insertion,” from Wikipedia, the free encyclopedia, Jan. 2, 2012; 1 page http://en.wikipedia.org/w/index.php?title=Digital_Program_Insertion&oldid=469076482. |
Author Unknown, “Dynamic Adaptive Streaming over HTTP,” from Wikipedia, the free encyclopedia, Oct. 25, 2012; 3 pages, http://en.wikipedia.org/w/index.php?title=Dynannic_Adaptive_Streanning_over_HTTP&oldid=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, “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, “Understanding Azure, A Guide for Developers,” Microsoft Corporation, Copyright © 2016 Microsoft Corporation, 39 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. |
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. |
Cisco Systems, Inc. “Cisco NSH Service Chaining Configuration Guide,” Jul. 28, 2017, 11 pages. |
Ersue, Mehmet, “ETSI NFV Management and Orchestration—An Overview,” Presentation at the IETF# 88 Meeting, Nov. 3, 2013, 14 pages. |
Fayaz, Seyed K., et al., “Efficient Network Reachability Analysis using a Succinct Control Plane Representation,” 2016, ratul.org, pp. 1-16. |
Halpern, Joel, et al., “Service Function Chaining (SFC) Architecture,” Internet Engineering Task Force (IETF), Cisco, Oct. 2015, 32 pages. |
Hendrickson, Scott, et al. “Serverless Computation with OpenLambda,” Elastic 60, University of Wisconson, Madison, Jun. 20, 2016, 7 pages, https://www.usenix.org/system/files/conference/hotcloud16/hendrickson.pdf. |
Jiang, Yuanlong, et al., “Fault Management in Service Function Chaining,” Network Working Group, China Telecom, Oct. 16, 2015, 13 pages. |
Kumar, Surendra, et al., “Service Function Path Optimization: draft-kumar-sfc-sfp-optimization-00.txt,” Internet Engineering Task Force, IETF; Standard Working Draft, May 10, 2014, 14 pages. |
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, 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. |
Wong, Fei, et al., “SMPTE-TT Embedded in ID3 for HTTP Live Streaming, draft-smpte-id3-http-live-streaming-00,” Informational Internet Draft, Jun. 2012, 7 pages http://tools.ietf.org/htnnl/draft-snnpte-id3-http-live-streaming-00. |
Yadav, Rishi, “What Real Cloud-Native Apps Will Look Like,” Crunch Network, posted Aug. 3, 2016, 8 pages; https://techcrunch.com/2016/08/03/what-real-cloud-native-apps-will-look-like/. |
Alizadeh, Mohammad, et al., “CONGA: Distributed Congestion-Aware Load Balancing for Datacenters,” SIGCOMM '14, Aug. 17-22, 2014, 12 pages. |
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, “OpenNebula 4.6 User Guide,” Jun. 12, 2014, opennebula.org, 87 pages. |
Author Unknown, “Service-Aware Network Architecture Based on SDN, NFV, and Network Intelligence,” 2014, 8 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. |
Bremler-Barr, Anat, et al., “Deep Packet Inspection as a Service,” CoNEXT '14, Dec. 2-5, 2014, pp. 271-282. |
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. |
Farrel, A., et al., “A Path Computation Element (PCE)—Based Architecture,” RFC 4655, Network Working Group, Aug. 2006, 40 pages. |
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. |
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. |
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. |
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., “Service Function Chaining: Creating a Service Plane via Network Service Headers,” IEEE Computer Society, 2014, pp. 38-44. |
Zhang, Ying, et al. “StEERING: A Software-Defined Networking for Inline Service Chaining,” IEEE, 2013, IEEE, p. 10 pages. |
Number | Date | Country | |
---|---|---|---|
20180026884 A1 | Jan 2018 | US |