The present technology pertains to provisioning services in a data center network, and more specifically pertains to automating the commissioning and decommissioning of application and the service configuration on one or more service nodes.
Service deployment can be a tedious process and can often be prone to errors. Deployment of a new application in a data center can require provisioning of computers, storage, and networking resources. However, service deployment, in particular automation and enabling of services, can be onerous and often takes very long time—often weeks or months (as compared to the other steps requiring less than a couple of days). In addition when an application has to be decommissioned, there are typically no easy ways to figure out what needs to be “un-configured” from the service nodes. Many organizations have to deal with such scenarios.
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 may be used without parting from the spirit and scope of the disclosure.
Overview
An infrastructure admin or administrator can define or modify one or more service graphs for outlining service chains and provisioning services in a network. The service graphs can include nodes in the network associated with service applications. Next, the infrastructure admin or administrator can register service appliances, such as firewalls, load balancers, intrusion detection devices, cache engines, application delivery controllers, intrusion prevention devices, etc., along with their device package files with a controller (e.g., a network controller or a fabric controller) on the network. The device package files can include data about the device, such as data which specifies the device's functionality, capabilities, configuration or settings, hardware resources, software resources, status, etc. For example, the device package files can indicate specific hardware and software capabilities of one or more devices or nodes. In some embodiments, the device package files can define the functionalities of the nodes in the service graph, such as forwarding functionalities, load balancing functionalities, configuration information, etc. Moreover, in some cases, the device package files can include a file, such as an extensible markup language (XML) file, defining the various features and configurations of the devices or nodes in the service graph.
Then, the controller can establish the capabilities of the service devices, and classify the service devices as legacy or service tag switching (STS) capable devices. Legacy service and STS capable devices can both implement the automated provisioning here without requiring additional software or patches to be installed on the devices. However, the information indicating legacy or STS capable can be used to understand the capabilities of the devices and consequently adjust the configurations, rules and/or implementations used in provisioning the services.
Then, the controller can create one or more instances of the service graph by populating the service nodes into the service graph. This can allow the controller to understand the devices or nodes used by a client and service application and/or understand the service chain. The resulting service graph can thus outline the service nodes in the network, as well as their respective capabilities, functionalities, and/or configuration.
Then, an application owner can attach an endpoint group (EPG) to one or more service graphs created by the infrastructure admin or administrator. For example, the application owner can attach an EPG to a service chain in a service graph created by the administrator. The EPGs in the service graph can be represented by a specific route, label, or address, for example. Moreover, the application owner can include specific details about the attached EPG, such as a tag, information about an application group, routing information, policy information, network segment or tenant space information, etc. The service graph and attached EPGs can then be used to provision services and deploying applications dynamically and/or automatically while minimizing or avoiding downtime. For example, in some cases, an EPG can be attached to a specific service node in the service graph, such as a terminal node (e.g., node corresponding to the destination EPG or source EPG). In some cases, the remaining service nodes can be defined as function nodes to identify their particular role within the service provisioning chain.
In some aspects, service provisioning can include various components, such as dynamic network configuration and dynamic service configuration. All nodes in the service graph can be automatically configured with respect to networking requirements and the services provided. The device package information for each node in the graph, as well as various rules or policies can be used to determine the configuration for each node along a service chain in the service graph. This way, resources and services can be automatically provisioned on the network, with each relevant node in the service chain and any configuration settings in the network being automatically configured and integrated to avoid service downtime and/or tedious and unnecessary planning efforts.
Description
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, with the types 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).
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 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 an intermediate network node, such as a router, to extend the effective “size” of each network.
Overlay networks generally allow virtual networks to be created and layered over a physical network infrastructure. Overlay network protocols, such as Virtual Extensible LAN (VXLAN), Network Virtualization using Generic Routing Encapsulation (NVGRE), Network Virtualization Overlays (NVO3), 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).
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.
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 virtual LANs (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.
Network segments, such as physical or virtual segments; networks; devices; ports; physical or logical links; and/or traffic in general can be grouped into a bridge or flood domain. A bridge domain or flood domain can represent a broadcast domain, such as an L2 broadcast domain. A bridge domain or flood domain can include a single subnet, but can also include multiple subnets. Moreover, a bridge domain can be associated with a bridge domain interface on a network device, such as a switch. A bridge domain interface can be a logical interface which supports traffic between an L2 bridged network and an L3 routed network. In addition, a bridge domain interface can support internet protocol (IP) termination, VPN termination, address resolution handling, MAC addressing, etc. Both bridge domains and bridge domain interfaces can be identified by a same index or identifier.
Furthermore, endpoint groups (EPGs) can be used in a network for mapping applications to the network. In particular, EPGs can use a grouping of application endpoints in a network to apply connectivity and policy to the group of applications. EPGs can act as a container for buckets or collections of applications, or application components, and tiers for implementing forwarding and policy logic. EPGs also allow separation of network policy, security, and forwarding from addressing by instead using logical application boundaries.
Cloud computing can also be provided in one or more networks to provide computing services using shared resources. Cloud computing can generally include Internet-based computing in which computing resources are dynamically provisioned and allocated to client or user computers or other devices on-demand, from a collection of resources available via the network (e.g., “the cloud”). Cloud computing resources, for example, can include any type of resource, such as computing, storage, and network devices, virtual machines (VMs), etc. For instance, resources may include service devices (firewalls, deep packet inspectors, traffic monitors, load balancers, etc.), compute/processing devices (servers, CPU's, memory, brute force processing capability), storage devices (e.g., network attached storages, storage area network devices), etc. In addition, such resources may be used to support virtual networks, virtual machines (VM), databases, applications (Apps), etc.
Cloud computing resources may include a “private cloud,” a “public cloud,” and/or a “hybrid cloud.” A “hybrid cloud” can be a cloud infrastructure composed of two or more clouds that inter-operate or federate through technology. In essence, a hybrid cloud is an interaction between private and public clouds where a private cloud joins a public cloud and utilizes public cloud resources in a secure and scalable manner. Cloud computing resources can also be provisioned via virtual networks in an overlay network, such as a VXLAN.
The disclosed technology addresses the need in the art for automatic provisioning of services when a client is accessing an application. Disclosed are systems, methods, and computer-readable storage media for populating one or more service graphs used in automating the provisioning of services. A brief introductory description of exemplary systems and networks, as illustrated in
The interfaces 168 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 110. 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 162 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 161) 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 200, an input device 245 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 235 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 200. The communications interface 240 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 230 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) 225, read only memory (ROM) 220, and hybrids thereof.
The storage device 230 can include software modules 232, 234, 236 for controlling the processor 210. Other hardware or software modules are contemplated. The storage device 230 can be connected to the system bus 205. 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 210, bus 205, display 235, and so forth, to carry out the function.
Chipset 260 can also interface with one or more communication interfaces 290 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 255 analyzing data stored in storage 270 or 275. Further, the machine can receive inputs from a user via user interface components 285 and execute appropriate functions, such as browsing functions by interpreting these inputs using processor 255.
It can be appreciated that exemplary systems 200 and 250 can have more than one processor 210 or be part of a group or cluster of computing devices networked together to provide greater processing capability.
Spine switches 302 can be L3 switches in the fabric 312. However, in some cases, the spine switches 302 can also, or otherwise, perform L2 functionalities. Further, the spine switches 302 can support various capabilities, such as 40 or 10 Gbps Ethernet speeds. To this end, the spine switches 302 can include one or more 40 Gigabit Ethernet ports. Each port can also be split to support other speeds. For example, a 40 Gigabit Ethernet port can be split into four 10 Gigabit Ethernet ports.
In some embodiments, one or more of the spine switches 302 can be configured to host a proxy function that performs a lookup of the endpoint address identifier to locator mapping in a mapping database on behalf of leaf switches 304 that do not have such mapping. The proxy function can do this by parsing through the packet to the encapsulated, tenant packet to get to the destination locator address of the tenant. The spine switches 302 can then perform a lookup of their local mapping database to determine the correct locator address of the packet and forward the packet to the locator address without changing certain fields in the header of the packet.
When a packet is received at a spine switch 302i, the spine switch 302i can first check if the destination locator address is a proxy address. If so, the spine switch 302i can perform the proxy function as previously mentioned. If not, the spine switch 302i can lookup the locator in its forwarding table and forward the packet accordingly.
Spine switches 302 connect to leaf switches 304 in the fabric 312. Leaf switches 304 can include access ports (or non-fabric ports) and fabric ports. Fabric ports can provide uplinks to the spine switches 302, while access ports can provide connectivity for devices, hosts, endpoints, VMs, or external networks to the fabric 312.
Leaf switches 304 can reside at the edge of the fabric 312, and can thus represent the physical network edge. In some cases, the leaf switches 304 can be top-of-rack (“ToR”) switches configured according to a ToR architecture. In other cases, the leaf switches 304 can be aggregation switches in any particular topology, such as end-of-row (EoR) or middle-of-row (MoR) topologies. The leaf switches 304 can also represent aggregation switches, for example.
The leaf switches 304 can be responsible for routing and/or bridging the tenant packets and applying network policies. In some cases, a leaf switch can perform one or more additional functions, such as implementing a mapping cache, sending packets to the proxy function when there is a miss in the cache, encapsulate packets, enforce ingress or egress policies, etc.
Moreover, the leaf switches 304 can contain virtual switching functionalities, such as a virtual tunnel endpoint (VTEP) function.
Network connectivity in the fabric 312 can flow through the leaf switches 304. Here, the leaf switches 304 can provide servers, resources, endpoints, external networks, or VMs access to the fabric 312, and can connect the leaf switches 304 to each other. In some cases, the leaf switches 304 can connect EPGs to the fabric 312 and/or any external networks. Each EPG can connect to the fabric 312 via one of the leaf switches 304, for example.
Endpoints 310A-E (collectively “310”) can connect to the fabric 312 via leaf switches 304. For example, endpoints 310A and 310B can connect directly to leaf switch 304A, which can connect endpoints 310A and 310B to the fabric 312 and/or any other one of the leaf switches 304. Similarly, endpoint 310E can connect directly to leaf switch 304C, which can connect endpoint 310E to the fabric 312 and/or any other of the leaf switches 304. On the other hand, endpoints 310C and 310D can connect to leaf switch 304B via L2 network 306. Similarly, the wide area network (WAN) can connect to the leaf switches 304C or 304D via L3 network 308.
Endpoints 310 can include any communication device, such as a computer, a server, a switch, a router, a client device, etc. The overlay network can host physical devices, such as servers, applications, EPGs, virtual segments, virtual workloads, etc. In addition, the endpoints 310 can host virtual workload(s), clusters, and applications or services, which can connect with the fabric 312 or any other device or network, including an external network. For example, one or more endpoints 310 can host, or connect to, a cluster of load balancers or an EPG of various applications.
Although the fabric 312 is illustrated and described herein as an example leaf-spine architecture, one of ordinary skill in the art will readily recognize that the subject technology can be implemented based on any network fabric, including any data center or cloud network fabric. Indeed, other architectures, designs, infrastructures, and variations are contemplated herein.
As used herein the term “configured” shall be considered to interchangeably be used to refer to configured and configurable, unless the term “configurable” is explicitly used to distinguish from “configured”. The proper understanding of the term will be apparent to persons of ordinary skill in the art in the context in which the term is used.
Example Embodiments
The above mechanism can allow the networking part of the services to be “auto” (automated) provisioned by a machine. The mechanism can work with existing service nodes which do not need to be aware of any of the service improvements that have been made in a network fabric. Examples of the services or service appliances in the network can include, but are not limited to, firewalls (FWs), Intrusion Prevention Devices (IPS), Intrusion Detection Devices (IDS), Application Delivery Controllers (ADCs) Server Load Balancers (SLBs), Cache Engines and compliance analysis engines. Moreover, the services and service appliances can be hardware based, such as a hardware firewall; software based, such as a virtual load balancer; or both.
Further, the mechanism can provide automatic provisioning of services; reduce the operational expenditure (OPEX) and time to provision a new application in a network, such as a data center; work with legacy services with no change required on the service nodes; support automated commissioning and decommissioning of applications and the service configuration on the service nodes; and support a linear chain of services of arbitrary length.
Reference is now made to
Each device provides a device package with a device specification file (for example an XML file) and a device script. A service graph 400 can be created to allocate networking resources when clients and applications are connected to the service graph. A “node” generally refers to an active electronic device, virtual machine, or software element that is attached to a network, and is capable of sending, receiving or forwarding information over a communications channel. In a distributed system, nodes can be clients, servers, resources, virtual appliances, or peers. The nodes of the service graph generally represent functions which are to be applied to the traffic flowing between the client and application. The nodes can be populated into the network (such as fabric 312 in
The security rules are also defined by the service graph based upon the security rules for the various devices.
Reference is now made to
The package file registered with the controller includes the device specification file (e.g., an XML file) which identifies the device, the functions that it can provide, the configuration needed for the various functions, and networking requirements for various functions. The device package file also includes a device script that enables communication with the device.
At 530, the capabilities of each of the service devices are established by downloading the policies into the network switches. At 540 the service devices are classified as a legacy device or a service tag switching device to determine parameters for the device. At 550 at least one service graph is populated, for example the service graph 600 shown in
Reference is now made to
Reference is now made to
If the node is a terminal node, at 706 it is provisioned as a terminal mode. At 708, the EPG type is determined as being a source EPG or a destination EPG. If the EPG is a source EPG, at 710 the source EPG is set up and at 712 the processing advances to step 712 to move to the next node in the graph as the first function node in the graph. If the EPG is a destination EPG, at 714 the destination EPG is set up and at 716 the processing advances to step 716 to complete processing the service graph.
If the node is not a terminal node at 704, then it is a function node at 720. A function node represents a discrete function that is available from a service node. At 722, a service device is selected that provides the function from the function group. The controller factors in the available capacity on the service device and the device selection policy to determine device selection. At 724 the input parameters are accepted that are specific to this instance of the function. For example, a virtual server IP address is provided for SLB (server load balancing).
At 726, the forward input connector is set up (see, for example, forward input connector 640A for node 610A in
At 728, the forward output connector is set up (see, for example, forward output connector 641A for node 610A in
At 730, the reverse input connector is set up (see, for example, reverse input connector 642A for node 610A in
At 732, the reverse output connector is set up (see, for example, reverse output connector 643A for node 610A in
At 734, the connectors are provisioned in the fabric so that the flow in the fabric can be automated from the client to the application to flow though the services. At 736, the device parameters are passed along with the connectors to device configuration script. The device configuration script is invoked to configure the function on the device. At 738, the next node in the graph is accessed to continue graph processing. At this point, all connectors for this node have been initialized and the service device has been configured for the function provided by this node.
The processing of
At 804, if the administrator has not configured the bridge domain for the connector, at 808 it is determined if it is a “GoTo” function. If it is a GoTo function, then at 810 it is determined if the adjacency type is L2 (layer 2), meaning determine if the adjacent node is an L2 node. If not, then a fault is raised at 816. If the adjacency type is L2 at 810, then it is determined at 812 if the bridge domain can be found from the adjacent node. If it cannot be found, at 818 the fault is raised. If it can be found, at 814 the bridge domain from the adjacent node is used. If the connector has routing disabled, then the routing is disabled and ARP flood enabled. At 826, the unknown MAC flood is enabled on the bridge domain.
At 820, if the adjacency type is not L2, meaning the adjacent node is not an L2 device, at 830 derive the bridge domain from one or more of the terminal nodes. The shadow service bridge domain is then allocated and the ARP flood is enabled on the new service bridge domain.
The method 900 starts at 902 and retrieves associated Layer 2 (L2) bridge (BD) domain for the graph connector at 904. If an encapsulation (encap) protocol has been allocated at 906 for the bridge domain, then the existing encapsulation protocol is used at 908. If the encapsulation protocol has not been allocated, then allocate the encapsulation protocol for the connector at 910 and encapsulation protocols are allocated from the administrator provided encapsulation resource pools. Encapsulation protocols include HDLC (High-Level Data Link Control), PPP (Point-to-Point Protocol) or frame relay.
The automation of service provisioning is accomplished by populating service graphs and performing service graph processing in accordance with the methods and example embodiments herein.
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, 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, multiple members of the set or all members of the set satisfy the claim.
This application is a continuation of U.S. patent application Ser. No. 14/486,828, filed Sep. 15, 2014, which claims priority to U.S. Provisional Patent Application No. 61/900,372, filed Nov. 5, 2013; all of which are incorporated herein by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
4298770 | Nishihara et al. | Nov 1981 | A |
4636919 | Itakura et al. | Jan 1987 | A |
4700016 | Hitchcock et al. | Oct 1987 | A |
5859835 | Varma et al. | Jan 1999 | A |
5926458 | Yin et al. | Jul 1999 | A |
6389031 | Chao et al. | May 2002 | B1 |
6677831 | Cheng et al. | Jan 2004 | B1 |
6714553 | Poole et al. | Mar 2004 | B1 |
6757897 | Shi et al. | Jun 2004 | B1 |
6876952 | Kappler et al. | Apr 2005 | B1 |
6907039 | Shen | Jun 2005 | B2 |
6941649 | Goergen | Sep 2005 | B2 |
6952421 | Slater | Oct 2005 | B1 |
6954463 | Ma et al. | Oct 2005 | B1 |
6996099 | Kadambi et al. | Feb 2006 | B1 |
7152117 | Stapp et al. | Dec 2006 | B1 |
7177946 | Kaluve et al. | Feb 2007 | B1 |
7372857 | Kappler et al. | May 2008 | B1 |
7411915 | Spain et al. | Aug 2008 | B1 |
7426604 | Rygh et al. | Sep 2008 | B1 |
7630368 | Tripathi et al. | Dec 2009 | B2 |
7729296 | Choudhary | Jun 2010 | B1 |
7826469 | Li et al. | Nov 2010 | B1 |
8302301 | Lau | Nov 2012 | B2 |
8325459 | Mutnury et al. | Dec 2012 | B2 |
8339973 | Pichumani et al. | Dec 2012 | B1 |
8687629 | Kompella et al. | Apr 2014 | B1 |
8868766 | Theimer et al. | Oct 2014 | B1 |
9203188 | Siechen et al. | Dec 2015 | B1 |
9258195 | Pendleton et al. | Feb 2016 | B1 |
9374294 | Pani | Jun 2016 | B1 |
9397946 | Yadav | Jul 2016 | B1 |
9402470 | Shen et al. | Aug 2016 | B2 |
9407501 | Yadav | Aug 2016 | B2 |
9433081 | Xiong et al. | Aug 2016 | B1 |
9444634 | Pani | Sep 2016 | B2 |
9502111 | Dharmapurikar et al. | Nov 2016 | B2 |
9509092 | Shen et al. | Nov 2016 | B2 |
9544224 | Chu et al. | Jan 2017 | B2 |
9590914 | Attar et al. | Mar 2017 | B2 |
9627063 | Dharmapurikar et al. | Apr 2017 | B2 |
9634846 | Pani | Apr 2017 | B2 |
9635937 | Shen et al. | May 2017 | B2 |
9654300 | Pani | May 2017 | B2 |
9654385 | Chu et al. | May 2017 | B2 |
9654409 | Yadav et al. | May 2017 | B2 |
9655232 | Saxena et al. | May 2017 | B2 |
9667431 | Pani | May 2017 | B2 |
9667551 | Edsall et al. | May 2017 | B2 |
9674086 | Ma et al. | Jun 2017 | B2 |
9686180 | Chu et al. | Jun 2017 | B2 |
9698994 | Pani | Jul 2017 | B2 |
9716665 | Attar et al. | Jul 2017 | B2 |
9742673 | Banerjee et al. | Aug 2017 | B2 |
9755965 | Yadav et al. | Sep 2017 | B1 |
20020126671 | Ellis et al. | Sep 2002 | A1 |
20020146026 | Unitt et al. | Oct 2002 | A1 |
20030035385 | Walsh et al. | Feb 2003 | A1 |
20030067924 | Choe et al. | Apr 2003 | A1 |
20030097461 | Barham et al. | May 2003 | A1 |
20030115319 | Dawson et al. | Jun 2003 | A1 |
20030137940 | Schwartz et al. | Jul 2003 | A1 |
20030174650 | Shankar et al. | Sep 2003 | A1 |
20030231646 | Chandra et al. | Dec 2003 | A1 |
20040062259 | Jeffries et al. | Apr 2004 | A1 |
20040073715 | Folkes et al. | Apr 2004 | A1 |
20040100901 | Bellows | May 2004 | A1 |
20040103310 | Sobel et al. | May 2004 | A1 |
20040160956 | Hardy et al. | Aug 2004 | A1 |
20040249960 | Hardy et al. | Dec 2004 | A1 |
20050007961 | Scott et al. | Jan 2005 | A1 |
20050013280 | Buddhikot et al. | Jan 2005 | A1 |
20050175020 | Park et al. | Aug 2005 | A1 |
20050207410 | Adhikari et al. | Sep 2005 | A1 |
20060028285 | Jang et al. | Feb 2006 | A1 |
20060031643 | Figueira | Feb 2006 | A1 |
20060198315 | Sasagawa et al. | Sep 2006 | A1 |
20060209688 | Tsuge et al. | Sep 2006 | A1 |
20060221835 | Sweeney | Oct 2006 | A1 |
20060250982 | Yuan et al. | Nov 2006 | A1 |
20060268742 | Chu | Nov 2006 | A1 |
20060280179 | Meier | Dec 2006 | A1 |
20070025241 | Nadeau et al. | Feb 2007 | A1 |
20070223372 | Haalen et al. | Sep 2007 | A1 |
20070274229 | Scholl et al. | Nov 2007 | A1 |
20070280264 | Milton et al. | Dec 2007 | A1 |
20080031130 | Raj et al. | Feb 2008 | A1 |
20080031247 | Tahara et al. | Feb 2008 | A1 |
20080092213 | Wei et al. | Apr 2008 | A1 |
20080147830 | Ridgill et al. | Jun 2008 | A1 |
20080151863 | Lawrence et al. | Jun 2008 | A1 |
20080177896 | Quinn | Jul 2008 | A1 |
20080225853 | Melman et al. | Sep 2008 | A1 |
20080310421 | Teisberg et al. | Dec 2008 | A1 |
20090094357 | Keohane et al. | Apr 2009 | A1 |
20090122805 | Epps et al. | May 2009 | A1 |
20090188711 | Ahmad | Jul 2009 | A1 |
20090193103 | Small et al. | Jul 2009 | A1 |
20090232011 | Li et al. | Sep 2009 | A1 |
20090268614 | Tay et al. | Oct 2009 | A1 |
20100128619 | Shigei | May 2010 | A1 |
20100150155 | Napierala | Jun 2010 | A1 |
20100191813 | Gandhewar et al. | Jul 2010 | A1 |
20100191839 | Gandhewar et al. | Jul 2010 | A1 |
20100223655 | Zheng | Sep 2010 | A1 |
20100287227 | Goel et al. | Nov 2010 | A1 |
20100299553 | Cen | Nov 2010 | A1 |
20100312875 | Wilerson et al. | Dec 2010 | A1 |
20110110241 | Atkinson et al. | May 2011 | A1 |
20110138310 | Gomez et al. | Jun 2011 | A1 |
20110158248 | Vorunganti et al. | Jun 2011 | A1 |
20110170426 | Kompella et al. | Jul 2011 | A1 |
20110203834 | Yoneya et al. | Aug 2011 | A1 |
20110228795 | Agrawal et al. | Sep 2011 | A1 |
20110249682 | Kean et al. | Oct 2011 | A1 |
20110286447 | Liu | Nov 2011 | A1 |
20110299406 | Vobbilisetty et al. | Dec 2011 | A1 |
20110310738 | Lee et al. | Dec 2011 | A1 |
20110321031 | Dournov et al. | Dec 2011 | A1 |
20120007688 | Zhou et al. | Jan 2012 | A1 |
20120063318 | Boddu et al. | Mar 2012 | A1 |
20120102114 | Dunn et al. | Apr 2012 | A1 |
20120163396 | Cheng et al. | Jun 2012 | A1 |
20120275304 | Patel et al. | Nov 2012 | A1 |
20120281697 | Huang | Nov 2012 | A1 |
20120300787 | Korger | Nov 2012 | A1 |
20130055155 | Wong et al. | Feb 2013 | A1 |
20130090014 | Champion | Apr 2013 | A1 |
20130097335 | Jiang et al. | Apr 2013 | A1 |
20130124708 | Lee et al. | May 2013 | A1 |
20130182712 | Aguayo et al. | Jul 2013 | A1 |
20130250951 | Koganti | Sep 2013 | A1 |
20130311663 | Kamath et al. | Nov 2013 | A1 |
20130311991 | Li et al. | Nov 2013 | A1 |
20130322258 | Nedeltchev et al. | Dec 2013 | A1 |
20130322446 | Biswas et al. | Dec 2013 | A1 |
20130322453 | Allan | Dec 2013 | A1 |
20130332399 | Reddy et al. | Dec 2013 | A1 |
20130332577 | Nakil et al. | Dec 2013 | A1 |
20130332602 | Nakil et al. | Dec 2013 | A1 |
20140016501 | Kamath et al. | Jan 2014 | A1 |
20140047264 | Wang et al. | Feb 2014 | A1 |
20140056298 | Vobbilisetty et al. | Feb 2014 | A1 |
20140068750 | Tjahjono et al. | Mar 2014 | A1 |
20140086253 | Yong et al. | Mar 2014 | A1 |
20140105039 | McDysan | Apr 2014 | A1 |
20140105062 | McDysan et al. | Apr 2014 | A1 |
20140105216 | McDysan | Apr 2014 | A1 |
20140146817 | Zhang | May 2014 | A1 |
20140146824 | Angst et al. | May 2014 | A1 |
20140201375 | Beereddy et al. | Jul 2014 | A1 |
20140219275 | Allan et al. | Aug 2014 | A1 |
20140241353 | Zhang et al. | Aug 2014 | A1 |
20140244779 | Roitshtein et al. | Aug 2014 | A1 |
20140269712 | Kidambi | Sep 2014 | A1 |
20140307744 | Dunbar | Oct 2014 | A1 |
20140321277 | Lynn, Jr. et al. | Oct 2014 | A1 |
20140334295 | Guichard et al. | Nov 2014 | A1 |
20140341029 | Allan | Nov 2014 | A1 |
20140372582 | Ghanwani et al. | Dec 2014 | A1 |
20150009992 | Zhang | Jan 2015 | A1 |
20150092551 | Moisand et al. | Apr 2015 | A1 |
20150092593 | Kompella | Apr 2015 | A1 |
20150113143 | Stuart et al. | Apr 2015 | A1 |
20150124629 | Pani | May 2015 | A1 |
20150124633 | Banerjee et al. | May 2015 | A1 |
20150124640 | Chu et al. | May 2015 | A1 |
20150124644 | Pani | May 2015 | A1 |
20150124806 | Banerjee et al. | May 2015 | A1 |
20150124821 | Chu et al. | May 2015 | A1 |
20150124823 | Pani et al. | May 2015 | A1 |
20150124824 | Edsall et al. | May 2015 | A1 |
20150124825 | Dharmapurikar et al. | May 2015 | A1 |
20150124833 | Ma et al. | May 2015 | A1 |
20150236900 | Chung | Aug 2015 | A1 |
20150378712 | Cameron et al. | Dec 2015 | A1 |
20150378969 | Powell et al. | Dec 2015 | A1 |
20160119204 | Murasato et al. | Apr 2016 | A1 |
20170085469 | Chu et al. | Mar 2017 | A1 |
20170207961 | Saxena et al. | Jul 2017 | A1 |
20170214619 | Chu et al. | Jul 2017 | A1 |
20170237651 | Pani | Aug 2017 | A1 |
20170237678 | Ma et al. | Aug 2017 | A1 |
20170250912 | Chu et al. | Aug 2017 | A1 |
Number | Date | Country |
---|---|---|
WO 2014071996 | May 2014 | WO |
Number | Date | Country | |
---|---|---|---|
20160315811 A1 | Oct 2016 | US |
Number | Date | Country | |
---|---|---|---|
61900372 | Nov 2013 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14486828 | Sep 2014 | US |
Child | 15199752 | US |