US 11,212,140 B2Grant
Network-link method useful for a last-mile connectivity in an edge-gateway multipath system
Issue Date:2021-12-28
•20 Claims
•8 Drawing Sheets
Abstract
In one exemplary aspect, an edge-gateway multipath method includes the step of providing an edge device in a local network communicatively coupled with a cloud-computing service in a cloud-computing network. A set of wide area network (WAN) links connected to the edge device are automatically detected. The WAN links are automatically measured without the need for an external router. The edge device is communicatively coupled with a central configuration point in the cloud-computing network. The method further includes the step of downloading, from the central configuration point, an enterprise-specific configuration data into the edge device. The enterprise-specific configuration data includes the gateway information. The edge device is communicatively coupled with a gateway in the cloud-computing network. The communicatively coupling of the edge device with the gateway includes a multipath (MP) protocol.
Metadata
Assignee
- NICIRA, INC.
Inventors
- Sunil Mukundan
- Stephen Craig Connors
- Steven Michael Woo
- Ajit Ramachandra Mayya
- Thomas Harold Speeter
Application Information
Application Number:US 16/945,700
Filing Date:2020-07-31
Priority Date:2013-07-10
Art Unit:2463
Classifications
IPC:
H04L12/66H04L29/08H04L12/707H04L12/891H04L12/803H04L12/851H04L1/00H04L1/18H04L12/26H04L1/16
Field of Search:
H04L 12/66H04L 47/41H04L 47/125H04L 47/2408H04L 1/004
Patent Drawings (8 sheets)
Description
CLAIM OF BENEFIT TO PRIOR APPLICATIONS
[0001] This application is a continuation application of U.S. patent application Ser. No. 15/221,608, filed Jul. 28, 2016, now published as U.S. Patent Publication 2017/0134186. U.S. patent application Ser. No. 15/221,608 is a continuation-in-part of U.S. patent application Ser. No. 14/321,818, filed on Jul. 2, 2014, now issued as U.S. Pat. No. 9,722,815. U.S. patent application Ser. No. 14/321,818 claims priority to U.S. Provisional Patent Application 61/844,822, filed on Jul. 10, 2013. U.S. patent application Ser. No. 15/221,608, now published as U.S. Patent Publication 2017/0134186, U.S. patent application Ser. No. 14/321,818, now issued as U.S. Pat. No. 9,722,815, and U.S. Provisional Patent Application 61/844,822 are hereby incorporated by reference in their entirety.
BACKGROUND
[0002] Several trends are altering the use of enterprise applications. For example, enterprises are moving to hosting applications in private and public clouds as opposed to enterprise data centers. Enterprises are also increasingly using applications provided by other companies, which are generically grouped under SaaS (Software-as-a-Service) and are not hosted in an enterprise-data center. In another example, enterprises are migrating from large Information Technology (IT) supported branches to smaller branches. These smaller branches can utilize remote IT management strategies.
[0003] These trends have combined to alter application's network paths and/or the quality of service (QoS) of these paths. With enterprise data-center applications, the large IT branches can lease multiprotocol label switching (MPLS) lines. MPLS can be mechanism in communications networks that directs data from one network node to the next node based on short path labels rather than long network addresses, thus avoiding complex lookups in a routing table. MPLS lines can be associated with a known level of QoS that provides a deterministic application access experience and/or application availability. Applications are moving to the cloud where they are deployed either in the public and/or hybrid cloud. Enterprise branches access these applications via the public Internet. Access to these applications in such cases may be hampered by the ‘best effort’ nature of access as opposed to having a known QoS level. Additionally, a smaller branch may also utilize computing devices that are relatively easy to deploy and/or remotely manage in the event no on-site IT staff is available.
BRIEF SUMMARY OF THE INVENTION
[0004] In one aspect, a network-link method useful for a last-mile connectivity in an edge-gateway multipath includes the step of identifying a network-traffic flow of a computer network using deep-packet inspection to determine an identity of an application type associated with the network-traffic flow. The network-link method includes the step of aggregating a bandwidth from a specified set of network links. The network-link method includes the step of intelligently load-balancing a traffic on the set of network links by sending successive packets belonging to a same traffic flow on a set of specified multiple-network links. The set of specified multiple-network links is selected based on the identity of an application type associated with the network-traffic flow. The network-link method includes the step of identifying a set of active-network links in the set of specified multiple-network links. The network-link method includes the step of providing an in-order data delivery with an application persistence by sending data packets belonging to a same data-packet flow on the set of active links. The network-link method includes the step of correcting an error on a lossy network link using an error-control mechanism for data transmission selectively based on the identified network-traffic flow nd a current measured condition in the computer network.
BRIEF DESCRIPTION OF THE DRAWINGS
[0005] The present application can be best understood by reference to the following description taken in conjunction with the accompanying figures, in which like parts may be referred to by like numerals.
[0006] FIG. 1 illustrates an example a programmable, multi-tenant overlay network, according to some embodiments.
[0007] FIG. 2 depicts a process of a network link used to replace ‘last mile’ connectivity, according to some embodiments.
[0008] FIG. 3 depicts a process of removing the requirement for an IT administrator to configure each individual device in an enterprise computing network, according to some embodiments.
[0009] FIG. 4 illustrates an example flow sequence diagram for an MP packet flow, according to some embodiments.
[0010] FIG. 5 illustrates an example MP process for bandwidth aggregation and data ordering, according to some embodiments.
[0011] FIG. 6 illustrates an example of metadata in an MP header, according to some embodiments.
[0012] FIG. 7 depicts an exemplary computing system that can be configured to perform any one of the processes provided herein.
[0013] The Figures described above are a representative set, and are not an exhaustive with respect to embodying the invention.
DETAILED DESCRIPTION
[0014] Disclosed are a network-link method and system useful for a last-mile connectivity in an edge-gateway multipath. Although the present embodiments have been described with reference to specific example embodiments, it can be evident that various modifications and changes may be made to these embodiments without departing from the broader spirit and scope of the particular example embodiment.
[0015] Reference throughout this specification to “one embodiment,” “an embodiment,” or similar language means that a particular feature, structure, or characteristic described in connection with the embodiment is included in at least one embodiment of the present invention. Thus, appearances of the phrases “in one embodiment,” “in an embodiment,” and similar language throughout this specification may, but do not necessarily, all refer to the same embodiment.
[0016] Furthermore, the described features, structures, or characteristics of the invention may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided, such as examples of programming, software modules, attendee selections, network transactions, database queries, database structures, hardware modules, hardware circuits, hardware chips, etc., to provide a thorough understanding of embodiments of the invention. One skilled in the relevant art can recognize, however, that the invention may be practiced without one or more of the specific details, or with other methods, components, materials, and so forth. In other instances, well-known structures, materials, or operations are not shown or described in detail to avoid obscuring aspects of the invention.
[0017] The schematic flow chart diagrams included herein are generally set forth as logical flow chart diagrams. As such, the depicted order and labelled steps are indicative of one embodiment of the presented method. Other steps and methods may be conceived that are equivalent in function, logic, or effect to one or more steps, or portions thereof, of the illustrated method. Additionally, the format and symbols employed are provided to explain the logical steps of the method and are understood not to limit the scope of the method. Although various arrow types and line types may be employed in the flow chart diagrams, they are understood not to limit the scope of the corresponding method. Indeed, some arrows or other connectors may be used to indicate only the logical flow of the method. For instance, an arrow may indicate a waiting or monitoring period of unspecified duration between enumerated steps of the depicted method. Additionally, the order in which a particular method occurs may or may not strictly adhere to the order of the corresponding steps shown.
Example Definitions
[0018] Automatic Repeat reQuest (ARQ) can be an error-control method for data transmission that uses acknowledgements (e.g. messages sent by the receiver indicating that it has correctly received a data frame or packet) and timeouts (e.g. specified periods of time allowed to elapse before an acknowledgment is to be received) to achieve reliable data transmission over an unreliable service. If the sender does not receive an acknowledgment before the timeout, it retransmits the frame/packet until the sender receives an acknowledgment or exceeds a predefined number of re-transmissions
[0019] Deep-packet inspection (DPI) can include a form of computer network packet filtering that examines the data part (and also the header in some embodiments) of a packet as it passes an inspection point.
[0020] Forward error correction (FEC) can be used for controlling errors in data transmission over unreliable or noisy communication channels. A sender can encode a message in a redundant way by using an error-correcting code (ECC). FEC codes can include block codes, convolutional codes, etc.
[0021] Last-mile connectivity can refer to the final leg of the telecommunications networks delivery components and mechanisms.
[0022] Lossy can refer to data compression in which unnecessary information is discarded.
[0023] Multiprotocol Label Switching (MPLS) can be a type of data-carrying technique for high-performance telecommunications networks that directs data from one network node to the next based on short path labels rather than long network addresses, avoiding complex lookups in a routing table. The labels can identify virtual links between distant nodes rather than endpoints. MPLS can encapsulate packets of various network protocols. MPLS can support a range of access technologies, including, inter alia: T-carrier (e.g. T1)/E-carrier (E1), Asynchronous Transfer Mode (ATM), Frame Relay, and Digital subscriber line (DSL).
[0024] Quality of service (QoS) can refer to the overall performance of a telephony or computer network, particularly the performance seen by the users of the network.
[0025] Software as a Service (SaaS) can be a software licensing and delivery model in which software is licensed on a subscription basis and is centrally hosted.
[0026] Virtual Machine (VM) can be an emulationa particular computer system.
[0027] Link Characterization can refer to measuring the quality of a link which will include the latency (e.g. one-way packet delay), jitter (e.g. packet delay variation), loss (e.g. what percentage of packets are actually delivered at the receiving end) and available bandwidth.
[0028] Measured Condition in a computer network can refer to the characterization of one or more links that are connected to an edge device.
[0029] Error Control Mechanism can refer to the remedial action taken by an edge device or a gateway device to overcome the side effects of a non-perfect link. These mechanisms can be used to overcome jitter and loss experienced in any one link and include forward error correction (FEC), duplication of packets (e.g. if multiple links are available). This can also include an implementation of a jitter buffer which can minimize the effects of the packet delay variation.
Example Methods and Systems
[0030] FIG. 1 illustrates an example of a programmable, multi-tenant overlay network 100, according to some embodiments. An overlay network can be a computer network built on the top of another network. Overlay network 100 can include a distributed system such as a cloud-computing network (e.g. public cloud 102). Public cloud 102 can include a cloud-computing network. In some embodiments, public cloud 102 can be implemented, in whole or in part, as private cloud-computing network (e.g. a proprietary network or datacenter that uses cloud computing technologies). In other embodiments, the public cloud 102 can include SaaS companies 109 which provide applications to enterprises and end-consumers. As used herein, a cloud-computing network can include a computer network(s) that utilizes a variety of different computing concepts that involve a large number of computers connected through a real-time communication network (e.g. the Internet). A public cloud can include a set of computers and computer network resources based on the standard cloud-computing model, in which a service provider makes resources, such as applications and storage, available to the general public over the Internet. Applications, storage, and other resources can be made available by a service provider.
[0031] Public cloud 102 can include orchestrator 104 (e.g. a Velocloud® orchestrator). Orchestrator 104 can enable configuration and monitoring of the network from any location with Internet access. Orchestrator 104 can be a central controller for configuring and monitoring a multi-tenant instance of the overlay network described by a unique ‘network ID’. Each such instance can have a set of tenant(s) that have tenant specific policies for sharing resources, access control and configuration. A tenant can then have a ‘tenant-id’ which is used to identify tenants in the network. Multiple independent instances of networks can exist so as to enable self-operated overlay networks similar to the public network.
[0032] In this context, an orchestrator 104 can perform various functions such as configuration and monitoring. Orchestrator 104 can enable role based configuration and management. The following can be examples of roles. An ‘end-user’ (e.g. maps to an access device like laptop or mobile device) that connects to an edge device 108 that can be enabled to configure and/or monitor resources and policies that are specific to a user. A ‘tenant administrator’ can be a tenant administrator. A tenant administrator can configure tenant-wide policy and by extension policies for all the users in the tenancy. An ‘operator’ that can operate the overlay network by provisioning gateway(s) 106, edge device(s) 108 and/or other resources for the network (e.g. may not be able to view or modify tenant policies) can be provided.
[0033] In addition to this, the orchestrator 104 can also enable ‘authenticated partners’ to modify the behavior of the network (e.g. application service providers who want to reserve extra bandwidth for some applications sessions etc.) via published application program interface (APIs).
[0034] Public cloud 102 can include gateway(s) 106. A gateway can be a network node equipped for interfacing with another network utilizing different communication protocols. Gateway(s) 106 can be deployed in a public cloud (e.g. as shown in FIG. 1 ), a private cloud, Internet service provider (ISP) peering points and/or application service peering points that serve as aggregation points for multiple edges. Gateway(s) 106 can be located at peering points in public cloud 102.
[0035] Edge device 108 can provide entry points into enterprise and/or service-provider core networks. Example edge devices can include routers, routing switches, integrated access devices (IADs), multiplexers, and a variety of metropolitan area network (MAN) and wide area network (WAN) access devices. Edge device 108 can be deployed inline in one of several modes. In one example, edge device 108 can be deployed as a customer premises equipment (CPE) device in a branch that is capable of serving as a router. In one example, edge device 108 can be deployed as a powered mobile device that can be attached to end-user devices (e.g. laptops, desktops, wearable computers, tablet computers and the like via universal serial bus (USB)). In some examples, edge device 108 can include device software that directly interacts with a host-device operating system. In one example, the edge device 108 may be a virtual machine. A virtual machine can be a software-based emulation of a computer. In some examples, edge device 108 and the gateway(s) 106 can straddle the ‘bottleneck’ section of a communication network (e.g. the ‘last-mile’—a final leg of a communication networks delivering communications connectivity to a network host such as an enterprise computing system). In some embodiments, edge device 108 can be characterized as ‘zero touch’ (e.g. no configuration explicitly required at client side). Accordingly, edge device can automatically detect an available wide area network (WAN) and locate orchestrator 104.
[0036] The edge device 108 sends network packets. Network packets may be control packets, data packets or management packets. Control packets or control traffic is used to sense the quality of the path, link characteristics, clock synchronization etc. This is also known as the control plane. Data packets or data traffic are packets can be sent from the client and/or source computer to the application server running in the enterprise data center or private or public cloud 102. This is also known as the data plane. Management packets or management traffic are packets can be sent from the edge 108 or gateway 106 to the orchestrator 104 and includes heartbeat messages or flow statistics etc. This is also known as the management plane. In one example, both the control plane and the data plane can pass through the gateway 106. In some examples, only the control traffic may be sent to the gateway 106 and the data plane may bypass the gateway 106 and go directly from the edge 108 to the application server.
[0037] FIG. 2 depicts a process 200 of a network link used to replace a ‘last mile’ connectivity (e.g. last MPLS, T1 etc.), according to some embodiments. The network links can be multiple consumer grade broadband links, private links (MPLS, etc.), WiFi networks or 3g/4g mobile links with the ability to perform process 200. In step 202 of process 200, network traffic can be identified using deep-packet inspection to determine the application and/or application type of the traffic. Appropriate measures can be applied to ensure the QoS of the specific traffic based on the application, application type (e.g. real-time, transactional, bulk) and/or business priority of the traffic. For example, if the network traffic is identified as voice traffic which is a high business priority, then forward-error correction can be performed to reduce or eliminate packet loss. In another example, the network traffic can be identified as a bulk-file transfer. In this example, the file-transfer network traffic can be set as the lowest-priority traffic and can use a small portion of bandwidth under contention or more bandwidth if no other traffic is in the network. Traffic identified as ‘regular web browsing’ (such as Facebook® and YouTube®) can be dropped out of the network altogether and sent over the regular Internet as it is not business critical. In step 204, bandwidth can be aggregated from all the links (e.g. a link can be a communications channel that connects two or more communicating devices). For example, bandwidth can be aggregated with a multipath transport layer protocol capable of ‘striping’ a traffic flow (e.g. flow of data packets from a source to a destination) across multiple paths between two peers (e.g. edge 108 and/or gateway 106). Traffic flow can be ‘striped’ across the multiple paths in one peer and ‘gathered’ at the other peer. In step 206, traffic on the links can be intelligently load balanced by sending successive packets belonging to the same flow (e.g. a traffic flow) on multiple links selected by an application aware intelligent link characterization and/or link selection it is noted that the selected QoS based on the application can inform the selected links (e.g. whether to bind traffic to the best link, load balance or replicate traffic, etc.). The selected QoS can also determine whether the application is sensitive to loss and/or jitter. Based on the levels of loss and jitter in the network and the sensitivity of the traffic to them, a mitigation mechanism is put into play. In step 208, outages can be prevented using reliable, self-correcting data transfer to ensure in-order data delivery with the ability to maintain application persistence, as long as there is at least one active link, by sending packets belonging to the same flow on the active link(s). In step 210 errors on lossy links can be corrected using an error control mechanism for data transmission (e.g. Automatic Repeat-reQuest (ARQ) and/or forward error correction (FEC)) selectively based on the traffic identified and the current measured, conditions in the network.
[0038] FIG. 3 depicts a process 300 of removing the requirement for an IT administrator to configure each individual device in an enterprise computing network, according to some embodiments. In step 302, WAN links that are connected directly to the edge device can be detected and measured without the need for an external router. In step 304, a central configuration point in the cloud can be connected to. Enterprise-specific configuration data, including available gateways, can be downloaded. In step 306, the available gateway(s) can be connected to by the entity in the cloud with the enterprise-specific configuration data. In step 308, an available bandwidth on each path can be measured.
[0039] A multipath (MP) protocol can implemented by combining multiple network paths into a composite connection that multiplexes packets from MP packet flows and control information (path quality, link characteristics, clock synchronization, etc.). An MP packet flow can map to a pair of internet protocol (IP) flows (e.g. one flow in each direction such as forward and reverse and between two endpoints). The MP packet flow can be identified by a set of parameters that describe a pair of IP flows (e.g. five (5)-tuple (the reverse path is described with source and destination swapped), namely: source IP address, destination IP address, source port, destination port, and the network layer three (3) protocol identifier. In some examples, a multipath routing can include a routing technique of using multiple alternative paths through a network.
[0040] In effect every network layer four (4) flow (e.g. a pair of layer three (3) flows) (e.g. an application flow) can have a one-to-one mapping with the MP packet flow. In some embodiments, an, application flow and MP packet flow refer to the same notion. Each MP packet flow can be assigned an MP packet-flow identifier. The MP packet-flow identifier can be unique to the set of MP peers (e.g. peer one (1) and/or peer two (2) of FIG. 4 ). An MP node can aggregate connections from multiple MP peers that are sending MP packet flows to it (e.g. gateway(s) 106). The MP node can aggregate flow identifiers generated b the non-aggregation peer (e.g. edge device 108) that may not be unique.
[0041] In one example, at the time of first connection between two MP stacks, an MP_INITIATE message can be passed which assigns a unique identifier that is used by the non-aggregation peer to ensure the flow identifier is unique at the aggregation point (see FIG. 4 ). In one example, this operation can be implemented to an identifier specific to the particular network of the non-aggregation peer.
[0042] FIG. 4 illustrates an example flow sequence 400 diagram for an MP packet flow, according to some embodiments. In one embodiment, peer one (1) can be a client-side edge device and peer two (2) can be a cloud-based gateway device. Peer one (1) can transmit an MP_INITIATE 402 to peer two (2). MP_CONTROL 408 (e.g. control information such as QoS parameters, treatment of data traffic flow parameters, etc.) can be exchanged between peer one (1) and peer two (2). Data packets can then be exchanged (e.g. MP_DATA 404 and MP_DATA 412). Data packets can include any user data. These data packets can be sequenced, numbered and/or sent across multiple links. When sent across multiple links, redundant copies of the packets can be purged on receipt. Data packets can be acknowledged on return. Additional control data (e.g. MP_CONTROL) can be exchanged. MP_FIN 406 can initiate closing the MP packet flow session by peer one (1). Peer two (2) can provide MP_FIN+ACK 412 to acknowledge MP_FIN 406 can terminate session.
[0043] FIG. 5 illustrates an example MP process 500 for bandwidth aggregation and data ordering, according to some embodiments. Process 500 can be used for intersession load balancing. In some embodiments, the MP stack can achieve bandwidth aggregation by sending successive packets belonging to the same MP packet flow on the different paths, to a peer MP stack. In some examples, different paths can be established on different links (though this is not a limiting condition). For example, data packets 502 can be an application flow. Data packets 502 can be striped with a MP stripe 504 in one device (e.g. edge device 108).
[0044] The endpoints (e.g. client and the application server) can infer this as an aggregated throughput as more packets are delivered to the endpoints in a given time window when compared to non-multipath case. MP process 500 can deliver ordered data 505 and 508 between two MP peers even if the data is sent on different paths between the peers. For example, successive data packets belonging to the same flow can be sent on different links with additional metadata. The metadata can identify data packet absolute offsets in the original flow. This metadata can be used to re-arrange the data back in order when the underlying application requires in-order data. In some applications (e.g. real-time collaboration applications) this re-ordering may introduce latencies that may be unacceptable. In these instances, data packets can be delivered in the same order of arrival. The application can handle ordering of data packets. This application awareness can be in the transport layer. This presence can be implemented on both sides of the network and enable interpretation of metadata and reassemble the data. This functionality can be selectively turned on/off based on detecting an application's particular requirements on receiving the ordered data 506 and 508. Additional headers, shown below, marked with MP headers 510 and 514 (e.g. “Vn’) can be added. MP headers 510 and 514 can describe the data ordering along with other metadata (e.g. such as MP packet flow identifier, timestamps).
[0045] FIG. 6 illustrates an example of metadata in an MP header, according to some embodiments. This metadata can enable the peer MP stack to receive the MP packet flows 506 and 508 (including striped data packets 512 and 516) from different paths in their order of arrival and re-arrange them in order to re-create the original flow of data packets 502 as data packets 520.
[0046] In one example, a Global Data Sequence Number (GDSN) can be the byte offset of the data with respect to the original application flow (e.g. data packets 502). GDSN can be used to reorder the data. Each MP packet can have the GDSN which is used by the peer MP stack to re-order the MP packet flow in an original order. Additionally, each peer can transmit the last seen GDSN on its stack for a given MP packet flow ‘piggybacked’ on an MP data packet. This last seen GDSN can be used to purge queues and re-transmit a missing GDSN. In the case the data transfer is half-duplex, then a MP_ACK message can be explicitly used to transmit the last seen GDSN to the other peer.
[0047] In the context of FIG. 4 , during the closing of the MP packet flow 400, the MP_FIN 406 can be set by the peer that initiates the closing of the MP packet flow 400. The GDSN in this packet can be used by the other peer to acknowledge teardown via the MP_FIN+ACK 414 with a GDSN of zero (0).
[0048] An example method of traffic identification is now provided. An MP system can utilize an external deep-packet inspection engine (and/or form of computer network packet filtering) to identify the application and application type of a given flow. This information can be used to determine the optimal MP packet flow settings to ensure the MP packet flow's QoS parameter. In cases where the application cannot be identified, an MP system can monitor the behavior of MP packet flows over time and attempt to derive the optimal settings for QoS. Future flows can be mapped to these new settings using IP address, port number, protocol, TOS/DSCP tag and/or destination hostname as the MP system learns optimal MP traffic parameters. Additionally, these settings which were obtained through this slow learning method (e.g. can include machine-learning methodologies such as neural networks, supervised learning, unsupervised learning, clustering, structured prediction, decision tree learning, reinforcement learning and the like) can be shared to all other edges in the network via the orchestrator 104 which can allow learning to be spread across an enterprise or the entire network of connected edges.
[0049] Deep-packet inspection (DPI) can include examining, the data part (and/or also the packet header, etc.) of a packet as it passes an inspection point, searching for protocol non-compliance, viruses, spam, intrusions, or defined criteria to decide whether the packet may pass or if it needs to be routed to a different destination, or, for the purpose of collecting statistical information. DPI can be performed with a DPI engine (e.g. Qosmos®, DPI engine, Dell™ SonicWALL™ Reassembly-Free Deep-Packet Inspection™ (RFDPI) engine, etc.) and/or other packet analyser.
[0050] An example of path characterization and selection is now provided. An MP protocol can implicitly implement communicating an MP packet flow on multiple paths (e.g. on a set of underlying links). Consequently, an active path characterization that periodically measures the health of a path can be implemented. A cost function that computes a cost for each path based on the parameters measured in the health check can be implemented. A selection algorithm can be implemented that applies a set of constraints and chooses the path based on the path cost and the transmit algorithm determined.
[0051] An example of active path characterization is now provided. As a part of link characterization, the latency (e.g. one-way packet delay), jitter (e.g. packet delay variation), loss and available bandwidth on the path can be measured. To measure latency between two MP peers on a given path, a clock synchronization operation can be implemented in the MP peers. An example time synchronization protocol is now provided. Timestamp measurements can be sent continuously to whichever device is performing the role of master clock. The lowest difference in timestamps from a set of measurements can be used as a measure of the offset between the clocks. Backward time shifts which could influence measurements and computation can be avoided. The drift rate can be measured by observing the change in offset over time. Based on this drift rate, the interval between continuous measurements can be calculated to ensure that clocks will remain synchronized over time. Once the docks are synchronized, the one-way receive latency and jitter can then be measured by sending a timestamped packet train.
[0052] In one example, multipath transport can handle and/or prevent congestion issues when the network paths are sufficiently diverse from a network topology standpoint. In these cases, the overall load on the individual paths can be reduced. On the other hand, diverse network paths can have diverse characteristics in terms of latency, throughput, loss and/or jitter. The load-balancing algorithm can send packets are on a ‘best possible’ link until the point the link is oversubscribed and/or there is loss on the link before switching to another path. When the network includes a wireline backbone (cable, DSL etc.), alternate paths can be utilized when available. On the other hand, with respect to networks with a wireless backbone (e.g. mobile, WiFi, WiMax, etc.), a packet drop may be an ‘ephemeral’ event that is short lived with relatively quicker recovery. In such a case, it may not be prudent to switch to alternate paths or clamp down the rate for this event without consideration of various other metrics. Thus, other metrics in addition to a loss value can be utilized. For example, a combination of parameters can be utilized, including, inter alia: the ECN flag (e.g. explicit congestion notification) set by an upstream router in an IP layer, a rate of acknowledgements received, a rate of loss in an interval of time to estimate the lossy value of a link, etc.
[0053] In one example, the cost of a MP path can be computed as the e taken for a data packet to reach from one peer to another peer inclusive of such factors as scheduling and/or MP processing overheads. It can be computed as the sum of the jitter, latency and processing delays. The path with the least cost with respect to, a given a set of constraints (e.g. link level policies, application specific path usage policies etc.) can be, selected accordingly.
[0054] An example MP path selection method is now provided. Based on the application and/or the current measured network conditions, the MP path(s) can be treated in various ways. In one example, the MP path can be load balanced such that each data packet selects the path with the lowest path cost and is transmitted on that path. In another example, the MP path can fixed such that the first packet selects the best path available. This path can be used as long it is available. If an active path characterization operation determines that the path is no longer available, a path selection operation can be performed again and the MP packet flow can migrate to a next best path. In yet another example, the MP path can be replicated across n-number paths based on such parameters as, inter alia: the importance of the application, bandwidth required and/or expected potential for packet loss in the network.
[0055] In one example, QoS can be ensured for an application by utilizing a combination of path selection methods such as those provided supra, as well as, network scheduling, packet reordering and/or error correction. For example, when an MP packet flow is initiated, an edge device (e.g. edge device 108) can identify the application and determine the proper QoS methods to be applied for this type of flow. The methods may or may not be symmetric (e.g. the same for the sender and receiver). Once the edge device determines the methods to be used, a control message can be sent to the gateway to ensure that the gateway (e.g. gateway(s) 106) in turn has information as to how to treat the MP packet flow (e.g. without having to do its own application identification). In the event the MP system (e.g. based on network conditions) and/or an administrator indicates that the methods should be changed, the edge device can again signal the gateway with a control message. The methods can be updated without interruption to the service or traffic. For example, upon receipt of the control message from the edge, the gateway can update the QoS methods of the flow without deleting the existing flow. As a result, the next packet to be sent can use the updated scheduling policies and link selection methods that were transmitted without interruption. For example, a MP packet flow that is being load balanced and is changed to replication as loss increases in the network can load balance packets 1-n until the control message is received. Packet flow can be a sequence of packets from a source computer to a destination, which may be another host, a multicast group, or a broadcast domain. Accordingly, packets beginning with n+1 can begin to be replicated.
[0056] The gateway can be a multi-tenant gateway wherein multiple customers with edge devices can connect to the same gateway without actually exposing any of their data to each other. The multi-tenant gateway can implement a two-level hierarchical scheduler. In this case, a total egress bandwidth to the edge can be equally shared (e.g. in a work conserving manner) between all the connected edges at the top level (e.g. root level). The second level (e.g. a leaf) can schedule the MP packet flows belonging to a particular edge device rather than have resource limits defined for that edge device by the top level. To ensure that the scheduler does not hit processing limits for scheduling flows, the leaf level scheduler may not have per flow queues. Instead, a multiplexing algorithm can be utilized. The multiplexing algorithm can map a set of flows characterized by a set of parameters to a set of queues such that there is a many to one mapping between flows and queues.
[0057] In one example, SaaS applications may also directly interact with the software in the edge device (e.g. edge device 108 in FIG. 1 ) or gateway(s) (e.g. gateway 106 in FIG. 1 ). This can be done, for example, to query the health of the last-mile and to provision network bandwidth and characteristics in the last-mile to ensure QoS for the application. The edge device and/or the gateway(s) regardless of their embodiments provide APIs (application programming interfaces) that a SaaS application, with suitable permissions, can use to determine how the last-mile from the edge device to the gateway (e.g. in both directions) is performing. With this information the SaaS application may throttle back bandwidth so that the application continues to operate without congesting the network further and yet function reasonably well. By default, when an end-user accesses an application (which may run anywhere in the public cloud), the edge device identifies the application and determines the proper QoS methods to apply for this type of flow. As noted in supra, this includes network scheduling, packet reordering and/or error correction which is determined by policies set in the Orchestrator (e.g. orchestrator 104 in FIG. 1 ). The SaaS application may modify these policies dynamically to ensure that the end-user gets the best experience possible given the current last-mile characteristics.
[0058] FIG. 7 depicts an exemplary computing system 700 that can be configured to perform any one of the processes provided herein. In this context, computing system 700 may include, for example, a processor, memory, storage, and I/O devices (e.g., monitor, keyboard, disk drive, Internet connection, etc.). However, computing system 700 may include circuitry or other specialized hardware for carrying out some or all aspects of the processes. In some operational settings, computing system 700 may be configured as a system that includes one or more units, each of which is configured to carry out some aspects of the processes either in software, hardware, or some combination thereof.
[0059] FIG. 7 depicts computing system 700 with a number of components that may be used to perform any of the processes described herein. The main system 702 includes a mother-board 704 having an I/O section 705, one or more central processing units (CPU) 708, and a memory section 710, which may have a flash memory card 712 related to it. The I/O section 705 can be connected to a display 714, a keyboard and/or other user input (not shown), a disk storage unit 716, and a media drive unit 718. The media drive unit 718 can read/write a computer-readable medium 720, which can include programs 722 and/or data.
B. CONCLUSION
[0060] Although the present embodiments have been described with reference to specific example embodiments, various modifications and changes can be made to these embodiments without departing from the broader spirit and scope of the various embodiments. For example, the various devices, modules, etc. described herein can be enabled and operated using hardware circuitry, firmware, software or any combination of hardware, firmware, and software (e.g., embodied in a machine-readable medium).
[0061] In addition, it can be appreciated that the various operations, processes, and methods disclosed herein can be embodied in a machine-readable medium and/or a machine accessible medium compatible with a data processing system (e.g., a computer system), and can be performed in any order (e.g., including using means for achieving the various operations). Accordingly, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense. In some embodiments, the machine-readable medium can be a non-transitory form of machine-readable medium.
Claims
What is claimed as new and desired to be protected by Letters Patent of the United States is:
1. A method for directing packet flows in a software defined wide area network (SD-WAN), the method comprising:
at an edge device connected to a gateway via a plurality of network links between the edge device and the gateway, wherein the gateway is at a different location than the edge device:
receiving a packet flow;
performing deep packet inspection (DPI) on the received packet flow to identify an application type associated with the received packet flow; and
based on the identified application type, selecting a network link from the plurality of network links between the edge device and the gateway for forwarding the packet flow to the gateway.
2. The method of claim 1, wherein the gateway is in a public cloud.
3. The method of claim 1, wherein the gateway is in a datacenter.
4. The method of claim 1, wherein the edge device is at a premises of an enterprise, and the plurality of network links connect the premises to the gateway at the different location.
5. The method of claim 1, wherein selecting the network link comprises selecting, based on the identified application type, two or more network links from the plurality of network links to forward the packets of the flow to the gateway.
6. The method of claim 5, wherein selecting the two or more network links comprises:
assessing bandwidth on the plurality of network links; and
load balancing traffic on the two or more network links to distribute the packets belonging to the flow among the two or more network links.
7. The method of claim 6, wherein load balancing traffic comprises assessing a quality of a network link based on the identified application type.
8. The method of claim 7, wherein assessing the quality of the network link comprises measuring a quality of the network link based on at least one of latency, jitter, loss, and available bandwidth.
9. The method of claim 5, wherein selecting the two or more network links comprises identifying a set of two or more active network links.
10. The method of claim 1, wherein the identified application type comprises an identify of a specific application associated with the network-traffic flow.
11. The method of claim 1, wherein the identified application type comprises a bulk-file transfer application type, wherein bulk-file transfer network traffic is set as a lowest priority traffic and uses a small portion of network bandwidth.
12. The method of claim 1, wherein when the identified application type comprises a social-network website browsing application type, the network-traffic flow is switched to an internet connection.
13. The method of claim 1, wherein the identified application type comprises a voice application type, and wherein the voice application type comprises a high priority traffic type, the method further comprising performing a forward-error correction to reduce packet loss.
14. A non-transitory machine readable medium storing a program for execution by a set of processing units, the program for directing packet flows along a plurality of network links defined between an edge device and a gateway device of a software defined wide area network (SD-WAN), the program comprising sets of instructions for:
at an edge device connected to a gateway that is at a different location than the edge device:
receiving a packet flow;
performing deep packet inspection (DPI) on the received packet flow to identify an application type associated with the received packet flow; and
based on the identified application type, selecting a network link from the plurality of network links for forwarding the packet flow to the gateway.
15. The non-transitory machine readable medium of claim 14, wherein the gateway is in one of a public cloud and a datacenter.
16. The non-transitory machine readable medium of claim 14, wherein the edge device is at a premises of an enterprise, and the plurality of network links connect the premises to the gateway at the different location.
17. The non-transitory machine readable medium of claim 14, wherein the set of instructions for selecting the network link comprises a set of instructions for selecting, based on the identified application type, two or more network links from the plurality of network links to forward the packets of the flow to the gateway.
18. The non-transitory machine readable medium of claim 17, wherein the set of instruction for selecting the two or more network links comprises sets of instructions for:
assessing bandwidth on the plurality of network links; and
load balancing traffic on the two or more network links to distribute the packets belonging to the flow among the two or more network links.
19. The non-transitory machine readable medium of claim 18, wherein the set of instructions for load balancing traffic comprises a set of instructions for assessing a quality of a network link based on the identified application type by measuring a quality of the network link based on at least one of latency, jitter, loss, and available bandwidth.
20. The non-transitory machine readable medium of claim 14, wherein the identified application type comprises an identity of a specific application associated with the network-traffic flow.
Patent Citations (566)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US5652751(A) | 1997-07-01 | Sharony | Applicant |
| US5909553(A) | 1999-06-01 | Campbell et al. | Applicant |
| US6154465(A) | 2000-11-01 | Pickett | Applicant |
| US6157648(A) | 2000-12-01 | Voit et al. | Applicant |
| US6201810(B1) | 2001-03-01 | Masuda et al. | Applicant |
| US6363378(B1) | 2002-03-01 | Conklin et al. | Applicant |
| US6445682(B1) | 2002-09-01 | Weitz | Applicant |
| US6744775(B1) | 2004-06-01 | Beshai et al. | Applicant |
| US6976087(B1) | 2005-12-01 | Westfall et al. | Applicant |
| US7003481(B2) | 2006-02-01 | Banka et al. | Applicant |
| US7280476(B2) | 2007-10-01 | Anderson | Applicant |
| US7313629(B1) | 2007-12-01 | Nucci et al. | Applicant |
| US7320017(B1) | 2008-01-01 | Kurapati et al. | Applicant |
| US7581022(B1) | 2009-08-01 | Griffin et al. | Applicant |
| US7680925(B2) | 2010-03-01 | Sathyanarayana et al. | Applicant |
| US7681236(B2) | 2010-03-01 | Tamura et al. | Applicant |
| US7962458(B2) | 2011-06-01 | Holenstein et al. | Applicant |
| US8094575(B1) | 2012-01-01 | Vadlakonda et al. | Applicant |
| US8094659(B1) | 2012-01-01 | Arad | Applicant |
| US8111692(B2) | 2012-02-01 | Ray | Applicant |
| US8141156(B1) | 2012-03-01 | Mao et al. | Applicant |
| US8224971(B1) | 2012-07-01 | Miller et al. | Applicant |
| US8228928(B2) | 2012-07-01 | Parandekar et al. | Applicant |
| US8243589(B1) | 2012-08-01 | Trost et al. | Applicant |
| US8259566(B2) | 2012-09-01 | Chen et al. | Applicant |
| US8274891(B2) | 2012-09-01 | Averi et al. | Applicant |
| US8301749(B1) | 2012-10-01 | Finklestein et al. | Applicant |
| US8385227(B1) | 2013-02-01 | Downey | Applicant |
| US8566452(B1) | 2013-10-01 | Goodwin et al. | Applicant |
| US8630291(B2) | 2014-01-01 | Shaffer et al. | Applicant |
| US8661295(B1) | 2014-02-01 | Khanna et al. | Applicant |
| US8724456(B1) | 2014-05-01 | Hong et al. | Applicant |
| US8724503(B2) | 2014-05-01 | Johnsson et al. | Applicant |
| US8745177(B1) | 2014-06-01 | Kazerani et al. | Applicant |
| US8799504(B2) | 2014-08-01 | Capone et al. | Applicant |
| US8804745(B1) | 2014-08-01 | Sinn | Applicant |
| US8806482(B1) | 2014-08-01 | Nagargadde et al. | Applicant |
| US8856339(B2) | 2014-10-01 | Mestery et al. | Applicant |
| US8964548(B1) | 2015-02-01 | Keralapura et al. | Applicant |
| US8989199(B1) | 2015-03-01 | Sella et al. | Applicant |
| US9009217(B1) | 2015-04-01 | Nagargadde et al. | Applicant |
| US9055000(B1) | 2015-06-01 | Ghosh et al. | Applicant |
| US9060025(B2) | 2015-06-01 | Xu | Applicant |
| US9071607(B2) | 2015-06-01 | Twitchell, Jr. | Applicant |
| US9075771(B1) | 2015-07-01 | Gawali et al. | Applicant |
| US9135037(B1) | 2015-09-01 | Petrescu-Prahova et al. | Applicant |
| US9137334(B2) | 2015-09-01 | Zhou | Applicant |
| US9154327(B1) | 2015-10-01 | Marino et al. | Applicant |
| US9306949(B1) | 2016-04-01 | Richard et al. | Applicant |
| US9323561(B2) | 2016-04-01 | Ayala et al. | Applicant |
| US9336040(B2) | 2016-05-01 | Dong et al. | Applicant |
| US9354983(B1) | 2016-05-01 | Yenamandra et al. | Applicant |
| US9356943(B1) | 2016-05-01 | Lopilato et al. | Applicant |
| US9379981(B1) | 2016-06-01 | Zhou et al. | Applicant |
| US9413724(B2) | 2016-08-01 | Xu | Applicant |
| US9419878(B2) | 2016-08-01 | Hsiao et al. | Applicant |
| US9432245(B1) | 2016-08-01 | Sorenson et al. | Applicant |
| US9438566(B2) | 2016-09-01 | Zhang et al. | Applicant |
| US9450817(B1) | 2016-09-01 | Bahadur et al. | Applicant |
| US9450852(B1) | 2016-09-01 | Chen et al. | Applicant |
| US9462010(B1) | 2016-10-01 | Stevenson | Applicant |
| US9467478(B1) | 2016-10-01 | Khan et al. | Applicant |
| US9485163(B1) | 2016-11-01 | Fries et al. | Applicant |
| US9521067(B2) | 2016-12-01 | Michael et al. | Applicant |
| US9525564(B2) | 2016-12-01 | Lee | Applicant |
| US9559951(B1) | 2017-01-01 | Sajassi et al. | Applicant |
| US9563423(B1) | 2017-02-01 | Pittman | Applicant |
| US9602389(B1) | 2017-03-01 | Maveli et al. | Applicant |
| US9608917(B1) | 2017-03-01 | Anderson et al. | Applicant |
| US9608962(B1) | 2017-03-01 | Chang | Applicant |
| US9621460(B2) | 2017-04-01 | Mehta et al. | Applicant |
| US9641551(B1) | 2017-05-01 | Kariyanahalli | Applicant |
| US9665432(B2) | 2017-05-01 | Kruse et al. | Applicant |
| US9686127(B2) | 2017-06-01 | Ramachandran et al. | Applicant |
| US9715401(B2) | 2017-07-01 | Devine et al. | Applicant |
| US9717021(B2) | 2017-07-01 | Hughes et al. | Applicant |
| US9722815(B2) | 2017-08-01 | Mukundan et al. | Applicant |
| US9747249(B2) | 2017-08-01 | Cherian et al. | Applicant |
| US9755965(B1) | 2017-09-01 | Yadav et al. | Applicant |
| US9787559(B1) | 2017-10-01 | Schroeder | Applicant |
| US9807004(B2) | 2017-10-01 | Koley et al. | Applicant |
| US9819565(B2) | 2017-11-01 | Djukic et al. | Applicant |
| US9825822(B1) | 2017-11-01 | Holland | Applicant |
| US9825911(B1) | 2017-11-01 | Brandwine | Applicant |
| US9825992(B2) | 2017-11-01 | Xu | Applicant |
| US9832128(B1) | 2017-11-01 | Ashner et al. | Applicant |
| US9832205(B2) | 2017-11-01 | Santhi et al. | Applicant |
| US9875355(B1) | 2018-01-01 | Williams | Applicant |
| US9906401(B1) | 2018-02-01 | Rao | Applicant |
| US9930011(B1) | 2018-03-01 | Clemons, Jr. et al. | Applicant |
| US9935829(B1) | 2018-04-01 | Miller et al. | Applicant |
| US9942787(B1) | 2018-04-01 | Tillotson | Applicant |
| US10038601(B1) | 2018-07-01 | Becker et al. | Applicant |
| US10057183(B2) | 2018-08-01 | Salle et al. | Applicant |
| US10057294(B2) | 2018-08-01 | Xu | Applicant |
| US10135789(B2) | 2018-11-01 | Mayya et al. | Applicant |
| US10142226(B1) | 2018-11-01 | Wu et al. | Applicant |
| US10178032(B1) | 2019-01-01 | Freitas | Applicant |
| US10187289(B1) | 2019-01-01 | Chen et al. | Applicant |
| US10229017(B1) | 2019-03-01 | Zou et al. | Applicant |
| US10237123(B2) | 2019-03-01 | Dubey et al. | Applicant |
| US10250498(B1) | 2019-04-01 | Bales et al. | Applicant |
| US10263832(B1) | 2019-04-01 | Ghosh | Applicant |
| US10320664(B2) | 2019-06-01 | Nainar et al. | Applicant |
| US10320691(B1) | 2019-06-01 | Matthews et al. | Applicant |
| US10326830(B1) | 2019-06-01 | Singh | Applicant |
| US10348767(B1) | 2019-07-01 | Lee et al. | Applicant |
| US10355989(B1) | 2019-07-01 | Panchal et al. | Applicant |
| US10425382(B2) | 2019-09-01 | Mayya et al. | Applicant |
| US10454708(B2) | 2019-10-01 | Mibu | Applicant |
| US10454714(B2) | 2019-10-01 | Mayya et al. | Applicant |
| US10498652(B2) | 2019-12-01 | Mayya et al. | Applicant |
| US10511546(B2) | 2019-12-01 | Singarayan et al. | Applicant |
| US10523539(B2) | 2019-12-01 | Mayya et al. | Applicant |
| US10554538(B2) | 2020-02-01 | Spohn et al. | Applicant |
| US10560431(B1) | 2020-02-01 | Chen et al. | Applicant |
| US10565464(B2) | 2020-02-01 | Han et al. | Applicant |
| US10567519(B1) | 2020-02-01 | Mukhopadhyaya et al. | Applicant |
| US10574528(B2) | 2020-02-01 | Mayya et al. | Applicant |
| US10594516(B2) | 2020-03-01 | Cidon et al. | Applicant |
| US10594659(B2) | 2020-03-01 | El-Moussa et al. | Applicant |
| US10608844(B2) | 2020-03-01 | Cidon et al. | Applicant |
| US10637889(B2) | 2020-04-01 | Ermagan et al. | Applicant |
| US10666460(B2) | 2020-05-01 | Cidon et al. | Applicant |
| US10686625(B2) | 2020-06-01 | Cidon et al. | Applicant |
| US10749711(B2) | 2020-08-01 | Mukundan et al. | Applicant |
| US10778466(B2) | 2020-09-01 | Cidon et al. | Applicant |
| US10778528(B2) | 2020-09-01 | Mayya et al. | Applicant |
| US10805114(B2) | 2020-10-01 | Cidon et al. | Applicant |
| US10805272(B2) | 2020-10-01 | Mayya et al. | Applicant |
| US10826775(B1) | 2020-11-01 | Moreno et al. | Applicant |
| US10841131(B2) | 2020-11-01 | Cidon et al. | Applicant |
| US10938693(B2) | 2021-03-01 | Mayya et al. | Applicant |
| US10958479(B2) | 2021-03-01 | Cidon et al. | Applicant |
| US10959098(B2) | 2021-03-01 | Cidon et al. | Applicant |
| US2002/0087716(A1) | 2002-07-01 | Mustafa | Applicant |
| US2002/0198840(A1) | 2002-12-01 | Banka et al. | Applicant |
| US2003/0088697(A1) | 2003-05-01 | Matsuhira | Applicant |
| US2003/0112766(A1) | 2003-06-01 | Riedel et al. | Applicant |
| US2003/0112808(A1) | 2003-06-01 | Solomon | Applicant |
| US2003/0126468(A1) | 2003-07-01 | Markham | Applicant |
| US2003/0161313(A1) | 2003-08-01 | Jinmei et al. | Applicant |
| US2003/0189919(A1) | 2003-10-01 | Gupta et al. | Applicant |
| US2003/0202506(A1) | 2003-10-01 | Perkins et al. | Applicant |
| US2003/0219030(A1) | 2003-11-01 | Gubbi | Applicant |
| US2004/0059831(A1) | 2004-03-01 | Chu et al. | Applicant |
| US2004/0068668(A1) | 2004-04-01 | Lor et al. | Applicant |
| US2004/0165601(A1) | 2004-08-01 | Liu et al. | Applicant |
| US2004/0224771(A1) | 2004-11-01 | Chen et al. | Applicant |
| US2005/0078690(A1) | 2005-04-01 | DeLangis | Applicant |
| US2005/0154790(A1) | 2005-07-01 | Nagata et al. | Applicant |
| US2005/0172161(A1) | 2005-08-01 | Cruz et al. | Applicant |
| US2005/0265255(A1) | 2005-12-01 | Kodialam et al. | Applicant |
| US2006/0002291(A1) | 2006-01-01 | Alicherry et al. | Applicant |
| US2006/0114838(A1) | 2006-06-01 | Mandavilli et al. | Applicant |
| US2006/0171365(A1) | 2006-08-01 | Borella | Applicant |
| US2006/0182034(A1) | 2006-08-01 | Klinker et al. | Applicant |
| US2006/0182035(A1) | 2006-08-01 | Vasseur | Applicant |
| US2006/0193247(A1) | 2006-08-01 | Naseh et al. | Applicant |
| US2006/0193252(A1) | 2006-08-01 | Naseh et al. | Applicant |
| US2007/0064604(A1) | 2007-03-01 | Chen et al. | Applicant |
| US2007/0064702(A1) | 2007-03-01 | Bates et al. | Applicant |
| US2007/0091794(A1) | 2007-04-01 | Filsfils et al. | Applicant |
| US2007/0115812(A1) | 2007-05-01 | Hughes | Applicant |
| US2007/0121486(A1) | 2007-05-01 | Guichard et al. | Applicant |
| US2007/0130325(A1) | 2007-06-01 | Lesser | Examiner |
| US2007/0177511(A1) | 2007-08-01 | Das et al. | Applicant |
| US2007/0237081(A1) | 2007-10-01 | Kodialam et al. | Applicant |
| US2007/0260746(A1) | 2007-11-01 | Mirtorabi et al. | Applicant |
| US2007/0268882(A1) | 2007-11-01 | Breslau et al. | Applicant |
| US2008/0002670(A1) | 2008-01-01 | Bugenhagen et al. | Applicant |
| US2008/0049621(A1) | 2008-02-01 | McGuire et al. | Applicant |
| US2008/0080509(A1) | 2008-04-01 | Khanna et al. | Applicant |
| US2008/0095187(A1) | 2008-04-01 | Jung et al. | Applicant |
| US2008/0144532(A1) | 2008-06-01 | Chamarajanagar et al. | Applicant |
| US2008/0181116(A1) | 2008-07-01 | Kavanaugh et al. | Applicant |
| US2008/0219276(A1) | 2008-09-01 | Shah | Applicant |
| US2008/0240121(A1) | 2008-10-01 | Xiong et al. | Applicant |
| US2009/0013210(A1) | 2009-01-01 | McIntosh et al. | Applicant |
| US2009/0125617(A1) | 2009-05-01 | Klessig et al. | Applicant |
| US2009/0154463(A1) | 2009-06-01 | Hines et al. | Applicant |
| US2009/0247204(A1) | 2009-10-01 | Sennett et al. | Applicant |
| US2009/0274045(A1) | 2009-11-01 | Meier et al. | Applicant |
| US2009/0276657(A1) | 2009-11-01 | Wetmore et al. | Applicant |
| US2009/0303880(A1) | 2009-12-01 | Maltz et al. | Applicant |
| US2010/0008361(A1) | 2010-01-01 | Guichard et al. | Applicant |
| US2010/0017802(A1) | 2010-01-01 | Lojewski | Applicant |
| US2010/0046532(A1) | 2010-02-01 | Okita | Applicant |
| US2010/0061379(A1) | 2010-03-01 | Parandekar et al. | Applicant |
| US2010/0088440(A1) | 2010-04-01 | Banks et al. | Applicant |
| US2010/0091823(A1) | 2010-04-01 | Retana et al. | Applicant |
| US2010/0107162(A1) | 2010-04-01 | Edwards et al. | Applicant |
| US2010/0118727(A1) | 2010-05-01 | Draves et al. | Applicant |
| US2010/0191884(A1) | 2010-07-01 | Holenstein et al. | Applicant |
| US2010/0223621(A1) | 2010-09-01 | Joshi et al. | Applicant |
| US2010/0309841(A1) | 2010-12-01 | Conte | Applicant |
| US2010/0309912(A1) | 2010-12-01 | Mehta et al. | Applicant |
| US2010/0322255(A1) | 2010-12-01 | Hao et al. | Applicant |
| US2010/0332657(A1) | 2010-12-01 | Elyashev et al. | Applicant |
| US2011/0007752(A1) | 2011-01-01 | Silva et al. | Applicant |
| US2011/0032939(A1) | 2011-02-01 | Nozaki et al. | Applicant |
| US2011/0040814(A1) | 2011-02-01 | Higgins | Applicant |
| US2011/0075674(A1) | 2011-03-01 | Li et al. | Applicant |
| US2011/0107139(A1) | 2011-05-01 | Middlecamp et al. | Applicant |
| US2011/0110370(A1) | 2011-05-01 | Moreno et al. | Applicant |
| US2011/0141877(A1) | 2011-06-01 | Xu et al. | Applicant |
| US2011/0142041(A1) | 2011-06-01 | Imai | Applicant |
| US2011/0153909(A1) | 2011-06-01 | Dong | Applicant |
| US2012/0008630(A1) | 2012-01-01 | Ould-Brahim | Applicant |
| US2012/0027013(A1) | 2012-02-01 | Napierala | Applicant |
| US2012/0136697(A1) | 2012-05-01 | Peles et al. | Applicant |
| US2012/0157068(A1) | 2012-06-01 | Eichen | Examiner |
| US2012/0173694(A1) | 2012-07-01 | Yan et al. | Applicant |
| US2012/0173919(A1) | 2012-07-01 | Patel et al. | Applicant |
| US2012/0221955(A1) | 2012-08-01 | Raleigh et al. | Applicant |
| US2012/0250682(A1) | 2012-10-01 | Vincent et al. | Applicant |
| US2012/0250686(A1) | 2012-10-01 | Vincent et al. | Applicant |
| US2012/0281706(A1) | 2012-11-01 | Agarwal et al. | Applicant |
| US2012/0300615(A1) | 2012-11-01 | Kempf et al. | Applicant |
| US2012/0317291(A1) | 2012-12-01 | Wolfe | Applicant |
| US2013/0019005(A1) | 2013-01-01 | Hui | Examiner |
| US2013/0021968(A1) | 2013-01-01 | Reznik et al. | Applicant |
| US2013/0044764(A1) | 2013-02-01 | Casado et al. | Applicant |
| US2013/0051399(A1) | 2013-02-01 | Zhang et al. | Applicant |
| US2013/0054763(A1) | 2013-02-01 | Merwe et al. | Applicant |
| US2013/0086267(A1) | 2013-04-01 | Gelenbe et al. | Applicant |
| US2013/0103834(A1) | 2013-04-01 | Dzerve et al. | Applicant |
| US2013/0124718(A1) | 2013-05-01 | Griffith et al. | Applicant |
| US2013/0124911(A1) | 2013-05-01 | Griffith et al. | Applicant |
| US2013/0124912(A1) | 2013-05-01 | Griffith et al. | Applicant |
| US2013/0128889(A1) | 2013-05-01 | Mathur | Examiner |
| US2013/0142201(A1) | 2013-06-01 | Kim et al. | Applicant |
| US2013/0173788(A1) | 2013-07-01 | Song | Applicant |
| US2013/0182712(A1) | 2013-07-01 | Aguayo et al. | Applicant |
| US2013/0191688(A1) | 2013-07-01 | Agarwal et al. | Applicant |
| US2013/0238782(A1) | 2013-09-01 | Zhao et al. | Applicant |
| US2013/0242718(A1) | 2013-09-01 | Zhang | Applicant |
| US2013/0254599(A1) | 2013-09-01 | Katkar et al. | Applicant |
| US2013/0258839(A1) | 2013-10-01 | Wang et al. | Applicant |
| US2013/0283364(A1) | 2013-10-01 | Chang et al. | Applicant |
| US2013/0286846(A1) | 2013-10-01 | Atlas et al. | Applicant |
| US2013/0297770(A1) | 2013-11-01 | Zhang | Applicant |
| US2013/0301469(A1) | 2013-11-01 | Suga | Applicant |
| US2013/0301642(A1) | 2013-11-01 | Radhakrishnan et al. | Applicant |
| US2013/0308444(A1) | 2013-11-01 | Sem-Jacobsen et al. | Applicant |
| US2013/0315242(A1) | 2013-11-01 | Wang et al. | Applicant |
| US2013/0315243(A1) | 2013-11-01 | Huang et al. | Applicant |
| US2013/0329548(A1) | 2013-12-01 | Nakil et al. | Applicant |
| US2013/0329601(A1) | 2013-12-01 | Yin et al. | Applicant |
| US2013/0329734(A1) | 2013-12-01 | Chesla | Examiner |
| US2013/0346470(A1) | 2013-12-01 | Obstfeld et al. | Applicant |
| US2014/0019604(A1) | 2014-01-01 | Twitchell, Jr. | Applicant |
| US2014/0019750(A1) | 2014-01-01 | Dodgson et al. | Applicant |
| US2014/0040975(A1) | 2014-02-01 | Raleigh et al. | Applicant |
| US2014/0064283(A1) | 2014-03-01 | Balus et al. | Applicant |
| US2014/0092907(A1) | 2014-04-01 | Sridhar et al. | Applicant |
| US2014/0108665(A1) | 2014-04-01 | Arora et al. | Applicant |
| US2014/0112171(A1) | 2014-04-01 | Pasdar | Applicant |
| US2014/0115584(A1) | 2014-04-01 | Mudigonda et al. | Applicant |
| US2014/0126418(A1) | 2014-05-01 | Brendel et al. | Applicant |
| US2014/0156818(A1) | 2014-06-01 | Hunt | Applicant |
| US2014/0156823(A1) | 2014-06-01 | Liu et al. | Applicant |
| US2014/0164560(A1) | 2014-06-01 | Ko et al. | Applicant |
| US2014/0164617(A1) | 2014-06-01 | Jalan et al. | Applicant |
| US2014/0173113(A1) | 2014-06-01 | Vemuri et al. | Applicant |
| US2014/0173331(A1) | 2014-06-01 | Martin et al. | Applicant |
| US2014/0208317(A1) | 2014-07-01 | Nakagawa | Applicant |
| US2014/0219135(A1) | 2014-08-01 | Li et al. | Applicant |
| US2014/0223507(A1) | 2014-08-01 | Xu | Applicant |
| US2014/0229210(A1) | 2014-08-01 | Sharifian et al. | Applicant |
| US2014/0244851(A1) | 2014-08-01 | Lee | Applicant |
| US2014/0258535(A1) | 2014-09-01 | Zhang | Applicant |
| US2014/0269690(A1) | 2014-09-01 | Tu | Applicant |
| US2014/0279862(A1) | 2014-09-01 | Dietz et al. | Applicant |
| US2014/0280499(A1) | 2014-09-01 | Basavaiah et al. | Applicant |
| US2014/0317440(A1) | 2014-10-01 | Biermayr et al. | Applicant |
| US2014/0337500(A1) | 2014-11-01 | Lee | Applicant |
| US2014/0341109(A1) | 2014-11-01 | Cartmell et al. | Applicant |
| US2014/0372582(A1) | 2014-12-01 | Ghanwani et al. | Applicant |
| US2015/0003240(A1) | 2015-01-01 | Drwiega et al. | Applicant |
| US2015/0016249(A1) | 2015-01-01 | Mukundan et al. | Applicant |
| US2015/0029864(A1) | 2015-01-01 | Raileanu et al. | Applicant |
| US2015/0046572(A1) | 2015-02-01 | Cheng et al. | Applicant |
| US2015/0052247(A1) | 2015-02-01 | Threefoot et al. | Applicant |
| US2015/0052517(A1) | 2015-02-01 | Raghu et al. | Applicant |
| US2015/0056960(A1) | 2015-02-01 | Egner et al. | Applicant |
| US2015/0058917(A1) | 2015-02-01 | Xu | Applicant |
| US2015/0088942(A1) | 2015-03-01 | Shah | Applicant |
| US2015/0089628(A1) | 2015-03-01 | Lang | Applicant |
| US2015/0092603(A1) | 2015-04-01 | Aguayo et al. | Applicant |
| US2015/0096011(A1) | 2015-04-01 | Watt | Applicant |
| US2015/0124603(A1) | 2015-05-01 | Ketheesan et al. | Applicant |
| US2015/0134777(A1) | 2015-05-01 | Onoue | Applicant |
| US2015/0139238(A1) | 2015-05-01 | Pourzandi et al. | Applicant |
| US2015/0146539(A1) | 2015-05-01 | Mehta et al. | Applicant |
| US2015/0163152(A1) | 2015-06-01 | Li | Applicant |
| US2015/0169340(A1) | 2015-06-01 | Haddad et al. | Applicant |
| US2015/0172121(A1) | 2015-06-01 | Farkas et al. | Applicant |
| US2015/0172169(A1) | 2015-06-01 | DeCusatis et al. | Applicant |
| US2015/0188823(A1) | 2015-07-01 | Williams et al. | Applicant |
| US2015/0189009(A1) | 2015-07-01 | Bemmel | Applicant |
| US2015/0195178(A1) | 2015-07-01 | Bhattacharya et al. | Applicant |
| US2015/0201036(A1) | 2015-07-01 | Nishiki et al. | Applicant |
| US2015/0222543(A1) | 2015-08-01 | Song | Applicant |
| US2015/0222638(A1) | 2015-08-01 | Morley | Applicant |
| US2015/0236945(A1) | 2015-08-01 | Michael et al. | Applicant |
| US2015/0236962(A1) | 2015-08-01 | Veres et al. | Applicant |
| US2015/0244617(A1) | 2015-08-01 | Nakil et al. | Applicant |
| US2015/0249644(A1) | 2015-09-01 | Xu | Applicant |
| US2015/0271056(A1) | 2015-09-01 | Chunduri et al. | Applicant |
| US2015/0271104(A1) | 2015-09-01 | Chikkamath et al. | Applicant |
| US2015/0271303(A1) | 2015-09-01 | Neginhal et al. | Applicant |
| US2015/0312142(A1) | 2015-10-01 | Barabash et al. | Applicant |
| US2015/0317169(A1) | 2015-11-01 | Sinha et al. | Applicant |
| US2015/0334696(A1) | 2015-11-01 | Gu et al. | Applicant |
| US2015/0341271(A1) | 2015-11-01 | Gomez | Applicant |
| US2015/0349978(A1) | 2015-12-01 | Wu et al. | Applicant |
| US2015/0350907(A1) | 2015-12-01 | Timariu et al. | Applicant |
| US2015/0363733(A1) | 2015-12-01 | Brown | Applicant |
| US2015/0372943(A1) | 2015-12-01 | Hasan et al. | Applicant |
| US2015/0372982(A1) | 2015-12-01 | Herle et al. | Applicant |
| US2015/0381407(A1) | 2015-12-01 | Wang et al. | Applicant |
| US2015/0381493(A1) | 2015-12-01 | Bansal et al. | Applicant |
| US2016/0035183(A1) | 2016-02-01 | Buchholz et al. | Applicant |
| US2016/0036924(A1) | 2016-02-01 | Koppolu et al. | Applicant |
| US2016/0036938(A1) | 2016-02-01 | Aviles et al. | Applicant |
| US2016/0037434(A1) | 2016-02-01 | Gopal et al. | Applicant |
| US2016/0072669(A1) | 2016-03-01 | Saavedra | Applicant |
| US2016/0080502(A1) | 2016-03-01 | Yadav et al. | Applicant |
| US2016/0105353(A1) | 2016-04-01 | Cociglio | Applicant |
| US2016/0105392(A1) | 2016-04-01 | Thakkar et al. | Applicant |
| US2016/0105471(A1) | 2016-04-01 | Nunes et al. | Applicant |
| US2016/0134461(A1) | 2016-05-01 | Sampath et al. | Applicant |
| US2016/0134528(A1) | 2016-05-01 | Lin et al. | Applicant |
| US2016/0134591(A1) | 2016-05-01 | Liao et al. | Applicant |
| US2016/0142373(A1) | 2016-05-01 | Ossipov | Applicant |
| US2016/0164832(A1) | 2016-06-01 | Bellagamba et al. | Applicant |
| US2016/0164914(A1) | 2016-06-01 | Madhav et al. | Applicant |
| US2016/0173338(A1) | 2016-06-01 | Wolting | Applicant |
| US2016/0191363(A1) | 2016-06-01 | Haraszti et al. | Applicant |
| US2016/0191374(A1) | 2016-06-01 | Singh et al. | Applicant |
| US2016/0197834(A1) | 2016-07-01 | Luft | Applicant |
| US2016/0197835(A1) | 2016-07-01 | Luft | Applicant |
| US2016/0198003(A1) | 2016-07-01 | Luft | Applicant |
| US2016/0210209(A1) | 2016-07-01 | Verkaik et al. | Applicant |
| US2016/0218947(A1) | 2016-07-01 | Hughes et al. | Applicant |
| US2016/0218951(A1) | 2016-07-01 | Vasseur et al. | Applicant |
| US2016/0255169(A1) | 2016-09-01 | Kovvuri et al. | Applicant |
| US2016/0261493(A1) | 2016-09-01 | Li | Applicant |
| US2016/0261495(A1) | 2016-09-01 | Xia et al. | Applicant |
| US2016/0261639(A1) | 2016-09-01 | Xu | Applicant |
| US2016/0269298(A1) | 2016-09-01 | Li et al. | Applicant |
| US2016/0269926(A1) | 2016-09-01 | Sundaram | Applicant |
| US2016/0285736(A1) | 2016-09-01 | Gu | Applicant |
| US2016/0308762(A1) | 2016-10-01 | Teng et al. | Applicant |
| US2016/0315912(A1) | 2016-10-01 | Mayya et al. | Applicant |
| US2016/0323377(A1) | 2016-11-01 | Einkauf et al. | Applicant |
| US2016/0328159(A1) | 2016-11-01 | Coddington et al. | Applicant |
| US2016/0352588(A1) | 2016-12-01 | Subbarayan et al. | Applicant |
| US2016/0353268(A1) | 2016-12-01 | Senarath et al. | Applicant |
| US2016/0359738(A1) | 2016-12-01 | Sullenberger et al. | Applicant |
| US2016/0366187(A1) | 2016-12-01 | Kamble | Applicant |
| US2016/0371153(A1) | 2016-12-01 | Dornemann | Applicant |
| US2016/0380886(A1) | 2016-12-01 | Blair et al. | Applicant |
| US2016/0380906(A1) | 2016-12-01 | Hodique et al. | Applicant |
| US2017/0005986(A1) | 2017-01-01 | Bansal et al. | Applicant |
| US2017/0012870(A1) | 2017-01-01 | Blair et al. | Applicant |
| US2017/0019428(A1) | 2017-01-01 | Cohn | Applicant |
| US2017/0026283(A1) | 2017-01-01 | Williams et al. | Applicant |
| US2017/0026355(A1) | 2017-01-01 | Mathaiyan et al. | Applicant |
| US2017/0034046(A1) | 2017-02-01 | Cai et al. | Applicant |
| US2017/0034129(A1) | 2017-02-01 | Sawant et al. | Applicant |
| US2017/0053258(A1) | 2017-02-01 | Carney et al. | Applicant |
| US2017/0055131(A1) | 2017-02-01 | Kong et al. | Applicant |
| US2017/0063674(A1) | 2017-03-01 | Maskalik et al. | Applicant |
| US2017/0063782(A1) | 2017-03-01 | Jain et al. | Applicant |
| US2017/0063794(A1) | 2017-03-01 | Jain et al. | Applicant |
| US2017/0064005(A1) | 2017-03-01 | Lee | Applicant |
| US2017/0093625(A1) | 2017-03-01 | Pera et al. | Applicant |
| US2017/0097841(A1) | 2017-04-01 | Chang et al. | Applicant |
| US2017/0104755(A1) | 2017-04-01 | Arregoces et al. | Applicant |
| US2017/0118173(A1) | 2017-04-01 | Arramreddy et al. | Applicant |
| US2017/0123939(A1) | 2017-05-01 | Maheshwari et al. | Applicant |
| US2017/0126516(A1) | 2017-05-01 | Tiagi et al. | Applicant |
| US2017/0126564(A1) | 2017-05-01 | Mayya et al. | Applicant |
| US2017/0134186(A1) | 2017-05-01 | Mukundan et al. | Applicant |
| US2017/0134520(A1) | 2017-05-01 | Abbasi et al. | Applicant |
| US2017/0139789(A1) | 2017-05-01 | Fries et al. | Applicant |
| US2017/0155557(A1) | 2017-06-01 | Desai et al. | Applicant |
| US2017/0163473(A1) | 2017-06-01 | Sadana et al. | Applicant |
| US2017/0171310(A1) | 2017-06-01 | Gardner | Applicant |
| US2017/0181210(A1) | 2017-06-01 | Nadella et al. | Applicant |
| US2017/0195161(A1) | 2017-07-01 | Ruel et al. | Applicant |
| US2017/0195169(A1) | 2017-07-01 | Mills et al. | Applicant |
| US2017/0201585(A1) | 2017-07-01 | Doraiswamy et al. | Applicant |
| US2017/0207976(A1) | 2017-07-01 | Rovner et al. | Applicant |
| US2017/0214545(A1) | 2017-07-01 | Cheng et al. | Applicant |
| US2017/0214701(A1) | 2017-07-01 | Hasan | Applicant |
| US2017/0223117(A1) | 2017-08-01 | Messerli et al. | Applicant |
| US2017/0237710(A1) | 2017-08-01 | Mayya et al. | Applicant |
| US2017/0257260(A1) | 2017-09-01 | Govindan et al. | Applicant |
| US2017/0257309(A1) | 2017-09-01 | Appanna | Applicant |
| US2017/0264496(A1) | 2017-09-01 | Ao et al. | Applicant |
| US2017/0279717(A1) | 2017-09-01 | Bethers et al. | Applicant |
| US2017/0279803(A1) | 2017-09-01 | Desai et al. | Applicant |
| US2017/0280474(A1) | 2017-09-01 | Vesterinen et al. | Applicant |
| US2017/0289002(A1) | 2017-10-01 | Ganguli et al. | Applicant |
| US2017/0302565(A1) | 2017-10-01 | Ghobadi et al. | Applicant |
| US2017/0310641(A1) | 2017-10-01 | Jiang et al. | Applicant |
| US2017/0310691(A1) | 2017-10-01 | Vasseur et al. | Applicant |
| US2017/0317974(A1) | 2017-11-01 | Masurekar et al. | Applicant |
| US2017/0337086(A1) | 2017-11-01 | Zhu et al. | Applicant |
| US2017/0339054(A1) | 2017-11-01 | Yadav et al. | Applicant |
| US2017/0339070(A1) | 2017-11-01 | Chang et al. | Applicant |
| US2017/0364419(A1) | 2017-12-01 | Lo | Applicant |
| US2017/0366445(A1) | 2017-12-01 | Nemirovsky et al. | Applicant |
| US2017/0366467(A1) | 2017-12-01 | Martin et al. | Applicant |
| US2017/0374174(A1) | 2017-12-01 | Evens et al. | Applicant |
| US2018/0006995(A1) | 2018-01-01 | Bickhart et al. | Applicant |
| US2018/0007123(A1) | 2018-01-01 | Cheng et al. | Applicant |
| US2018/0014051(A1) | 2018-01-01 | Phillips et al. | Applicant |
| US2018/0034668(A1) | 2018-02-01 | Mayya et al. | Applicant |
| US2018/0041425(A1) | 2018-02-01 | Zhang | Applicant |
| US2018/0062914(A1) | 2018-03-01 | Boutros et al. | Applicant |
| US2018/0062917(A1) | 2018-03-01 | Chandrashekhar et al. | Applicant |
| US2018/0063036(A1) | 2018-03-01 | Chandrashekhar et al. | Applicant |
| US2018/0063193(A1) | 2018-03-01 | Chandrashekhar et al. | Applicant |
| US2018/0063233(A1) | 2018-03-01 | Park | Applicant |
| US2018/0069924(A1) | 2018-03-01 | Tumuluru et al. | Applicant |
| US2018/0074909(A1) | 2018-03-01 | Bishop et al. | Applicant |
| US2018/0077081(A1) | 2018-03-01 | Lauer et al. | Applicant |
| US2018/0077202(A1) | 2018-03-01 | Xu | Applicant |
| US2018/0084081(A1) | 2018-03-01 | Kuchibhotla et al. | Applicant |
| US2018/0097725(A1) | 2018-04-01 | Wood et al. | Applicant |
| US2018/0114569(A1) | 2018-04-01 | Strachan et al. | Applicant |
| US2018/0131608(A1) | 2018-05-01 | Jiang et al. | Applicant |
| US2018/0131615(A1) | 2018-05-01 | Zhang | Applicant |
| US2018/0131720(A1) | 2018-05-01 | Hobson et al. | Applicant |
| US2018/0145899(A1) | 2018-05-01 | Rao | Applicant |
| US2018/0159856(A1) | 2018-06-01 | Gujarathi | Applicant |
| US2018/0167378(A1) | 2018-06-01 | Kostyukov et al. | Applicant |
| US2018/0176073(A1) | 2018-06-01 | Dubey et al. | Applicant |
| US2018/0176082(A1) | 2018-06-01 | Katz et al. | Applicant |
| US2018/0176130(A1) | 2018-06-01 | Banerjee et al. | Applicant |
| US2018/0213472(A1) | 2018-07-01 | Ishii et al. | Applicant |
| US2018/0219765(A1) | 2018-08-01 | Michael et al. | Applicant |
| US2018/0219766(A1) | 2018-08-01 | Michael et al. | Applicant |
| US2018/0234300(A1) | 2018-08-01 | Mayya et al. | Applicant |
| US2018/0260125(A1) | 2018-09-01 | Botes et al. | Applicant |
| US2018/0262468(A1) | 2018-09-01 | Kumar et al. | Applicant |
| US2018/0270104(A1) | 2018-09-01 | Zheng et al. | Applicant |
| US2018/0278541(A1) | 2018-09-01 | Wu et al. | Applicant |
| US2018/0295529(A1) | 2018-10-01 | Jen et al. | Applicant |
| US2018/0302286(A1) | 2018-10-01 | Mayya et al. | Applicant |
| US2018/0302321(A1) | 2018-10-01 | Manthiramoorthy et al. | Applicant |
| US2018/0351855(A1) | 2018-12-01 | Sood et al. | Applicant |
| US2018/0351862(A1) | 2018-12-01 | Jeganathan et al. | Applicant |
| US2018/0351863(A1) | 2018-12-01 | Vairavakkalai et al. | Applicant |
| US2018/0351882(A1) | 2018-12-01 | Jeganathan et al. | Applicant |
| US2018/0373558(A1) | 2018-12-01 | Chang et al. | Applicant |
| US2018/0375744(A1) | 2018-12-01 | Mayya et al. | Applicant |
| US2018/0375824(A1) | 2018-12-01 | Mayya et al. | Applicant |
| US2018/0375967(A1) | 2018-12-01 | Pithawala et al. | Applicant |
| US2019/0014038(A1) | 2019-01-01 | Ritchie | Applicant |
| US2019/0020588(A1) | 2019-01-01 | Twitchell, Jr. | Applicant |
| US2019/0020627(A1) | 2019-01-01 | Yuan | Applicant |
| US2019/0028552(A1) | 2019-01-01 | Johnson et al. | Applicant |
| US2019/0036810(A1) | 2019-01-01 | Michael et al. | Applicant |
| US2019/0046056(A1) | 2019-02-01 | Khachaturian et al. | Applicant |
| US2019/0058657(A1) | 2019-02-01 | Chunduri et al. | Applicant |
| US2019/0058709(A1) | 2019-02-01 | Kempf et al. | Applicant |
| US2019/0068470(A1) | 2019-02-01 | Mirsky | Applicant |
| US2019/0068493(A1) | 2019-02-01 | Ram et al. | Applicant |
| US2019/0068500(A1) | 2019-02-01 | Hira | Applicant |
| US2019/0075083(A1) | 2019-03-01 | Mayya et al. | Applicant |
| US2019/0103990(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0103991(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0103992(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0103993(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104035(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104049(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104050(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104051(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104052(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104053(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104063(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104064(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104109(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104111(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0104413(A1) | 2019-04-01 | Cidon et al. | Applicant |
| US2019/0140889(A1) | 2019-05-01 | Mayya et al. | Applicant |
| US2019/0140890(A1) | 2019-05-01 | Mayya et al. | Applicant |
| US2019/0158605(A1) | 2019-05-01 | Markuze et al. | Applicant |
| US2019/0199539(A1) | 2019-06-01 | Deng et al. | Applicant |
| US2019/0220703(A1) | 2019-07-01 | Prakash et al. | Applicant |
| US2019/0238364(A1) | 2019-08-01 | Boutros et al. | Applicant |
| US2019/0238446(A1) | 2019-08-01 | Barzik et al. | Applicant |
| US2019/0238449(A1) | 2019-08-01 | Michael et al. | Applicant |
| US2019/0238450(A1) | 2019-08-01 | Michael et al. | Applicant |
| US2019/0268421(A1) | 2019-08-01 | Markuze et al. | Applicant |
| US2019/0280962(A1) | 2019-09-01 | Michael et al. | Applicant |
| US2019/0280963(A1) | 2019-09-01 | Michael et al. | Applicant |
| US2019/0280964(A1) | 2019-09-01 | Michael et al. | Applicant |
| US2019/0313907(A1) | 2019-10-01 | Khachaturian et al. | Applicant |
| US2019/0319847(A1) | 2019-10-01 | Nahar et al. | Applicant |
| US2019/0356736(A1) | 2019-11-01 | Narayanaswamy et al. | Applicant |
| US2019/0364099(A1) | 2019-11-01 | Thakkar et al. | Applicant |
| US2019/0372888(A1) | 2019-12-01 | Michael et al. | Applicant |
| US2019/0372889(A1) | 2019-12-01 | Michael et al. | Applicant |
| US2019/0372890(A1) | 2019-12-01 | Michael et al. | Applicant |
| US2020/0014615(A1) | 2020-01-01 | Michael et al. | Applicant |
| US2020/0014616(A1) | 2020-01-01 | Michael et al. | Applicant |
| US2020/0014661(A1) | 2020-01-01 | Mayya et al. | Applicant |
| US2020/0021514(A1) | 2020-01-01 | Michael et al. | Applicant |
| US2020/0021515(A1) | 2020-01-01 | Michael et al. | Applicant |
| US2020/0036624(A1) | 2020-01-01 | Michael et al. | Applicant |
| US2020/0059420(A1) | 2020-02-01 | Abraham | Applicant |
| US2020/0059459(A1) | 2020-02-01 | Abraham et al. | Applicant |
| US2020/0092207(A1) | 2020-03-01 | Sipra et al. | Applicant |
| US2020/0097327(A1) | 2020-03-01 | Beyer et al. | Applicant |
| US2020/0099659(A1) | 2020-03-01 | Cometto et al. | Applicant |
| US2020/0106696(A1) | 2020-04-01 | Michael et al. | Applicant |
| US2020/0106706(A1) | 2020-04-01 | Mayya et al. | Applicant |
| US2020/0119952(A1) | 2020-04-01 | Mayya et al. | Applicant |
| US2020/0127905(A1) | 2020-04-01 | Mayya et al. | Applicant |
| US2020/0153736(A1) | 2020-05-01 | Liebherr et al. | Applicant |
| US2020/0177503(A1) | 2020-06-01 | Hooda et al. | Applicant |
| US2020/0204460(A1) | 2020-06-01 | Schneider et al. | Applicant |
| US2020/0213212(A1) | 2020-07-01 | Dillon et al. | Applicant |
| US2020/0218558(A1) | 2020-07-01 | Sreenath et al. | Applicant |
| US2020/0235990(A1) | 2020-07-01 | Janakiraman et al. | Applicant |
| US2020/0235999(A1) | 2020-07-01 | Mayya et al. | Applicant |
| US2020/0236046(A1) | 2020-07-01 | Jain et al. | Applicant |
| US2020/0244721(A1) | 2020-07-01 | S et al. | Applicant |
| US2020/0267184(A1) | 2020-08-01 | Vera-Schockner | Applicant |
| US2020/0280587(A1) | 2020-09-01 | Janakiraman et al. | Applicant |
| US2020/0296011(A1) | 2020-09-01 | Jain et al. | Applicant |
| US2020/0296026(A1) | 2020-09-01 | Michael et al. | Applicant |
| US2020/0314614(A1) | 2020-10-01 | Moustafa et al. | Applicant |
| US2020/0351188(A1) | 2020-11-01 | Arora et al. | Applicant |
| US2020/0366562(A1) | 2020-11-01 | Mayya et al. | Applicant |
| US2020/0382345(A1) | 2020-12-01 | Zhao et al. | Applicant |
| US2020/0382387(A1) | 2020-12-01 | Pasupathy et al. | Applicant |
| US2021/0006490(A1) | 2021-01-01 | Michael et al. | Applicant |
| US2021/0029088(A1) | 2021-01-01 | Mayya et al. | Applicant |
| US2021/0067372(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067373(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067374(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067375(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067407(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067427(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067461(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067464(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067467(A1) | 2021-03-01 | Cidon et al. | Applicant |
| US2021/0067468(A1) | 2021-03-01 | Cidon et al. | Applicant |
| EP1912381(A1) | 2008-04-01 | Applicant | |
| EP3041178(A1) | 2016-07-01 | Applicant | |
| EP3509256(A1) | 2019-07-01 | Applicant | |
| WO3073701 | 2003-09-01 | Applicant | |
| WO2012167184(A2) | 2012-12-01 | Applicant | |
| WO2017083975(A1) | 2017-05-01 | Applicant | |
| WO2019070611(A1) | 2019-04-01 | Applicant | |
| WO2019094522(A1) | 2019-05-01 | Applicant | |
| WO2020018704(A1) | 2020-01-01 | Applicant | |
| WO2020101922(A1) | 2020-05-01 | Applicant | |
| WO2021040934(A1) | 2021-03-01 | Applicant |
Non-Patent Literature (35)
- Mudigonda, Jayaram, et al., “NetLord: A Scalable Multi-Tenant Network Architecture for Virtualized Datacenters,” Proceedings of the ACM SIGCOMM 2011 Conference, Aug. 15-19, 2011, 12 pages, ACM, Toronto, Canada.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,363, filed Oct. 24, 2019, 129 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,379, filed Oct. 24, 2019, 123 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,402, filed Oct. 24, 2019, 128 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,427, filed Oct. 24, 2019, 165 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,489, filed Oct. 24, 2019, 165 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,510, filed Oct. 24, 2019, 165 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,531, filed Oct. 24, 2019, 135 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,570, filed Oct. 24, 2019, 141 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,587, filed Oct. 24, 2019, 145 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/662,591, filed Oct. 24, 2019, 130 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/721,964, filed Dec. 20, 2019, 39 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/721,965, filed Dec. 20, 2019, 39 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/792,908, filed Feb. 18, 2020, 48 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/792,909, filed Feb. 18, 2020, 49 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/851,294, filed Apr. 17, 2020, 59 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/851,301, filed Apr. 17, 2020, 59 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/851,308, filed Apr. 17, 2020, 59 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/851,314, filed Apr. 17, 2020, 59 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/851,323, filed Apr. 17, 2020, 59 pages, VMware, Inc.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 16/851,397, filed Apr. 17, 2020, 59 pages, VMware, Inc.Applicant
- Petition for Post-Grant Review of U.S. Pat. No. 9,722,815, filed May 1, 2018, 106 pages.Applicant
- Del Piccolo, Valentin, et al., “A Survey of Network Isolation Solutions for Multi-Tenant Data Centers,” IEEE Communications Society, Apr. 20, 2016, vol. 18, No. 4, 37 pages, IEEE.Applicant
- Fortz, Bernard, et al., “Internet Traffic Engineering by Optimizing OSPF Weights,” Proceedings IEEE INFOCOM 2000, Conference on Computer Communications, Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies, Mar. 26-30, 2000, 11 pages, IEEE, Tel Aviv, Israel, Israel.Applicant
- Francois, Frederic, et al., “Optimizing Secure SDN-enabled Inter-Data Centre Overlay Networks through Cognitive Routing,” 2016 IEEE 24th International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS), Sep. 19-21, 2016, 10 pages, IEEE, London, UK.Applicant
- Michael, Nithin, et al., “HALO: Hop-by-Hop Adaptive Link-State Optimal Routing,” IEEE/ACM Transactions on Networking, Dec. 2015, 14 pages, vol. 23, No. 6, IEEE.Applicant
- Mishra, Mayank, et al., “Managing Network Reservation for Tenants in Oversubscribed Clouds,” 2013 IEEE 21st International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, Aug. 14-16, 2013, 10 pages, IEEE, San Francisco, CA, USA.Applicant
- Non-Published Commonly Owned U.S. Appl. No. 17/068,603, filed Oct. 12, 2020, 37 pages, Nicira, Inc.Applicant
- Ray, Saikat, et al., “Always Acyclic Distributed Path Computation,” University of Pennsylvania Department of Electrical and Systems Engineering Technical Report, May 2008, 16 pages, University of Pennsylvania ScholarlyCommons.Applicant
- Webb, Kevin C., et al., “Blender: Upgrading Tenant-Based Data Center Networking,” 2014 ACM/IEEE Symposium on Architectures for Networking and Communications Systems (ANCS), Oct. 20-21, 2014, 11 pages, IEEE, Marina del Rey, CA, USA.Applicant
- Yap, Kok-Kiong, et al., “Taking the Edge off with Espresso: Scale, Reliability and Programmability for Global Internet Peering,” SIGCOMM '17: Proceedings of the Conference of the ACM Special Interest Group on Data Communication, Aug. 21-25, 2017, 14 pages, Los Angeles, CA.Applicant
- Huang, Cancan, et al., “Modification of Q.SD-WAN,” Rapporteur Group Meeting—Doc, Study Period 2017-2020, Q4/11-DOC1 (190410), Study Group 11, Apr. 10, 2019, 19 pages, International Telecommunication Union, Geneva, Switzerland.Applicant
- Sarhan, Soliman Abd Elmonsef, et al., “Data Inspection in SDN Network,” 2018 13th International Conference on Computer Engineering and Systems (ICCES), Dec. 18-19, 2018, 6 pages, IEEE, Cairo, Egypt.Applicant
- Xie, Junfeng, et al., A Survey of Machine Learning Techniques Applied to Software Defined Networking (SDN): Research Issues and Challenges, IEEE Communications Surveys & Tutorials, Aug. 23, 2018, 38 pages, vol. 21, Issue 1, IEEE.Applicant
- Lin, Weidong, et al., “Using Path Label Routing in Wide Area Software-Defined Networks with Open Flow,” 2016 International Conference on Networking and Network Application, Jul. 2016, 6 pages, IEEE.Applicant