Device for creating software defined ordered service patterns in a communications network
2 claims: 1 independent, 1 dependent
- 1A software defined network service, SDNS, node for altering a logical flow of data packets in a network to accommodate predetermined ordered service chains, comprising:a receiver (812) configured to receive an encapsulated data packet comprising a first tag via a encapsulated tunnel from another SDNS node, wherein the first tag identifies an ordered service chain or a next hop in the ordered service chain;a processor coupled to the receiver and configured to decapsulate the encapsulated data packet;and a transmitter (832) coupled to the processor and configured to forward the decapsulated data packet to a service device attached to the SDNS node when the processor determines, based on the first tag, that a service on the service device should be applied to the data packet;the receiver is further configured to receive a processed data packet from the service device;the processor is further configured to: classify the processed data packet;map the classification of the processed data packet to a second tag;encapsulate the processed data packet, wherein the encapsulated processed data packet comprises the second tag, wherein the second tag indicates the ordered service chain or the next hop in the ordered service chain;and cause the transmitter to forward the encapsulated processed data packet to a next SDNS node via a second encapsulated tunnel.
28 paragraphs in 5 sections, as filed
FIELD OF INVENTION
0001The present invention relates to network communication, and, in particular, to a system for creating software defined ordered service patterns in a communication network.
BACKGROUND
0002Network services are services hosted on a computer network. Network services are usually hosted by servers (or service devices) in the network to provide services or shared resources to client computers. Enterprises may configure network services on a local area network to ensure security, provide e-mail, and provide printing to their employees. Network services may also include a firewall and encryption/decryption services. A specific service may often be assigned or mapped to a specific port number in the network. In some networks, a series of services may need to be provided and the services may need to be provided in a specified order. The services provided and/or the order in which they are provided may change over time. Thus, the network may need to be reconfigured to accommodate the changes.
0003<nplcit id="ncit0001" npl-type="s"><text>ERIK NORDSTROM ET AL: "Serval: An End-Host Stack for Service-Centric Networking", 9th Usenix Symposium on networked Systems Design and Implementation, 25 April 2012, San Jose, CA</text></nplcit> discloses a network architecture named Serval. The Serval-to-TCP translator receives a Serval format packet with a serviceID. The serviceID is a global identifier uniquely identifies a specific service or a group of same services. A Serval-to-TCP/UDP translator converts a Serval connection into a legacy transport connection. After the conversion, the packet is forwarded by legacy IP routing.
0004<nplcit id="ncit0002" npl-type="s"><text>Salvestrini ET AL: "CHANGE: Enabling Innovation in the Internet Architecture through Flexible Flow-Processing Extensions D4.2 Inter-platform signalling", 30 January 2012, pages 1-68</text></nplcit> discloses only an MPLS network. The label in an MPLS packet is used by only one device in the path. Forwarding the decapsulated data packet is not disclosed. Moreover, a service device attached to the SDNS node being determined based on the tag is not disclosed.
SUMMARY
0005In one embodiment, the disclosure includes a software defined network service (SDNS) node for altering a logical flow of data packets in a network to accommodate predetermined ordered service chains, comprising a receiver configured to receive an encapsulated data packet comprising a tag via a encapsulated tunnel from another SDNS node, wherein the tag identifies an ordered service chain or a next hop in the ordered service chain, a processor coupled to the receiver and configured to decapsulate the encapsulated data packet, and a transmitter coupled to the processor and configured to forward the decapsulated data packet to a service device attached to the SDNS node when the processor determines, based on the tag, that a service on the service device should be applied to the data packet.
0006These and other features will be more clearly understood from the following detailed description taken in conjunction with the accompanying drawings and claims.
BRIEF DESCRIPTION OF THE DRAWINGS
0007For a more complete understanding of this disclosure, reference is now made to the following brief description, taken in connection with the accompanying drawings and detailed description, wherein like reference numerals represent like parts. <ul id="ul0001" list-style="none" compact="compact"><li><figref idref="f0001">FIG. 1</figref> is a diagram of a network for providing network services to clients.</li><li><figref idref="f0001">FIG. 2</figref> is another example of a network for providing network services to clients.</li><li><figref idref="f0002">FIG. 3</figref> is a schematic diagram of a network implementing a software defined overlay network for creating and enforcing ordered service chains according to a disclosed embodiment.</li><li><figref idref="f0003">FIG. 4</figref> is a schematic diagram of a network implementing a software defined overlay network for creating and enforcing ordered service chains according to a disclosed embodiment.</li><li><figref idref="f0003">FIG. 5</figref> is a schematic diagram of a network for implementing a software defined overlay network for creating and enforcing ordered service chains according to a disclosed embodiment.</li><li><figref idref="f0004">FIG. 6</figref> is a diagram of a user interface for creating ordered service chains according to a disclosed embodiment.</li><li><figref idref="f0005">FIGS. 7A</figref> and <figref idref="f0006">7B</figref> show a flowchart of a method for implementing a software defined service chain according to a disclosed embodiment.</li><li><figref idref="f0006">FIG. 8</figref> is a schematic diagram illustrating an embodiment of a network unit, which may be any device that transports and processes data through the network.</li></ul>
DETAILED DESCRIPTION
0008It should be understood at the outset that although an illustrative implementation of one or more embodiments are provided below, the disclosed systems and/or methods may be implemented using any number of techniques, whether currently known or in existence. The disclosure should in no way be limited to the illustrative implementations, drawings, and techniques illustrated below, including the exemplary designs and implementations illustrated and described herein, but may be modified within the scope of the appended claims. <figref idref="f0001">FIG. 1</figref> is a diagram of a network 100 for providing network services to clients. Network 100 may comprise a plurality of routers 102, a plurality of aggregation points 104, a plurality of service devices 106, and a plurality of switches 108 (e.g., Open Systems Interconnection (OSI) Layer 2 (L2) switches). The routers 102 may couple the network 100 to other networks or other devices or clients (not shown) in the network 100. The aggregation points 104 may be coupled to the routers 102 and configured to enforce service chains (e.g., two or more services that may need to be executed in a specified order) that may be provided to clients coupled to the routers 102. The switches 108 may be coupled to the aggregation points 104 as shown and may connect the network 100 to other devices (not shown). The service devices 106 may provide various services, such as a firewall, encryption/decryption, wide area network (WAN) optimization, server load balancing (SLB), and monitoring services. The services provided by the service devices 106 may enforce various security policies for an enterprise to ensure, for example, that files are not accessed without authorization and to ensure the integrity of the files. The services and order of services in a service chain may change with time. For example, the services provided by the service devices 106 used by an enterprise to ensure security may change over time to address new threats that may appear. Furthermore, the enterprise may have multiple service chains that are implemented in different situations.
0009The network 100 may use a spanning tree protocol (STP) (as defined in Institute of Electrical and Electronics Engineers (IEEE) 802.1D) based L2 forwarding path for service path determination. Each chain link (link between services) may require a unique virtual local area network (VLAN), and the VLANs may span the network topology. Each permutation of service chains may require a new L2/STP path and additional VLANs. Changing the service chains in network 100 may require a complex reconfiguration of the L2 path and the service devices. The network 100 may be inflexible in terms of service placement and the scalability may be limited to port density of the aggregation devices 104. Additionally, complexity in deployment and changes is very high, which may increase the probability of an error or an outage. Changes affect the aggregation points 104 which magnify the potential impact of any errors introduced by the changes. Furthermore, the service devices must be made aware of changes to the service chains. <figref idref="f0001">FIG. 2</figref> is another example of a network 200 for providing network services to clients. The network 200 may comprise a plurality of domains 202, 203, 204 and a plurality of service devices 210, 211, 212. The security requirements for network 200 may require that communication between clients in domain 202, and clients in domain 203 be required to pass through a firewall in service device 210. Similarly, the security requirements for the network 200 may require that communication between clients in domain 202 and clients in domain 204 pass through a firewall in service device 212. The security requirements for the network 200 may require that all communications to or from client in domain 203 pass through a firewall in service device 211. To accomplish these security requirements, L2/STP VLANs 220, 221, 222, 223, 224 must be configured between the domains 202, 203, 204 and the service devices 210, 211, 212 as shown. Any changes to the security policy requiring the addition, removal, or changes in the services may require that new L2/STP VLANs be established and configured. Thus, as with network 100, changes to network 200 may require a complex reconfiguration of the L2 path and the service devices. Furthermore, network 200 may suffer from many or all of the problems associated with network 100.
0010Disclosed herein are systems, methods, and apparatuses for software defined service chains. This disclosure outlines a method to employ a software defined overlay network that provides logical path forwarding alteration, via classification, tagging, and encapsulation to enable the direction of traffic through one (or more) network services or service platforms. The disclosed system may combine software defined classification, forwarding, encapsulation rules, and an overlay encapsulation that provides the ability to allow for the creation of a logical sub-network that can be modified arbitrarily with little overall impact to the network or existing data flows. This may effectively create a logical "service chain" where each link in the chain is a service stop allowing the application of one or more network services. In an embodiment, a software defined network service (SDNS) node closest to the source of a data packet may classify the data packet, map the classification to a tag representing that class, type, or group of data, and route the data packet to a specific encapsulation tunnel based on the classification. Intermediate SDNS nodes may decapsulate the data packet and forward the decapsulated data packet to a service device for processing and then receive the processed data packet back from the service device. The intermediate SDNS node may re-encapsulate the processed data packet based on the tag or classification and forward the encapsulated data packet to the next hop in the service chain until all services have been applied to the data packet in the specified order. The data packet may be decapsulated by a last SDNS node in the service chain and forwarded to the end point or client. The service devices and end points need not be aware of the encapsulation mechanism and need not be modified. Other nodes (e.g., switches, routers, etc.) in the network may forward the encapsulated packets without being aware of the encapsulation.
0011The combination of software defined classification, forwarding, encapsulation rules and the overlay encapsulation ability may allow for the creation of a logical sub-network that can be modified arbitrarily with little overall impact to the network or existing data flows. This effectively creates logical "service chains" where each link in the chain is a service stop allowing the application of one or more network services.
0012The disclosed software programmed classification, forwarding, and encapsulation to create network service based traffic engineering may provide the ability to create arbitrary (e.g. defined by an administrator without creating new VLANs or other tunnels) logical traffic paths to apply arbitrary data path services in a specific order. This in turn may introduce novel methods of load balancing and scaling the services, which is not possible using current or traditional methods of implementation or deployment without creating and configuring additional tunnels, which may be quite complicated and expensive. In some embodiments, the disclosed system provides a mechanism to use the unique identifiers present in the encapsulation mechanism such as Virtual eXtensible Local Area Network (VXLAN), Network Virtualization using Generic Routing Encapsulation (NVGRE), etc. to uniquely identify/encode a service sequence to which the traffic should be redirected based on the classification. The unique identifiers may be certain fields present in various encapsulation mechanisms. For example, the unique identifier may include the VNI in the VXLAN encapsulation mechanism and may include the tenant ID in the NVGRE encapsulation mechanism. The unique identifiers (or tags) may be used to encode the service sequence, class, type, etc. This may not require any new information in the encapsulation headers. Instead, the encapsulation mechanism may reuse existing headers in a unique way to define a service sequence which is understood and interpreted only by certain network elements (e.g., SDNS nodes). The rest of the network may be transparent to the disclosed mechanism since the SDNS nodes may encapsulate the data packets during transport to other SDNS nodes and decapsulate the data packets for transmission to the services and/or destinations. In an embodiment, the disclosed mechanisms and methods may use existing hardware that already supports encapsulation mechanisms.
0013The disclosed system and methods provide a mechanism for mapping the uniquely encoded encapsulation header identities (i.e., tags) to the entities that the existing services (e.g., VLANs) can understand and vice versa to maintain the transparency of services to the service sequencing mechanisms. The disclosed systems and methods may ensure that there is no change required in the services and may enable easy plug and play for third party services. The disclosed methods may maintain the mapping in network elements while the services remain transparent to the service sequencing, thereby enabling easier, faster, and transparent deployment. For example, the tag may be a virtual network interface (VNI) when the tunnel encapsulation is a VXLAN. The tag may be a tenant identifier (ID) when the encapsulation mechanism is NVGRE. VNI is part of the VXLAN header and tenant ID is part of the NVGRE header. Other tags may be used for different encapsulation mechanisms. Thus, the mapping maintained in the network elements may be, for example, a VNI to VLAN mapping or a tenant identifier to VLAN mapping. The network elements may maintain a mapping between the identifier present in the network (e.g., a VLAN identifier) to the identifier that the service devices may understand. The mapping may be localized to the device to which the service is attached. The disclosed systems and methods may decouple services from the physical topology. The disclosed systems and methods may reduce operation expenses as compared with current or traditional methods of implementation or deployment of network services. Additionally, the disclosed systems and methods may provide a more flexible use of existing resources and improve the long-term data center lifecycle. The disclosed systems and methods may also enable services virtualization.
0014<figref idref="f0002">FIG. 3</figref> is a schematic diagram of a network 300 for implementing a software defined overlay network for creating and enforcing ordered service chains according to a disclosed embodiment. The network 300 may be an Ethernet network, an Internet Protocol (IP) network, Multi-Protocol Label Switching (MPLS) network, or any other packet switched network (PSN). The network 300 may comprise a combination of different types of PSNs. The network 300 may comprise end points 302, SDNS nodes 304, a network domain 306, an edge node 308, an external domain 310, and service devices 312. The end points 302 may be file servers or other devices that provide files or data to clients. The SDNS nodes 304 and similarly the edge node 308 may be any nodes, devices, or components configured to receive, transmit, and/or forward packets in the network 300. The network domain 306 may comprise an OSI L2 or an OSI layer 3 (L3) for transferring data. The network domain 306 may comprise a plurality of nodes, switches, routers, or other devices configured to receive, transmit and/or forward packets. The edge node 308 may facilitate communication between the components 302, 304, 306, and 312 and devices (e.g., clients) located in an external domain 310. The service devices 312 (which may also be referred to as service platforms) may process the data packets flowing through the network 300 and apply various services. Examples of services that may be provided by service devices 312 include a firewall, server load balancing, encryption/decryption, WAN optimization, and a monitoring service. The transport mechanism between the components of network 300 may be any transport system capable of transporting data packets between components. The transport mechanism may be an L2 network, an L3 network, an Ethernet, and/or a Transmission Control Protocol/Internet Protocol (TCP/IP) based network. The components of network 300 may be arranged as shown in <figref idref="f0002">FIG. 3</figref>.
0015The SDNS nodes 304 may be configured to implement software defined service chains. The SDNS nodes 304 may maintain encapsulation tunnels or mechanisms (e.g., VLANs, VXLANs) between each other and may use the encapsulation tunnels to forward encapsulated data packets. The SDNS nodes 304 may be configured to form a logical service chain sequence through which network traffic (e.g., data packets) may be forced in order to apply specific network born services in a specific order. The SDNS nodes 304 may provide for flexible logical service chains and data paths that allow a simple insertion, removal, or modification of service elements in the logical chain. The SDNS nodes 304 may be configured to classify inbound data packet based on the type of data packet, the source, the destination, the ingress point, and/or some other classification system. The classification or the tag may correspond to an administrative set of rules for applying an ordered chain of services. Thus, the classification system may indicate a service chain order for applying services to the data packet. In an embodiment, the SDNS node 304 closest to the data flow source may classify the inbound data packet. The SDNS node 304 may map the classification to a tag that represents that class, type, or group of data packets. The tag may provide an SDNS node 304 with an identification of the specific ordered service chain to apply to the data packet, a next hop in the chain of the ordered service chain, and/or identify the rules for forwarding the data packet. The SDNS node 304 may encapsulate the data packet (including the tag or other identifier) and route the encapsulated data packet to a specific encapsulation tunnel or mechanism (e.g., an existing VLAN) based on the classification and/or tag. The encapsulated data packet may comprise the tag or classifier. The classification and/or tag may be associated with a specified ordered service chain. The specified ordered service chain may change over time and may be changed by an administrator. The rules to determine an ordered service chain for a data packet based on the classification or tag associated with the data packet may be pushed or transmitted to all the SDNS nodes 304 by an administrator. After encapsulation, the encapsulated inbound data packet may be transported across the network 300 via the encapsulated tunnel.
0016A SDNS node 304 (e.g., an intermediate node) nearest or connected to a specified next service device 312 may receive and decapsulate the data packet. Based on the tag or other information in the payload of the data packet, the intermediate SDNS node 304 may determine that the data packet should be forwarded to the attached service device 312 for processing. Based on this determination, the intermediate SDNS node 304 may forward the decapsulated native data packet to a service device 312 connected to the SDNS node 304 for processing by the service device 312. The service device 312 may return the processed data packet back to the SDNS node 304 from which the service device 312 received the data packet. The SDNS node 304 nearest the service device 312 may receive the data packet, reclassify and remap the data packet, tag the data packet, encapsulate the data packet and router the encapsulated data packet to a specif encapsulation tunnel or mechanism based on the classification and/or tag. The reclassification and re-tagging may result in the same or different classification or tag as that done by the first SDNS node 304. The encapsulated data packet may be routed to the next SDNS node 304 specified by the service chain order that may be identified by the classification and/or tag.
0017The next SDNS node 304 may perform steps similar to the previous SDNS node 304 if another service is to be applied to the data packet. When all the services have been applied as specified by an administrative set of rules governing ordered service chains, the data packet may be received by a SDNS node 304 (e.g., egress node) closest to the destination of the data packet. The egress SDNS node 304 may decapsulate the data packet and forward the data packet to the destination (e.g., end point 302 or a client coupled to external domain 310).
0018The data packet may be forwarded across the network domain 306 by nodes (e.g., switches, routers, etc.) not participating in the encapsulation/decapsulation mechanism and which may not be aware of the underlying nature of the encapsulated data packet. The solid arrows 314 and the dashed arrows 316 indicate examples of data flows through the network 300. For example, arrow 314 shows the data path for a first data flow. The data flow may originate in end point 302 (labeled A) and be transmitted to SDNS node 304 (labeled N1). Node N1 may classify and/or tag the data flow, encapsulate the data flow and transmit the encapsulated data flow to node N4 via the network domain 306. The nodes, switches, routers, and devices of network domain 306 may forward the encapsulated packet without being aware of the underlying content and without decapsulating and inspecting the payload. Node N4 may decapsulate the data flow and forward the decapsulated data flow to service device S2 for processing. The service device S2 may forward the processed data flow back to node N4 which may reclassify, re-tag, and re-encapsulate the data flow and then forward the re-encapsulated data flow through an existing encapsulation tunnel (e.g., a VLAN, a VXLAN) to node N3 through network domain 306. Similarly, node N3 may decapsulate the data flow, forward the decapsulated data flow to service device S1 for processing, receive the processed data flow from service device 312, reclassify, re-tag, and re-encapsulate the data flow, and forward the encapsulated data flow through an existing encapsulation tunnel to node N2 via network domain 306. Node N2. may receive the encapsulated data flow, decapsulate the data flow and forward the decapsulated data flow to the end point B. End point B may return a data flow back to end point A, which may follow the same course in reverse order back to end point A and processed in a similar manner on the return path.
0019Arrow 316 may represent the path of another data flow entering the network 300 from external domain 310 at router 308. The data flow represented by arrow 316 may follow a path as shown in <figref idref="f0002">FIG. 3</figref> and may be handled in a similar manner to that of the data flow associated with arrow 314.
0020<figref idref="f0003">FIG. 4</figref> is a schematic diagram of a network 400 implementing a software defined overlay network for creating and enforcing ordered service chains according to a disclosed embodiment. Network 400 may comprise routers 402, aggregation points 404, L2 switches 406, and service devices 408. Routers 404 may connect network 400 with other clients, servers, nodes, devices, networks, and/or domains. The routers 402 may be connected to the aggregation points 404. The aggregation points 404 may be connected to the L2 switches 406 that may provide a connection to the service devices 408. The L2 switches may be similar to SDNS nodes 304 in <figref idref="f0002">FIG. 3</figref>. The L2 switches 406 may have encapsulated tunnels configured to connect to each other through aggregation points 404. The service devices 408 may be similar to service devices 312 in <figref idref="f0002">FIG. 3</figref>. In contrast to network 100 in <figref idref="f0001">FIG. 1</figref>, the service devices do not need to have VLANs configured to couple to the aggregation points for each service chain path. Rather, the service devices are directly connected to the L2 switches 406, and the service order chaining mechanism implemented by the L2 switches is transparent to the service devices 408, the routers 402, and the aggregation points 404. The service order chaining mechanism may be transparent to the service devices 408, the routers 402, and the aggregation points 404 since the ordering may be performed by the L2 switches 406 that encapsulate and decapsulate the data packets. The ordering may be encoded in the encapsulated data packets. The service devices 408, the routers 402, and the aggregation points 404 may not participate in the encapsulation/decapsulation processes.
0021<figref idref="f0003">FIG. 5</figref> is a schematic diagram of a network 500 for implementing a software defined overlay network for creating and enforcing ordered service chains according to a disclosed embodiment. Network 500 may comprise a domain 502 and a plurality of service devices 504. The service devices 504 may be connected directly to edge devices 506 in the domain 502. The edge devices 506 may be similar to SDNS nodes 304 in <figref idref="f0002">FIG. 3</figref>. <figref idref="f0003">FIG. 5</figref> shows that, in contrast to network 200 in <figref idref="f0001">FIG. 2</figref>, the service devices 504 do not need to be connected to the rest of the network 500 via VLANs or other encapsulated tunnels.
0022<figref idref="f0004">FIG. 6</figref> is a diagram of a user interface 600 for creating ordered service chains according to a disclosed embodiment. The user interface 600 may comprise a plurality of icons representing different services and groups within a network, such as network 300. The service icons may include firewall icons 606, 607, SLB icons 608, 609, Wide Area Application Services (WAAS) icons 610, 611, and group A icon 612 and group B icon 613. An administrator may select various icons and move a copy of the icon into a service chain area 602, 604. The administrator may order the icons 606-613 in the service chain areas 602, 604 to create a rule for an ordered service chain that may be promulgated to SDNS nodes 304 for implementation. The user interface 600 shows two service chains. Service chain 1 in service chain area 602 shows an ordered service chain comprising group A 612, SLB 608, firewall 606, WAcc 611, and group B 613. Service chain 2 in service chain area 604 shows an ordered service chain comprising group A 612, SLB 608, firewall 607, and group B.
0023<figref idref="f0005">FIGS. 7A</figref> and <figref idref="f0006">7B</figref> show a flowchart of a method 700 for implementing a software defined service chain according to a disclosed embodiment. The method 700 may begin at block 702 where a SDNS node 304 at an ingress point in the network 300 closest to an inbound data flow so may classify the inbound data flow. At block 704, the SDNS node 304 may map the classification to a tag representing the class, type, or group of the data flow and that representing the sequence of services associated with the flow type.. At step 706, the SDNS node 304 may encapsulate the data flow and route the data flow to a specific encapsulation tunnel or mechanism based on the classification and/or tag. At block 708, the encapsulated data flow may be transported across the intermediate network via the encapsulated tunnel.
0024At block 710, an intermediate SDNS node 304 to which the service devices/instances 312 are attached may decapsulate the tunneled payload data flow. (The intermediate SDNS nodes 304 to which a service device/instance 312 is not attached or that the service for the service device/instance 312 is not used for the particular data flow may refrain from decapsulating the tunneled payload data flow.) At block 712, the intermediate SDNS node 304 may forward the decapsulated native data flow to a service device or platform 312, service device 408, service device 504, or one of service devices 606-611 connected to the intermediate SDNS node 304 or L2 switch 406 for processing by the service device/platform 312, service device 408, service device 504, or one of service devices 606-611. At block 714, the service device/platform 312, service device 408, service device 504, or one of service devices 606-611 may return the data flow traffic to the directly connected intermediate SDNS node 304 or L2 switch 406. At block 716, if there are additional services to be performed on the data flow, the method 700 may proceed to block 718 where the intermediate SDNS node 304 or L2 switch 406 may reclassify, remap, and re-tag the processed data flow from the service device/platform 312, service device 408, service device 504, or one of service devices 606-611, after which the method 700 may proceed to block 706. At block 716, if there are no additional services to be performed, the method 700 may proceed to block 720 the data flow may be forwarded to the destination (e.g., endpoint 302, domain 310, or one of domains 612, 613), after which, the method 700 may end. The disclosed methods, systems, and apparatuses include software defined forwarding tables to allow Top of Rack (ToR) to classify traffic and to define next hop based on classification. The disclosed methods, systems, and apparatuses provide flexible service placement: any service can be on any ToR. Additionally, the disclosed methods, systems, and apparatuses scales with number of ToRs (horizontal scaling), uses Software Defined Networking (SDN) defined paths for service chains, and VLANs remain localized. Furthermore, changes do not require reconfiguration of service devices, thus resulting in a more dynamic network. The disclosed methods, systems, and apparatuses may lower configuration complexity, which may lower the probability of error/outage. The disclosed methods, systems, and methods also provide that the changes are implemented on ToR reducing the scope of potential impact.
0025<figref idref="f0006">FIG. 8</figref> illustrates an embodiment of a network unit 800, which may be any device that transports and processes data through the network. For instance, the network unit 800 may correspond to SDNS nodes 304 described above. The network unit 800 may comprise one or more ingress ports or units 810 coupled to a receiver (Rx) 812 for receiving signals and frames/data from other network components. The network unit 800 may comprise a logic unit 820 to determine which network components to send data to. The logic unit 820 may be implemented using hardware, software, or both. The logic unit 820 may be implemented as one or more central processing unit (CPU) chips, or may be part of one or more application specific integrated circuits (ASICs). The network unit 800 may also comprise one or more egress ports or units 830 coupled to a transmitter (Tx) 832 for transmitting signals and frames/data to the other network components. The logic unit 820 may also implement or support the software defined networking ordered service chain procedures described above. The components of the network unit 800 may be arranged as shown in <figref idref="f0006">FIG. 8</figref>.
0026At least one embodiment is disclosed and variations, combinations, and/or modifications of the embodiment(s) and/or features of the embodiment(s) made by a person having ordinary skill in the art are within the scope of the disclosure. Alternative embodiments that result from combining, integrating, and/or omitting features of the embodiment(s) are also within the scope of the disclosure. Where numerical ranges or limitations are expressly stated, such express ranges or limitations should be understood to include iterative ranges or limitations of like magnitude falling within the expressly stated ranges or limitations (e.g., from about 1 to about 10 includes, 2, 3, 4, etc.; greater than 0.10 includes 0.11, 0.12, 0.13, etc.). For example, whenever a numerical range with a lower limit, R<sub>1</sub>, and an upper limit, R<sub>u</sub>, is disclosed, any number falling within the range is specifically disclosed. In particular, the following numbers within the range are specifically disclosed: R=R<sub>1</sub>+k*(R<sub>u</sub>-R<sub>1</sub>), wherein k is a variable ranging from 1 percent to 100 percent with a 1 percent increment, i.e., k is 1 percent, 2 percent, 3 percent, 4 percent, 7 percent, ..., 70 percent, 71 percent, 72 percent, ..., 97 percent, 96 percent, 97 percent, 98 percent, 99 percent, or 100 percent. Moreover, any numerical range defined by two R numbers as defined in the above is also specifically disclosed. The use of the term about means ±10% of the subsequent number, unless otherwise stated. Use of the term "optionally" with respect to any element of a claim means that the element is required, or alternatively, the element is not required, both alternatives being within the scope of the claim. Use of broader terms such as comprises, includes, and having should be understood to provide support for narrower terms such as consisting of, consisting essentially of, and comprised substantially of. Accordingly, the scope of protection is not limited by the description set out above but is defined by the claims that follow. The discussion of a reference in the disclosure is not an admission that it is prior art, especially any reference that has a publication date after the priority date of this application.
0027While several embodiments have been provided in the present disclosure, it should be understood that the disclosed systems and methods might be embodied in many other specific forms without departing from the scope of the present disclosure. The present examples are to be considered as illustrative and not restrictive, and the intention is not to be limited to the details given herein. For example, the various elements or components may be combined or integrated in another system or certain features may be omitted, or not implemented.
0028In addition, techniques, systems, subsystems, and methods described and illustrated in the various embodiments as discrete or separate may be combined or integrated with other systems, modules, techniques, or methods without departing from the scope of the present disclosure. Other items shown or discussed as coupled or directly coupled or communicating with each other may be indirectly coupled or communicating through some interface, device, or intermediate component whether electrically, mechanically, or otherwise. Other examples of changes, substitutions, and alterations are ascertainable by one skilled in the art and could be made without departing from the scope disclosed herein.
Contents5
6 sheets
Sheet 1 Sheet 2 Sheet 3 Sheet 4 Sheet 5 Sheet 6
Every citation, both ways
| Document | Relation | Office | Cited during |
|---|---|---|---|
| US2011161521A1 | Cites | United States of America | Examiner |
| US2011161521A1 | Cites | United States of America | – |
| ERIK NORDSTRÖM ET AL: "Serval: An End-Host Stack for Service-Centric Networking", 9TH USENIX SYMPOSIUM ON NETWORKED SYSTEMS DESIGN AND IMPLEMENTATION, 25 April 2012 (2012-04-25), XP055082938, San Jose, CA | Non-patent | – | – |
| Salvestrini ET AL: "CHANGE: Enabling Innovation in the Internet Architecture through Flexible Flow-Processing Extensions D4.2 Inter-platform signalling", , 30 January 2012 (2012-01-30), pages 1-68, XP055084333, Retrieved from the Internet: URL:http://typo3.change-project.eu/fileadm in/publications/Deliverables/CHANGE_Delive rable_D4_2.pdf [retrieved on 2013-10-17] | Non-patent | – | – |
| ADAM GREENHALGH ET AL: "Flow processing and the rise of commodity network hardware", ACM SIGCOMM COMPUTER COMMUNICATION REVIEW, vol. 39, no. 2, 31 March 2009 (2009-03-31) , page 20, XP055061496, ISSN: 0146-4833, DOI: 10.1145/1517480.1517484 | Non-patent | – | – |
| BHUMIP KHASNABISH ZTE USA ET AL: "Requirements for Mobility and Interconnection of Virtual Machine and Virtual Network Elements; draft-khasnabish-vmmi-problems-01.txt", REQUIREMENTS FOR MOBILITY AND INTERCONNECTION OF VIRTUAL MACHINE AND VIRTUAL NETWORK ELEMENTS; DRAFT-KHASNABISH-VMMI-PROBLEMS-01.TXT, INTERNET ENGINEERING TASK FORCE, IETF; STANDARDWORKINGDRAFT, INTERNET SOCIETY (ISOC) 4, RUE DES FALAISES CH- 1205 GE, 29 June 2012 (2012-06-29), pages 1-36, XP015083606, [retrieved on 2012-06-29] | Non-patent | – | – |
9 members in 4 offices
Priority claims5
| Document | Office | Kind | Date |
|---|---|---|---|
| 201261683582P | United States of America | – | |
| 201261683582 | United States of America | P | |
| 201213715524 | United States of America | – | |
| 201213715524 | United States of America | A | |
| 2013054932 | United States of America | W |
Members9
| Document | Office | Kind | |
|---|---|---|---|
| US2014050223A1 | United States of America | A1 | |
| WO2014028612A1 | World Intellectual Property Organization (WIPO) | A1 | |
| US8989192B2 | United States of America | B2 | |
| CN104521195A | China | A | |
| EP2875615A1 | European Patent Office (EPO) | A1 | |
| US2015156035A1 | United States of America | A1 | |
| US9705702B2 | United States of America | B2 | |
| CN104521195B | China | B | |
| EP2875615B1This record | European Patent Office (EPO) | B1 |
77 legal events, as 10 offices reported them to INPADOC
Over the term
Point at a mark for the eventEvents
| Event | Code | Office | |
|---|---|---|---|
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Annual fee paid to national office [announced via postgrant information from national office to epo]GrantedPGFP | PGFP | EP | |
| Opt-out of the competence of the unified patent court (upc) registeredP01 | P01 | EP | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: H04L0012701000R079 | R079 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent lapsedLapsedMM4A | MM4A | IE | |
| Lapsed because of non-payment of the annual feeLapsedMM | MM | BE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent ceasedCeasedPL | PL | CH | |
| No opposition filedOpposition26N | 26N | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| No opposition filed within time limitOppositionORIGINAL CODE: 0009261PLBE | PLBE | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: NO OPPOSITION FILED WITHIN TIME LIMITSTAA | STAA | EP | |
| No opposition filed against granted patent, or epo opposition proceedings concluded without decisionGrantedR097 | R097 | DE | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Deletion acc. to par. 5 (withdrawal of the translation of the ep patent)MK05 | MK05 | AT | |
| Invalidated european patentMG4D | MG4D | LT | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Lapsed in a contracting state [announced via postgrant information from national office to epo]LapsedPG25 | PG25 | EP | |
| Patent invalid in the netherlands as no translation has been filedMP | MP | NL | |
| Fee paymentPLFP | PLFP | FR | |
| Dpma publication of mentioned ep patent grantGrantedR096 | R096 | DE | |
| European patents granted designating irelandGrantedFG4D | FG4D | IE | |
| Reference to at number (ep patent validated in austria)REF | REF | AT | |
| European patent takes effect as a national patent in ch/liEP | EP | CH | |
| Designated contracting statesAK | AK | EP | |
| European patent grantedGrantedFG4D | FG4D | GB | |
| (expected) grantORIGINAL CODE: 0009210GRAA | GRAA | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: THE PATENT HAS BEEN GRANTEDSTAA | STAA | EP | |
| Grant fee paidORIGINAL CODE: EPIDOSNIGR3GRAS | GRAS | EP | |
| Intention to grant announcedINTG | INTG | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Information provided on ipc code assigned before grantRIC1 | RIC1 | EP | |
| Despatch of communication of intention to grant a patentORIGINAL CODE: EPIDOSNIGR1GRAP | GRAP | EP | |
| Information on the status of an ep patent application or granted ep patentGrantedSTATUS: GRANT OF PATENT IS INTENDEDSTAA | STAA | EP | |
| Amendment of ipc main classPREVIOUS MAIN CLASS: H04L0012723000R079 | R079 | DE | |
| Request for extension of the european patent (deleted)DAX | DAX | EP | |
| First examination report despatched17Q | 17Q | EP | |
| Request for examination filed17P | 17P | EP | |
| Designated contracting statesAK | AK | EP | |
| Request for extension of the european patentAX | AX | EP | |
| Public reference made under article 153(3) epc to a published international application that has entered the european phaseORIGINAL CODE: 0009012PUAI | PUAI | EP |
Numbers
- Publication
- 2875615
- Application
- 137530473
Titles3
- German
- GERÄT ZUR ERZEUGUNG SOFTWAREDEFINIERTER GEORDNETER MUSTER IN EINEM KOMMUNIKATIONSNETZ
- English
- DEVICE FOR CREATING SOFTWARE DEFINED ORDERED SERVICE PATTERNS IN A COMMUNICATIONS NETWORK
- French
- DISPOSITIF POUR LA CRÉATION DE SCHÉMAS DE SERVICES ORDONNÉS, DÉFINIS PAR UN LOGICIEL, DANS UN RÉSEAU DE COMMUNICATION
Classification
- CPC, 7
- H04L12/4633
- H04L47/2441
- H04L45/306
- H04L45/645
- H04L45/00
- H04L12/4645
- H04L45/74
- IPC, 7
- H04L12 701
- H04L12 741
- H04L12 851
- H04L12 723
- H04L12 46
- H04L45 50
- H04L45 74
Designated states1
- Contracting states, 1
- Türkiye
