The present disclosure relates to networking for service chains/service paths.
Network services are widely deployed and essential in many networks. The services provide a range of functions such as security, wide area network (WAN) acceleration, firewall services, and server load balancing. Service functions that form part of the overall service may be physically located at different points in the network infrastructure, such as the wide area network, data center, campus, and so forth.
Current network service deployment models are relatively static, and bound to topology for insertion and policy selection. Furthermore, they do not adapt well to elastic service environments enabled by virtualization.
New data center network and cloud architectures require more flexible network service deployment models. Additionally, the transition to virtual platforms requires an agile service insertion model that supports elastic service delivery. The movement of service functions and application workloads in the network and the ability to easily bind service policy to granular information such as per-subscriber state are particularly useful.
Overview
Presented herein are techniques performed in a network comprising a plurality of network nodes each configured to apply one or more service functions to traffic that passes the respective network nodes in a service path. At a network node, an indication is received of a failure or degradation of one or more service functions or applications applied to traffic at the network node. Data descriptive of the failure or degradation is generated. A previous service hop network node at which a service function or application was applied to traffic in the service path is determined. The data descriptive of the failure or degradation is communicated to the previous service hop network node.
Example Embodiments
A service chain is defined as a set of service functions, e.g., firewall, network address translation (NAT), deep packet inspection (DPI), intrusion detection service (IDS), and the order in which they should be applied to selective packets as they are forwarded through a service-path. This form of service chaining, while useful, does not provide enough functionality for the delivery of more complex services that rely upon the binding of service policy to granular information such as per-subscriber state, or receipt of metadata specifically formatted for consumption by a particular service function. Examples of metadata specifically formatted for consumption by a service function include application identification, network forwarding context, flow identifier and user identity. Such advanced services require that service context and metadata be carried within service headers as part of the data-plane encapsulation.
Service chain construction involves establishment of a binding between forwarding state and the service chain. This mapping of forwarding-state to the service chain defines the service path and is most typically formed using a network overlay. Service nodes perform operations and service functions on packets that are forwarded through the service path.
While the control and data-plane elements of a service path are well understood, it is not currently possible to determine which service hop was the last successful one to have been applied should failures such as black holing, dropping, or incorrect forwarding of packets occur along the service path. This creates an operational/security problem, as packets may not reach the expected service nodes as defined by the appropriate service policies or worse still have service functions misapplied to them. These two issues are critical problems to solve: the operational/security implications such as the wrong firewall policy being applied to the traffic threaten the robustness of the solution.
All of these issues result in the same observed behavior. Operators/customers do not see the end-to-end packet flow as traffic passes through each service hop along the service path. The goal therefore is to identify which is the root cause and at which service hop/service node.
There is a need for a solution that is able to detect failures and/or function degradation at the application and/or service function layer so that preventative measures may be taken to bypass the failure. In addition, such a solution should either provide the methods necessary for communication of said failures using the data plane to upstream service nodes/load balancers, and/or send notifications and details of the failure type to an off-board Operations and Management (OAM) manager, or service controller/orchestration system.
According to one aspect of the techniques presented herein, a method is provided to (i) detect failures and/or function degradation at the application and/or service function layers, (ii) communicate details of the failure type through the advertisement of metadata in the data plane, and/or communicate details of the failure type through the advertisement of metadata to an off-board OAM manager or service controller/orchestration system, and (iii) provide application and/or service function failure bypass through manipulation of the service node/load balancer Equal Cost Multiple Path (ECMP) process. ECMP is a routing strategy in which next-hop packet forwarding to a single destination can occur over multiple “best paths” which tie for top place in routing metric calculations.
According to another aspect of the techniques presented herein, a network operator may activate a troubleshooting function upon detection of such failures along a service path, to allow for debugging/troubleshooting data to be sent to an off-board OAM manager so that the network operator may take corrective action having discovered the last successfully applied service hop of the service path/service chain.
Verification of the integrity and forwarding state of a service path is a fundamental requirement for any network operator. Currently, this verification process may be performed in one of two ways; (i) using real user traffic, and (ii) using OAM packets that may be forwarded to an on-board OAM function at a service node to verify operation and status of a given service function. However, both of these methods present challenges that do not fully satisfy all verification requirements.
Using real user traffic for verification of a service path has the implication that a user traffic flow is effectively “hijacked” for OAM purposes; this is not only undesirable but presents issues with regards to billing and service level agreement management. Using OAM packets punted to an on-board OAM function does not truly verify the service path as such OAM packets are taken from the normal processing path at each service hop and are presented to an OAM processing module for verification.
Thus, according to still another aspect, techniques are presented herein for service path verification that do not rely upon user traffic or an on-board OAM processing module but rather use the functions of Network Service Headers (NSHs) and therefore verifies the same forwarding path as that used for user data sent through the service chain.
In accordance with the techniques presented herein, service nodes utilize information carried within service headers in the data-plane, such as network classification used for deriving targeted service policies and profiles. Service nodes may also determine common metadata related to a particular service such as finer classification that can be passed to the service functions further down the service-path. In other words, services benefit from metadata derived both from the network as well as the service functions that form a given service chain. Metadata can also be passed from network node to network node with a service between network nodes.
The metadata imposed by the network node originating the service chain is a combination of the metadata pushed by a central controller and metadata determined by the network node itself. Controllers push network classification specific metadata to all the network nodes that act as classifiers. These network nodes perform the classification and choose the assigned metadata for that classification along with the forwarding state. The determined metadata could be related to aspects of the service topology such as tenant identity. The implication of associating such metadata to the forwarding state and passing it to the functions that provide services is that more complex services can be delivered, for instance, on a tenant boundary for a given service-path. This can result in simpler services because the services do not need to derive information or re-classify every packet/flow.
Reference is now made to
There is also a network management station 80 that may be coupled to the controller 20 to communicate with the service nodes (or may communicate with the service nodes indirectly) in order to perform various network management functions as described herein.
The Network Service Header
Service chaining techniques are enabled through the use of transport independent Network Service Headers (NSH) in the data plane. The NSH 100 comprises a plurality of headers, and as will become apparent, these headers contain service related information and have two main elements:
The NSH 100 is designed to be easy to implement across a range of devices, both physical and virtual, including hardware forwarding elements. The NSH 100 addresses several limitations associated with network service deployment today.
Topological Dependencies: network service deployments are often coupled to the physical network topology creating artificial constraints on delivery. These topologies serve only to “insert” the service function; they are not required from a native packet delivery perspective. For example, firewalls often require an “in” and “out” layer-2 segment and adding a new firewall requires changing the topology i.e. adding new layer-2 segments. This is restrictive because as more services are required—often with strict ordering—topology changes are needed before and after each service resulting in complex network changes and device configuration. In such topologies, all traffic, whether a service needs to be applied or not, will often pass through the same strict order. A common example is web servers using a server load balancer as the default gateway. When the web service responds to non-load balanced traffic (e.g. administrative or backup operations), all traffic from the server must traverse the load balancer forcing network administrators to create complex routing schemes or create additional interfaces to provide an alternate topology.
Service Chaining: service functions are most typically independent, e.g. service-function-1 and service-function-2 are unrelated and there is no notion at the service layer that service-function-1 occurs before service-function-2. However, to an administrator many service functions have a strict ordering that must be in place yet there is no consistent way to impose and verify the deployed service ordering.
Service Policy Application: service functions rely on either topology information such as virtual local area networks (VLANs) or packet (re)classification to determine service policy selection, the service action taken. Topology information is increasingly less viable due to scaling, tenancy, and complexity reasons. Per-service function packet classification is inefficient and prone to errors, duplicating functionality across services. Furthermore, packet classification is often too coarse lacking the ability to determine class of traffic with enough detail.
Elastic Service Delivery: given the current state of the art for adding/removing services largely centers around VLANs and routing changes, rapid changes to the service layer can be difficult to realize due to the risk and complexity of such changes.
Common Header Format: various proprietary methods are used to share metadata and create service paths. An open header provides a common format for all network and service devices.
Transport Agnostic: services can and will be deployed in networks with a range of transports, including underlays and overlays. The coupling of services to topology requires services to support many transports or for a transport gateway function to be present.
There are three operational phases that work in tandem to detect and bypass an application/service function failure/degradation:
There are many reasons why an application/service function might fail and it is not always possible to detect such failures at the transport layer, as the underlying packet forwarding through the overlay network may be fully operational. Furthermore, complete application/service function failure is only one of the possible failure types; others include functional degradation, performance degradation above and beyond a specified threshold, unrelated failure of the network element hosting the application/service function, etc.
Reference is now made to
Advertisement of Application/Service Function Failure Type Through the Use of Metadata
Once an application/service function failure or degradation has been detected and reported to the OAM manager of the hosting service node, it is necessary that other network elements be informed so that corrective action may be taken to bypass the failure. This may be achieved in a distributed or centralized fashion by communicating the failure through the data plane (as opposed to using a signaling protocol for this purpose such as is done today for transport link/node failures) to upstream network elements (distributed), or by advertising the failure to an off-board OAM manager or centralized service orchestration controller (centralized).
Accordingly, the service node hosting the failed or degraded service function generates metadata to include details of the application/service function failure and to be communicated either within the data plane to interested upstream network elements, or through whatever northbound protocol is appropriate for communication with a centralized service orchestration system generally represented by the controller 20 shown in
To communicate application/service function failure metadata, in accordance with one example, a common header is defined to be used for carrying metadata in a NSH 100 for Internet Protocol (IPv4), IPv6, and Multiprotocol Label Switching (MPLS) packets as shown in
The Metadata Channel Header 110 provides for a “Metadata Channel Type” (MCT) that specifies the type of metadata carried within the packet. For the purposes of these techniques, a new MCT is defined called “Application/Service Function Failure” with a value equal to be determined. Details of the application/service function failure are carried within the Metadata Channel 112 that follows the Metadata Channel Header 110. The original payload of the packet is shown at 114 and is the original packet that was sent into the network. In this case, it would be blank or empty as the packet is generated by the service node that detects the service function failure.
As an alternative to the Common Metadata Header it is also possible to carry the application/service function failure information within the NSH (through definition of an opaque context header defined for that purpose). In order for a service node (that is hosting a failed or degraded service function) to know which particular upstream network elements to advertise the metadata to, the NSH 100 referred to above in connection with
The NSH 100 may be constructed as shown in
One form of the base service header 105 is shown in more detail in
The protocol type field 107 indicates the protocol type of the original packet or frame. The service index field 108 specifies time-to-live (TTL) functionality and location within the service path. The service index is decremented by service nodes after performing required service function(s).
The service path identifier field 109 identifies a particular service path. A participating node uses this identifier for path selection.
The combination of the service path identifier and service index carried within the NSH is used for identification of which specific service functions should be applied to packets. Each service path identifier is a unique value that points to an ordered list of service functions (e.g., service-function-1, service-function-2, service-function-3) and the service index is decremented by 1 at each service hop so that a Service Node receiving a packet prefaced with a NSH is able to identify which of the ordered list of service functions it should apply.
Using this mechanism combined with the service hop context header 120, the OAM manager function at the service node that is hosting the failed application/service function is able to identify the previously applied service function and service hop and therefore send its metadata to that specific network node.
Traffic Bypass of the Service Node Hosting the Failed Application/Service Function
Traffic bypass of the service node hosting a failed application/service function is triggered through the receipt of the “Application/Service Function Failure” metadata (or NSH context header in lieu of the metadata MCT) at the previous service hop network element, or through instruction from an orchestration system.
In current networking systems, load balancers use schemes to detect failures and take them out of their predictors. There are two key differences; (i) load balancers use signaling to achieve this rather than an explicit data plane trigger, and (ii) load balancers detect failures in the forwarding path (link/node failure) as opposed to failures at the application and/or service function layers.
By contrast, the techniques presented herein trigger traffic bypass through receipt of failure information within the data plane. Receipt of the failure information forces a service node/load balancer to remove the failing elements from their predictors (or mark the next-hop as inoperative within their ECMP function) and select a different service hop from the updated set of available next-hops.
Turning to
In summary of the concepts presented above in connection with
There are numerous advantages associated with these techniques. They provide the capability to generate “application/service function failure” metadata or NSH opaque context headers, from an OAM manager function at a service node upon detection of failure or degradation of functionality. This enables identification of the previous service hop of a service chain and advertisement of the generated metadata to the previous service hop network element so as to trigger automatic traffic bypass of the failing or degraded service node. In addition, a service node/load balancer can trigger traffic bypass by manipulation of their ECMP decision process through correlation of the “application/service function failure” metadata or NSH opaque context headers, and available service node next-hops for the required service function. Further still, these techniques allow for the correlation of “application/service function failure” metadata or opaque NSH context headers at an off-board OAM manager and/or centralized controller/orchestration system.
Reference is now made to
The base service header 105 (as depicted in
The (T) bit shown in
Normal processing of the packet through the service path continues so that each service node along the service path is forced to generate debugging/troubleshooting information that can be correlated at an off-board OAM manager so that corrective action may be taken by the network operator or orchestration system having discovered the last successfully applied service hop of the service chain. An example of an off-board OAM manager is the network management station 80 shown in
Turning to
Synthetic user data is injected at the entry point into a service path, e.g., by a classifier (head-end node) in response to a command received from a controller 20 or network management station 80 (
Synthetic packets may be used in two modes:
Additionally, two modes for verification of the service path may be defined:
The intelligence to decide when to inject a synthetic packet may reside in the controller 20 shown in
Thus, the techniques depicted in
The operations of a service function or application associated with network node 700 are implemented by service function or application software 770 running on a processor core or server blade 760 that is in communication with a port, e.g., port 710(m), of the network node. In addition, there is monitoring software 780 running on the processor core or server blade 760 to perform monitoring of the service function in order to detect when a degradation or failure occurs in the associated service function or application at the network node. The monitoring software 780 performs the aforementioned monitoring process shown at reference numeral 64 in
The memory 730 may comprise read only memory (ROM), random access memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. In general, the memory 730 may comprise one or more tangible (non-transitory) computer readable storage media (e.g., a memory device) encoded with software comprising computer executable instructions and when the software is executed (by the processor 720) it is operable to perform the operations described herein.
Turning now to
The memory 820 may comprise read only memory (ROM), random access memory (RAM), magnetic disk storage media devices, optical storage media devices, flash memory devices, electrical, optical, or other physical/tangible memory storage devices. In general, the memory 820 may comprise one or more tangible (non-transitory) computer readable storage media (e.g., a memory device) encoded with software comprising computer executable instructions and when the software is executed (by the processor 810) it is operable to perform the operations described herein.
Thus, the techniques presented herein may be embodied in a method, an apparatus and computer readable storage media, for example. In method form, the method involves, in a network comprising a plurality of network nodes each configured to apply one or more service functions to traffic that passes the respective network nodes in a service path, receiving at a network node an indication of a failure or degradation of a service function or application applied to traffic at the network node; generating data descriptive of the failure or degradation; determining a previous service hop network node at which a service function or application was applied to traffic in the service path; and communicating the data descriptive of the failure or degradation to the previous service hop network node.
In apparatus form, an apparatus is provided comprising a network interface unit configured to enable communications over a network, the network comprising a plurality of network nodes each configured to apply one or more service functions to traffic that passes through the respective network nodes; memory; and a processor coupled to the network interface unit and the memory, wherein the processor is configured to: receive at a network node an indication of a failure or degradation of a service function or application applied to traffic at the network node; generate data descriptive of the failure or degradation; determine a previous service hop network node at which a service function or application was applied to traffic in the service path; and communicate the data descriptive of the failure or degradation to the previous service hop network node.
In computer readable storage media form, one or more computer readable storage media are provided encoded with software comprising computer executable instructions and when the software is executed operable to: receive at a network node an indication of a failure or degradation of a service function or application applied to traffic at the network node; generate data descriptive of the failure or degradation; determine a previous service hop network node at which a service function or application was applied to traffic in the service path; and communicate the data descriptive of the failure or degradation to the previous service hop network node.
Described above are examples. The concepts described herein may be embodied in other specific forms without departing from the spirit or essential characteristics thereof. The foregoing examples are therefore to be considered in all respects illustrative and not meant to be limiting. Accordingly, it is intended to embrace all such alterations, modifications and variations that fall within the spirit and scope of any claims filed in applications claiming priority hereto interpreted in accordance with the breadth to which they are fairly, legally and equitably entitled.
This application is a continuation of U.S. application Ser. No. 13/912,224, filed Jun. 7, 2014, the entirety of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5825772 | Dobbins et al. | Oct 1998 | A |
6687226 | Galyas | Feb 2004 | B1 |
6985488 | Pan et al. | Jan 2006 | B2 |
7197008 | Shabtay et al. | Mar 2007 | B1 |
7298693 | Owens et al. | Nov 2007 | B1 |
7457248 | Ali et al. | Nov 2008 | B1 |
7480283 | Sylvain | Jan 2009 | B1 |
7558261 | Arregoces et al. | Jul 2009 | B2 |
7571470 | Arregoces et al. | Aug 2009 | B2 |
7610375 | Portolani et al. | Oct 2009 | B2 |
7643468 | Arregoces et al. | Jan 2010 | B1 |
7657940 | Portolani et al. | Feb 2010 | B2 |
7804767 | Owens et al. | Sep 2010 | B1 |
7827256 | Phillips | Nov 2010 | B2 |
7895425 | Khalid et al. | Feb 2011 | B2 |
7983174 | Monaghan et al. | Jul 2011 | B1 |
8150963 | Baek et al. | Apr 2012 | B2 |
8254272 | Vasseur | Aug 2012 | B1 |
8311045 | Quinn et al. | Nov 2012 | B2 |
8369330 | Allan et al. | Feb 2013 | B2 |
8442043 | Sharma et al. | May 2013 | B2 |
8532087 | Kojima et al. | Sep 2013 | B2 |
8634314 | Banka | Jan 2014 | B2 |
8670326 | Balasubramanian | Mar 2014 | B1 |
9008511 | Lin et al. | Apr 2015 | B2 |
20010033548 | Saleh et al. | Oct 2001 | A1 |
20030193944 | Sasagawa | Oct 2003 | A1 |
20050089016 | Zhang et al. | Apr 2005 | A1 |
20050201278 | Banerjee et al. | Sep 2005 | A1 |
20060092950 | Arregoces et al. | May 2006 | A1 |
20060095960 | Arregoces et al. | May 2006 | A1 |
20060203720 | Kano | Sep 2006 | A1 |
20070201374 | Qing et al. | Aug 2007 | A1 |
20070237147 | Quinn et al. | Oct 2007 | A1 |
20070286204 | Ould-Brahim | Dec 2007 | A1 |
20080049621 | McGuire et al. | Feb 2008 | A1 |
20080049631 | Morrill | Feb 2008 | A1 |
20080052393 | McNaughton | Feb 2008 | A1 |
20080052628 | Bugenhagen | Feb 2008 | A1 |
20080120394 | Yokoyama et al. | May 2008 | A1 |
20080177896 | Quinn et al. | Jul 2008 | A1 |
20080225857 | Lange | Sep 2008 | A1 |
20080229025 | Plamondon | Sep 2008 | A1 |
20090037713 | Khalid et al. | Feb 2009 | A1 |
20090262651 | Liu | Oct 2009 | A1 |
20090304010 | Kurebayashi et al. | Dec 2009 | A1 |
20090323522 | Deguchi | Dec 2009 | A1 |
20100034205 | Kusama et al. | Feb 2010 | A1 |
20100058329 | Durazzo et al. | Mar 2010 | A1 |
20100077063 | Amit et al. | Mar 2010 | A1 |
20100128640 | Okamoto | May 2010 | A1 |
20100165985 | Sharma et al. | Jul 2010 | A1 |
20100278040 | He et al. | Nov 2010 | A1 |
20110023090 | Asati et al. | Jan 2011 | A1 |
20110045818 | Banks et al. | Feb 2011 | A1 |
20110054644 | Baek et al. | Mar 2011 | A1 |
20110292940 | Okamoto | Dec 2011 | A1 |
20110305136 | Pan et al. | Dec 2011 | A1 |
20110317696 | Aldrin | Dec 2011 | A1 |
20120078994 | Jackowski | Mar 2012 | A1 |
20120082048 | Taft et al. | Apr 2012 | A1 |
20120281540 | Khan et al. | Nov 2012 | A1 |
20130163594 | Sharma et al. | Jun 2013 | A1 |
20130232193 | Ali et al. | Sep 2013 | A1 |
20130272305 | Lefebvre et al. | Oct 2013 | A1 |
20130329546 | Wijnands | Dec 2013 | A1 |
20140029414 | Jain et al. | Jan 2014 | A1 |
20140050223 | Foo et al. | Feb 2014 | A1 |
20140064062 | Taillon et al. | Mar 2014 | A1 |
20140105031 | McDysan et al. | Apr 2014 | A1 |
20140105039 | McDysan | Apr 2014 | A1 |
20140215560 | Roberson | Jul 2014 | A1 |
20140304399 | Chaudhary | Oct 2014 | A1 |
20140307744 | Dunbar et al. | Oct 2014 | A1 |
20140334488 | Guichard et al. | Nov 2014 | A1 |
20140341029 | Allan et al. | Nov 2014 | A1 |
20140362682 | Guichard et al. | Dec 2014 | A1 |
Entry |
---|
Rosen, et al., “BGP/MPLS IP Virtual Private Networks (VPNs),” Network Working Group, RFC 4364, Feb. 2006, pp. 1-47. |
Joseph, et al., “A Policy-aware Switching Layer for Data Centers,” SIGCOMM'08, Aug. 17-22, 2008, Seattle, Washington, USA, pp. 51-62. |
Paul, et al., “OpenADN: Mobile Apps on Global Clouds Using OpenFlow and Software Defined Networking,” GC'12 Workshop: First International workshop on Management and Security technologies for Cloud Computing 2012, Dec. 2012, 5 pages. |
Gurbani, et al., “Session Initiation Protocol (SIP) Overload Control,” Internet Engineering Task Force (IETF), SOC Working Group, Internet-Draft, Intended status: Standards Track, May 23, 2013, 35 pages. |
Rosenberg, et al., “SIP: Session Initiation Protocol,” Internet Engineering Task Force (IETF), Network Working Group, Standards Track, Request for Comments: 3261, Jun. 2002, 269 pages. |
Hilt, et al., “Design Considerations for Session Initiation Protocol (SIP) Overload Control,” Internet Engineering Task Force (IETF), Informational, Request for Comments: 6357, Aug. 2011, 25 pages. |
Cisco, “Cisco Nexus 1000V Series Switches: Deploy Cisco vPath Service-Chaining Architecture,” White Paper, retrieved from http://www.cisco.com/c/en/us/products/collateral/switches/nexus-1000v-switch-vmware-vsphere/white—paper—c11-713736.html, on Sep. 16, 2014, pp. 1-4. |
International Search Report and Written Opinion in corresponding International Application No. PCT/US2014/038687, dated Sep. 28, 2015, 18 pages. |
International Preliminary Report on Patentability in counterpart International Application No. PCT/US2014/038687, dated Dec. 8, 2015,13 pages. |
Written Opinion for International Application No. PCT/US2014/059011, dated Jan. 29, 2015, 5 pages. |
International Search Report for International Application No. PCT/US2014/059011, dated Jan. 29, 2015, 4 pages. |
Written Opinion for International Application No. PCT/US2014/036789, dated Aug. 21, 2014, 8 pages. |
International Search Report for International Application No. PCT/US2014/036789, dated Aug. 21, 2014, 5 pages. |
Written Opinion for International Application No. PCT/US2014/036907, dated Nov. 10, 2014, 6 pages. |
International Search Report for International Application No. PCT/US2014/036907, dated Nov. 10, 2014, 3 pages. |
P. Quinn, et al., “Network Service Header” draft-quinn-sfc-nsh-03.txt, Network Working Group, Internet-Draft, Jul. 3, 2014, 27 pages. |
L. Fang, et al., “BGP IP VVPN Virtual PE”, draft-fang-13vpn-virtual-pe-02, Internet-Draft, Apr. 7, 2013, 25 pages. |
R. Fernando, et al., “Virtual Topologies for Service Chaining in BGP IP VPNs”, draft-rfernando-13vpn-service-chaining-01, Internet-Draft, Feb. 25, 2013, 16 pages. |
Number | Date | Country | |
---|---|---|---|
20160337209 A1 | Nov 2016 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13912224 | Jun 2013 | US |
Child | 15223235 | US |