Embodiments of the present invention relate generally to networking. More particularly, embodiments of the invention relate to configuring and managing virtual private networks (VPNs) of a cloud managed network.
VPN networks typically include multiple routers that use public infrastructure to communicate with each other (directly or indirectly) to create an overlay network across WAN links. The WAN can include, for example, the Internet, and the communication with the WAN is typically through a T1 interface, T3 interface, cable interface (cable modem), DSL interface or the like. VPN networks are convenient because they can be implemented with little or no effort to provide infrastructure and establish private and encrypted communication between devices that need to access each other but do not wish to be available via public infrastructure or the Internet to all other computers. VPN networks are convenient because they can be implemented with little or no private infrastructure. For example, it is generally not necessary to install additional cabling or install a wide area network. Once the connection to the WAN is provided, additional routers can be configured to communicate and thereby provide network access whose geographic coverage is theoretically limited only by the physically distribution of routers.
A virtual private network (VPN) is a network that typically uses public telecommunication infrastructure, such as the Internet, to provide remote offices or traveling users access to a central organizational network. VPNs typically require remote users of the network to be authenticated, and often secure data with encryption technologies to prevent disclosure of private information to unauthorized parties. VPNs may serve any network functionality that is found on any network, such as sharing of data and access to network resources, printers, databases, websites, etc. A VPN user typically experiences the central network in a manner that is identical to being connected directly to the central network.
A site-to-site VPN allows multiple geographically different fixed locations (sites) to establish secure connections with each other over a public network such as the Internet. A site-to-site VPN extends the company's network, making computer resources from one location available to other locations. An example of a company that needs a site-to-site VPN is a growing corporation with dozens of branch offices. A site-to-site VPN can be set up between two routers (that is, two network devices operating as routers) at the different sites that provide access to the WAN for that site (where these routers are also referred to as the VPN endpoints or VPN endpoint network devices). When multiple routers are part of the same VPN network, typically a VPN tunnel is created between each to form a mesh VPN.
Currently, to set up virtual private networks between routers, network administrator(s) for the organization has to: generate cryptographic keys to encrypt traffic; install keys on each pair of routers, which keys are used to establish the VPN tunnel between them; install remote endpoint network configuration on each router (i.e., tell each router about the others' IP addresses and ports); etc.
There are many disadvantages with the common methods of configuring mesh VPNs. A large number of error-prone manual human configuration steps are required. For instance, making configuration changes (i.e. changing a subnet) requires manual entry on multiple routers and is error prone. It is difficult to audit and keep track of the cryptographic keys used (i.e. generation and storage of these). Revocation of a device's access (i.e. removing a device from the VPN) requires manual configuration changes on every other router in the VPN. Devices cannot automatically verify and contact each other once they are configured.
Embodiments of the invention are illustrated by way of example and not limitation in the figures of the accompanying drawings in which like references indicate similar elements.
Various embodiments and aspects of the inventions will be described with reference to details discussed below, and the accompanying drawings will illustrate the various embodiments. The following description and drawings are illustrative of the invention and are not to be construed as limiting the invention. Numerous specific details are described to provide a thorough understanding of various embodiments of the present invention. However, in certain instances, well-known or conventional details are not described in order to provide a concise discussion of embodiments of the present inventions.
Reference in the specification to “one embodiment” or “an embodiment” means that a particular feature, structure, or characteristic described in conjunction with the embodiment can be included in at least one embodiment of the invention. The appearances of the phrase “in one embodiment” in various places in the specification do not necessarily all refer to the same embodiment.
A system for automatically configuring and managing VPNs without the need for significant manual configuration of each VPN endpoint network device is described. According to some embodiments, the system automates the setup and configuration of a mesh (all-pairs connected) VPN. According to some embodiments, the system automatically handles distributing correct cryptographic keys to each VPN endpoint, establishing VPN tunnels between all pairs of endpoints in the VPN, and reconfiguring all endpoints in the case of any configuration change in the system (e.g., redefinition of a subnet, addition or removal of a VPN endpoint) or in the event that an endpoint's IP address changes. According to some embodiments, the system also automatically discovers how each VPN endpoint can reach the other VPN endpoints given the configuration (e.g., whether there is network address translation (NAT) being performed by another network device between the VPN endpoint and the WAN). According to some embodiments, the system also automatically detects collision of subnets and/or automatically selects subnets that do not overlap the ones currently in use.
According to one embodiment, management server 101 includes a configuration and management (CM) module 111 to configure routers 102-103 and to generate MS configuration information 108 for each of routers 102-103. In one embodiment, management server 101 provides a user interface such as a Web interface to allow network administrator 107 to create and log into an account associated with the organization to which the routers 102-103 belong.
The management server 101 includes router information database 112, including information regarding the routers 102-103. In one embodiment, the router information database 112 includes a serial number and a mechanism to authenticate the router's identity (e.g., the public key of a private public key pair, the private key 116 of which was embedded or stored in the router during the manufacturing). This router information database 112 may be populated different ways in different embodiments (e.g., populated by the seller of the routers, populated by the network administrator). In embodiments in which this information is populated by the seller, different ones of these embodiments may associate the information regarding routers 102-103 in the router information database with the user account in different ways (example, the network administrator 107 may provide an order number (or invoice number) associated with a purchase of routers 102-103).
An example of the user interface provided by the management server is shown in
In one embodiment, CM module 111 automatically generates VPN peer information based on the VPN participation settings, tunnel keys for each VPN peer pair, and VPN peer subnet route information, etc. The VPN peer information identifies which of the routers are configured to participate in the VPN; in the simple case, this may simply be the serial numbers of the routers, but for greater security a VPN ID may be generated for each router (e.g., such VPN IDs may be generated to be unique across all routers represented in the management sever across all organizations) (e.g., such VPN IDs may be generated by cryptographically hashing of {a private key of the management server, router serial number}). The VPN peer subnet route information identifies which of the plurality of subnets participating in the VPN are behind which routers. While in some embodiments this automatically calculated VPN configuration includes generating a VPN peer list and VPN peer subnet route table specific to each of the VPN routers (e.g., the VPN peer list identifying other routers participating in a VPN; and the VPN peer subnet route table identifying, for each the subnets that is participating in the VPN and that is behind one of the other routers, that subnet and the other router it is behind), other embodiments provide the same information to all of the VPN routers participating in the same VPN. Note that MS configuration information may be different for each of the router peers, while certain portions of the MS configuration information may be identical or similar.
According to one embodiment, when a router, in this example router 102, is powered up and attempts entering network 104, configuration module 114 attempts to contact management server 101. In one embodiment, certain device information such as an IP address 117 of management server 101 is stored in the router 102 when it is manufactured. In one embodiment, when router 102 is powered up, configuration module 114 performs any self-configuration processes including obtaining an IP address for itself from a dynamic host configuration protocol (DHCP) facility (which address may be a public IP address, or may be a private IP address if there is a device performing NAT between the router and the WAN (that is to say, the router is behind a device performing NAT)). Configuration module 114 then accesses management server 102 based on the IP address 117 and authenticates itself (e.g., signing a message (e.g., including the serial number of the router) using the private key 116 such that management server 101 can authenticate router 102 using the associated public key (stored in the router information database 112) maintained by management server 101).
In one embodiment, each of routers 102-103 creates one or more secure communication channels (e.g., a control tunnel) with server 101 using the keys downloaded from management server 101 to exchange control traffic such as management messages or notification, etc. In one embodiment, once router 102 has been successfully authenticated by server 101, configuration module 114 of router 102 downloads MS configuration information 108 and stores it in a storage device within the router 102 as part of MS configuration information 118. This download may take place over a secure session layer (SSL)-encrypted session and/or the management server may encrypt the data using the public key corresponding to the private key 116. This secure channel may also be used to receive subsequent configuration updates from the backend.
In addition, configuration module 114 obtains VPN network address translation (NAT) traversal information 119 (also referred to as IP registry information). The VPN NAT traversal information includes combinations of IP addresses/ports of certain VPN peers (in one embodiment, these may include a combination of a local IP address/port and a combination of a public IP address/port; which IP address will be the same if the router is not behind a device performing NAT). The VPN NAT traversal information may be obtained from a set of one or more IP registry servers such as IP registry server(s) 122 as described later herein, or alternatively from management server 101.
Configuration module 114 establishes a VPN tunnel with each of the VPN peers for data traffic. In this example, between router 102 and router 103, configuration module 114 establishes VPN tunnel 121 using a corresponding tunnel key pair shared by routers 102-103 (e.g., while in some embodiments these keys are manually entered, the embodiment of
Based on MS configuration information 118 and VPN NAT traversal information 119, forwarding module 115 can properly forward a packet to an opposing VPN peer via the corresponding VPN data tunnel. In one embodiment, forwarding module 115 is configured to determine a best IP address/port to the corresponding VPN subnet based on a VPN peer subnet route table of MS configuration information 118 and IP registry information from VPN NAT traversal information 119. In another embodiment, an optional forwarding table 120 mapping a VPN subnet and the best IP address/port is created from the VPN peer subnet route table of MS configuration information 118 and IP registry information from VPN NAT traversal information 119. Forwarding module 115 can select the best IP address/port from the forwarding table 120 when forwarding a packet.
According to one embodiment, subsequently, when there is a change in the configuration, such as adding or removing a router, changing of subnet settings, CM module 111 is configured to generate updated configuration information 108 and communicate the updates to routers 102-103 via their corresponding control tunnels (such communication can be done with different mechanisms depending on the embodiment of type of information, including a push mechanism, a pull mechanism, etc.). For example, CM module 111 may generate new VPN peer subnet route information based on the change of configuration of a router and/or subnet, and the updated VPN peer subnet route table(s) is then sent from management server 101 to routers 102-103 via the corresponding control tunnels. Note that some or all of the modules as shown in
One problem with large VPNs is ensuring that there are no subnet collisions. This is particularly difficult and error prone since it requires checking all the existing subnets. Problems can arise if the routers order the routes incorrectly, or if they overlap with upstream subnets they are plugged into. This can happen if a router is plugged into an Internet service provider (ISP) over which the network operator does not have control, or if it is behind a NAT. Also, an operator may accidentally enter a subnet that is too large. To make this process simpler, according to one embodiment, the system implements a few mechanisms.
First, each router prioritizes the local uplink subnet route above routes to the VPN. This ensures that any router will never be disconnected because of a subnet that overlaps with its uplink connection and a subnet through the VPN.
Second, the VPN routes are sorted by “longest subnet first.” As a result, even if there are overlapping subnets, it is very likely that most routes will work.
Third, the system checks for subnet collisions when an operator makes a configuration change and alerts them to problems if they exist. According to some embodiments, the system treats all subnet allocations in an organization as if they were coming from a VPN subnet. This prevents having a conflict by default. Most subnets are reserved by the Internet Assigned Number Authority (IANA) for public use, and there are a limited number of private subnet spaces that can be used for networks like VPNs (e.g., 192.168.0.0116, 172.16.0.0112, and 10.0.0.0/8). Also, it is desirable for a subnet allocation algorithm to continue to allocate addresses that, to the network administrator, look like they continue with the allocation scheme (i.e. if 10.0.0/24 was added, the operator would expect that any subnet corresponding to 10.0.X.0/24 would be selected next). If most routers are plugged into particular subnets in their local configuration, it is desirable that the system avoid those (for instance, if most routers deployed are behind cable modems using 10.x.x.x/16 as their local LAN, it is beneficial to avoid that subnet). In one embodiment, it is preferable to use private IP addresses for the VPN addresses. However, it is also possible to use public IP addresses. In this situation, traffic between those IPs and any within the VPN will be routed over the VPN. This may be desirable because it will encrypt the traffic.
Fourth, the system automatically finds and assigns an appropriate subnet to a new router device when it is added to the network. In one embodiment, the allocation algorithm gathers all subnets currently used. This includes all VPN subnets, all other subnets not participating in VPN but allocated by the system as local subnets, and all “upstream” subnets in use by all routers (this is specifically to reduce the potential for routing conflicts). It sorts the private addresses by the number of subnets currently used. For each subnet in order, it tries to allocate appropriate subnets that don't overlap with current ones and to allocate a subnet, sort the subnets according to RFC-3531 and choose the subnet if no overlap currently exists.
In one embodiment, automatically calculated VPN configuration information 110 is specific to each router and includes for each router, but is not limited to, VPN ID for the router 408, VPN IDs of VPN peers 401, one or more addresses of one or more IP registry servers 402, tunnel keys for each VPN peer pair 403, and VPN peer subnet route table 404. VPN IDs for the routers may be automatically generated by management server 101 when the corresponding routers were registered with management server 101. In one embodiment, a VPN ID is an identification string randomly generated by the management server and guaranteed to be unique. Alternatively, a serial number may be utilized as a VPN ID. Address(es) of IP registry server(s) 402 may be used by a configuration module of the router to access one or more IP registry servers to obtain the IP addresses/ports of the VPN peers. Address(es) of IP registry server(s) 402 may point back to the management server if the management server provides the IP registry services.
In one embodiment, tunnel keys 403 are generated by management server 101, which may be used by the router to establish a VPN data tunnel with each of the peers identified by VPN IDs 401. At least one of tunnel keys 403 may also be used to establish a control tunnel between the router and the management server. Alternatively, the control tunnel may be established using a private key (e.g., private key 116 of
Referring back to
According to one embodiment, once a configuration change is made by a network administrator (for instance, adding a device to the VPN), CM module 111 automatically checks for overlapping subnets and warns the user if they are potentially causing routing problems and tells them which devices may have issues. In addition, CM module 111 regenerates configurations (i.e. subnets, etc) for each device in the VPN. For each device configuration that has changed, CM module 111 pings the device and notifies the device of a configuration change. This results in immediate changes, as part of MS configuration information 108, being pushed out to all the routers participating in the VPN.
Furthermore, in order for the system to be multi-tenant, each peer registry must be able to handle connections from a large number of VPN devices and also cannot reveal confidential information. In order to do this, according to one embodiment, the management server assigns peer VPN IDs using a cryptographic hash of a {private key, device key} where the private key is only known to the management server, and the device key (e.g., serial number) is only known by the router and the management server. The result of this hash can be shared with other VPN peers that are connecting to the routers, but it does not reveal the private key or device key to other parties. Also, it makes it cryptographically harder to determine the peer VPN ID for a particular device without knowing the device key and private key. Since the peer VPN IDs are distributed through a secure channel, it makes it impossible for a third party to query information without knowledge of peer VPN IDs.
Once configuration module 114 obtains the IP address, according to one embodiment, it contacts the management server based on IP address 117 of the management server, where IP address 117 is stored in a storage device of router 500 during the manufacturing. In addition, configuration module 114 may sign the message using private key 116 to allow the management server to authenticate router 500. Private key 116 may also be stored in the storage device of router 500 during the manufacturing. The corresponding public key is maintained by the management server, where the management server is to authenticate router 500 using the public key. Once router 500 has been successfully authenticated by the management server, in one embodiment, configuration module 114 downloads MS configuration information 118 from the management server. MS configuration information 118 includes VPN peer subnet route data structure 404 and other information as shown in
Upon initialization of the VPN module, router 500 establishes a connection with one or more IP registries to alert the system of its presence and find contact information (IP/ports) that its peers are located on. It also uses the IP registries to check network settings and see if it is behind a NAT/firewall and if those connections allow VPN traffic. In one embodiment, when router 500 registers with an IP registry, it sends the following information: the VPN ID of the router, the local IP/port it is using to send data on, the list of peer VPN IDs the device is interested in discovering. In response, the IP registry responds with a combination of the remote IP address/port the connection was received on and a list of peer contact information (the VPN IDs of VPN peers as well as local and public IP addresses/ports they used).
Router 500 may contact multiple IP registries and aggregate the received information. First, it compares the responses to detect NAT compatibility of the uplink connection (e.g., whether the device can send and receive outgoing UDP traffic, whether the device has a public IP address (i.e. no NAT), if the upstream device is behind a NAT, how restrictive it is). The registries respond with the IP address/port the original packet used; this can be used to see if upstream devices allow preserving source port for NAT traffic. Also included in the response is VPN peer contact information (combinations of possible IP addresses/ports). This can be used to establish a contact with each peer through the hole-punching protocol. Using an IP Registry also has many advantages; devices cache information from the registry, so in the case of internet outages to the rest of the backend, data continues to flow.
Current VPNs often deploy a concentrator to simplify configuration (i.e. adding a device can happen on two devices instead of each one in the VPN), but this has undesirable reliability properties and requires more bandwidth at the concentrator, since traffic from one device to another always must go through the concentrator. Another possible design is to use the hole punching techniques but have traffic go through the registries; this is also undesirable, since it would mean the IP registries would need to be capable of sending and receiving all data going through the VPN. Embodiments of the VPN system described herein use the IP registry to communicate contact information with each VPN end point, and thus only deals with control traffic; this allows each router to send traffic directly to the router that its traffic is destined for. The routers also cache the peer contact information (e.g., IP address/port). As a result it can survive network outages even if the IP registry goes down.
Specifically, referring back to
An example of IP registry information 504 is shown in
Referring back to
According to one embodiment, when forwarding module 115 receives a packet to be forwarded to a remote node, forwarding module 115 looks up in VPN peer subnet route table 404 based on the destination IP address (e.g., subnet) of the packet to retrieve a VPN ID associated with the destination IP address. Based on the VPN ID, forwarding module 115 then looks up in punch table 505 to locate an IP address/port that is most suitable at the time based on the corresponding status (e.g., status 653). For example, forwarding module 115 may select either a local IP address or a public IP address associated with the VPN ID, whichever has a lower latency. In one embodiment, if both the public IP address and the local IP address has the same latency level, the local IP address will be selected, in which the traffic can directly reach the remote router, bypassing the NAT device in between (e.g., through the “punched” hole). Once the IP address has been selected from the punch table, the packet is encapsulated within another packet using the selected IP address as the destination IP address. The encapsulated packet is then forward to the remote router by forwarding module 115.
In the above embodiment, two data structures are used—the VPN peer subnet route table and the punch table—that are linked are keys by VPN ID. These two data structures effectively function as a forwarding table. Alternatively, according to another embodiment, a VPN forwarding table 506 is built from these two data structures; the VPN forward table 506 includes the subnets from the VPN peer subnet route table, and for each subnet, includes the best combination of IP address/port from the punch table for that subnet (in other words, it drops the VPN IDs and non-best combinations of IP addresses/ports). As a result, when a packet is received by forwarding module 115, instead of looking up in punch table 505 and VPN peer subnet route table 404, forwarding module 115 only needs to look up in VPN forwarding table 506 based on the subnet to locate the “best” IP address to forward the packet.
The above techniques for reaching a node behind a NAT device based on a local IP address that is not published in the WAN are referred to as hole punching. Further detailed information concerning the hole punching techniques can be found in the article entitled “Peer-to-Peer Communication Across Network Address Translators” published by Bryan Ford, et. al, which is incorporated by reference herein in its entirety. Note that some or all of the components as shown in
Based on the user configurable information, at block 705, the management server generates automatically calculated VPN configuration information (e.g., automatically calculated VPN configuration information 110) for each of the routers, including, for example, VPN ID, VPN peers, tunnel keys for each VPN peer pair, VPN peer subnet route table, etc. Optionally, the VPN peer subnet route table(s) may be sorted based on the length of the subnet with longer subnet having a higher priority. As described above, the user input configuration information and the automatically calculated configuration information are collectively referred to as MS configuration information (e.g., MS configuration information 108). Thereafter, at block 706, the MS configuration information is stored in the local storage of the management server. While the illustrated embodiment generates the automatically generated VPN configuration information 110 specific to each router participating in the VPN, alternative embodiments provide the same information to all of the routers and the routers ignore that of the information that is not relevant to them (e.g., the VPN peer information would include the VPN IDs of all the routers participating in the VPN, including the router's own VPN ID). One of the purposes of sorting the VPN peer subnet route table based on the length of the subnets is to reduce the possibility of failure to route traffic to conflicting subnets. It can also speed up searching and allocating a non-overlapping subnet for new or modified subnet settings. As a result, even if there are overlapping subnets, it is likely that most routes will work.
For example, it is assumed there are three subnets which overlap:
If VLAN/subnet settings for the new router are received at block 751 or modified VLAN/subnet settings of an existing router are received at block 754, for each of the new or modified VLAN/subnet settings, at block 755, it is determined whether any subnet has been specified by the administrator. If there is no subnet setting specified by the administrator, it will be treated as a default option and the processes of blocks 752-753 are performed. If it is determined there is a user specified subnet, at block 756, the configuration and management module of the management server detects whether the user-specified subnet overlaps with the subnets currently used. If it is determined there is an overlap subnet, at block 757, the administrator is alerted; otherwise, the VPN peer subnet route table is updated at block 753. These operations are repeatedly performed for each of the VLAN/subnet settings.
Referring to
Referring to
Alternatively, multiple subnets can also be partitioned, as shown in
At block 905, a punch table is built based on the MS configuration information and the IP registry information. For each entry in the punch table, at block 906, a test is periodically performed, for example, by sending a HELLO or ping message to the corresponding IP address. The performance (e.g., latency) is measured for each test and the punch table is updated to indicate the best IP address/port available. While in the illustrated embodiment, a punch table is used that includes multiple IP address/port combinations for each VPN router and a current best is determined based on testing. An alternative embodiment may be designed to receive only one IP address/port combination for each VPN router and not perform block 906. Optionally, at block 907, a VPN forwarding table is created. Thereafter, at block 908, a persistent VPN data tunnel is created between the router and each of the VPN peers using the corresponding tunnel keys downloaded from the management server. As described later herein, changes to the MS configuration 108 (e.g., a user changing the user input configuration information, which trigger changes to the automatically calculated VPN configuration information) resulted in updates being provided to the affected routers; some embodiments of the invention similarly repeat block 910 to keep the NAT traversal information current (e.g., repeating all of block 910 periodically, repeating block 906 more often than sending new requests to the IP Register Servers).
As described above, when there is a change in network configuration, such as adding or removing a router, change of subnets, the management server automatically reconfigures the necessary settings and the updated MS configuration is provided to the affected routers.
Some portions of the preceding detailed descriptions have been presented in terms of algorithms and symbolic representations of operations on data bits within a computer memory. These algorithmic descriptions and representations are the ways used by those skilled in the data processing arts to most effectively convey the substance of their work to others skilled in the art. An algorithm is here, and generally, conceived to be a self-consistent sequence of operations leading to a desired result. The operations are those requiring physical manipulations of physical quantities.
It should be borne in mind, however, that all of these and similar terms are to be associated with the appropriate physical quantities and are merely convenient labels applied to these quantities. Unless specifically stated otherwise as apparent from the above discussion, it is appreciated that throughout the description, discussions utilizing terms such as those set forth in the claims below refer to the action and processes of a computer system, or similar electronic computing device, that manipulates and transforms data represented as physical (electronic) quantities within the computer system's registers and memories into other data similarly represented as physical quantities within the computer system memories or registers or other such information storage, transmission or display devices.
The techniques shown in the figures can be implemented using code and data stored and executed on one or more electronic devices. Such electronic devices store and communicate (internally and/or with other electronic devices over a network) code and data using computer-readable media, such as non-transitory computer-readable storage media (e.g., magnetic disks; optical disks; random access memory; read only memory; flash memory devices; phase-change memory) and transitory computer-readable transmission media (e.g., electrical, optical, acoustical or other form of propagated signals—such as carrier waves, infrared signals, digital signals).
The processes or methods depicted in the preceding figures may be performed by processing logic that comprises hardware (e.g. circuitry, dedicated logic, etc.), firmware, software (e.g., embodied on a non-transitory computer readable medium), or a combination of both. Although the processes or methods are described above in terms of some sequential operations, it should be appreciated that some of the operations described may be performed in a different order. Moreover, some operations may be performed in parallel rather than sequentially.
In the foregoing specification, embodiments of the invention have been described with reference to specific exemplary embodiments thereof. It will be evident that various modifications may be made thereto without departing from the broader spirit and scope of the invention as set forth in the following claims. The specification and drawings are, accordingly, to be regarded in an illustrative sense rather than a restrictive sense.
This application is a continuation of U.S. patent application Ser. No. 13/350,736, filed Jan. 13, 2012, the content of which is incorporated by reference herein in its entirety.
Number | Name | Date | Kind |
---|---|---|---|
5812773 | Norin | Sep 1998 | A |
5889896 | Meshinsky et al. | Mar 1999 | A |
6108782 | Fletcher et al. | Aug 2000 | A |
6178453 | Mattaway et al. | Jan 2001 | B1 |
6223218 | Iijima | Apr 2001 | B1 |
6298153 | Oishi | Oct 2001 | B1 |
6343290 | Cossins et al. | Jan 2002 | B1 |
6643260 | Kloth et al. | Nov 2003 | B1 |
6683873 | Kwok et al. | Jan 2004 | B1 |
6721804 | Rubin et al. | Apr 2004 | B1 |
6733449 | Krishnamurthy et al. | May 2004 | B1 |
6735631 | Oehrke et al. | May 2004 | B1 |
6996615 | McGuire | Feb 2006 | B1 |
7054930 | Cheriton | May 2006 | B1 |
7058706 | Lyer et al. | Jun 2006 | B1 |
7062571 | Dale et al. | Jun 2006 | B1 |
7111177 | Chauvel et al. | Sep 2006 | B1 |
7212490 | Kao et al. | May 2007 | B1 |
7277948 | Igarashi et al. | Oct 2007 | B2 |
7313667 | Pullela et al. | Dec 2007 | B1 |
7379846 | Williams et al. | May 2008 | B1 |
7480672 | Hahn et al. | Jan 2009 | B2 |
7496043 | Leong et al. | Feb 2009 | B1 |
7536476 | Alleyne | May 2009 | B1 |
7567504 | Darling et al. | Jul 2009 | B2 |
7583665 | Duncan | Sep 2009 | B1 |
7606147 | Luft et al. | Oct 2009 | B2 |
7644437 | Volpano | Jan 2010 | B2 |
7647594 | Togawa | Jan 2010 | B2 |
7773510 | Back et al. | Aug 2010 | B2 |
7808897 | Mehta et al. | Oct 2010 | B1 |
7881957 | Cohen et al. | Feb 2011 | B1 |
7917647 | Cooper et al. | Mar 2011 | B2 |
8010598 | Tanimoto | Aug 2011 | B2 |
8028071 | Mahalingam et al. | Sep 2011 | B1 |
8041714 | Aymeloglu et al. | Oct 2011 | B2 |
8121117 | Amdahl et al. | Feb 2012 | B1 |
8171415 | Appleyard et al. | May 2012 | B2 |
8234377 | Cohn | Jul 2012 | B2 |
8244559 | Horvitz et al. | Aug 2012 | B2 |
8250215 | Stienhans et al. | Aug 2012 | B2 |
8280880 | Aymeloglu et al. | Oct 2012 | B1 |
8284664 | Aybay et al. | Oct 2012 | B1 |
8301746 | Head et al. | Oct 2012 | B2 |
8345692 | Smith | Jan 2013 | B2 |
8406141 | Couturier et al. | Mar 2013 | B1 |
8407413 | Yucel et al. | Mar 2013 | B1 |
8448171 | Donnellan et al. | May 2013 | B2 |
8477610 | Zuo et al. | Jul 2013 | B2 |
8495356 | Ashok et al. | Jul 2013 | B2 |
8495725 | Ahn | Jul 2013 | B2 |
8510469 | Portolani | Aug 2013 | B2 |
8514868 | Hill | Aug 2013 | B2 |
8532108 | Li et al. | Sep 2013 | B2 |
8533687 | Greifeneder et al. | Sep 2013 | B1 |
8547974 | Guruswamy et al. | Oct 2013 | B1 |
8560639 | Murphy et al. | Oct 2013 | B2 |
8560663 | Baucke et al. | Oct 2013 | B2 |
8589543 | Dutta et al. | Nov 2013 | B2 |
8590050 | Nagpal et al. | Nov 2013 | B2 |
8611356 | Yu et al. | Dec 2013 | B2 |
8612625 | Andries et al. | Dec 2013 | B2 |
8630291 | Shaffer et al. | Jan 2014 | B2 |
8639787 | Lagergren et al. | Jan 2014 | B2 |
8656024 | Krishnan et al. | Feb 2014 | B2 |
8660129 | Brendel et al. | Feb 2014 | B1 |
8719804 | Jain | May 2014 | B2 |
8775576 | Hebert et al. | Jul 2014 | B2 |
8797867 | Chen et al. | Aug 2014 | B1 |
8805951 | Faibish et al. | Aug 2014 | B1 |
8850002 | Dickinson et al. | Sep 2014 | B1 |
8850182 | Fritz et al. | Sep 2014 | B1 |
8856339 | Mestery et al. | Oct 2014 | B2 |
8909928 | Ahmad et al. | Dec 2014 | B2 |
8918510 | Gmach et al. | Dec 2014 | B2 |
8924720 | Raghuram et al. | Dec 2014 | B2 |
8930747 | Levijarvi et al. | Jan 2015 | B2 |
8938775 | Roth et al. | Jan 2015 | B1 |
8959526 | Kansal et al. | Feb 2015 | B2 |
8977754 | Curry, Jr. et al. | Mar 2015 | B2 |
9009697 | Breiter et al. | Apr 2015 | B2 |
9015324 | Jackson | Apr 2015 | B2 |
9043439 | Bicket et al. | May 2015 | B2 |
9049115 | Rajendran et al. | Jun 2015 | B2 |
9063789 | Beaty et al. | Jun 2015 | B2 |
9065727 | Liu et al. | Jun 2015 | B1 |
9075649 | Bushman et al. | Jul 2015 | B1 |
9130846 | Szabo et al. | Sep 2015 | B1 |
9164795 | Vincent | Oct 2015 | B1 |
9167050 | Durazzo et al. | Oct 2015 | B2 |
9201701 | Boldyrev et al. | Dec 2015 | B2 |
9201704 | Chang et al. | Dec 2015 | B2 |
9203784 | Chang et al. | Dec 2015 | B2 |
9223634 | Chang et al. | Dec 2015 | B2 |
9244776 | Koza et al. | Jan 2016 | B2 |
9251114 | Ancin et al. | Feb 2016 | B1 |
9264478 | Hon et al. | Feb 2016 | B2 |
9294408 | Dickinson et al. | Mar 2016 | B1 |
9313048 | Chang et al. | Apr 2016 | B2 |
9361192 | Smith et al. | Jun 2016 | B2 |
9379982 | Krishna et al. | Jun 2016 | B1 |
9380075 | He et al. | Jun 2016 | B2 |
9432245 | Sorenson, III et al. | Aug 2016 | B1 |
9432294 | Sharma et al. | Aug 2016 | B1 |
9444744 | Sharma et al. | Sep 2016 | B1 |
9473365 | Melander et al. | Oct 2016 | B2 |
9503530 | Niedzielski | Nov 2016 | B1 |
9558078 | Farlee et al. | Jan 2017 | B2 |
9571570 | Mutnuru | Feb 2017 | B1 |
9613078 | Vermeulen et al. | Apr 2017 | B2 |
9628471 | Sundaram et al. | Apr 2017 | B1 |
9658876 | Chang et al. | May 2017 | B2 |
9692802 | Bicket et al. | Jun 2017 | B2 |
9755858 | Bagepalli et al. | Sep 2017 | B2 |
20010055303 | Horton et al. | Dec 2001 | A1 |
20020073337 | Ioele et al. | Jun 2002 | A1 |
20020143928 | Maltz et al. | Oct 2002 | A1 |
20020166117 | Abrams et al. | Nov 2002 | A1 |
20020174216 | Shorey et al. | Nov 2002 | A1 |
20030018591 | Komisky | Jan 2003 | A1 |
20030056001 | Mate et al. | Mar 2003 | A1 |
20030228585 | Inoko et al. | Dec 2003 | A1 |
20040004941 | Malan et al. | Jan 2004 | A1 |
20040034702 | He | Feb 2004 | A1 |
20040088542 | Daude | May 2004 | A1 |
20040095237 | Chen et al. | May 2004 | A1 |
20040131059 | Ayyakad et al. | Jul 2004 | A1 |
20040197079 | Latvala et al. | Oct 2004 | A1 |
20040264481 | Darling et al. | Dec 2004 | A1 |
20050025125 | Kwan | Feb 2005 | A1 |
20050060418 | Sorokopud | Mar 2005 | A1 |
20050125424 | Herriott et al. | Jun 2005 | A1 |
20060062187 | Rune | Mar 2006 | A1 |
20060104286 | Cheriton | May 2006 | A1 |
20060126665 | Ward et al. | Jun 2006 | A1 |
20060146825 | Hofstaedter et al. | Jul 2006 | A1 |
20060155875 | Cheriton | Jul 2006 | A1 |
20060168338 | Bruegl et al. | Jul 2006 | A1 |
20060233106 | Achlioptas et al. | Oct 2006 | A1 |
20070174663 | Crawford et al. | Jul 2007 | A1 |
20070223487 | Kajekar et al. | Sep 2007 | A1 |
20070242830 | Conrado et al. | Oct 2007 | A1 |
20080005293 | Bhargava et al. | Jan 2008 | A1 |
20080080524 | Tsushima et al. | Apr 2008 | A1 |
20080084880 | Dharwadkar | Apr 2008 | A1 |
20080165778 | Ertemalp | Jul 2008 | A1 |
20080186977 | Nomi | Aug 2008 | A1 |
20080198752 | Fan et al. | Aug 2008 | A1 |
20080198858 | Townsley et al. | Aug 2008 | A1 |
20080201711 | Amir Husain | Aug 2008 | A1 |
20080235755 | Blaisdell et al. | Sep 2008 | A1 |
20090006527 | Gingell, Jr. et al. | Jan 2009 | A1 |
20090019367 | Cavagnari et al. | Jan 2009 | A1 |
20090031312 | Mausolf et al. | Jan 2009 | A1 |
20090083183 | Rao et al. | Mar 2009 | A1 |
20090138763 | Arnold | May 2009 | A1 |
20090177775 | Radia et al. | Jul 2009 | A1 |
20090178058 | Stillwell, III et al. | Jul 2009 | A1 |
20090182874 | Morford et al. | Jul 2009 | A1 |
20090265468 | Annambhotla et al. | Oct 2009 | A1 |
20090265753 | Anderson et al. | Oct 2009 | A1 |
20090293056 | Ferris | Nov 2009 | A1 |
20090300608 | Ferris et al. | Dec 2009 | A1 |
20090304000 | Masputra | Dec 2009 | A1 |
20090313562 | Appleyard et al. | Dec 2009 | A1 |
20090323706 | Germain et al. | Dec 2009 | A1 |
20090328031 | Pouyadou et al. | Dec 2009 | A1 |
20100036903 | Ahmad et al. | Feb 2010 | A1 |
20100042720 | Stienhans et al. | Feb 2010 | A1 |
20100061250 | Nugent | Mar 2010 | A1 |
20100115341 | Baker et al. | May 2010 | A1 |
20100131765 | Bromley et al. | May 2010 | A1 |
20100149966 | Achlioptas et al. | Jun 2010 | A1 |
20100191783 | Mason et al. | Jul 2010 | A1 |
20100192157 | Jackson et al. | Jul 2010 | A1 |
20100205601 | Abbas et al. | Aug 2010 | A1 |
20100211782 | Auradkar et al. | Aug 2010 | A1 |
20100293270 | Augenstein et al. | Nov 2010 | A1 |
20100318609 | Lahiri et al. | Dec 2010 | A1 |
20100325199 | Park et al. | Dec 2010 | A1 |
20100325441 | Laurie et al. | Dec 2010 | A1 |
20100333116 | Prahlad et al. | Dec 2010 | A1 |
20110016214 | Jackson | Jan 2011 | A1 |
20110035754 | Srinivasan | Feb 2011 | A1 |
20110055396 | Dehaan | Mar 2011 | A1 |
20110055398 | Dehaan et al. | Mar 2011 | A1 |
20110055470 | Portolani | Mar 2011 | A1 |
20110072489 | Parann-Nissany | Mar 2011 | A1 |
20110075667 | Li et al. | Mar 2011 | A1 |
20110110382 | Jabr et al. | May 2011 | A1 |
20110116443 | Yu et al. | May 2011 | A1 |
20110126099 | Anderson et al. | May 2011 | A1 |
20110138055 | Daly et al. | Jun 2011 | A1 |
20110145413 | Dawson et al. | Jun 2011 | A1 |
20110145657 | Bishop et al. | Jun 2011 | A1 |
20110173303 | Rider | Jul 2011 | A1 |
20110185063 | Head et al. | Jul 2011 | A1 |
20110185065 | Stanisic et al. | Jul 2011 | A1 |
20110206052 | Tan et al. | Aug 2011 | A1 |
20110213966 | Fu et al. | Sep 2011 | A1 |
20110219434 | Betz et al. | Sep 2011 | A1 |
20110231715 | Kunii et al. | Sep 2011 | A1 |
20110231899 | Pulier et al. | Sep 2011 | A1 |
20110239039 | Dieffenbach et al. | Sep 2011 | A1 |
20110252327 | Awasthi et al. | Oct 2011 | A1 |
20110261811 | Battestilli et al. | Oct 2011 | A1 |
20110261828 | Smith | Oct 2011 | A1 |
20110276675 | Singh et al. | Nov 2011 | A1 |
20110276951 | Jain | Nov 2011 | A1 |
20110283013 | Grosser et al. | Nov 2011 | A1 |
20110295998 | Ferris et al. | Dec 2011 | A1 |
20110305149 | Scott et al. | Dec 2011 | A1 |
20110307531 | Gaponenko et al. | Dec 2011 | A1 |
20110320870 | Kenigsberg et al. | Dec 2011 | A1 |
20120005724 | Lee | Jan 2012 | A1 |
20120036234 | Staats | Feb 2012 | A1 |
20120039334 | Mehta | Feb 2012 | A1 |
20120054367 | Ramakrishnan et al. | Mar 2012 | A1 |
20120072318 | Akiyama et al. | Mar 2012 | A1 |
20120072578 | Alam | Mar 2012 | A1 |
20120072581 | Tung et al. | Mar 2012 | A1 |
20120072985 | Davne et al. | Mar 2012 | A1 |
20120072992 | Arasaratnam et al. | Mar 2012 | A1 |
20120084445 | Brock et al. | Apr 2012 | A1 |
20120084782 | Chou et al. | Apr 2012 | A1 |
20120089742 | Jagannatharao | Apr 2012 | A1 |
20120096134 | Suit | Apr 2012 | A1 |
20120102193 | Rathore et al. | Apr 2012 | A1 |
20120102199 | Hopmann et al. | Apr 2012 | A1 |
20120131174 | Ferris et al. | May 2012 | A1 |
20120137215 | Kawara | May 2012 | A1 |
20120158967 | Sedayao et al. | Jun 2012 | A1 |
20120159097 | Jennas, II et al. | Jun 2012 | A1 |
20120167094 | Suit | Jun 2012 | A1 |
20120173710 | Rodriguez | Jul 2012 | A1 |
20120179909 | Sagi et al. | Jul 2012 | A1 |
20120180044 | Donnellan et al. | Jul 2012 | A1 |
20120182891 | Lee et al. | Jul 2012 | A1 |
20120185913 | Martinez et al. | Jul 2012 | A1 |
20120192016 | Gotesdyner et al. | Jul 2012 | A1 |
20120192075 | Ebtekar et al. | Jul 2012 | A1 |
20120201135 | Ding et al. | Aug 2012 | A1 |
20120214506 | Skaaksrud et al. | Aug 2012 | A1 |
20120222106 | Kuehl | Aug 2012 | A1 |
20120236716 | Anbazhagan et al. | Sep 2012 | A1 |
20120240113 | Hur | Sep 2012 | A1 |
20120265976 | Spiers et al. | Oct 2012 | A1 |
20120272025 | Park et al. | Oct 2012 | A1 |
20120281706 | Agarwal et al. | Nov 2012 | A1 |
20120281708 | Chauhan et al. | Nov 2012 | A1 |
20120290647 | Ellison et al. | Nov 2012 | A1 |
20120297238 | Watson et al. | Nov 2012 | A1 |
20120311106 | Morgan | Dec 2012 | A1 |
20120311568 | Jansen | Dec 2012 | A1 |
20120324092 | Brown et al. | Dec 2012 | A1 |
20120324114 | Dutta et al. | Dec 2012 | A1 |
20130003567 | Gallant et al. | Jan 2013 | A1 |
20130013248 | Brugler et al. | Jan 2013 | A1 |
20130036213 | Hasan et al. | Feb 2013 | A1 |
20130044636 | Koponen et al. | Feb 2013 | A1 |
20130066940 | Shao | Mar 2013 | A1 |
20130080509 | Wang | Mar 2013 | A1 |
20130080624 | Nagai et al. | Mar 2013 | A1 |
20130091557 | Gurrapu | Apr 2013 | A1 |
20130097601 | Podvratnik et al. | Apr 2013 | A1 |
20130104140 | Meng et al. | Apr 2013 | A1 |
20130111540 | Sabin | May 2013 | A1 |
20130117337 | Dunham | May 2013 | A1 |
20130124712 | Parker | May 2013 | A1 |
20130125124 | Kempf et al. | May 2013 | A1 |
20130138816 | Kuo et al. | May 2013 | A1 |
20130144978 | Jain et al. | Jun 2013 | A1 |
20130152076 | Patel | Jun 2013 | A1 |
20130152175 | Hromoko et al. | Jun 2013 | A1 |
20130159097 | Schory et al. | Jun 2013 | A1 |
20130159496 | Hamilton et al. | Jun 2013 | A1 |
20130160008 | Cawlfield et al. | Jun 2013 | A1 |
20130162753 | Hendrickson et al. | Jun 2013 | A1 |
20130169666 | Pacheco et al. | Jul 2013 | A1 |
20130179941 | McGloin et al. | Jul 2013 | A1 |
20130182712 | Aguayo et al. | Jul 2013 | A1 |
20130185433 | Zhu et al. | Jul 2013 | A1 |
20130191106 | Kephart et al. | Jul 2013 | A1 |
20130198374 | Zalmanovitch et al. | Aug 2013 | A1 |
20130201989 | Hu et al. | Aug 2013 | A1 |
20130204849 | Chacko | Aug 2013 | A1 |
20130232491 | Radhakrishnan et al. | Sep 2013 | A1 |
20130246588 | Borowicz et al. | Sep 2013 | A1 |
20130250770 | Zou et al. | Sep 2013 | A1 |
20130254415 | Fullen et al. | Sep 2013 | A1 |
20130262347 | Dodson | Oct 2013 | A1 |
20130283364 | Chang et al. | Oct 2013 | A1 |
20130297769 | Chang et al. | Nov 2013 | A1 |
20130318240 | Hebert et al. | Nov 2013 | A1 |
20130318546 | Kothuri et al. | Nov 2013 | A1 |
20130339949 | Spiers et al. | Dec 2013 | A1 |
20140006481 | Frey et al. | Jan 2014 | A1 |
20140006535 | Reddy | Jan 2014 | A1 |
20140006585 | Dunbar et al. | Jan 2014 | A1 |
20140040473 | Ho et al. | Feb 2014 | A1 |
20140040883 | Tompkins | Feb 2014 | A1 |
20140052877 | Mao | Feb 2014 | A1 |
20140056146 | Hu et al. | Feb 2014 | A1 |
20140059310 | Du et al. | Feb 2014 | A1 |
20140074850 | Noel et al. | Mar 2014 | A1 |
20140075048 | Yuksel et al. | Mar 2014 | A1 |
20140075108 | Dong et al. | Mar 2014 | A1 |
20140075357 | Flores et al. | Mar 2014 | A1 |
20140075501 | Srinivasan et al. | Mar 2014 | A1 |
20140089727 | Cherkasova et al. | Mar 2014 | A1 |
20140098762 | Ghai et al. | Apr 2014 | A1 |
20140108985 | Scott et al. | Apr 2014 | A1 |
20140122560 | Ramey et al. | May 2014 | A1 |
20140136779 | Guha et al. | May 2014 | A1 |
20140140211 | Chandrasekaran et al. | May 2014 | A1 |
20140141720 | Princen et al. | May 2014 | A1 |
20140156557 | Zeng et al. | Jun 2014 | A1 |
20140164486 | Ravichandran et al. | Jun 2014 | A1 |
20140188825 | Muthukkaruppan et al. | Jul 2014 | A1 |
20140189095 | Lindberg et al. | Jul 2014 | A1 |
20140189125 | Amies et al. | Jul 2014 | A1 |
20140215471 | Cherkasova | Jul 2014 | A1 |
20140222953 | Karve et al. | Aug 2014 | A1 |
20140244851 | Lee | Aug 2014 | A1 |
20140245298 | Zhou et al. | Aug 2014 | A1 |
20140281173 | Im et al. | Sep 2014 | A1 |
20140282536 | Dave et al. | Sep 2014 | A1 |
20140282611 | Campbell et al. | Sep 2014 | A1 |
20140282889 | Ishaya et al. | Sep 2014 | A1 |
20140289200 | Kato | Sep 2014 | A1 |
20140295831 | Karra et al. | Oct 2014 | A1 |
20140297569 | Clark et al. | Oct 2014 | A1 |
20140297835 | Buys | Oct 2014 | A1 |
20140310391 | Sorenson, III et al. | Oct 2014 | A1 |
20140310417 | Sorenson, III et al. | Oct 2014 | A1 |
20140310418 | Sorenson, III et al. | Oct 2014 | A1 |
20140314078 | Jilani | Oct 2014 | A1 |
20140317261 | Shatzkamer et al. | Oct 2014 | A1 |
20140321278 | Cafarelli et al. | Oct 2014 | A1 |
20140330976 | van Bemmel | Nov 2014 | A1 |
20140330977 | van Bemmel | Nov 2014 | A1 |
20140334488 | Guichard et al. | Nov 2014 | A1 |
20140362682 | Guichard et al. | Dec 2014 | A1 |
20140365680 | van Bemmel | Dec 2014 | A1 |
20140366155 | Chang et al. | Dec 2014 | A1 |
20140369204 | Anand et al. | Dec 2014 | A1 |
20140372567 | Ganesh et al. | Dec 2014 | A1 |
20140379938 | Bosch et al. | Dec 2014 | A1 |
20150033086 | Sasturkar et al. | Jan 2015 | A1 |
20150043576 | Dixon et al. | Feb 2015 | A1 |
20150052247 | Threefoot et al. | Feb 2015 | A1 |
20150052517 | Raghu et al. | Feb 2015 | A1 |
20150058382 | St Laurent et al. | Feb 2015 | A1 |
20150058459 | Amendjian et al. | Feb 2015 | A1 |
20150071285 | Kumar et al. | Mar 2015 | A1 |
20150085870 | Narasimha et al. | Mar 2015 | A1 |
20150089082 | Patwardhan et al. | Mar 2015 | A1 |
20150100471 | Curry, Jr. et al. | Apr 2015 | A1 |
20150103827 | Quinn et al. | Apr 2015 | A1 |
20150106802 | Ivanov et al. | Apr 2015 | A1 |
20150106805 | Melander et al. | Apr 2015 | A1 |
20150117199 | Chinnaiah Sankaran et al. | Apr 2015 | A1 |
20150117458 | Gurkan et al. | Apr 2015 | A1 |
20150120914 | Wada et al. | Apr 2015 | A1 |
20150124622 | Kovvali et al. | May 2015 | A1 |
20150138973 | Kumar et al. | May 2015 | A1 |
20150178133 | Phelan et al. | Jun 2015 | A1 |
20150189009 | van Bemmel | Jul 2015 | A1 |
20150215819 | Bosch et al. | Jul 2015 | A1 |
20150227405 | Jan et al. | Aug 2015 | A1 |
20150242204 | Hassine et al. | Aug 2015 | A1 |
20150249709 | Teng et al. | Sep 2015 | A1 |
20150263901 | Kumar et al. | Sep 2015 | A1 |
20150280980 | Bitar | Oct 2015 | A1 |
20150281067 | Wu | Oct 2015 | A1 |
20150281113 | Siciliano et al. | Oct 2015 | A1 |
20150309908 | Pearson et al. | Oct 2015 | A1 |
20150319063 | Zourzouvillys et al. | Nov 2015 | A1 |
20150326524 | Tankala et al. | Nov 2015 | A1 |
20150339210 | Kopp et al. | Nov 2015 | A1 |
20150358850 | La Roche, Jr. et al. | Dec 2015 | A1 |
20150365324 | Kumar et al. | Dec 2015 | A1 |
20150373108 | Fleming et al. | Dec 2015 | A1 |
20160011925 | Kulkarni et al. | Jan 2016 | A1 |
20160013990 | Kulkarni et al. | Jan 2016 | A1 |
20160026684 | Mukherjee et al. | Jan 2016 | A1 |
20160062786 | Meng et al. | Mar 2016 | A1 |
20160094389 | Jain et al. | Mar 2016 | A1 |
20160094398 | Choudhury et al. | Mar 2016 | A1 |
20160094453 | Jain et al. | Mar 2016 | A1 |
20160094454 | Jain et al. | Mar 2016 | A1 |
20160094455 | Jain et al. | Mar 2016 | A1 |
20160094456 | Jain et al. | Mar 2016 | A1 |
20160094480 | Kulkarni et al. | Mar 2016 | A1 |
20160094643 | Jain et al. | Mar 2016 | A1 |
20160099847 | Melander et al. | Apr 2016 | A1 |
20160099853 | Nedeltchev et al. | Apr 2016 | A1 |
20160099864 | Akiya et al. | Apr 2016 | A1 |
20160105393 | Thakkar et al. | Apr 2016 | A1 |
20160127184 | Bursell | May 2016 | A1 |
20160134557 | Steinder et al. | May 2016 | A1 |
20160156708 | Jalan et al. | Jun 2016 | A1 |
20160164780 | Timmons et al. | Jun 2016 | A1 |
20160164914 | Madhav et al. | Jun 2016 | A1 |
20160182378 | Basavaraja et al. | Jun 2016 | A1 |
20160188527 | Cherian et al. | Jun 2016 | A1 |
20160234071 | Nambiar et al. | Aug 2016 | A1 |
20160239399 | Babu et al. | Aug 2016 | A1 |
20160253078 | Ebtekar et al. | Sep 2016 | A1 |
20160254968 | Ebtekar et al. | Sep 2016 | A1 |
20160261564 | Foxhoven et al. | Sep 2016 | A1 |
20160277368 | Narayanaswamy et al. | Sep 2016 | A1 |
20170005948 | Melander et al. | Jan 2017 | A1 |
20170024260 | Chandrasekaran et al. | Jan 2017 | A1 |
20170026294 | Basavaraja et al. | Jan 2017 | A1 |
20170026470 | Bhargava et al. | Jan 2017 | A1 |
20170041342 | Efremov et al. | Feb 2017 | A1 |
20170054659 | Ergin et al. | Feb 2017 | A1 |
20170097841 | Chang et al. | Apr 2017 | A1 |
20170099188 | Chang et al. | Apr 2017 | A1 |
20170104755 | Arregoces et al. | Apr 2017 | A1 |
20170147297 | Krishnamurthy et al. | May 2017 | A1 |
20170149878 | Mutnuru | May 2017 | A1 |
20170171158 | Hoy et al. | Jun 2017 | A1 |
20170264663 | Bicket et al. | Sep 2017 | A1 |
20170339070 | Chang et al. | Nov 2017 | A1 |
Number | Date | Country |
---|---|---|
101719930 | Jun 2010 | CN |
101394360 | Jul 2011 | CN |
102164091 | Aug 2011 | CN |
104320342 | Jan 2015 | CN |
105740084 | Jul 2016 | CN |
2228719 | Sep 2010 | EP |
2439637 | Apr 2012 | EP |
2645253 | Nov 2014 | EP |
10-2015-0070676 | May 2015 | KR |
M394537 | Dec 2010 | TW |
WO 2009155574 | Dec 2009 | WO |
WO 2010030915 | Mar 2010 | WO |
WO 2013158707 | Oct 2013 | WO |
Entry |
---|
Ford, Bryan et al., Peer-to-Peer Communication Across Network Address Translators, In USENIX Annual Technical Conference, 2005, pp. 179-192, downloaded from http://www.brynosaurus.com/pub/net/p2pnat/, Jan. 10, 2012, 13 pages. |
Meraki releases industry's first cloud-managed routers, Merkai, Inc., Jan. 13, 2011, downloaded from http://meraki.com/press-releases/2011/01/13/meraki-releases-industrys-first-cloud-managed-routers/, Jan. 8, 2012, 2 pages. |
Blanchet, M., A Flexible Method for Managing the Assignment of Bits of an IPv6 Address Block, The Internet Society, Network Working Group, Request for Comments: 3531, Category: Informational, Apr. 2003, 8 pages. |
Baker, F. ed., Requirements for IP Version 4 Routers, The Internet Society, Network Working Group, Request for Comments: 1812, Category: Standards Track, Jun. 1995, 175 pages. |
Amedro, Brian, et al., “An Efficient Framework for Running Applications on Clusters, Grids and Cloud,” 2010, 17 pages. |
Author Unknown, “5 Benefits of a Storage Gateway in the Cloud,” Blog, TwinStrata, Inc., Jul. 25, 2012, XP055141645, 4 pages, https://web.archive.org/web/20120725092619/http://blog.twinstrata.com/2012/07/10//5-benefits-of-a-storage-gateway-in-the-cloud. |
Author Unknown, “Joint Cisco and VMWare Solution for Optimizing Virtual Desktop Delivery: Data Center 3.0: Solutions to Accelerate Data Center Virtualization,” Cisco Systems, Inc. and VMware, Inc., Sep. 2008, 10 pages. |
Author Unknown, “A Look at DeltaCloud: The Multi-Cloud API,” Feb. 17, 2012, 4 pages. |
Author Unknown, “About Deltacloud,” Apache Software Foundation, Aug. 18, 2013, 1 page. |
Author Unknown, “Architecture for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0102, Jun. 18, 2010, 57 pages. |
Author Unknown, “Cloud Infrastructure Management Interface—Common Information Model (CIMI-CIM),” Document No. DSP0264, Version 1.0.0, Dec. 14, 2012, 21 pages. |
Author Unknown, “Cloud Infrastructure Management Interface (CIMI) Primer,” Document No. DSP2027, Version 1.0.1, Sep. 12, 2012, 30 pages. |
Author Unknown, “cloudControl Documentation,” Aug. 25, 2013, 14 pages. |
Author Unknown, “Interoperable Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-IS0101, Nov. 11, 2009, 21 pages. |
Author Unknown, “Microsoft Cloud Edge Gateway (MCE) Series Appliance,” Iron Networks, Inc., 2014, 4 pages. |
Author Unknown, “Open Data Center Alliance Usage: Virtual Machine (VM) Interoperability in a Hybrid Cloud Environment Rev. 1.2,” Open Data Center Alliance, Inc., 2013, 18 pages. |
Author Unknown, “Real-Time Performance Monitoring on Juniper Networks Devices, Tips and Tools for Assessing and Analyzing Network Efficiency,” Juniper Networks, Inc., May 2010, 35 pages. |
Author Unknown, “Use Cases and Interactions for Managing Clouds, A White Paper from the Open Cloud Standards Incubator,” Version 1.0.0, Document No. DSP-ISO0103, Jun. 16, 2010, 75 pages. |
Author Unknown, “Apache Ambari Meetup What's New,” Hortonworks Inc., Sep. 2013, 28 pages. |
Author Unknown, “Introduction,” Apache Ambari project, Apache Software Foundation, 2014, 1 page. |
Beyer, Steffen, “Module “Data::Locations?!”,” YAPC::Europe, London, UK,ICA, Sep. 22-24, 2000, XP002742700, 15 pages. |
Borovick, Lucinda, et al., “Architecting the Network for the Cloud,” IDC White Paper, Jan. 2011, 8 pages. |
Bosch, Greg, “Virtualization,” last modified Apr. 2012 by B. Davison, 33 pages. |
Broadcasters Audience Research Board, “What's Next,” http://lwww.barb.co.uk/whats-next, accessed Jul. 22, 2015, 2 pages. |
Cisco Systems, Inc. “Best Practices in Deploying Cisco Nexus 1000V Series Switches on Cisco UCS B and C Series Cisco UCS Manager Servers,” Cisco White Paper, Apr. 2011, 36 pages, http://www.cisco.com/en/US/prod/collateral/switches/ps9441/ps9902/white_paper_c11-558242.pdf. |
Cisco Systems, Inc., “Cisco Unified Network Services: Overcome Obstacles to Cloud-Ready Deployments,” Cisco White Paper, Jan. 2011, 6 pages. |
Cisco Systems, Inc., “Cisco Intercloud Fabric: Hybrid Cloud with Choice, Consistency, Control and Compliance,” Dec. 10, 2014, 22 pages. |
Cisco Technology, Inc., “Cisco Expands Videoscape TV Platform Into the Cloud,” Jan. 6, 2014, Las Vegas, Nevada, Press Release, 3 pages. |
Citrix, “Citrix StoreFront 2.0” White Paper, Proof of Concept Implementation Guide, Citrix Systems, Inc., 2013, 48 pages. |
Citrix, “CloudBridge for Microsoft Azure Deployment Guide,” 30 pages. |
Citrix, “Deployment Practices and Guidelines for NetScaler 10.5 on Amazon Web Services,” White Paper, citrix.com, 2014, 14 pages. |
CSS Corp, “Enterprise Cloud Gateway (ECG)—Policy driven framework for managing multi-cloud environments,” original published on or about Feb. 11, 2012; 1 page; http://www.css-cloud.com/platform/enterprise-cloud-gateway.php. |
Fang K., “LISP MAC-EID-TO-RLOC Mapping (LISP based L2VPN),” Network Working Group, Internet Draft, CISCO Systems, Jan. 2012, 12 pages. |
Gedymin, Adam, “Cloud Computing with an emphasis on Google App Engine,” Sep. 2011, 146 pages. |
Good, Nathan A., “Use Apache Deltacloud to administer multiple instances with a single API,” Dec. 17, 2012, 7 pages. |
Herry, William, “Keep It Simple, Stupid: OpenStack nova-scheduler and its algorithm”, May 12, 2012, IBM, 12 pages. |
Hewlett-Packard Company, “Virtual context management on network devices”, Research Disclosure, vol. 564, No. 60, Apr. 1, 2011, Mason Publications, Hampshire, GB, Apr. 1, 2011, 524. |
Juniper Networks, Inc., “Recreating Real Application Traffic in Junosphere Lab,” Solution Brief, Dec. 2011, 3 pages. |
Kenhui, “Musings on Cloud Computing and IT-as-a-Service: [Updated for Havana] Openstack Computer for VSphere Admins, Part 2: Nova-Scheduler and DRS”, Jun. 26, 2013, Cloud Architect Musings, 12 pages. |
Kolyshkin, Kirill, “Virtualization in Linux,” Sep. 1, 2006, XP055141648, 5 pages, https://web.archive.org/web/20070120205111/http://download.openvz.org/doc/openvz-intro.pdf. |
Kumar, S., et al., “Infrastructure Service Forwarding for NSH,” draft-kumar-sfc-nsh-forwarding-00, Feb. 15, 2016, 17 pages, Service Function Chaining, Cisco Systems, Inc. |
Kunz, Thomas, et al., “OmniCloud—The Secure and Flexible Use of Cloud Storage Services,” 2014, 30 pages. |
Lerach, S.R.O., “Golem,” http://www.lerach.cz/en/products/golem, accessed Jul. 22, 2015, 2 pages. |
Linthicum, David, “VM Import could be a game changer for hybrid clouds”, InfoWorld, Dec. 23, 2010, 4 pages. |
Logan, Marcus, “Hybrid Cloud Application Architecture for Elastic Java-Based Web Applications,” F5 Deployment Guide Version 1.1, 2016, 65 pages. |
Lynch, Sean, “Monitoring cache with Claspin” Facebook Engineering, Sep. 19, 2012, 5 pages. |
Meireles, Fernando Miguel Dias, “Integrated Management of Cloud Computing Resources,” 2013-2014, 286 pages. |
Mu, Shuai, et al., “uLibCloud: Providing High Available and Uniform Accessing to Multiple Cloud Storages,” 2012 IEEE, 8 pages. |
Naik, Vijay K., et al., “Harmony: A Desktop Grid for Delivering Enterprise Computations,” Grid Computing, 2003, Fourth International Workshop on Proceedings, Nov 17, 2003, pp. 1-11. |
Nair, Srijith K. et al., “Towards Secure Cloud Bursting, Brokerage and Aggregation,” 2012, 8 pages, www.flexiant.com. |
Nielsen, “SimMetry Audience Measurement—Technology,” http://www.nielsen-admosphere.eu/products-and-services/simmetry-audience-measurement-technology/, accessed Jul. 22, 2015, 6 pages. |
Nielsen, “Television,” http://www.nielsen.com/us/en/solutions/measurement/television.html, accessed Jul. 22, 2015, 4 pages. |
Open Stack, “Filter Scheduler,” updated Dec. 17, 2017, 5 pages, accessed on Dec. 18, 2017, https://docs.openstack.org/nova/latest/user/filter-scheduler.html. |
Quinn P., et al., “Service Function Chaining (SFC) Architecture,” draft-quinn-sfc-arch-03, Jan. 22, 2014, 21 pages, Network Working Group, Cisco Systems, Inc. |
Quinn, P., et al., “Network Service Header,” draft-quinn-sfc-nsh-03, Jul. 3, 2014, 27 pages, Network Working Group, Cisco Systems, Inc. |
Rabadan, J., et al., “Operational Aspects of Proxy-ARP/ND in EVPN Networks,” BESS Worksgroup Internet Draft, draft-snr-bess-evpn-proxy-arp-nd-02, Oct. 6, 2015, 22 pages. |
Saidi, Ali, et al., “Performance Validation of Network-Intensive Workloads on a Full-System Simulator,” Interaction between Operating System and Computer Architecture Workshop, (IOSCA 2005), Austin, Texas, Oct. 2005, 10 pages. |
Shunra, “Shunra for HP Software; Enabling Confidence in Application Performance Before Deployment,” 2010, 2 pages. |
Son, Jungmin, “Automatic decision system for efficient resource selection and allocation in inter-clouds,” Jun. 2013, 35 pages. |
Sun, Aobing, et al., “IaaS Public Cloud Computing Platform Scheduling Model and Optimization Analysis,” Int. J. Communications, Network and System Sciences, 2011, 4, 803-811, 9 pages. |
Szymaniak, Michal, et al., “Latency-Driven Replica Placement”, vol. 47 No. 8, IPSJ Journal, Aug. 2006, 12 pages. |
Toews, Everett, “Introduction to Apache jclouds,” Apr. 7, 2014, 23 pages. |
Von Laszewski, Gregor, et al., “Design of a Dynamic Provisioning System for a Federated Cloud and Bare-metal Environment,” 2012, 8 pages. |
Wikipedia, “Filter (software)”, Wikipedia, Feb. 8, 2014, 2 pages, https://en.wikipedia.org/w/index.php?title=Filter_%28software%29&oldid=594544359. |
Wikipedia; “Pipeline (Unix)”, Wikipedia, May 4, 2014, 4 pages, https://en.wikipedia.org/w/index.php?title=Pipeline2/028Unix%29&oldid=606980114. |
Ye, Xianglong, et al., “A Novel Blocks Placement Strategy for Hadoop,” 2012 IEEE/ACTS 11th International Conference on Computer and Information Science, 2012 IEEE, 5 pages. |
Number | Date | Country | |
---|---|---|---|
20150092603 A1 | Apr 2015 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 13350736 | Jan 2012 | US |
Child | 14563977 | US |