Patent Grant
11075987
Some content providers attempt to facilitate the delivery of requested content, such as network pages (e.g., content pages, Web pages, etc.) and/or resources identified in network pages, through the utilization of a network storage provider or a content delivery network (“CDN”) service provider. A network storage provider and a CDN server provider each typically maintain a number of computing devices in a communication network that can maintain content from various content providers. In turn, content providers can instruct, or otherwise suggest to, client computing devices to request some, or all, of the content provider's content from the network storage provider's or CDN service provider's computing devices.
As with content providers, network storage providers and CDN service providers are also generally motivated to provide requested content to client computing devices often with consideration of efficient transmission of the requested content to the client computing device and/or consideration of a cost associated with the transmission of the content. Accordingly, CDN service providers often consider factors such as latency of delivery of requested content in order to meet service level agreements or to generally improve the quality of delivery service.
Throughout the drawings, reference numbers may be re-used to indicate correspondence between referenced elements. The drawings are provided to illustrate example embodiments described herein and are not intended to limit the scope of the disclosure.
Generally described, aspects of the present disclosure relate to a content delivery network (“CDN”) that estimates a size of a requested content resource (e.g., a data object, such as a video file, an audio file, a script, an image, a document, etc.) for use in implementing load balancing techniques. The load balancing techniques implemented by the CDN may reduce a latency of a delivery of the requested content resource.
As referenced above, CDNs may receive a high volume of content resource requests. Typically, CDNs employ load balancers to balance the incoming request load onto a number of cache servers. For example, typical CDNs may use consistent hashing techniques to distribute content resource requests onto different cache servers such that the cache servers each serve a similar number of requests.
For a CDN, however, all content resource requests are not equal. The computing resources (e.g., disk space, processor time, central processing power, graphical processing power, memory, network bandwidth, internal bus utilization, etc.) required by a CDN to serve one request can be drastically different from the computing resources required by the CDN to serve another request. For example, in typical scenarios, a 100 KB data object requested by a user device can be served by the CDN faster than a 20 GB data object. Typical load balancers do not take into account the size of a requested data object in determining how to balance the incoming request load because the size of the requested data object is unknown until the requested data object is delivered by the CDN to the user device. For example, the data object request may identify the desired data object, but the data object request may not indicate a size of the desired data object. Thus, typical load balancers do not fully evaluate the computing resource cost that may be incurred by a received data object request. The absence of a full evaluation of the computing resource cost that may be incurred by a received data object request can lead to imbalances on the cache servers. For example, some cache servers may be tasked with processing a higher load than other cache servers, even if the number of requests being served by each cache server is similar.
One possible solution for overcoming the deficiencies described above is to implement a CDN that stores the size of a data object a first time a request for the data object is received. The next time a request for the data object is received, the CDN can then retrieve the size and employ load balancers to balance the incoming load request according to the retrieved size. However, a CDN may receive thousands of requests per second. In addition, certain CDNs may be multitenant CDNs (e.g., CDNs that serve requests for data objects originating from different content providers), meaning that the CDNs receive requests for a large diversity of data objects. The amount of memory required to store information identifying the size of each requested data object and/or associated information (e.g., a cache key associated with each requested data object) may be too large for a CDN to handle.
Thus, a more efficient and less computing resource intensive approach may be to store an approximate history of data object requests and corresponding sizes. Accordingly, aspects of the present disclosure provide a CDN that employs a load balancer that uses probabilistic filters (e.g., Bloom filters, Cuckoo filters, etc.) to estimate sizes of requested data objects and that balances incoming request loads according to the estimated sizes. For example, the load balancer may store one or more probabilistic filters. Each probabilistic filter may be associated with a size range (e.g., a minimum data object size and a maximum data object size). The probabilistic filters in the aggregate (referred to herein as a “probabilistic filter family”) may cover a range of possible data object sizes. As an illustrative example, a first probabilistic filter may be associated with a size range of 0 KB to 100 KB, a second probabilistic filter may be associated with a size range of 101 KB to 1 MB, a third probabilistic filter may be associated with a size range of 1.001 MB to 10 MB, and so on. The size range associated with a probabilistic filter may be defined such that an amount of CDN computing resources necessary to serve a request for a data object with a size within the size range is similar to an amount of CDN computing resources necessary to serve a request for another data object with a different size within the size range (e.g., the difference in the amount of CDN computing resources necessary for serving a request for a data object with a minimum size within the size range and for serving a request for a data object with a maximum size within the size range is less than a threshold value; the difference in latency for serving a request for a data object with a minimum size within the size range and for serving a request for a data object with a maximum size within the size range is less than a threshold value, such as 10 ms or a time that would not be noticeable to a user; etc.).
When a CDN receives a request for a particular data object, a load balancer can generate a cache key based on the request, generate a hash (or multiple different hashes) based on the cache key, and use the hash(es) to determine within a certain probability whether the cache key is a member of any of the probabilistic filters. If the load balancer determines that the cache key is a member of a probabilistic filter, then the load balancer can determine an estimated size of the data object associated with the cache key based on the probabilistic filter of which the cache key is a member. For example, the load balancer can estimate that the data object size is a size that corresponds with the size range associated with the probabilistic filter of which the cache key is a member (e.g., the load balancer can estimate that the data object size is a maximum size of the size range associated with the probabilistic filter of which the cache key is a member). The load balancer may then use the estimated size to estimate the added load on one or more cache servers. Based on the estimated added load, the load balancer can select a cache server to handle the request. The load balancer can then transmit the cache key to the selected cache server such that the selected cache server serves the data object corresponding to the cache key to the requesting device.
If, however, the load balancer determines that the cache key is not a member of any probabilistic filter, then the load balancer may assign a size to the data object associated with the cache key. For example, the load balancer may assign a random size to the data object; may assign a size to the data object selected using consistent hashing techniques; may assign a size to the data object based on an overall average of sizes corresponding to requested data objects; may assign a size to the data object based on properties of the data object request, such as a distribution (e.g., a hostname), a URL type (e.g., a video URL, an audio URL, etc.), and/or a range header (e.g., a number of bytes indicated in the header); and/or the like. The load balancer may use the assigned size to estimate the added load on one or more cache servers, select a cache server to handle the request based on the estimated added load, and transmit the cache key to the selected cache server such that the selected cache server serves the data object corresponding to the cache key to the requesting device.
Once the request is served, the actual size of the data object may be known. The load balancer can then add the cache key to the probabilistic filter that is associated with a size range within which the data object size falls. Thus, because a representation of a data object is added as a member of a probabilistic filter once the actual data object size is known and because each probabilistic filter is associated with a size range, the probabilistic filter family can store data that represents an approximate or partial history of received data object requests and corresponding sizes (e.g., the history of received data object requests is approximate or partial because the load balancer is not tracking the receipt of a data object request if a request for the same data object has previously been received). As described in greater detail below, the probabilistic filters can be reset periodically to reduce the CDN memory usage and/or to minimize false positives (e.g., situations in which the load balancer determines that data representing a data object is a member of a probabilistic filter when in fact the data representing the data object is not a member of that probabilistic filter).
In some instances, a CDN may operate as a distributed system in which multiple points of presence (POPs) implement instances of the CDN. As used herein, a POP is intended to refer to any collection of related computing devices utilized to implement functionality on behalf of one or many providers. POPs are generally associated with a specific geographic location in which the computing devices implementing the POP are located, or with a region serviced by the POP. For example, a data center or a collection of computing devices within a data center may form a POP. A CDN may utilize multiple POPs that are geographically diverse, to enable users in a variety of geographic locations to quickly transmit and receive information (e.g., requested data objects) from the CDN. In some instances, the POPs may also implement other services in addition to the CDN services, such as data storage services, data processing services, etc.
For simplicity, the present disclosure is described herein with respect to a specific type of probabilistic filter—a Bloom filter. However, this is not meant to be limiting. For example, the functionality of the Bloom filters described herein may be implemented using other types of probabilistic filters (e.g., Cuckoo filters).
By using probabilistic filters to estimate the size of a requested data object, the CDN described herein may more effectively balance the load on the cache servers as compared with typical CDNs. Cache servers with more balanced loads may lead to a reduction in the latency associated with the delivery of a requested data object when compared with the performance of typical CDNs. The foregoing aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings.
Example Load Estimating CDN Environment
While the user devices 102 and POPs 120 are shown as grouped within
The operating environment 100 further includes one or more origin servers 104. The origin servers 104 may include any computing device owned or operated by an entity that has provided one or more sets of content (“distributions”) to a CDN (e.g., CDN service 122) for subsequent transmission to user devices 102. For example, origin servers 104 may include servers hosting web sites, streaming audio, video, or multimedia services, data analytics services, or other network-accessible services. The origin servers 104 may include primary versions of content within various distributions. The primary versions of content may be retrieved by the various POPs 120 for subsequent transmission to the user devices 102. In an embodiment, the POPs 120 includes a cache that stores frequently-requested content (e.g., the cache data store 128). If requested content is not present in the POP 120 cache, then the POP 120 may retrieve the content from an origin server 104. In alternate embodiments, not shown, the POP 120 may first request the content from an intermediate cache housed within a regional data center. If the requested content is also not present in the intermediate cache, then the POP 120 may retrieve the content from an origin server 104.
Users, by way of user devices 102, may interact with a host 124 of a CDN service 122 of a POP 120 to request content (e.g., a data object). In an embodiment, each host 124 functions as a load balancer. In particular, each host 124 may select a cache server 126 to deliver the requested data object based on an analysis of the load being handled by the cache servers 126 and an estimated size of the requested data object. A single POP 120 may include multiple hosts 124 such that the POP 120 can service multiple data object requests simultaneously.
For example, each host 124 may include an object size estimator 132, an object request distributor 134, and a Bloom filter data store 136. The object size estimator 132 may receive the data object request from a user device 102. The data object request may include header information (e.g., Hypertext Transfer Protocol (HTTP) header information) and a URL that identifies a location of the data object (e.g., in an origin server 104). The object size estimator 132 can generate a cache key corresponding to the request using the header information, the URL, and/or other user-defined information (e.g., generate a hash using this information). Various cache keys may be stored in the cache data store 128 in association with corresponding data objects (e.g., a cache key may be stored in the cache data store 128 in association with a data object that corresponds to the request from which the cache key is generated). Thus, the generated cache key can be used by a cache server 126 to retrieve a data object from the cache data store 128 (e.g., the data object requested by the user device 102).
The object size estimator 132 may also use the generated cache key to estimate a data object size. For example, the Bloom filter data store 136 may store one or more Bloom filters. Each Bloom filter may be represented as an N-bit array. Each Bloom filter may also be associated with one or more hash functions. The hash functions associated with a Bloom filter can be non-cryptographic hash functions (e.g., Fowler-Noll-Vo (FNV), Murmurhash, etc.) and/or a cryptographic hash functions (e.g., MD5, SHA-256, etc.). When a Bloom filter is created or reset, each bit in the N-bit array may be a logical “0.” As described herein, cache keys may be added as members of a Bloom filter, which may result in one or more bits in the N-bit array becoming a logical “1.” To test whether a cache key is a member of a Bloom filter, the object size estimator 132 applies each hash function associated with the Bloom filter to the cache key. In other words, the object size estimator 132 generates a first hash of the cache key using a first hash function associated with the Bloom filter, generates a second hash of the cache key using a second hash function associated with the Bloom filter, and so on until hashes of the cache key are generated using each hash function associated with the Bloom filter. The hash values that result from applying the hash functions to the cache key may each be alphanumeric values that correspond to an element in the N-bit array. As an illustrative example, a first hash of the cache key may be the value “2” and a second hash of the cache key may be the value “14.” Thus, the first hash may correspond to the second element in the N-bit array and the second hash may correspond to the fourteenth element in the N-bit array. After applying each hash function associated with the Bloom filter to the cache key, the object size estimator 132 determines whether each element in the N-bit array that corresponds to a generated hash value is a logical “1.” If each element in the N-bit array that corresponds to a generated hash value is a logical “1,” then the object size estimator 132 determines that the cache key is a member of the Bloom filter. Otherwise, if one or more elements in the N-bit array that correspond to a generated hash value are a logical “0,” then the object size estimator 132 determines that the cache key is not a member of the Bloom filter.
The object size estimator 132 can use a determination of a cache key being a member of a Bloom filter as an indicator of a possible size of a data object associated with the cache key. For example, each Bloom filter stored in the Bloom filter data store 136 is associated with a size range (e.g., a minimum size and a maximum size). The Bloom filters in the aggregate (referred to herein as a “Bloom filter family”) therefore may cover a large range of possible data object sizes. Because each Bloom filter is associated with a size range, a cache key is added as a member of a particular Bloom filter if a size of the data object associated with the cache key falls within the size range associated with the particular Bloom filter. Thus, cache keys that are members of a Bloom filter are each associated with a data object that has a size that falls within the size range associated with the Bloom filter. Accordingly, if the object size estimator 132 determines that a cache key is a member of a first Bloom filter, then the data object associated with the cache key likely has a size that falls within the size range associated with the first Bloom filter.
Once the cache key is generated using the data object request, the object size estimator 132 begins the process for estimating the data object size by first retrieving one or more of the Bloom filters stored in the Bloom filter data store 136. For a first Bloom filter, the object size estimator 132 can apply each hash function associated with the first Bloom filter to the generated cache key. The object size estimator 132 can then identify the element(s) that correspond to the resulting hash value(s) and analyze the first Bloom filter to determine whether the first Bloom filter is represented by an N-bit array that has a logical “1” stored in each of the identified element(s). The object size estimator 132 can repeat this process to test cache key membership in each of the retrieved Bloom filters or just until the object size estimator 132 identifies a Bloom filter of which the generated cache key is a member.
In some embodiments, each Bloom filter stored in the Bloom filter data store 136 is associated with the same set of hash functions (e.g., a Bloom filter family is associated with the same set of hash functions). Thus, the object size estimator 132 may apply each associated hash function to the cache key once. The object size estimator 132 can then retrieve one or more of the Bloom filters stored in the Bloom filter data store 136, identify the element(s) that correspond to the resulting hash value(s), and analyze the Bloom filters to determine whether any Bloom filter is represented by an N-bit array that has a logical “1” stored in each of the identified element(s). By having each Bloom filter in the Bloom filter data store 136 being associated with the same set of hash functions, the object size estimator 132 may test for membership in the Bloom filters using fewer computing resources.
If the object size estimator 132 determines that the generated cache key is a member of a particular Bloom filter, then the object size estimator 132 estimates that the data object associated with the generated cache key has a size corresponding to the size range of the Bloom filter of which the generated cache key is a member. For example, the object size estimator 132 may estimate the size of the data object to be the maximum size in the size range, the minimum size in the size range, an average size in the size range, and/or the like. Once the object size estimator 132 estimates the data object size, the object size estimator 132 can inform the object request distributor 134 of the estimated size.
On the other hand, if the object size estimator 132 determines that the generated cache key is not a member of any retrieved Bloom filter, then the object size estimator 132 can assign a size to the data object associated with the generated cache key. For example, the object size estimator 132 may assign a random size to the data object; may assign a size to the data object selected using consistent hashing techniques (e.g., one of a set of sizes is assigned based on a hash value generated using consistent hashing techniques (e.g., the generated hash value rotates between a set of hash values each time a hash is performed, and each hash value in the set is associated with a size)); may assign a size to the data object based on an overall average of sizes corresponding to requested data objects; may assign a size to the data object based on properties of the data object request, such as a distribution (e.g., a hostname), a URL type (e.g., a video URL, an audio URL, etc.), and/or a range header (e.g., a number of bytes indicated in the header); and/or the like. The object size estimator 132 can inform the object request distributor 134 of the assigned size and/or indicate that the assigned size is not an estimate based on Bloom filter membership. Alternatively, the object size estimator 132 may assign no size to the data object and may inform the object request distributor 134 that no size has been assigned to the data object.
In some situations, the object size estimator 132 may determine that the generated cache key is a member of two or more Bloom filters. For example, this situation may occur due to a false positive test result. In such a situation, the object size estimator 132 may estimate that the size of the data object associated with the generated cache key is a value derived from one or more size ranges associated with the Bloom filters of which the generated cache key is determined to be a member. For example, the object size estimator 132 may determine which Bloom filter is associated with a higher size range and estimate that the size of the data object associated with the generated cache key is a size within the higher size range (e.g., the maximum size of the higher size range). As another example, the object size estimator 132 may estimate that the size of the data object associated with the generated cache key is an average of the size ranges associated with the Bloom filters of which the generated cache key is determined to be a member.
The object request distributor 134 may select a cache server 126 to serve the requested data object using the data provided by the object size estimator 132 and/or cache server 126 load information. For example, the object request distributor 134 may track a current load on each of the cache servers 126. The current load may be represented by a value that is an aggregate of the estimated sizes of the data objects being served by a cache server 126 at a particular point in time. When a cache server 126 is tasked with responding to a new data object request, the object request distributor 134 may increase the value representing the current load of the cache server 126 by the estimated size of the requested data object (e.g., as estimated by the object size estimator 132) or by the size assigned to the requested data object (e.g., if the generated cache key was not a member of any Bloom filter). Likewise, once the cache server 126 is finished delivering a requested data object, the object request distributor 134 may decrease the value representing the current load of the cache server 126 by the estimated size of the requested data object (e.g., as estimated by the object size estimator 132) or by the size assigned to the requested data object (e.g., if the generated cache key was not a member of any Bloom filter).
The object request distributor 134 may aim to maintain similar loads on each of the cache servers 126. Thus, the object request distributor 134 may use the estimated or assigned size provided by the object size estimator 132 to identify a cache server 126 that has capacity to handle the data object request given current load levels. For example, the object request distributor 134 can calculate an average current load of the cache servers 126. The object request distributor 134 can then identify any cache servers 126 that have a current load below the calculated average and that, if tasked with handling the data object request, would still have a current load less than or equal to the calculated average given the estimated or assigned size. The object request distributor 134 may then select one of these identified cache servers 126 to service the data object request. As another example, the object request distributor 134 can add the estimated or assigned size to the current load of each cache server 126 and identify one or more cache servers 126 that have a current load such that the addition of the estimated or assigned size would still result in the current load of all cache servers 126 being within a threshold value of each other (e.g., within 10 MB of each other, within 10% of each other, etc.). As another example, the object request distributor 134 can add the estimated or assigned size to the current load of each cache server 126 and identify one or more cache servers 126 that have a current load such that the addition of the estimated or assigned size would still result in the current load of the respective cache server 126 being below the capacity and/or safety threshold of the respective cache servers 126 (even if the current load of the respective cache server 126 exceeds a calculated average current load, for example, because it may be more likely that the respective cache server 126 has access to the data object). The object request distributor 134 may then select one of these identified cache servers 126 to service the data object request.
Selection of a cache server 126 to service the data object request may cause the object request distributor 134 to update the current load of the selected cache server 126. For example, the object request distributor 134 may add the estimated or assigned size to the current load of the selected cache server 126 to form an updated version of the current load. The object request distributor 134 may then store the updated version of the current load of the selected cache server 126 for future use.
A data store (not shown) that stores the current loads of the cache servers 126 may be stored internal to the object request distributor 134. Alternatively, the data store (not shown) that stores the current loads of the cache servers 126 may be stored external to the object request distributor 134 (e.g., in a host 124 or in the CDN service 122 and/or cache server 126 such that the data store is available to all hosts 124). Thus, the object request distributor 134 may retrieve the current load information for each of the cache servers 126 from the external data store, perform the analysis of and/or update to the current load information as described above, and re-store in the external data store the possibly updated current load information of each cache server 126 once the cache server 126 selection is complete.
Once a cache server 126 is selected, the object request distributor 134 may instruct the selected cache server 126 to service the data object request by providing the generated cache key to the selected cache server 126. The selected cache server 126 may then query the cache data store 128 using the generated cache key, receive the data object corresponding to the generated cache key from the cache data store 128 in response to the query, and the transmit the received data object to the user device 102 to satisfy the data object request. If the query does not result in the selected cache server 126 receiving a data object (e.g., because the data object is not stored in the cache data store 128), then the selected cache server 126 may retrieve the data object from an origin server 104 (e.g., using the URL in the data object request) and/or instruct an origin server 104 to transmit the corresponding data object to the user device 102 (e.g., by providing the URL in the data object request) to satisfy the data object request.
If the object size estimator 132 initially determined that the generated cache key was not a member of any Bloom filter, then the object size estimator 132 can add the generated cache key to the appropriate Bloom filter for use in future requests. For example, the actual size of the data object may be known before, during, and/or after the selected cache server 126 delivers the data object to the user device 102. The selected cache server 126 may therefore transmit a message to the object size estimator 132 indicating the actual data object size once the actual data object size is known. The object size estimator 132 may then identify the Bloom filter stored in the Bloom filter data store 136 that is associated with a size range in which the actual data object size falls. Once the appropriate Bloom filter is identified, the object size estimator 132 can determine the hash functions associated with the identified Bloom filter. The object size estimator 132 can then apply each hash function associated with the identified Bloom filter to the previously generated cache key (e.g., the cache key generated based on the contents of the data object request). The object size estimator 132 adds the generated cache key as a member of the identified Bloom filter by identifying each element in the N-bit array representing the identified Bloom filter that corresponds to a generated hash value and changing the bit in those elements to be a logical “1.”
If the object size estimator 132 initially determined that the generated cache key was not a member of any Bloom filter, then the selected cache server 126 may also transmit the actual data object size to the object request distributor 134. The object request distributor 134 can use the actual data object size to update the current load of the selected cache server 126, if necessary. For example, if the assigned size differs from the actual data object size to the extent that the assigned size falls within the size range associated with one Bloom filter and the actual data object size falls within the size range associated with a different Bloom filter, then the object request distributor 134 can subtract the assigned size from the current load and add the actual data object size. The object request distributor 134 may subsequently subtract the actual data object size from the current load once the data object is delivered by the selected cache server 126 to the user device 102.
As described herein, each POP 120 is a collection of related computing devices utilized to implement CDN functionality on behalf of one or many providers. For example, the hosts 124, the one or more cache servers 126, and/or the cache data store 128 may each be implemented by one or more related computing devices (e.g., devices that include one or more processors, memory, input/output interfaces, networking interfaces, etc. to implement the functionality described herein). Each POP 120 may be generally associated with a specific geographic location in which the computing devices implementing the respective POP 120 are located, or with a region serviced by the respective POP 120. For example, a data center or a collection of computing devices within a data center may form a POP 120. A CDN may utilize multiple POPs 120 that are geographically diverse, to enable users in a variety of geographic locations to quickly transmit and receive information (e.g., requested data objects) from the CDN. In some instances, the POPs 120 may also implement other services in addition to the CDN services 122, such as data storage services, data processing services, etc.
The CDN services 122 may operate in a distributed computing environment including several computer systems that are interconnected using one or more computer networks (not shown in
Various example user devices 102 are shown in
The network 110 may include any wired network, wireless network, or combination thereof. For example, the network 110 may be a personal area network, local area network, wide area network, over-the-air broadcast network (e.g., for radio or television), cable network, satellite network, cellular telephone network, or combination thereof. As a further example, the network 110 may be a publicly accessible network of linked networks, possibly operated by various distinct parties, such as the Internet. In some embodiments, the network 110 may be a private or semi-private network, such as a corporate or university intranet. The network 110 may include one or more wireless networks, such as a Global System for Mobile Communications (GSM) network, a Code Division Multiple Access (CDMA) network, a Long Term Evolution (LTE) network, or any other type of wireless network. The network 110 can use protocols and components for communicating via the Internet or any of the other aforementioned types of networks. For example, the protocols used by the network 110 may include Hypertext Transfer Protocol (HTTP), HTTP Secure (HTTPS), Message Queue Telemetry Transport (MQTT), Constrained Application Protocol (CoAP), and the like. Protocols and components for communicating via the Internet or any of the other aforementioned types of communication networks are well known to those skilled in the art and, thus, are not described in more detail herein.
Example Block Diagrams for Load Balancing
The object size estimator 132 generates a cache key based on the request at (2). The object size estimator 132 may then retrieve one or more Bloom filters from the Bloom filter data store 136 at (3). For example, the Bloom filter data store 136 may store a Bloom filter family and the object size estimator 132 may retrieve each Bloom filter in the Bloom filter family.
Each retrieved Bloom filter may be associated with one or more hash functions that are used to add members and/or test membership in the respective Bloom filter. Thus, the object size estimator 132 can generate one or more hashes of the cache key at (4) for the purpose of identifying whether the cache key is a member of any of the retrieved Bloom filters. For example, the object size estimator 132 can generate, for each hash function associated with each Bloom filter, a hash of the cache key using the respective hash function.
The object size estimator 132 can then use the generated hashes to determine whether the cache key is a member of any of the retrieved Bloom filters. For example, for each retrieved Bloom filter, the object size estimator 132 can identify the elements of the N-bit array representing the respective Bloom filter that correspond with the hashes generated using the hash functions associated with the respective Bloom filter. If the identified elements all have bits set to logical “1,” then the object size estimator 132 determines that the cache key is a member of the respective Bloom filter. Otherwise, if any of the identified elements have a bit set to logical “0,” then the object size estimator 132 determines that the cache key is not a member of the respective Bloom filter. In the depicted example, the object size estimator 132 determines at (5) that the cache key is a member of a first Bloom filter based on one or more of the generated hashes.
As described herein, the Bloom filters within the Bloom filter family may all be associated with the same set of hash functions. Thus, the object size estimator 132 may generate a single set of hash values using the associated hash functions. The object size estimator 132 can then use the single set of hash values to evaluate each retrieved Bloom filter for the purpose of determining whether the cache key is a member of any retrieved Bloom filter.
Once the object size estimator 132 determines that the cache key is a member of the first Bloom filter, the object size estimator 132 estimates that the data object corresponding to the cache key has a size corresponding to the size range associated with the first Bloom filter. For example, the object size estimator 132 may estimate that the data object corresponding to the cache key has a size equal to the maximum size in the size range associated with the first Bloom filter. The object size estimator 132 can then transmit the size estimate and/or the cache key to the object request distributor 134 at (6).
The object request distributor 134 can retrieve data (e.g., from a data store, not shown) identifying a current load on one or more of the cache servers 126. The object request distributor 134 can then use the size estimate to estimate the added load on one or more of the cache servers 126 for the purpose of selecting one cache server 126 to service the data object request. For example, the object request distributor 134 can calculate an average current load of the cache servers 126. The object request distributor 134 can then identify any cache servers 126 that have a current load below the calculated average and that, if tasked with handling the data object request, would still have a current load less than or equal to the calculated average given the size estimate. The object request distributor 134 may then select one of these identified cache servers 126 to service the data object request. As another example, the object request distributor 134 can add the size estimate to the current load of each cache server 126 and identify one or more cache servers 126 that have a current load such that the addition of the size estimate would still result in the current load of all cache servers 126 being within a threshold value of each other (e.g., within 10 MB of each other, within 10% of each other, etc.). The object request distributor 134 may then select one of these identified cache servers 126 to service the data object request. Thus, the object request distributor 134 selects a cache server 126A to service the data object request based on the size estimate at (7).
The object request distributor 134 can then transmit the cache key to the selected cache server 126A at (8). The cache server 126A may retrieve the data object from the cache data store 128 using the cache key at (9). In alternate embodiments, not shown, the cache data store 128 does not include the data object. Thus, the cache server 126A may retrieve the data object from an origin server 104. Once the cache server 126A retrieves the data object, the cache server 126A transmits the retrieved data object to the user device 102 at (10) to satisfy the data object request.
The object size estimator 132 generates a cache key based on the request at (2). The object size estimator 132 may then retrieve one or more Bloom filters from the Bloom filter data store 136 at (3). For example, the Bloom filter data store 136 may store a Bloom filter family and the object size estimator 132 may retrieve each Bloom filter in the Bloom filter family.
Each retrieved Bloom filter may be associated with one or more hash functions that are used to add members and/or test membership in the respective Bloom filter. Thus, the object size estimator 132 can generate one or more hashes of the cache key at (4) for the purpose of identifying whether the cache key is a member of any of the retrieved Bloom filters. For example, the object size estimator 132 can generate, for each hash function associated with each Bloom filter, a hash of the cache key using the respective hash function.
The object size estimator 132 can then use the generated hashes to determine whether the cache key is a member of any of the retrieved Bloom filters. For example, for each retrieved Bloom filter, the object size estimator 132 can identify the elements of the N-bit array representing the respective Bloom filter that correspond with the hashes generated using the hash functions associated with the respective Bloom filter. If the identified elements all have bits set to logical “1,” then the object size estimator 132 determines that the cache key is a member of the respective Bloom filter. Otherwise, if any of the identified elements have a bit set to logical “0,” then the object size estimator 132 determines that the cache key is not a member of the respective Bloom filter. In the depicted example, the object size estimator 132 determines at (5) that the cache key is not a member of any retrieved Bloom filter based on one or more of the generated hashes.
As described herein, the Bloom filters within the Bloom filter family may all be associated with the same set of hash functions. Thus, the object size estimator 132 may generate a single set of hash values using the associated hash functions. The object size estimator 132 can then use the single set of hash values to evaluate each retrieved Bloom filter for the purpose of determining whether the cache key is a member of any retrieved Bloom filter.
Once the object size estimator 132 determines that the cache key is not a member of any retrieved Bloom filter, the object size estimator 132 assigns a size to the data object. For example, the object size estimator 132 may assign a random size to the data object; may assign a size to the data object selected using consistent hashing techniques (e.g., one of a set of sizes is assigned based on a hash generated using consistent hashing techniques); may assign a size to the data object based on an overall average of sizes corresponding to requested data objects; may assign a size to the data object based on properties of the data object request, such as a distribution (e.g., a hostname), a URL type (e.g., a video URL, an audio URL, etc.), and/or a range header (e.g., a number of bytes indicated in the header); and/or the like. Alternatively, not shown, the object size estimator 132 may assign no size to the data object. The object size estimator 132 can then transmit the assigned size, the cache key, and/or a notification that the cache key is not a member of any retrieved Bloom filter to the object request distributor 134 at (6).
The object request distributor 134 can retrieve data (e.g., from a data store, not shown) identifying a current load on one or more of the cache servers 126. The object request distributor 134 can then use the assigned size to estimate the added load on one or more of the cache servers 126 for the purpose of selecting one cache server 126 to service the data object request. For example, the object request distributor 134 can calculate an average current load of the cache servers 126. The object request distributor 134 can then identify any cache servers 126 that have a current load below the calculated average and that, if tasked with handling the data object request, would still have a current load less than or equal to the calculated average given the assigned size. The object request distributor 134 may then select one of these identified cache servers 126 to service the data object request. As another example, the object request distributor 134 can add the assigned size to the current load of each cache server 126 and identify one or more cache servers 126 that have a current load such that the addition of the assigned size would still result in the current load of all cache servers 126 being within a threshold value of each other (e.g., within 10 MB of each other, within 10% of each other, etc.). The object request distributor 134 may then select one of these identified cache servers 126 to service the data object request. Thus, the object request distributor 134 selects a cache server 126A to service the data object request based on the assigned size at (7).
The object request distributor 134 can then transmit the cache key to the selected cache server 126A at (8). The cache server 126A may retrieve the data object from the cache data store 128 using the cache key at (9). In alternate embodiments, not shown, the cache data store 128 does not include the data object. Thus, the cache server 126A may retrieve the data object from an origin server 104. Once the cache server 126A retrieves the data object, the cache server 126A transmits the retrieved data object to the user device 102 at (10) to satisfy the data object request.
Before, during, and/or after transmission of the data object to the user device 102, the actual data object size may become known. Thus, the cache server 126A can transmit the actual data object size to the object size estimator 132 and/or the object request distributor 134 at (11). The object size estimator 132 can identify that a first Bloom filter is associated with a size range in which the actual data object size falls and retrieve, from the Bloom filter data store 136, the first Bloom filter at (12) in response to this identification. The object size estimator 132 can then add the cache key as a member of the first Bloom filter using the techniques described herein at (13) such that future requests for the data object may result in the object size estimator 132 determining that a generated cache key is a member of the first Bloom filter. The object request distributor 134 may update the cache server 126A current load records, if necessary, at (14) using the actual data object size in a manner as described herein.
While steps (11) through (14) are depicted in
Example Load Balancing Routine
At block 404, a request for a data object is received. The request may include header information and/or a URL identifying a location of a data object.
At block 406, a cache key is generated based on the request. For example, the cache key may be generated based on the header information and/or the URL (e.g., the cache key may be a hash of the header information and/or the URL).
At block 408, one or more hashes are generated based on the cache key. For example, a different hash may be generated for each hash function associated with one or more Bloom filters using the respective hash function.
At block 410, cache key membership in one or more Bloom filters is tested. For example, the generated hash(es) may each identify an element in an N-bit array, where each Bloom filter is represented by a different N-bit array. For each Bloom filter, if the identified elements in the N-bit array representing the respective Bloom filter each have a bit set to logical “1,” then the cache key is a member of the respective Bloom filter. Otherwise, if any identified element in the N-bit array representing the respective Bloom filter has a bit set to logical “0,” then the cache key is not a member of the respective Bloom filter.
At block 412, a determination is made as to whether the cache key is a member of any Bloom filter. If the cache key is a member of a Bloom filter according to the test operation described herein, then the load balancing routine 400 proceeds to block 414. Otherwise, if the cache key is not a member of any Bloom filter according to the test operation described herein, then the load balancing routine 400 proceeds to block 418.
At block 414, an object size is estimated based on the Bloom filter of which the cache key is a member. For example, the Bloom filter of which the cache key is a member is associated with a size range. The object corresponding to the cache key can be estimated to have a size that is the maximum size in the size range, the minimum size in the size range, the average size in the size range, and/or another size within the size range.
At block 416, a cache server is selected to handle the object retrieval request based on the estimated object size. For example, the current load of one or more cache servers 126 can be retrieved. A cache server 126 can be selected to handle the object retrieval request based on the current load level of the cache server 126 and/or current load levels of other cache servers 126. For example, the object request distributor 134 can calculate an average current load of the cache servers 126. The object request distributor 134 can then identify any cache servers 126 that have a current load below the calculated average and that, if tasked with handling the data object request, would still have a current load less than or equal to the calculated average given the estimated object size. The object request distributor 134 may then select one of these identified cache servers 126 to handle the object retrieval request. As another example, the object request distributor 134 can add the estimated object size to the current load of each cache server 126 and identify one or more cache servers 126 that have a current load such that the addition of the estimated object size would still result in the current load of all cache servers 126 being within a threshold value of each other (e.g., within 10 MB of each other, within 10% of each other, etc.). After the cache server is selected, the load balancing routine 400 ends, as shown at block 428.
At block 418, a size is assigned to the object. For example, the object size estimator 132 may assign a random size to the object; may assign a size to the object selected using consistent hashing techniques (e.g., one of a set of sizes is assigned based on a hash generated using consistent hashing techniques); may assign a size to the object based on an overall average of sizes corresponding to requested objects; may assign a size to the object based on properties of the object request, such as a distribution (e.g., a hostname), a URL type (e.g., a video URL, an audio URL, etc.), and/or a range header (e.g., a number of bytes indicated in the header); and/or the like. Alternatively, not shown, no size may be assigned to the object.
At block 420, a cache server is selected to handle the object retrieval request based on the assigned size. The cache server may be selected in a manner as described with respect to block 416 using the assigned size instead of an estimated object size.
At block 422, an actual size of the object is determined after object retrieval. For example, the actual object size may be determined after the object is retrieved from the cache data store 128 using the cache key.
At block 424, the cache key is added as a member of the Bloom filter that is associated with a size range that corresponds to the actual object size. For example, the cache key is added as a member of the Bloom filter that is associated with a size range in which the actual object size falls.
At block 426, current load records for the selected cache server are updated based on the actual object size. For example, the assigned size may be subtracted from the current load and the actual object size may be added. After the current load records are updated, the load balancing routine 400 ends, as shown at block 428.
While block 424 is depicted after block 426 in
Example Bloom Filter Membership Test Routine
As described herein, the Bloom filters within a Bloom filter family may each be associated with the same hash functions. Thus, in some embodiments, the object size estimator 132 may implement certain optimizations to reduce latency in the cache server 126 selection process and/or to reduce the amount of computing resources used when selecting the appropriate cache server 126 to service a data object request.
For example, the object size estimator 132 can periodically perform a set union operation using the Bloom filters within a Bloom filter family as an input to form an encompassing Bloom filter. The set union operation may be equivalent to an OR operation and may be applied element by element in the N-bit arrays corresponding to the Bloom filters in the Bloom filter family. Accordingly, the resulting encompassing Bloom filter may be represented by an N-bit array that has logical “1” bit values set in elements that correspond with elements in which at least one input Bloom filter N-bit array has a bit set to logical “1.”
As an illustrative example, a second element and a fourth element in the N-bit array representing a first Bloom filter in the Bloom filter family may have bits set to a logical “1” and the remaining bits may be set to a logical “0.” A third element and a fourth element in the N-bit array representing a second Bloom filter in the Bloom filter family may have bits set to a logical “1” and the remaining bits may be set to a logical “0.” Finally, a fifth element and a tenth element in the N-bit array representing a third Bloom filter in the Bloom filter family may have bits set to a logical “1” and the remaining bits may be set to a logical “0.” If the object size estimator 132 performs a set union operation using the first, second, and third Bloom filters, then the resulting encompassing Bloom filter may be represented by an N-bit array that has a bit set to logical “1” in the second, third, fourth, fifth, and tenth elements (e.g., the elements in which at least one Bloom filter N-bit array has a bit set to logical “1”) and a bit set to logical “0” in the remaining elements.
If a generated cache key is a member of the encompassing Bloom filter, then this indicates that the generated cache key is possibly a member of one or more Bloom filters in the Bloom filter family. However, if the generated cache key is not a member of the encompassing Bloom filter, then this indicates that the generated cache key is not a member of any Bloom filter in the Bloom filter family. Thus, the encompassing Bloom filter may allow the object size estimator 132 to forgo performing multiple Bloom filter membership tests if the object size estimator 132 determines that the generated cache key is not a member of the encompassing Bloom filter, thereby conserving computing resources. For example, the object size estimator 132 can test whether a generated cache key is a member of the encompassing Bloom filter. If the generated cache key is not a member of the encompassing Bloom filter, then the object size estimator 132 can simply assign a size to the requested data object. Otherwise, if the generated key is a member of the encompassing Bloom filter, then the object size estimator 132 can test cache key membership in one or more of the Bloom filters in the Bloom filter family in a manner as described above. The object size estimator 132 may test cache key membership in individual Bloom filters to identify which Bloom filter, if any, of which the cache key is a member. In some cases, a cache key may be a member of the encompassing Bloom filter, but not a member of any individual Bloom filter. In such a situation, the object size estimator 132 can assign a size to the requested data object instead of estimating a size.
The object size estimator 132 can perform the set union operation each time a Bloom filter in the Bloom filter family is reset and/or receives a new member. Alternatively, the object size estimator 132 can perform the set union operation at set time intervals, at random times, and/or the like.
In further embodiments, the set union operation can be extended across hosts 124. As described herein, multiple hosts 124 may be present to service multiple data object requests simultaneously or nearly simultaneously. Because the hosts 124 may receive different data object requests, the Bloom filters stored in the Bloom filter data store 136 of each host 124 may have different members. Thus, it may be beneficial to combine related Bloom filters (e.g., Bloom filters stored in the various Bloom filter data stores 136 of the hosts 124 that are associated with the same size range), where the resulting combined Bloom filter represents a Bloom filter that would have resulted if one host 124 received all data object requests. The resulting combined Bloom filter may therefore allow each host 124 to provide better data object size estimates.
Accordingly, if the Bloom filters stored in each host 124 are associated with the same hash functions, the object size estimator 132 of one host 124 or a separate component in the CDN service 122 (not shown) can perform a set union operation using a set of related Bloom filters as inputs to form an encompassing related Bloom filter. The object size estimator 132 or separate component can repeat the set union operation for each set of related Bloom filters (e.g., each set of Bloom filters associated with the same size range). Each encompassing related Bloom filter may then be associated with a specific size range. The encompassing related Bloom filters can be stored in each Bloom filter data store 136 for use by the corresponding object size estimator 132. For example, the object size estimator 132 in a particular host 124 can use the encompassing related Bloom filters instead of the Bloom filters originally stored in the Bloom filter data store 136 to test cache key membership and estimate data object sizes.
The object size estimator 132 or separate component can perform the set union operation to form an encompassing related Bloom filter each time a related Bloom filter is reset and/or receives a new member. Alternatively, the object size estimator 132 or separate component can perform the set union operation to form an encompassing related Bloom filter at set time intervals, at random times, and/or the like.
In still further embodiments, the object size estimator 132 of one host 124 or a separate component in the CDN service 122 (not shown) can perform a set union operation using each encompassing related Bloom filter as inputs or each Bloom filter stored in each host 124 as inputs to form an inter-host encompassing Bloom filter. The object size estimator 132 in a particular host 124 can use the inter-host encompassing Bloom filter instead of the encompassing Bloom filter to test cache key membership and estimate data object sizes. For example, the object size estimator 132 can test whether a generated cache key is a member of the inter-host encompassing Bloom filter. If the generated cache key is not a member of the inter-host encompassing Bloom filter, then the object size estimator 132 can simply assign a size to the requested data object. Otherwise, if the generated key is a member of the inter-host encompassing Bloom filter, then the object size estimator 132 can test cache key membership in one or more of the encompassing related Bloom filters in a manner as described above. The object size estimator 132 may test cache key membership in individual encompassing related Bloom filters to identify which encompassing related Bloom filter, if any, of which the cache key is a member. Alternatively, if the generated key is a member of the inter-host encompassing Bloom filter, then the object size estimator 132 can test cache key membership in one or more of the Bloom filters in the Bloom filter family in a manner as described above. The object size estimator 132 may test cache key membership in individual Bloom filters corresponding to a Bloom filter family to identify which Bloom filter, if any, of which the cache key is a member.
At block 504, a Bloom filter set union operation is performed to generate an encompassing Bloom filter. The encompassing Bloom filter may indicate whether a cache key is possibly a member of one or more Bloom filters that were combined to form the encompassing Bloom filter or whether the cache key is not a member of any Bloom filter that was combined to form the encompassing Bloom filter.
At block 506, a request for an object is received. The request may include header information and/or a URL that corresponds to a data object.
At block 508, a cache key is generated based on the request. For example, the cache key may be generated based on the header information and/or the URL (e.g., the cache key may be a hash of the header information and/or the URL).
At block 510, one or more hashes are generated based on the cache key. For example, a different hash may be generated for each hash function associated with one or more Bloom filters using the respective hash function.
While block 504 is depicted in
At block 512, cache key membership in the encompassing Bloom filter is tested. For example, the generated hash(es) may each identify an element in an N-bit array that represents the encompassing Bloom filter. If the identified elements in the N-bit array representing the encompassing Bloom filter each have a bit set to logical “1,” then the cache key is a member of the encompassing Bloom filter. Otherwise, if any identified element in the N-bit array representing the encompassing Bloom filter has a bit set to logical “0,” then the cache key is not a member of the encompassing Bloom filter.
At block 514, a determination is made as to whether the cache key is a member of the encompassing Bloom filter. If the cache key is a member of the encompassing Bloom filter according to the test operation described herein, then the Bloom filter membership test routine 500 proceeds to block 516. Otherwise, if the cache key is not a member of the encompassing Bloom filter according to the test operation described herein, then the cache key is not a member of any Bloom filter that was combined to form the encompassing Bloom filter. Thus, the Bloom filter membership test routine 500 then ends, as shown at block 526.
At block 516, variable M is set equal to the number of Bloom filters and variable i is set equal to 1. The variable i may be used to indicate a particular Bloom filter within a Bloom filter family.
At block 518, a determination is made as to whether the cache key is a member of Bloom filter i. For example, the object size estimator 132 can test membership in Bloom filter i in a manner as described herein. If the cache key is a member of Bloom filter i, then the Bloom filter membership test routine 500 proceeds to block 524. Otherwise, if the cache key is not a member of Bloom filter i, then the Bloom filter membership test routine 500 proceeds to block 520.
At block 520, a determination is made as to whether variable i is equal to variable M. If variables i and M are equal, then the cache key is not a member of any Bloom filter that was combined to form the encompassing Bloom filter. Thus, the Bloom filter membership test routine 500 then ends, as shown at block 526. Otherwise, if variables i and M are not equal, then the Bloom filter membership test routine 500 proceeds to block 522.
At block 522, variable i is incremented by 1. The Bloom filter membership test routine 500 then proceeds back to block 518 such that the object size estimator 132 can test whether the cache key is a member of another Bloom filter in the Bloom filter family.
Example Bloom Filter Creation Routine
As described herein, false positives may occur in which the object size estimator 132 determines that the generated cache key is a member of a Bloom filter when in fact the generated cache key is not a member of the Bloom filter. As a Bloom filter gains members, the rate of false positives may increase. Thus, the object size estimator 132 can periodically reset Bloom filters to reduce the likelihood that a false positive will occur.
For example, the object size estimator 132 can reset a Bloom filter when a threshold period of time from when the Bloom filter was created or last reset has expired. As another example, the object size estimator 132 can reset a Bloom filter when the Bloom filter has gained a threshold number of members. For one or more Bloom filters, the object size estimator 132 may maintain a counter to track the number of Bloom filter members.
A simple reset of Bloom filters, however, may lead to initially poor data object size estimates. For example, if a Bloom filter has no members or only a few members, then the object size estimator 132 may more often assign sizes to data objects rather than estimate sizes for data objects.
Accordingly, in some embodiments, a host 124 can maintain a set of Bloom filters that are each associated with the same size range. However, each Bloom filter in the set may be shifted in time. Thus, the Bloom filters in the set may be active during different time intervals. In particular, one Bloom filter in the set may be active at any given time. A Bloom filter in the set may be active if the object size estimator 132 uses the Bloom filter for testing cache key membership. While one Bloom filter in the set may be active at any given time, the object size estimator 132 may nonetheless add members to one or more Bloom filters during that time. For example, the object size estimator 132 may start adding members to a Bloom filter prior to the time interval during which the Bloom filter becomes active. By adding members to a Bloom filter prior to the time interval during which the Bloom filter becomes active, the object size estimator 132 may be able to provide better data object size estimates once the Bloom filter becomes active because the Bloom filter will already store data representing an approximate or partial data object request history once the Bloom filter becomes active.
After a time interval in which a Bloom filter is active passes, the object size estimator 132 can reset the Bloom filter. At a later time, the object size estimator 132 can reuse the reset Bloom filter by adding members to the Bloom filter and then reactivating the Bloom filter shortly thereafter. Thus, the Bloom filters in the set can be reset, receive members, and be activated in a rotating manner. By reusing the Bloom filters instead of generating new Bloom filters, the CDN service 122 may be able to conserve disk space. By resetting Bloom filters and adding members to the Bloom filters prior to the time that the Bloom filters become active, the object size estimator 132 can provide improved data object size estimates while still reducing the rate of false positives.
As an illustrative example, the Bloom filter data store 136 may store a first Bloom filter associated with a first size range and a second Bloom filter associated with the first size range. The object size estimator 132 may determine that the first Bloom filter will be active from time 0 to time 2, from time 4 to time 6, from time 8 to time 10, and so on. The object size estimator 132 may determine that the second Bloom filter will be active from time 2 to time 4, from time 6 to time 8, from time 10 to time 12, and so on. The object size estimator 132 may continue to add members to the first Bloom filter between times 0 and 2, between times 3 and 6, between times 7 and 10, and so on. Likewise, the object size estimator 132 may continue to add members to the second Bloom filter between times 1 and 4, between times 5 and 8, between times 9 and 12, and so on. Furthermore, the object size estimator 132 may reset the first Bloom filter after times 2, 6, 10, and so on, and may reset the second Bloom filter after times 4, 8, 12, and so on. Thus, when the object size estimator 132 activates either the first Bloom filter or the second Bloom filter, the active Bloom filter will already have one time interval of generated cache keys added as members.
The host 124 can further maintain a set of Bloom filters for each size range. Each set of Bloom filters may have Bloom filters that are reset, start to receive members, or become active at the same time. Alternatively, one or more sets of Bloom filters may be shifted in time such the Bloom filters in the sets are reset, start to receive members, and/or become active at different times.
At block 604, variable i is set equal to 1. The variable i may be used to indicate a particular object request.
At block 606, object request i is received. The request may include header information and/or a URL that corresponds to a data object.
At block 608, a cache key is generated based on object request i. For example, the cache key may be generated based on the header information and/or the URL included in object request i (e.g., the cache key may be a hash of the header information and/or the URL).
In an embodiment, the cache key is not a member of any active Bloom filter in a Bloom filter family. For example, the cache key is not a member of any Bloom filter used by the object size estimator 132 to test cache key membership and estimate data object sizes. Thus, the object size estimator 132 may assign a size to the object and wait for an indication of an actual size of the object once the object is delivered to the requesting device.
At block 610, an actual object size is received. In an embodiment, the object size estimator 132 can use the actual object size to identify which active Bloom filter in the Bloom filter family is associated with a size range in which the actual object size falls.
At block 612, a determination is made as to whether a first time period expired. For example, when the first time period expires, one or more of the Bloom filters that follow the active Bloom filters may begin to receive members. If the first time period expired, then the Bloom filter creation routine 600 proceeds to block 616. Otherwise, if the first time period has not expired, then the Bloom filter creation routine 600 proceeds to block 614.
At block 614, the generated cache key is added as a member of an active Bloom filter. For example, the generated cache key may be added to the active Bloom filter that is associated with a size range in which the actual object size falls. After the generated cache key is added as a member, the Bloom filter creation routine 600 proceeds to block 626.
At block 616, a determination is made as to whether a second time period has expired. For example, expiration of the second time period may represent a time when one or more of the active Bloom filters become deactivated and one or more of the next Bloom filters are activated. If the second time period expired, then the Bloom filter creation routine 600 proceeds to block 620. Otherwise, if the second time period has not expired, then the Bloom filter creation routine 600 proceeds to block 618.
At block 618, the generated cache key is added as a member of the active Bloom filter and the next Bloom filter. For example, the generated cache key may be added to the active Bloom filter and the next Bloom filter that are both associated with a size range in which the actual object size falls. After the generated cache key is added as a member, the Bloom filter creation routine 600 proceeds to block 626.
At block 620, the active Bloom filter is reset. For example, the object size estimator 132 may reset the active Bloom filter by changing all of the elements in the N-bit array representing the active Bloom filter that have bits set to logical “1” from logical “1” to logical “0.” Thus, the reset active Bloom filter may be represented by an N-bit array that has a logical “0” in each element.
At block 622, the active Bloom filter and the next Bloom filter are swapped. Thus, the active Bloom filter now includes as members cache keys that were added to the next Bloom filter after the first time period expired. The next Bloom filter now is a reset Bloom filter.
At block 624, the time periods are reset. Thus, the first time period and the second time period are no longer expired. As mentioned above, the active Bloom filter now includes as members some cache keys and the active Bloom filter will continue to receive as members additional cache keys until the second period of time expires once again. After the time periods are reset, the Bloom filter creation routine 600 proceeds to block 626.
At block 626, variable i is incremented by 1. The Bloom filter creation routine 600 then proceeds back to block 606 such that the Bloom filter creation routine 600 can be repeated for a new object request.
Example Inter-Host Encompassing Bloom Filter Formation
Because the Bloom filters 710A-C are each associated with the same, first size range, the object size estimator 132 of one of the hosts 124A-C or a separate component in the CDN service 122 (not shown) can perform a set union operation using the Bloom filters 710A-C as inputs to form an encompassing related Bloom filter 710D. The encompassing related Bloom filter 710D may also be associated with the first size range and can represent a Bloom filter that would have resulted if one host 124 received all of the data object requests actually received by each of the hosts 124A-C. The encompassing related Bloom filter 710D can be stored in the Bloom filter data stores 136 of the hosts 124A-C for use by the corresponding object size estimator 132. For example, the object size estimator 132 of the host 124A may use the encompassing related Bloom filter 710D rather than the Bloom filter 710A to estimate data object sizes.
The object size estimator 132 of one of the hosts 124A-C or a separate component in the CDN service 122 (not shown) can repeat the set union operation using the Bloom filters 720A-C as inputs to form an encompassing related Bloom filter 720D and/or using the Bloom filters 730A-C as inputs to form an encompassing related Bloom filter 730D. The encompassing related Bloom filter 720D then is associated with the second size range and the encompassing related Bloom filter 730D is associated with the third size range. The encompassing related Bloom filters 720D and/or 730D may also be stored in the Bloom filter data stores 136 of the hosts 124A-C for use by the corresponding object size estimator 132. For example, the object size estimator 132 of the host 124B may use the encompassing related Bloom filter 720D rather than the Bloom filter 720B to estimate data object sizes and/or may use the encompassing related Bloom filter 730D rather than the Bloom filter 730B to estimate data object sizes.
The object size estimator 132 of one of the hosts 124A-C or a separate component in the CDN service 122 (not shown) can perform an additional set union operation using each of the encompassing related Bloom filters 710D, 720D, and 730D to form the inter-host encompassing Bloom filter 740. The object size estimator 132 of one of the hosts 124A-C can use the inter-host encompassing Bloom filter 740 instead of an encompassing Bloom filter to test cache key membership and estimate data object sizes. For example, the object size estimator 132 of the host 124A can test whether a generated cache key is a member of the inter-host encompassing Bloom filter 740. If the generated cache key is not a member of the inter-host encompassing Bloom filter 740, then the object size estimator 132 can simply assign a size to the requested data object. Otherwise, if the generated key is a member of the inter-host encompassing Bloom filter 740, then the object size estimator 132 can test cache key membership in one or more of the encompassing related Bloom filters 710D, 720D, and/or 730D in a manner as described above. The object size estimator 132 may test cache key membership in individual encompassing related Bloom filters 710D, 720D, and/or 730D to identify which encompassing related Bloom filter, if any, of which the cache key is a member. Alternatively, if the generated key is a member of the inter-host encompassing Bloom filter 740, then the object size estimator 132 of the host 124A can test cache key membership in one or more of the Bloom filters 710A, 720A, and/or 730A in the Bloom filter family in a manner as described above. The object size estimator 132 may test cache key membership in individual Bloom filters 710A, 720A, and/or 730A corresponding to a Bloom filter family to identify which Bloom filter, if any, of which the cache key is a member.
Alternatively, not shown, the object size estimator 132 of one of the hosts 124A-C or a separate component in the CDN service 122 (not shown) can perform an additional set union operation using the individual Bloom filters 710A-C, 720A-C, and 730A-C as inputs to form the inter-host encompassing Bloom filter 740. For example, the object size estimator 132 or separate component can perform the set union operation using each of the individual Bloom filters 710A-C, 720A-C, and 730A-C together as inputs to form the inter-host encompassing Bloom filter 740. As another example, the object size estimator 132 or separate component can perform the set union operation using the Bloom filters 710A, 720A, and 730A as inputs to form an intermediate Bloom filter. The object size estimator 132 or separate component can then repeat the set union operation using the Bloom filters 710B, 720B, and 730B as inputs and using the Bloom filters 710C, 720C, and 730C as inputs to form additional intermediate Bloom filters. The object size estimator 132 or separate component can then perform the set union operation using the intermediate Bloom filters as inputs to form the inter-host encompassing Bloom filter 740.
All of the methods and tasks described herein may be performed and fully automated by a computer system. The computer system may, in some cases, include multiple distinct computers or computing devices (e.g., physical servers, workstations, storage arrays, cloud computing resources, etc.) that communicate and interoperate over a network to perform the described functions. Each such computing device typically includes a processor (or multiple processors) that executes program instructions or modules stored in a memory or other non-transitory computer-readable storage medium or device (e.g., solid state storage devices, disk drives, etc.). The various functions disclosed herein may be embodied in such program instructions, or may be implemented in application-specific circuitry (e.g., ASICs or FPGAs) of the computer system. Where the computer system includes multiple computing devices, these devices may, but need not, be co-located. The results of the disclosed methods and tasks may be persistently stored by transforming physical storage devices, such as solid state memory chips or magnetic disks, into a different state. In some embodiments, the computer system may be a cloud-based computing system whose processing resources are shared by multiple distinct business entities or other users.
Depending on the embodiment, certain acts, events, or functions of any of the processes or algorithms described herein can be performed in a different sequence, can be added, merged, or left out altogether (e.g., not all described operations or events are necessary for the practice of the algorithm). Moreover, in certain embodiments, operations or events can be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially.
The various illustrative logical blocks, modules, routines, and algorithm steps described in connection with the embodiments disclosed herein can be implemented as electronic hardware (e.g., ASICs or FPGA devices), computer software that runs on computer hardware, or combinations of both. Moreover, the various illustrative logical blocks and modules described in connection with the embodiments disclosed herein can be implemented or performed by a machine, such as a processor device, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A processor device can be a microprocessor, but in the alternative, the processor device can be a controller, microcontroller, or state machine, combinations of the same, or the like. A processor device can include electrical circuitry configured to process computer-executable instructions. In another embodiment, a processor device includes an FPGA or other programmable device that performs logic operations without processing computer-executable instructions. A processor device can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. Although described herein primarily with respect to digital technology, a processor device may also include primarily analog components. For example, some or all of the rendering techniques described herein may be implemented in analog circuitry or mixed analog and digital circuitry. A computing environment can include any type of computer system, including, but not limited to, a computer system based on a microprocessor, a mainframe computer, a digital signal processor, a portable computing device, a device controller, or a computational engine within an appliance, to name a few.
The elements of a method, process, routine, or algorithm described in connection with the embodiments disclosed herein can be embodied directly in hardware, in a software module executed by a processor device, or in a combination of the two. A software module can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of a non-transitory computer-readable storage medium. An exemplary storage medium can be coupled to the processor device such that the processor device can read information from, and write information to, the storage medium. In the alternative, the storage medium can be integral to the processor device. The processor device and the storage medium can reside in an ASIC. The ASIC can reside in a user terminal. In the alternative, the processor device and the storage medium can reside as discrete components in a user terminal.
Conditional language used herein, such as, among others, “can,” “could,” “might,” “may,” “e.g.,” and the like, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements or steps. Thus, such conditional language is not generally intended to imply that features, elements or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without other input or prompting, whether these features, elements or steps are included or are to be performed in any particular embodiment. The terms “comprising,” “including,” “having,” and the like are synonymous and are used inclusively, in an open-ended fashion, and do not exclude additional elements, features, acts, operations, and so forth. Also, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list.
Disjunctive language such as the phrase “at least one of X, Y, or Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to present that an item, term, etc., may be either X, Y, or Z, or any combination thereof (e.g., X, Y, or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y, and at least one of Z to each be present.
While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it can be understood that various omissions, substitutions, and changes in the form and details of the devices or algorithms illustrated can be made without departing from the spirit of the disclosure. As can be recognized, certain embodiments described herein can be embodied within a form that does not provide all of the features and benefits set forth herein, as some features can be used or practiced separately from others. The scope of certain embodiments disclosed herein is indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.
| Number | Name | Date | Kind |
|---|---|---|---|
| 5063500 | Shorter | Nov 1991 | A |
| 5341477 | Pitkin et al. | Aug 1994 | A |
| 5459837 | Caccavale | Oct 1995 | A |
| 5611049 | Pitts | Mar 1997 | A |
| 5627889 | Eslambolchi | Mar 1997 | A |
| 5701467 | Freeston | Dec 1997 | A |
| 5764910 | Shachar | Jun 1998 | A |
| 5774660 | Brendel et al. | Jun 1998 | A |
| 5815649 | Utter et al. | Sep 1998 | A |
| 5852717 | Bhide et al. | Dec 1998 | A |
| 5892914 | Pitts | Apr 1999 | A |
| 5893116 | Simmonds et al. | Apr 1999 | A |
| 5895462 | Toki | Apr 1999 | A |
| 5905248 | Russell et al. | May 1999 | A |
| 5933811 | Angles et al. | Aug 1999 | A |
| 5937427 | Shinagawa et al. | Aug 1999 | A |
| 5974454 | Apfel et al. | Oct 1999 | A |
| 5991306 | Burns et al. | Nov 1999 | A |
| 5999274 | Lee et al. | Dec 1999 | A |
| 6006264 | Colby et al. | Dec 1999 | A |
| 6016512 | Huitema | Jan 2000 | A |
| 6018619 | Allard et al. | Jan 2000 | A |
| 6026452 | Pitts | Feb 2000 | A |
| 6038601 | Lambert et al. | Mar 2000 | A |
| 6052718 | Gifford | Apr 2000 | A |
| 6078960 | Ballard | Jun 2000 | A |
| 6085234 | Pitts et al. | Jul 2000 | A |
| 6092100 | Berstis et al. | Jul 2000 | A |
| 6098096 | Tsirigotis et al. | Aug 2000 | A |
| 6108703 | Leighton et al. | Aug 2000 | A |
| 6128279 | O'Neil et al. | Oct 2000 | A |
| 6151631 | Ansell et al. | Nov 2000 | A |
| 6157942 | Chu et al. | Dec 2000 | A |
| 6167438 | Yates et al. | Dec 2000 | A |
| 6167446 | Lister et al. | Dec 2000 | A |
| 6173316 | De Boor et al. | Jan 2001 | B1 |
| 6182111 | Inohara et al. | Jan 2001 | B1 |
| 6182125 | Borella et al. | Jan 2001 | B1 |
| 6185598 | Farber et al. | Feb 2001 | B1 |
| 6192051 | Lipman et al. | Feb 2001 | B1 |
| 6205475 | Pitts | Mar 2001 | B1 |
| 6223209 | Watson | Apr 2001 | B1 |
| 6223288 | Byrne | Apr 2001 | B1 |
| 6243761 | Mogul et al. | Jun 2001 | B1 |
| 6256671 | Strentzsch et al. | Jul 2001 | B1 |
| 6275496 | Burns et al. | Aug 2001 | B1 |
| 6286043 | Cuomo et al. | Sep 2001 | B1 |
| 6286084 | Wexler et al. | Sep 2001 | B1 |
| 6304913 | Rune | Oct 2001 | B1 |
| 6324580 | Jindal et al. | Nov 2001 | B1 |
| 6330602 | Law et al. | Dec 2001 | B1 |
| 6338082 | Schneider | Jan 2002 | B1 |
| 6345308 | Abe | Feb 2002 | B1 |
| 6351743 | DeArdo et al. | Feb 2002 | B1 |
| 6351775 | Yu | Feb 2002 | B1 |
| 6363411 | Dugan et al. | Mar 2002 | B1 |
| 6366952 | Pitts | Apr 2002 | B2 |
| 6374290 | Scharber et al. | Apr 2002 | B1 |
| 6377257 | Borrel et al. | Apr 2002 | B1 |
| 6386043 | Millins | May 2002 | B1 |
| 6389532 | Gupta et al. | May 2002 | B1 |
| 6405252 | Gupta et al. | Jun 2002 | B1 |
| 6408360 | Chamberlain et al. | Jun 2002 | B1 |
| 6411967 | Van Renesse | Jun 2002 | B1 |
| 6415280 | Farber et al. | Jul 2002 | B1 |
| 6430607 | Kavner | Aug 2002 | B1 |
| 6438592 | Killian | Aug 2002 | B1 |
| 6442165 | Sitaraman et al. | Aug 2002 | B1 |
| 6452925 | Sistanizadeh et al. | Sep 2002 | B1 |
| 6457047 | Chandra et al. | Sep 2002 | B1 |
| 6459909 | Bilcliff et al. | Oct 2002 | B1 |
| 6473804 | Kaiser et al. | Oct 2002 | B1 |
| 6484143 | Swildens et al. | Nov 2002 | B1 |
| 6484161 | Chipalkatti et al. | Nov 2002 | B1 |
| 6493765 | Cunningham et al. | Dec 2002 | B1 |
| 6505241 | Pitts | Jan 2003 | B2 |
| 6513112 | Craig et al. | Jan 2003 | B1 |
| 6523036 | Hickman et al. | Feb 2003 | B1 |
| 6529910 | Fleskes | Mar 2003 | B1 |
| 6529953 | Van Renesse | Mar 2003 | B1 |
| 6553413 | Leighton et al. | Apr 2003 | B1 |
| 6560610 | Eatherton et al. | May 2003 | B1 |
| 6564380 | Murphy | May 2003 | B1 |
| 6611873 | Kanehara | Aug 2003 | B1 |
| 6622168 | Datta | Sep 2003 | B1 |
| 6643357 | Lumsden | Nov 2003 | B2 |
| 6643707 | Booth | Nov 2003 | B1 |
| 6654807 | Farber et al. | Nov 2003 | B2 |
| 6658462 | Dutta | Dec 2003 | B1 |
| 6665706 | Kenner et al. | Dec 2003 | B2 |
| 6678717 | Schneider | Jan 2004 | B1 |
| 6678791 | Jacobs et al. | Jan 2004 | B1 |
| 6681282 | Golden et al. | Jan 2004 | B1 |
| 6687846 | Adrangi et al. | Feb 2004 | B1 |
| 6694358 | Swildens et al. | Feb 2004 | B1 |
| 6697805 | Choquier et al. | Feb 2004 | B1 |
| 6718324 | Edlund et al. | Apr 2004 | B2 |
| 6724770 | Van Renesse | Apr 2004 | B1 |
| 6732237 | Jacobs et al. | May 2004 | B1 |
| 6748413 | Bournas | Jun 2004 | B1 |
| 6754699 | Swildens et al. | Jun 2004 | B2 |
| 6754706 | Swildens et al. | Jun 2004 | B1 |
| 6760721 | Chasen et al. | Jul 2004 | B1 |
| 6769031 | Bero | Jul 2004 | B1 |
| 6782398 | Bahl | Aug 2004 | B1 |
| 6785704 | McCanne | Aug 2004 | B1 |
| 6795434 | Kumar et al. | Sep 2004 | B1 |
| 6799214 | Li | Sep 2004 | B1 |
| 6804706 | Pitts | Oct 2004 | B2 |
| 6810291 | Card et al. | Oct 2004 | B2 |
| 6810411 | Coughlin et al. | Oct 2004 | B1 |
| 6829654 | Jungck | Dec 2004 | B1 |
| 6862607 | Vermeulen | Mar 2005 | B1 |
| 6868439 | Basu et al. | Mar 2005 | B2 |
| 6874017 | Inoue et al. | Mar 2005 | B1 |
| 6917951 | Orbits et al. | Jul 2005 | B2 |
| 6925499 | Chen et al. | Aug 2005 | B1 |
| 6928467 | Peng et al. | Aug 2005 | B2 |
| 6928485 | Krishnamurthy et al. | Aug 2005 | B1 |
| 6941562 | Gao et al. | Sep 2005 | B2 |
| 6944167 | McPherson | Sep 2005 | B1 |
| 6950848 | Yousefi'zadeh et al. | Sep 2005 | B1 |
| 6961783 | Cook et al. | Sep 2005 | B1 |
| 6963850 | Bezos et al. | Nov 2005 | B1 |
| 6968389 | Menditto et al. | Nov 2005 | B1 |
| 6976090 | Ben-Shaul et al. | Dec 2005 | B2 |
| 6981017 | Kasriel et al. | Dec 2005 | B1 |
| 6981025 | Frazier et al. | Dec 2005 | B1 |
| 6985945 | Farhat et al. | Jan 2006 | B2 |
| 6986018 | O'Rourke et al. | Jan 2006 | B2 |
| 6990526 | Zhu | Jan 2006 | B1 |
| 6996616 | Leighton et al. | Feb 2006 | B1 |
| 7003555 | Jungck | Feb 2006 | B1 |
| 7006099 | Gut et al. | Feb 2006 | B2 |
| 7007089 | Freedman | Feb 2006 | B2 |
| 7010578 | Lewin et al. | Mar 2006 | B1 |
| 7010598 | Sitaraman et al. | Mar 2006 | B2 |
| 7024466 | Outten et al. | Apr 2006 | B2 |
| 7027582 | Khello et al. | Apr 2006 | B2 |
| 7031445 | Lumsden | Apr 2006 | B2 |
| 7032010 | Swildens et al. | Apr 2006 | B1 |
| 7058633 | Gnagy et al. | Jun 2006 | B1 |
| 7058706 | Iyer et al. | Jun 2006 | B1 |
| 7058953 | Willard et al. | Jun 2006 | B2 |
| 7062158 | Ayaki | Jun 2006 | B1 |
| 7065587 | Huitema et al. | Jun 2006 | B2 |
| 7072982 | Teodosiu et al. | Jul 2006 | B2 |
| 7076633 | Tormasov et al. | Jul 2006 | B2 |
| 7082476 | Cohen et al. | Jul 2006 | B1 |
| 7086061 | Joshi et al. | Aug 2006 | B1 |
| 7092505 | Allison et al. | Aug 2006 | B2 |
| 7092997 | Kasriel et al. | Aug 2006 | B1 |
| 7095715 | Buckman et al. | Aug 2006 | B2 |
| 7096266 | Lewin et al. | Aug 2006 | B2 |
| 7099936 | Chase et al. | Aug 2006 | B2 |
| 7103645 | Leighton et al. | Sep 2006 | B2 |
| 7114160 | Suryanarayana et al. | Sep 2006 | B2 |
| 7117262 | Bai et al. | Oct 2006 | B2 |
| 7133905 | Dilley et al. | Nov 2006 | B2 |
| 7136922 | Sundaram et al. | Nov 2006 | B2 |
| 7139808 | Anderson et al. | Nov 2006 | B2 |
| 7139821 | Shah et al. | Nov 2006 | B1 |
| 7143169 | Champagne et al. | Nov 2006 | B1 |
| 7143170 | Swildens et al. | Nov 2006 | B2 |
| 7146560 | Dang et al. | Dec 2006 | B2 |
| 7149747 | Cheng et al. | Dec 2006 | B1 |
| 7149809 | Barde et al. | Dec 2006 | B2 |
| 7152118 | Anderson, IV et al. | Dec 2006 | B2 |
| 7162539 | Garcie-Luna-Aceves | Jan 2007 | B2 |
| 7165117 | Sitaraman et al. | Jan 2007 | B1 |
| 7171469 | Ackaouy et al. | Jan 2007 | B2 |
| 7174382 | Ramanathan et al. | Feb 2007 | B2 |
| 7185046 | Ferstl et al. | Feb 2007 | B2 |
| 7185063 | Kasriel et al. | Feb 2007 | B1 |
| 7185084 | Sirivara et al. | Feb 2007 | B2 |
| 7188214 | Kasriel et al. | Mar 2007 | B1 |
| 7194522 | Swildens et al. | Mar 2007 | B1 |
| 7194552 | Schneider | Mar 2007 | B1 |
| 7200667 | Teodosiu et al. | Apr 2007 | B2 |
| 7200673 | Augart | Apr 2007 | B1 |
| 7216170 | Ludvig et al. | May 2007 | B2 |
| 7225254 | Swildens et al. | May 2007 | B1 |
| 7228350 | Hong et al. | Jun 2007 | B2 |
| 7228359 | Monteiro | Jun 2007 | B1 |
| 7233978 | Overton et al. | Jun 2007 | B2 |
| 7240100 | Wein et al. | Jul 2007 | B1 |
| 7249196 | Peiffer et al. | Jul 2007 | B1 |
| 7251675 | Kamakura et al. | Jul 2007 | B1 |
| 7254626 | Kommula et al. | Aug 2007 | B1 |
| 7254636 | O'Toole, Jr. et al. | Aug 2007 | B1 |
| 7257581 | Steele et al. | Aug 2007 | B1 |
| 7260598 | Liskov et al. | Aug 2007 | B1 |
| 7260639 | Afergan et al. | Aug 2007 | B2 |
| 7269784 | Kasriel et al. | Sep 2007 | B1 |
| 7272227 | Beran | Sep 2007 | B1 |
| 7274658 | Bornstein et al. | Sep 2007 | B2 |
| 7284056 | Ramig | Oct 2007 | B2 |
| 7289519 | Liskov | Oct 2007 | B1 |
| 7293093 | Leighton | Nov 2007 | B2 |
| 7308499 | Chavez | Dec 2007 | B2 |
| 7310686 | Uysal | Dec 2007 | B2 |
| 7316648 | Kelly et al. | Jan 2008 | B2 |
| 7318074 | Iyengar et al. | Jan 2008 | B2 |
| 7320131 | O'Toole, Jr. | Jan 2008 | B1 |
| 7321918 | Burd et al. | Jan 2008 | B2 |
| 7337968 | Wilz, Sr. et al. | Mar 2008 | B2 |
| 7339937 | Mitra et al. | Mar 2008 | B2 |
| 7340505 | Lisiecki et al. | Mar 2008 | B2 |
| 7343397 | Kochanski | Mar 2008 | B2 |
| 7350075 | Eastham et al. | Mar 2008 | B1 |
| 7362703 | Taft et al. | Mar 2008 | B1 |
| 7363291 | Page | Apr 2008 | B1 |
| 7363626 | Koutharapu et al. | Apr 2008 | B2 |
| 7370089 | Boyd et al. | May 2008 | B2 |
| 7372809 | Chen | May 2008 | B2 |
| 7373416 | Kagan et al. | May 2008 | B2 |
| 7376716 | Dilley et al. | May 2008 | B2 |
| 7376736 | Sundaram et al. | May 2008 | B2 |
| 7380078 | Ikegaya et al. | May 2008 | B2 |
| 7389354 | Sitaraman et al. | Jun 2008 | B1 |
| 7392236 | Rusch et al. | Jun 2008 | B2 |
| 7398301 | Hennessey et al. | Jul 2008 | B2 |
| 7406512 | Swildens et al. | Jul 2008 | B2 |
| 7406522 | Riddle | Jul 2008 | B2 |
| 7409712 | Brooks et al. | Aug 2008 | B1 |
| 7430610 | Pace et al. | Sep 2008 | B2 |
| 7441045 | Skene et al. | Oct 2008 | B2 |
| 7441261 | Slater et al. | Oct 2008 | B2 |
| 7451230 | Corrado et al. | Oct 2008 | B2 |
| 7454457 | Lowery et al. | Nov 2008 | B1 |
| 7454500 | Hsu et al. | Nov 2008 | B1 |
| 7461170 | Taylor et al. | Dec 2008 | B1 |
| 7464142 | Flurry et al. | Dec 2008 | B2 |
| 7472201 | Aitken | Dec 2008 | B1 |
| 7478148 | Neerdaels | Jan 2009 | B2 |
| 7492720 | Pruthi et al. | Feb 2009 | B2 |
| 7496651 | Joshi | Feb 2009 | B1 |
| 7499998 | Toebes et al. | Mar 2009 | B2 |
| 7502836 | Menditto et al. | Mar 2009 | B1 |
| 7505464 | Okmianski et al. | Mar 2009 | B2 |
| 7506034 | Coates et al. | Mar 2009 | B2 |
| 7519705 | Papagiannaki et al. | Mar 2009 | B1 |
| 7519720 | Fishman et al. | Apr 2009 | B2 |
| 7519726 | Palliyil et al. | Apr 2009 | B2 |
| 7523181 | Swildens et al. | Apr 2009 | B2 |
| 7543024 | Holstege | Jun 2009 | B2 |
| 7548947 | Kasriel et al. | Jun 2009 | B2 |
| 7552235 | Chase et al. | Jun 2009 | B2 |
| 7555542 | Ayers et al. | Jun 2009 | B1 |
| 7561571 | Lovett et al. | Jul 2009 | B1 |
| 7565407 | Hayball | Jul 2009 | B1 |
| 7568032 | Feng et al. | Jul 2009 | B2 |
| 7573916 | Bechtolsheim et al. | Aug 2009 | B1 |
| 7574499 | Swildens et al. | Aug 2009 | B1 |
| 7581009 | Hsu et al. | Aug 2009 | B1 |
| 7584507 | Nucci | Sep 2009 | B1 |
| 7593935 | Sullivan | Sep 2009 | B2 |
| 7594189 | Walker et al. | Sep 2009 | B1 |
| 7596619 | Leighton et al. | Sep 2009 | B2 |
| 7603439 | Dilley et al. | Sep 2009 | B2 |
| 7613815 | Prakash et al. | Oct 2009 | B1 |
| 7617222 | Coulthard et al. | Nov 2009 | B2 |
| 7623460 | Miyazaki | Nov 2009 | B2 |
| 7624169 | Lisiecki et al. | Nov 2009 | B2 |
| 7624264 | Aura et al. | Nov 2009 | B2 |
| 7626940 | Jain | Dec 2009 | B2 |
| 7631101 | Sullivan et al. | Dec 2009 | B2 |
| 7631310 | Henzinger | Dec 2009 | B1 |
| 7640296 | Fuchs et al. | Dec 2009 | B2 |
| 7650376 | Blumenau | Jan 2010 | B1 |
| 7653700 | Bahl et al. | Jan 2010 | B1 |
| 7653725 | Yahiro et al. | Jan 2010 | B2 |
| 7657613 | Hanson et al. | Feb 2010 | B1 |
| 7657622 | Douglis et al. | Feb 2010 | B1 |
| 7661027 | Langen et al. | Feb 2010 | B2 |
| 7664831 | Cartmell et al. | Feb 2010 | B2 |
| 7664879 | Chan et al. | Feb 2010 | B2 |
| 7676570 | Levy et al. | Mar 2010 | B2 |
| 7680897 | Carter et al. | Mar 2010 | B1 |
| 7684394 | Cutbill et al. | Mar 2010 | B1 |
| 7685109 | Ransil et al. | Mar 2010 | B1 |
| 7685251 | Houlihan et al. | Mar 2010 | B2 |
| 7685270 | Vermeulen et al. | Mar 2010 | B1 |
| 7685273 | Anastas et al. | Mar 2010 | B1 |
| 7693813 | Cao et al. | Apr 2010 | B1 |
| 7693959 | Leighton et al. | Apr 2010 | B2 |
| 7698418 | Shimada et al. | Apr 2010 | B2 |
| 7702724 | Brydon et al. | Apr 2010 | B1 |
| 7706740 | Collins et al. | Apr 2010 | B2 |
| 7707071 | Rigole | Apr 2010 | B2 |
| 7707314 | McCarthy et al. | Apr 2010 | B2 |
| 7711647 | Gunaseelan et al. | May 2010 | B2 |
| 7711788 | Lev Ran et al. | May 2010 | B2 |
| 7716367 | Leighton et al. | May 2010 | B1 |
| 7725602 | Liu et al. | May 2010 | B2 |
| 7725658 | Lang et al. | May 2010 | B2 |
| 7730187 | Raciborski et al. | Jun 2010 | B2 |
| 7739400 | Lindbo et al. | Jun 2010 | B2 |
| 7747720 | Toebes et al. | Jun 2010 | B2 |
| 7748005 | Romero et al. | Jun 2010 | B2 |
| 7756017 | Goyal et al. | Jul 2010 | B2 |
| 7756913 | Day | Jul 2010 | B1 |
| 7756965 | Joshi | Jul 2010 | B2 |
| 7757202 | Dahlsted et al. | Jul 2010 | B2 |
| 7761572 | Auerbach | Jul 2010 | B1 |
| 7765295 | Anastas et al. | Jul 2010 | B2 |
| 7765304 | Davis et al. | Jul 2010 | B2 |
| 7769823 | Jenny et al. | Aug 2010 | B2 |
| 7773596 | Marques | Aug 2010 | B1 |
| 7774342 | Virdy | Aug 2010 | B1 |
| 7783727 | Foley et al. | Aug 2010 | B1 |
| 7787380 | Aggarwal et al. | Aug 2010 | B1 |
| 7792989 | Toebes et al. | Sep 2010 | B2 |
| 7805516 | Kettler et al. | Sep 2010 | B2 |
| 7809597 | Das et al. | Oct 2010 | B2 |
| 7813308 | Reddy et al. | Oct 2010 | B2 |
| 7814229 | Cabrera et al. | Oct 2010 | B1 |
| 7818454 | Kim et al. | Oct 2010 | B2 |
| 7827256 | Phillips et al. | Nov 2010 | B2 |
| 7836177 | Kasriel et al. | Nov 2010 | B2 |
| 7853680 | Phatak | Dec 2010 | B2 |
| 7853719 | Cao et al. | Dec 2010 | B1 |
| 7860735 | Evanitsky | Dec 2010 | B2 |
| 7865594 | Baumback et al. | Jan 2011 | B1 |
| 7865953 | Hsieh et al. | Jan 2011 | B1 |
| 7873065 | Mukerji et al. | Jan 2011 | B1 |
| 7890612 | Todd et al. | Feb 2011 | B2 |
| 7890989 | Hofrichter et al. | Feb 2011 | B1 |
| 7899899 | Joshi | Mar 2011 | B2 |
| 7904875 | Hegyi | Mar 2011 | B2 |
| 7912921 | O'Rourke et al. | Mar 2011 | B2 |
| 7925713 | Day et al. | Apr 2011 | B1 |
| 7925782 | Sivasubramanian et al. | Apr 2011 | B2 |
| 7930393 | Baumback et al. | Apr 2011 | B1 |
| 7930402 | Swildens et al. | Apr 2011 | B2 |
| 7930427 | Josefsberg et al. | Apr 2011 | B2 |
| 7933988 | Nasuto et al. | Apr 2011 | B2 |
| 7937456 | McGrath | Apr 2011 | B2 |
| 7937477 | Day et al. | May 2011 | B1 |
| 7945693 | Farber et al. | May 2011 | B2 |
| 7949779 | Farber et al. | May 2011 | B2 |
| 7958222 | Pruitt et al. | Jun 2011 | B1 |
| 7958258 | Yeung et al. | Jun 2011 | B2 |
| 7961736 | Ayyagari | Jun 2011 | B2 |
| 7962597 | Richardson et al. | Jun 2011 | B2 |
| 7966404 | Hedin et al. | Jun 2011 | B2 |
| 7970816 | Chess et al. | Jun 2011 | B2 |
| 7970940 | van de Ven et al. | Jun 2011 | B1 |
| 7979509 | Malmskog et al. | Jul 2011 | B1 |
| 7991910 | Richardson et al. | Aug 2011 | B2 |
| 7996404 | Wong et al. | Aug 2011 | B2 |
| 7996533 | Leighton et al. | Aug 2011 | B2 |
| 7996535 | Auerbach | Aug 2011 | B2 |
| 8000724 | Rayburn et al. | Aug 2011 | B1 |
| 8001187 | Stochosky | Aug 2011 | B2 |
| 8010705 | Sebastian et al. | Aug 2011 | B1 |
| 8010707 | Elzur et al. | Aug 2011 | B2 |
| 8019869 | Kriegsman | Sep 2011 | B2 |
| 8024441 | Kommula et al. | Sep 2011 | B2 |
| 8028090 | Richardson et al. | Sep 2011 | B2 |
| 8041773 | Abu-Ghazaleh et al. | Oct 2011 | B2 |
| 8041809 | Sundaram et al. | Oct 2011 | B2 |
| 8041818 | Gupta et al. | Oct 2011 | B2 |
| 8042054 | White et al. | Oct 2011 | B2 |
| 8051166 | Baumback et al. | Oct 2011 | B1 |
| 8065275 | Eriksen et al. | Nov 2011 | B2 |
| 8069231 | Schran et al. | Nov 2011 | B2 |
| 8073940 | Richardson et al. | Dec 2011 | B1 |
| 8079087 | Spies et al. | Dec 2011 | B1 |
| 8082348 | Averbuj et al. | Dec 2011 | B1 |
| 8099487 | Smirnov et al. | Jan 2012 | B1 |
| 8108623 | Krishnaprasad et al. | Jan 2012 | B2 |
| 8117306 | Baumback et al. | Feb 2012 | B1 |
| 8122098 | Richardson et al. | Feb 2012 | B1 |
| 8122124 | Baumback et al. | Feb 2012 | B1 |
| 8132242 | Wu | Mar 2012 | B1 |
| 8135820 | Richardson et al. | Mar 2012 | B2 |
| 8155126 | Mao et al. | Mar 2012 | B1 |
| 8156199 | Hoche-Mong et al. | Apr 2012 | B1 |
| 8156243 | Richardson et al. | Apr 2012 | B2 |
| 8161184 | Sekar et al. | Apr 2012 | B2 |
| 8165915 | Lucash | Apr 2012 | B1 |
| 8175863 | Ostermeyer et al. | May 2012 | B1 |
| 8180720 | Kovacs et al. | May 2012 | B1 |
| 8190682 | Paterson-Jones et al. | May 2012 | B2 |
| 8195605 | Chellappa et al. | May 2012 | B2 |
| 8195837 | McCarthy et al. | Jun 2012 | B2 |
| 8209695 | Pruyne et al. | Jun 2012 | B1 |
| 8218965 | Uhlhorn et al. | Jul 2012 | B1 |
| 8224942 | Presotto et al. | Jul 2012 | B1 |
| 8224971 | Miller et al. | Jul 2012 | B1 |
| 8224986 | Liskov et al. | Jul 2012 | B1 |
| 8224994 | Schneider | Jul 2012 | B1 |
| 8234403 | Richardson et al. | Jul 2012 | B2 |
| 8239530 | Sundaram et al. | Aug 2012 | B2 |
| 8250135 | Driesen et al. | Aug 2012 | B2 |
| 8250211 | Swildens et al. | Aug 2012 | B2 |
| 8250219 | Raciborski et al. | Aug 2012 | B2 |
| 8260914 | Ranjan | Aug 2012 | B1 |
| 8261062 | Aura et al. | Sep 2012 | B2 |
| 8266288 | Banerjee et al. | Sep 2012 | B2 |
| 8266327 | Kumar et al. | Sep 2012 | B2 |
| 8271471 | Kamvar et al. | Sep 2012 | B1 |
| 8280998 | Joshi | Oct 2012 | B2 |
| 8281035 | Farber et al. | Oct 2012 | B2 |
| 8286176 | Baumback et al. | Oct 2012 | B1 |
| 8291046 | Farber et al. | Oct 2012 | B2 |
| 8291117 | Eggleston et al. | Oct 2012 | B1 |
| 8296375 | Katzer et al. | Oct 2012 | B1 |
| 8296393 | Alexander et al. | Oct 2012 | B2 |
| 8296429 | Baumback et al. | Oct 2012 | B2 |
| 8296786 | Faust et al. | Oct 2012 | B2 |
| 8301600 | Helmick et al. | Oct 2012 | B1 |
| 8301645 | Crook | Oct 2012 | B1 |
| 8316124 | Baumback et al. | Oct 2012 | B1 |
| 8321568 | Sivasubramanian et al. | Nov 2012 | B2 |
| 8321588 | Richardson et al. | Nov 2012 | B2 |
| 8331370 | Hamilton et al. | Nov 2012 | B2 |
| 8341745 | Chat et al. | Dec 2012 | B1 |
| 8356074 | Ehrlich et al. | Jan 2013 | B1 |
| 8380831 | Barber | Feb 2013 | B2 |
| 8380851 | McCarthy et al. | Feb 2013 | B2 |
| 8392928 | Forys et al. | Mar 2013 | B1 |
| 8396908 | Moore et al. | Mar 2013 | B2 |
| 8402137 | Sivasuramanian et al. | Mar 2013 | B2 |
| 8423408 | Barnes et al. | Apr 2013 | B1 |
| 8423662 | Weihl et al. | Apr 2013 | B1 |
| 8433749 | Wee et al. | Apr 2013 | B2 |
| 8443167 | Fallone et al. | May 2013 | B1 |
| 8447831 | Sivasubramanian et al. | May 2013 | B1 |
| 8447854 | Jasinskyj | May 2013 | B1 |
| 8447876 | Verma et al. | May 2013 | B2 |
| 8452745 | Ramakrishna | May 2013 | B2 |
| 8452870 | Baumback et al. | May 2013 | B2 |
| 8452874 | MacCarthaigh et al. | May 2013 | B2 |
| 8463877 | Richardson | Jun 2013 | B1 |
| 8468222 | Sakata et al. | Jun 2013 | B2 |
| 8468245 | Farber et al. | Jun 2013 | B2 |
| 8473613 | Farber et al. | Jun 2013 | B2 |
| 8478883 | Day et al. | Jul 2013 | B2 |
| 8478903 | Farber et al. | Jul 2013 | B2 |
| 8489737 | Baumback et al. | Jul 2013 | B2 |
| 8504721 | Hsu et al. | Aug 2013 | B2 |
| 8504775 | Plamondon | Aug 2013 | B2 |
| 8510428 | Joshi | Aug 2013 | B2 |
| 8510807 | Elazary et al. | Aug 2013 | B1 |
| 8516082 | Cadwell et al. | Aug 2013 | B2 |
| 8521851 | Richardson | Aug 2013 | B1 |
| 8521876 | Goodman et al. | Aug 2013 | B2 |
| 8521880 | Richardson et al. | Aug 2013 | B1 |
| 8521885 | Richardson et al. | Aug 2013 | B1 |
| 8521908 | Holmes et al. | Aug 2013 | B2 |
| 8526405 | Curtis et al. | Sep 2013 | B2 |
| 8527639 | Liskov et al. | Sep 2013 | B1 |
| 8527645 | Proffit et al. | Sep 2013 | B1 |
| 8527658 | Holmes et al. | Sep 2013 | B2 |
| 8549646 | Stavrou et al. | Oct 2013 | B2 |
| 8572208 | Farber et al. | Oct 2013 | B2 |
| 8572210 | Farber et al. | Oct 2013 | B2 |
| 8577963 | Trahan et al. | Nov 2013 | B2 |
| 8577992 | Richardson et al. | Nov 2013 | B1 |
| 8589996 | Ma et al. | Nov 2013 | B2 |
| 8606926 | Ulevitch | Dec 2013 | B2 |
| 8606996 | Richardson et al. | Dec 2013 | B2 |
| 8612565 | Schneider | Dec 2013 | B2 |
| 8612588 | Ehrlich et al. | Dec 2013 | B1 |
| 8615549 | Knowles et al. | Dec 2013 | B2 |
| 8619780 | Brandwine | Dec 2013 | B1 |
| 8626950 | Richardson et al. | Jan 2014 | B1 |
| 8635340 | Schneider | Jan 2014 | B1 |
| 8639817 | Sivasubramanian et al. | Jan 2014 | B2 |
| 8645539 | McCarthy et al. | Feb 2014 | B2 |
| 8645700 | Smith et al. | Feb 2014 | B2 |
| 8667127 | Bettis et al. | Feb 2014 | B2 |
| 8676918 | Richardson et al. | Mar 2014 | B2 |
| 8683023 | Brandwine et al. | Mar 2014 | B1 |
| 8683076 | Farber et al. | Mar 2014 | B2 |
| 8688837 | Richardson et al. | Apr 2014 | B1 |
| 8694642 | Dempsky et al. | Apr 2014 | B2 |
| 8712950 | Smith et al. | Apr 2014 | B2 |
| 8732309 | Richardson et al. | May 2014 | B1 |
| 8738766 | Kazerani et al. | May 2014 | B1 |
| 8745177 | Kazerani et al. | Jun 2014 | B1 |
| 8756322 | Lynch | Jun 2014 | B1 |
| 8756325 | Sivasubramanian et al. | Jun 2014 | B2 |
| 8756341 | Richardson et al. | Jun 2014 | B1 |
| 8762526 | Baumback et al. | Jun 2014 | B2 |
| 8775553 | Cansino et al. | Jun 2014 | B2 |
| 8782207 | Qiu et al. | Jul 2014 | B2 |
| 8782236 | Marshall et al. | Jul 2014 | B1 |
| 8782279 | Eggleston et al. | Jul 2014 | B2 |
| 8788671 | Richardson et al. | Jul 2014 | B2 |
| 8812727 | Sorenson, III et al. | Aug 2014 | B1 |
| 8819187 | Hofmann | Aug 2014 | B1 |
| 8819283 | Richardson et al. | Aug 2014 | B2 |
| 8826032 | Yahalom et al. | Sep 2014 | B1 |
| 8843625 | Baumback et al. | Sep 2014 | B2 |
| 8902897 | Hamilton et al. | Sep 2014 | B2 |
| 8904009 | Marshall et al. | Dec 2014 | B1 |
| 8914514 | Jenkins et al. | Dec 2014 | B1 |
| 8914626 | Adogla et al. | Dec 2014 | B1 |
| 8914797 | Osogami et al. | Dec 2014 | B2 |
| 8914814 | Middleton et al. | Dec 2014 | B1 |
| 8924528 | Richardson et al. | Dec 2014 | B1 |
| 8930513 | Richardson et al. | Jan 2015 | B1 |
| 8930544 | Richardson et al. | Jan 2015 | B2 |
| 8935744 | Osterweil et al. | Jan 2015 | B2 |
| 8938526 | Richardson et al. | Jan 2015 | B1 |
| 8949161 | Borst et al. | Feb 2015 | B2 |
| 8949459 | Scholl | Feb 2015 | B1 |
| 8966318 | Shah | Feb 2015 | B1 |
| 8971328 | Judge et al. | Feb 2015 | B2 |
| 8972580 | Fleischman et al. | Mar 2015 | B2 |
| 8976711 | Li et al. | Mar 2015 | B2 |
| 9003035 | Richardson et al. | Apr 2015 | B1 |
| 9003040 | MacCarthaigh et al. | Apr 2015 | B2 |
| 9009286 | Sivasubramanian et al. | Apr 2015 | B2 |
| 9009334 | Jenkins et al. | Apr 2015 | B1 |
| 9021127 | Richardson et al. | Apr 2015 | B2 |
| 9021128 | Sivasubramanian et al. | Apr 2015 | B2 |
| 9021129 | Richardson et al. | Apr 2015 | B2 |
| 9026616 | Sivasubramanian et al. | May 2015 | B2 |
| 9037975 | Taylor et al. | May 2015 | B1 |
| 9071502 | Baumback et al. | May 2015 | B2 |
| 9075777 | Pope et al. | Jul 2015 | B1 |
| 9075893 | Jenkins | Jul 2015 | B1 |
| 9083675 | Richardson et al. | Jul 2015 | B2 |
| 9083743 | Patel et al. | Jul 2015 | B1 |
| 9088460 | Baumback et al. | Jul 2015 | B2 |
| 9106701 | Richardson et al. | Aug 2015 | B2 |
| 9116803 | Agrawal et al. | Aug 2015 | B1 |
| 9118543 | Baumback et al. | Aug 2015 | B2 |
| 9118680 | Dunlap et al. | Aug 2015 | B1 |
| 9130756 | Richardson et al. | Sep 2015 | B2 |
| 9130977 | Zisapel et al. | Sep 2015 | B2 |
| 9137210 | Joglekar et al. | Sep 2015 | B1 |
| 9137301 | Dunlap et al. | Sep 2015 | B1 |
| 9137302 | Makhijani et al. | Sep 2015 | B1 |
| 9154551 | Watson | Oct 2015 | B1 |
| 9160641 | Baumback et al. | Oct 2015 | B2 |
| 9160703 | Richardson et al. | Oct 2015 | B2 |
| 9172674 | Patel et al. | Oct 2015 | B1 |
| 9176894 | Marshall et al. | Nov 2015 | B2 |
| 9185012 | Richardson et al. | Nov 2015 | B2 |
| 9191338 | Richardson et al. | Nov 2015 | B2 |
| 9191393 | Tovar | Nov 2015 | B2 |
| 9191458 | Richardson et al. | Nov 2015 | B2 |
| 9195996 | Walsh et al. | Nov 2015 | B1 |
| 9208097 | Richardson et al. | Dec 2015 | B2 |
| 9210099 | Baumback et al. | Dec 2015 | B2 |
| 9210235 | Sivasubramanian et al. | Dec 2015 | B2 |
| 9219686 | Hilt et al. | Dec 2015 | B2 |
| 9237087 | Risbood et al. | Jan 2016 | B1 |
| 9237114 | Richardson et al. | Jan 2016 | B2 |
| 9240954 | Ellsworth et al. | Jan 2016 | B1 |
| 9246776 | Ellsworth et al. | Jan 2016 | B2 |
| 9251112 | Richardson et al. | Feb 2016 | B2 |
| 9253065 | Richardson et al. | Feb 2016 | B2 |
| 9276812 | Nagargadde et al. | Mar 2016 | B1 |
| 9282032 | Judge et al. | Mar 2016 | B2 |
| 9294391 | Mostert | Mar 2016 | B1 |
| 9300535 | Popli et al. | Mar 2016 | B2 |
| 9323577 | Marr et al. | Apr 2016 | B2 |
| 9332078 | Sivasubramanian et al. | May 2016 | B2 |
| 9367929 | Bettis et al. | May 2016 | B2 |
| 9386038 | Martini | Jul 2016 | B2 |
| 9391949 | Richardson et al. | Jul 2016 | B1 |
| 9407539 | Dickinson et al. | Aug 2016 | B1 |
| 9407676 | Archer et al. | Aug 2016 | B2 |
| 9407681 | Richardson et al. | Aug 2016 | B1 |
| 9407699 | Sivasubramanian et al. | Aug 2016 | B2 |
| 9444718 | Khakpour et al. | Sep 2016 | B2 |
| 9444759 | Richardson et al. | Sep 2016 | B2 |
| 9479476 | Richardson et al. | Oct 2016 | B2 |
| 9491073 | Baumback et al. | Oct 2016 | B2 |
| 9495338 | Hollis et al. | Nov 2016 | B1 |
| 9497259 | Richardson et al. | Nov 2016 | B1 |
| 9515949 | Richardson et al. | Dec 2016 | B2 |
| 9516130 | Graham-Cumming | Dec 2016 | B1 |
| 9525659 | Sonkin et al. | Dec 2016 | B1 |
| 9544388 | Li et al. | Jan 2017 | B1 |
| 9544394 | Richardson et al. | Jan 2017 | B2 |
| 9571389 | Richardson et al. | Feb 2017 | B2 |
| 9575810 | Clarke | Feb 2017 | B2 |
| 9584328 | Graham-Cumming | Feb 2017 | B1 |
| 9590946 | Richardson et al. | Mar 2017 | B2 |
| 9608957 | Sivasubramanian et al. | Mar 2017 | B2 |
| 9621660 | Sivasubramanian et al. | Apr 2017 | B2 |
| 9628403 | Baumback et al. | Apr 2017 | B2 |
| 9628509 | Holloway et al. | Apr 2017 | B2 |
| 9628554 | Marshall et al. | Apr 2017 | B2 |
| 9645808 | Turpie | May 2017 | B1 |
| 9660890 | Baumback et al. | May 2017 | B2 |
| 9703713 | Nadgowda | Jul 2017 | B2 |
| 9705922 | Foxhoven et al. | Jul 2017 | B2 |
| 9712325 | Richardson et al. | Jul 2017 | B2 |
| 9712484 | Richardson et al. | Jul 2017 | B1 |
| 9734472 | Richardson et al. | Aug 2017 | B2 |
| 9742795 | Radlein et al. | Aug 2017 | B1 |
| 9760420 | Letz et al. | Sep 2017 | B1 |
| 9769248 | Krishnan et al. | Sep 2017 | B1 |
| 9774619 | Radlein et al. | Sep 2017 | B1 |
| 9787599 | Richardson et al. | Oct 2017 | B2 |
| 9787775 | Richardson et al. | Oct 2017 | B1 |
| 9794188 | Baumback et al. | Oct 2017 | B2 |
| 9794216 | Richardson et al. | Oct 2017 | B2 |
| 9794281 | Radlein et al. | Oct 2017 | B1 |
| 9800539 | Richardson et al. | Oct 2017 | B2 |
| 9811451 | Arguelles et al. | Nov 2017 | B1 |
| 9819567 | Uppal et al. | Nov 2017 | B1 |
| 9825831 | Baumback et al. | Nov 2017 | B2 |
| 9832141 | Raftery | Nov 2017 | B1 |
| 9871794 | Joffe et al. | Jan 2018 | B2 |
| 9887914 | Bergman | Feb 2018 | B2 |
| 9887915 | Richardson et al. | Feb 2018 | B2 |
| 9887931 | Uppal et al. | Feb 2018 | B1 |
| 9887932 | Uppal et al. | Feb 2018 | B1 |
| 9888089 | Sivasubramanian et al. | Feb 2018 | B2 |
| 9893957 | Ellsworth et al. | Feb 2018 | B2 |
| 9894168 | Sivasubramanian et al. | Feb 2018 | B2 |
| 9900402 | Li et al. | Feb 2018 | B1 |
| 9912740 | Richardson et al. | Mar 2018 | B2 |
| 9929959 | Mostert | Mar 2018 | B2 |
| 9930131 | MacCarthaigh et al. | Mar 2018 | B2 |
| 9954934 | Sivasubramanian et al. | Apr 2018 | B2 |
| 9985927 | Richardson et al. | May 2018 | B2 |
| 9992086 | Mizik et al. | Jun 2018 | B1 |
| 9992303 | Richardson et al. | Jun 2018 | B2 |
| 9996501 | Nelson et al. | Jun 2018 | B1 |
| 10015237 | Richardson et al. | Jul 2018 | B2 |
| 10015241 | Marr et al. | Jul 2018 | B2 |
| 10021179 | Velummylum et al. | Jul 2018 | B1 |
| 10027582 | Richardson et al. | Jul 2018 | B2 |
| 10027739 | Krishnan et al. | Jul 2018 | B1 |
| 10033627 | Howard et al. | Jul 2018 | B1 |
| 10033691 | Mizik et al. | Jul 2018 | B1 |
| 10033699 | Sullivan et al. | Jul 2018 | B2 |
| 10049051 | Baldwin | Aug 2018 | B1 |
| 10063459 | Judge et al. | Aug 2018 | B2 |
| 10075551 | Baldwin et al. | Sep 2018 | B1 |
| 10079742 | Richardson et al. | Sep 2018 | B1 |
| 10091096 | Howard et al. | Oct 2018 | B1 |
| 10097398 | Richardson et al. | Oct 2018 | B1 |
| 10097448 | Howard et al. | Oct 2018 | B1 |
| 10097566 | Radlein et al. | Oct 2018 | B1 |
| 10104009 | Baumback et al. | Oct 2018 | B2 |
| 10110694 | Watson et al. | Oct 2018 | B1 |
| 10116584 | Richardson et al. | Oct 2018 | B2 |
| 10135620 | Richardson et al. | Nov 2018 | B2 |
| 10148542 | Baumback et al. | Dec 2018 | B2 |
| 10157135 | Richardson et al. | Dec 2018 | B2 |
| 10158729 | Sivasubramanian et al. | Dec 2018 | B2 |
| 10162753 | Marshall et al. | Dec 2018 | B2 |
| 10180993 | Raftery | Jan 2019 | B2 |
| 10200402 | Radlein et al. | Feb 2019 | B2 |
| 10200492 | MacCarthaigh et al. | Feb 2019 | B2 |
| 10205644 | Baumback et al. | Feb 2019 | B2 |
| 10205698 | Petersen et al. | Feb 2019 | B1 |
| 10218584 | Ellsworth et al. | Feb 2019 | B2 |
| 10225322 | Richardson et al. | Mar 2019 | B2 |
| 10225326 | Puchala et al. | Mar 2019 | B1 |
| 10225362 | Watson | Mar 2019 | B2 |
| 10225365 | Hotchkies et al. | Mar 2019 | B1 |
| 10230819 | Richardson et al. | Mar 2019 | B2 |
| 10257307 | Baldwin | Apr 2019 | B1 |
| 10264062 | Richardson et al. | Apr 2019 | B2 |
| 10270878 | Uppal et al. | Apr 2019 | B1 |
| 10284446 | Baumback et al. | May 2019 | B2 |
| 10305797 | Richardson et al. | May 2019 | B2 |
| 10311371 | Hotchkies et al. | Jun 2019 | B1 |
| 10348639 | Puchala et al. | Jul 2019 | B2 |
| 10372499 | Radhakrishnan et al. | Aug 2019 | B1 |
| 10374955 | Mostert | Aug 2019 | B2 |
| 10410085 | Bettis et al. | Sep 2019 | B2 |
| 10447648 | Bliss et al. | Oct 2019 | B2 |
| 10462025 | Baumback et al. | Oct 2019 | B2 |
| 10467042 | Mercier et al. | Nov 2019 | B1 |
| 10469355 | Uppal et al. | Nov 2019 | B2 |
| 10469513 | Uppal et al. | Nov 2019 | B2 |
| 10491534 | Richardson et al. | Nov 2019 | B2 |
| 10505961 | Uppal et al. | Dec 2019 | B2 |
| 10506029 | Hollis et al. | Dec 2019 | B2 |
| 10511567 | Richardson et al. | Dec 2019 | B2 |
| 10516590 | Mizik et al. | Dec 2019 | B2 |
| 10521348 | Marshall et al. | Dec 2019 | B2 |
| 10523783 | Richardson et al. | Dec 2019 | B2 |
| 10530874 | Sivasubramanian et al. | Jan 2020 | B2 |
| 10542079 | Marr et al. | Jan 2020 | B2 |
| 10554748 | Sivasubramanian et al. | Feb 2020 | B2 |
| 10574787 | Richardson et al. | Feb 2020 | B2 |
| 10601767 | Richardson et al. | Mar 2020 | B2 |
| 10616250 | Uppal et al. | Apr 2020 | B2 |
| 10623408 | Marshall et al. | Apr 2020 | B1 |
| 10630771 | Garza et al. | Apr 2020 | B1 |
| 10645149 | Sivasubramanian et al. | May 2020 | B2 |
| 10666756 | Baldwin et al. | May 2020 | B2 |
| 10691752 | Raftery | Jun 2020 | B2 |
| 10742550 | Richardson et al. | Aug 2020 | B2 |
| 10742593 | Vasquez et al. | Aug 2020 | B1 |
| 10771552 | Sivasubramanian et al. | Sep 2020 | B2 |
| 10778554 | Richardson et al. | Sep 2020 | B2 |
| 10783077 | Marshall et al. | Sep 2020 | B2 |
| 10785037 | Richardson et al. | Sep 2020 | B2 |
| 10797995 | Richardson et al. | Oct 2020 | B2 |
| 10812358 | Krishnan et al. | Oct 2020 | B2 |
| 10831549 | Radhakrishnan et al. | Nov 2020 | B1 |
| 20010000811 | May et al. | May 2001 | A1 |
| 20010025305 | Yoshiasa et al. | Sep 2001 | A1 |
| 20010027479 | Delaney et al. | Oct 2001 | A1 |
| 20010032133 | Moran | Oct 2001 | A1 |
| 20010034704 | Farhat et al. | Oct 2001 | A1 |
| 20010049741 | Skene et al. | Dec 2001 | A1 |
| 20010052016 | Skene et al. | Dec 2001 | A1 |
| 20010056416 | Garcia-Luna-Aceves | Dec 2001 | A1 |
| 20010056500 | Farber et al. | Dec 2001 | A1 |
| 20020002613 | Freeman et al. | Jan 2002 | A1 |
| 20020004816 | Vange et al. | Jan 2002 | A1 |
| 20020004846 | Garcia-Luna-Aceves et al. | Jan 2002 | A1 |
| 20020007413 | Garcia-Luna-Aceves et al. | Jan 2002 | A1 |
| 20020010783 | Primak et al. | Jan 2002 | A1 |
| 20020010798 | Ben-Shaul et al. | Jan 2002 | A1 |
| 20020016831 | Peled et al. | Feb 2002 | A1 |
| 20020032777 | Kawata | Mar 2002 | A1 |
| 20020035624 | Kim | Mar 2002 | A1 |
| 20020048269 | Hong et al. | Apr 2002 | A1 |
| 20020049608 | Hartsell et al. | Apr 2002 | A1 |
| 20020049842 | Huetsch et al. | Apr 2002 | A1 |
| 20020049857 | Farber et al. | Apr 2002 | A1 |
| 20020052942 | Swildens et al. | May 2002 | A1 |
| 20020062372 | Hong et al. | May 2002 | A1 |
| 20020065910 | Dutta | May 2002 | A1 |
| 20020068554 | Dusse | Jun 2002 | A1 |
| 20020069420 | Russell et al. | Jun 2002 | A1 |
| 20020078233 | Biliris et al. | Jun 2002 | A1 |
| 20020082858 | Heddaya et al. | Jun 2002 | A1 |
| 20020083118 | Sim | Jun 2002 | A1 |
| 20020083148 | Shaw et al. | Jun 2002 | A1 |
| 20020083178 | Brothers | Jun 2002 | A1 |
| 20020083198 | Kim et al. | Jun 2002 | A1 |
| 20020087374 | Boubez et al. | Jul 2002 | A1 |
| 20020087797 | Adrangi | Jul 2002 | A1 |
| 20020091786 | Yamaguchi et al. | Jul 2002 | A1 |
| 20020091801 | Lewin et al. | Jul 2002 | A1 |
| 20020092026 | Janniello et al. | Jul 2002 | A1 |
| 20020099616 | Sweldens | Jul 2002 | A1 |
| 20020099850 | Farber et al. | Jul 2002 | A1 |
| 20020101836 | Dorenbosch | Aug 2002 | A1 |
| 20020103820 | Cartmell et al. | Aug 2002 | A1 |
| 20020103972 | Satran et al. | Aug 2002 | A1 |
| 20020107944 | Bai et al. | Aug 2002 | A1 |
| 20020112049 | Elnozahy et al. | Aug 2002 | A1 |
| 20020112123 | Becker et al. | Aug 2002 | A1 |
| 20020116481 | Lee | Aug 2002 | A1 |
| 20020116491 | Boyd et al. | Aug 2002 | A1 |
| 20020116582 | Copeland et al. | Aug 2002 | A1 |
| 20020120666 | Landsman et al. | Aug 2002 | A1 |
| 20020120782 | Dillon et al. | Aug 2002 | A1 |
| 20020124047 | Gartner et al. | Sep 2002 | A1 |
| 20020124098 | Shaw | Sep 2002 | A1 |
| 20020129123 | Johnson et al. | Sep 2002 | A1 |
| 20020131428 | Pecus et al. | Sep 2002 | A1 |
| 20020133741 | Maeda et al. | Sep 2002 | A1 |
| 20020135611 | Deosaran et al. | Sep 2002 | A1 |
| 20020138286 | Engstrom | Sep 2002 | A1 |
| 20020138437 | Lewin et al. | Sep 2002 | A1 |
| 20020138443 | Schran et al. | Sep 2002 | A1 |
| 20020138649 | Cartmell et al. | Sep 2002 | A1 |
| 20020138761 | Kanemaki et al. | Sep 2002 | A1 |
| 20020143675 | Orshan | Oct 2002 | A1 |
| 20020143798 | Lisiecki et al. | Oct 2002 | A1 |
| 20020143984 | Hudson Michel | Oct 2002 | A1 |
| 20020143989 | Huitema et al. | Oct 2002 | A1 |
| 20020145993 | Chowdhury et al. | Oct 2002 | A1 |
| 20020147770 | Tang | Oct 2002 | A1 |
| 20020147774 | Lisiecki et al. | Oct 2002 | A1 |
| 20020150094 | Cheng et al. | Oct 2002 | A1 |
| 20020150276 | Chang | Oct 2002 | A1 |
| 20020152326 | Orshan | Oct 2002 | A1 |
| 20020154157 | Sherr et al. | Oct 2002 | A1 |
| 20020156884 | Bertram et al. | Oct 2002 | A1 |
| 20020156911 | Croman et al. | Oct 2002 | A1 |
| 20020161745 | Call | Oct 2002 | A1 |
| 20020161767 | Shapiro et al. | Oct 2002 | A1 |
| 20020163882 | Bornstein et al. | Nov 2002 | A1 |
| 20020165912 | Wenocur et al. | Nov 2002 | A1 |
| 20020169890 | Beaumont et al. | Nov 2002 | A1 |
| 20020184368 | Wang | Dec 2002 | A1 |
| 20020187935 | Redmond et al. | Dec 2002 | A1 |
| 20020188722 | Banerjee et al. | Dec 2002 | A1 |
| 20020194324 | Guha | Dec 2002 | A1 |
| 20020194382 | Kausik et al. | Dec 2002 | A1 |
| 20020198953 | O'Rourke et al. | Dec 2002 | A1 |
| 20030002484 | Freedman | Jan 2003 | A1 |
| 20030004998 | Datta | Jan 2003 | A1 |
| 20030005036 | Mitzenmacher | Jan 2003 | A1 |
| 20030005111 | Allan | Jan 2003 | A1 |
| 20030007482 | Khello et al. | Jan 2003 | A1 |
| 20030009488 | Hart, III | Jan 2003 | A1 |
| 20030009591 | Hayball et al. | Jan 2003 | A1 |
| 20030026410 | Lumsden | Feb 2003 | A1 |
| 20030028642 | Agarwal et al. | Feb 2003 | A1 |
| 20030033283 | Evans et al. | Feb 2003 | A1 |
| 20030037108 | Peiffer et al. | Feb 2003 | A1 |
| 20030037139 | Shteyn | Feb 2003 | A1 |
| 20030037284 | Srinivasan et al. | Feb 2003 | A1 |
| 20030041094 | Lara et al. | Feb 2003 | A1 |
| 20030046343 | Krishnamurthy et al. | Mar 2003 | A1 |
| 20030065739 | Shnier | Apr 2003 | A1 |
| 20030070096 | Pazi et al. | Apr 2003 | A1 |
| 20030074401 | Connell et al. | Apr 2003 | A1 |
| 20030074471 | Anderson et al. | Apr 2003 | A1 |
| 20030074472 | Lucco et al. | Apr 2003 | A1 |
| 20030079027 | Slocombe et al. | Apr 2003 | A1 |
| 20030093523 | Cranor et al. | May 2003 | A1 |
| 20030099202 | Lear et al. | May 2003 | A1 |
| 20030099237 | Mitra et al. | May 2003 | A1 |
| 20030101278 | Garcia-Luna-Aceves et al. | May 2003 | A1 |
| 20030105829 | Hayward | Jun 2003 | A1 |
| 20030105857 | Kamen et al. | Jun 2003 | A1 |
| 20030112792 | Cranor et al. | Jun 2003 | A1 |
| 20030120741 | Wu et al. | Jun 2003 | A1 |
| 20030126387 | Watanabe | Jul 2003 | A1 |
| 20030133554 | Nykanen et al. | Jul 2003 | A1 |
| 20030135467 | Okamoto | Jul 2003 | A1 |
| 20030135509 | Davis et al. | Jul 2003 | A1 |
| 20030140087 | Lincoln et al. | Jul 2003 | A1 |
| 20030145038 | Bin Tariq et al. | Jul 2003 | A1 |
| 20030145066 | Okada et al. | Jul 2003 | A1 |
| 20030149581 | Chaudhri et al. | Aug 2003 | A1 |
| 20030154239 | Davis et al. | Aug 2003 | A1 |
| 20030154284 | Bernardin et al. | Aug 2003 | A1 |
| 20030163722 | Anderson, IV | Aug 2003 | A1 |
| 20030172145 | Nguyen | Sep 2003 | A1 |
| 20030172183 | Anderson, IV et al. | Sep 2003 | A1 |
| 20030172291 | Judge et al. | Sep 2003 | A1 |
| 20030174648 | Wang et al. | Sep 2003 | A1 |
| 20030177321 | Watanabe | Sep 2003 | A1 |
| 20030182305 | Balva et al. | Sep 2003 | A1 |
| 20030182413 | Allen et al. | Sep 2003 | A1 |
| 20030182447 | Schilling | Sep 2003 | A1 |
| 20030187935 | Agarwalla et al. | Oct 2003 | A1 |
| 20030187970 | Chase et al. | Oct 2003 | A1 |
| 20030191822 | Leighton et al. | Oct 2003 | A1 |
| 20030200394 | Ashmore et al. | Oct 2003 | A1 |
| 20030204602 | Hudson et al. | Oct 2003 | A1 |
| 20030206520 | Wu et al. | Nov 2003 | A1 |
| 20030221000 | Cherkasova et al. | Nov 2003 | A1 |
| 20030229682 | Day | Dec 2003 | A1 |
| 20030233423 | Dilley et al. | Dec 2003 | A1 |
| 20030233445 | Levy et al. | Dec 2003 | A1 |
| 20030233455 | Leber et al. | Dec 2003 | A1 |
| 20030236700 | Arning et al. | Dec 2003 | A1 |
| 20030236779 | Choi et al. | Dec 2003 | A1 |
| 20040003032 | Ma et al. | Jan 2004 | A1 |
| 20040010562 | Itonaga | Jan 2004 | A1 |
| 20040010563 | Forte et al. | Jan 2004 | A1 |
| 20040010588 | Slater et al. | Jan 2004 | A1 |
| 20040010601 | Afergan | Jan 2004 | A1 |
| 20040010621 | Afergan et al. | Jan 2004 | A1 |
| 20040010683 | Huitema | Jan 2004 | A1 |
| 20040015584 | Cartmell et al. | Jan 2004 | A1 |
| 20040019518 | Abraham et al. | Jan 2004 | A1 |
| 20040024841 | Becker et al. | Feb 2004 | A1 |
| 20040030620 | Benjamin et al. | Feb 2004 | A1 |
| 20040032278 | Orii et al. | Feb 2004 | A1 |
| 20040034744 | Karlsson et al. | Feb 2004 | A1 |
| 20040039798 | Hotz et al. | Feb 2004 | A1 |
| 20040044731 | Chen et al. | Mar 2004 | A1 |
| 20040044791 | Pouzzner | Mar 2004 | A1 |
| 20040054757 | Ueda et al. | Mar 2004 | A1 |
| 20040059805 | Dinker et al. | Mar 2004 | A1 |
| 20040064335 | Yang | Apr 2004 | A1 |
| 20040064501 | Jan et al. | Apr 2004 | A1 |
| 20040068542 | Lalonde et al. | Apr 2004 | A1 |
| 20040073596 | Kloninger et al. | Apr 2004 | A1 |
| 20040073707 | Dillon | Apr 2004 | A1 |
| 20040073867 | Kausik et al. | Apr 2004 | A1 |
| 20040078468 | Hedin et al. | Apr 2004 | A1 |
| 20040078487 | Cernohous et al. | Apr 2004 | A1 |
| 20040083283 | Sundaram et al. | Apr 2004 | A1 |
| 20040083307 | Uysal | Apr 2004 | A1 |
| 20040098478 | Koetke et al. | May 2004 | A1 |
| 20040105544 | Haneda et al. | Jun 2004 | A1 |
| 20040114579 | Karaoguz et al. | Jun 2004 | A1 |
| 20040117309 | Inoue et al. | Jun 2004 | A1 |
| 20040117455 | Kaminksy et al. | Jun 2004 | A1 |
| 20040128344 | Trossen | Jul 2004 | A1 |
| 20040128346 | Melamed et al. | Jul 2004 | A1 |
| 20040148520 | Talpade et al. | Jul 2004 | A1 |
| 20040167981 | Douglas et al. | Aug 2004 | A1 |
| 20040167982 | Cohen et al. | Aug 2004 | A1 |
| 20040170379 | Yao et al. | Sep 2004 | A1 |
| 20040172466 | Douglas et al. | Sep 2004 | A1 |
| 20040184456 | Binding et al. | Sep 2004 | A1 |
| 20040194085 | Beaubien et al. | Sep 2004 | A1 |
| 20040194102 | Neerdaels | Sep 2004 | A1 |
| 20040203630 | Wang | Oct 2004 | A1 |
| 20040205149 | Dillon et al. | Oct 2004 | A1 |
| 20040205162 | Parikh | Oct 2004 | A1 |
| 20040205374 | Poletto et al. | Oct 2004 | A1 |
| 20040215823 | Kleinfelter et al. | Oct 2004 | A1 |
| 20040221019 | Swildens et al. | Nov 2004 | A1 |
| 20040221034 | Kausik et al. | Nov 2004 | A1 |
| 20040246948 | Lee et al. | Dec 2004 | A1 |
| 20040249939 | Amini et al. | Dec 2004 | A1 |
| 20040249971 | Klinker | Dec 2004 | A1 |
| 20040249975 | Tuck et al. | Dec 2004 | A1 |
| 20040250119 | Shelest et al. | Dec 2004 | A1 |
| 20040254921 | Cohen et al. | Dec 2004 | A1 |
| 20040260769 | Yamamoto | Dec 2004 | A1 |
| 20040267906 | Truty | Dec 2004 | A1 |
| 20040267907 | Gustafsson | Dec 2004 | A1 |
| 20050010653 | McCanne | Jan 2005 | A1 |
| 20050015471 | Zhang et al. | Jan 2005 | A1 |
| 20050021706 | Maggi et al. | Jan 2005 | A1 |
| 20050021862 | Schroeder et al. | Jan 2005 | A1 |
| 20050027882 | Sullivan et al. | Feb 2005 | A1 |
| 20050038967 | Umbehocker et al. | Feb 2005 | A1 |
| 20050039019 | Delany | Feb 2005 | A1 |
| 20050044270 | Grove et al. | Feb 2005 | A1 |
| 20050102683 | Branson et al. | May 2005 | A1 |
| 20050108169 | Balasubramanian et al. | May 2005 | A1 |
| 20050108262 | Fawcett | May 2005 | A1 |
| 20050108529 | Juneau | May 2005 | A1 |
| 20050114296 | Farber et al. | May 2005 | A1 |
| 20050117717 | Lumsden | Jun 2005 | A1 |
| 20050132083 | Raciborski et al. | Jun 2005 | A1 |
| 20050147088 | Bao et al. | Jul 2005 | A1 |
| 20050149529 | Gutmans | Jul 2005 | A1 |
| 20050157712 | Rangarajan et al. | Jul 2005 | A1 |
| 20050160133 | Greenlee et al. | Jul 2005 | A1 |
| 20050163168 | Sheth et al. | Jul 2005 | A1 |
| 20050168782 | Kobashi et al. | Aug 2005 | A1 |
| 20050171959 | Deforche et al. | Aug 2005 | A1 |
| 20050172080 | Miyauchi | Aug 2005 | A1 |
| 20050174989 | Chen et al. | Aug 2005 | A1 |
| 20050181769 | Kogawa | Aug 2005 | A1 |
| 20050188073 | Nakamichi et al. | Aug 2005 | A1 |
| 20050192814 | Challener et al. | Aug 2005 | A1 |
| 20050192008 | Desai et al. | Sep 2005 | A1 |
| 20050198170 | LeMay et al. | Sep 2005 | A1 |
| 20050198200 | Subramanian et al. | Sep 2005 | A1 |
| 20050198303 | Knauerhase et al. | Sep 2005 | A1 |
| 20050198334 | Farber et al. | Sep 2005 | A1 |
| 20050198453 | Osaki | Sep 2005 | A1 |
| 20050198571 | Kramer et al. | Sep 2005 | A1 |
| 20050201302 | Gaddis et al. | Sep 2005 | A1 |
| 20050216483 | Armstrong et al. | Sep 2005 | A1 |
| 20050216569 | Coppola et al. | Sep 2005 | A1 |
| 20050216674 | Robbin et al. | Sep 2005 | A1 |
| 20050223095 | Volz et al. | Oct 2005 | A1 |
| 20050228856 | Swildens et al. | Oct 2005 | A1 |
| 20050229119 | Torvinen | Oct 2005 | A1 |
| 20050232165 | Brawn et al. | Oct 2005 | A1 |
| 20050234864 | Shapiro | Oct 2005 | A1 |
| 20050240574 | Challenger et al. | Oct 2005 | A1 |
| 20050256880 | Nam Koong et al. | Nov 2005 | A1 |
| 20050259645 | Chen et al. | Nov 2005 | A1 |
| 20050259672 | Eduri | Nov 2005 | A1 |
| 20050262248 | Jennings, III et al. | Nov 2005 | A1 |
| 20050266835 | Agrawal et al. | Dec 2005 | A1 |
| 20050267928 | Anderson et al. | Dec 2005 | A1 |
| 20050267937 | Daniels et al. | Dec 2005 | A1 |
| 20050267991 | Huitema et al. | Dec 2005 | A1 |
| 20050267992 | Huitema et al. | Dec 2005 | A1 |
| 20050267993 | Huitema et al. | Dec 2005 | A1 |
| 20050278259 | Gunaseelan et al. | Dec 2005 | A1 |
| 20050283759 | Peteanu et al. | Dec 2005 | A1 |
| 20050283784 | Suzuki | Dec 2005 | A1 |
| 20050286564 | Hatley et al. | Dec 2005 | A1 |
| 20060005014 | Aura et al. | Jan 2006 | A1 |
| 20060013158 | Ahuja et al. | Jan 2006 | A1 |
| 20060020596 | Liu et al. | Jan 2006 | A1 |
| 20060020684 | Mukherjee et al. | Jan 2006 | A1 |
| 20060020714 | Girouard et al. | Jan 2006 | A1 |
| 20060020715 | Jungck | Jan 2006 | A1 |
| 20060021001 | Giles et al. | Jan 2006 | A1 |
| 20060026067 | Nicholas et al. | Feb 2006 | A1 |
| 20060026154 | Altinel et al. | Feb 2006 | A1 |
| 20060031239 | Koenig | Feb 2006 | A1 |
| 20060031319 | Nelson et al. | Feb 2006 | A1 |
| 20060031503 | Gilbert | Feb 2006 | A1 |
| 20060034494 | Holloran | Feb 2006 | A1 |
| 20060036720 | Faulk, Jr. | Feb 2006 | A1 |
| 20060036966 | Yevdayev | Feb 2006 | A1 |
| 20060037037 | Miranz | Feb 2006 | A1 |
| 20060039352 | Karstens | Feb 2006 | A1 |
| 20060041614 | Oe | Feb 2006 | A1 |
| 20060045005 | Blackmore et al. | Mar 2006 | A1 |
| 20060047787 | Aggarwal et al. | Mar 2006 | A1 |
| 20060047813 | Aggarwal et al. | Mar 2006 | A1 |
| 20060059246 | Grove | Mar 2006 | A1 |
| 20060063534 | Kokkonen et al. | Mar 2006 | A1 |
| 20060064476 | Decasper et al. | Mar 2006 | A1 |
| 20060064500 | Roth et al. | Mar 2006 | A1 |
| 20060070060 | Tantawi et al. | Mar 2006 | A1 |
| 20060074750 | Clark et al. | Apr 2006 | A1 |
| 20060075084 | Lyon | Apr 2006 | A1 |
| 20060075139 | Jungck | Apr 2006 | A1 |
| 20060083165 | McLane et al. | Apr 2006 | A1 |
| 20060085536 | Meyer et al. | Apr 2006 | A1 |
| 20060088026 | Mazur et al. | Apr 2006 | A1 |
| 20060106938 | Dini et al. | May 2006 | A1 |
| 20060107036 | Randle et al. | May 2006 | A1 |
| 20060112066 | Hamzy | May 2006 | A1 |
| 20060112176 | Liu et al. | May 2006 | A1 |
| 20060120385 | Atchison et al. | Jun 2006 | A1 |
| 20060129665 | Toebes et al. | Jun 2006 | A1 |
| 20060129766 | Cassia et al. | Jun 2006 | A1 |
| 20060136453 | Kwan | Jun 2006 | A1 |
| 20060143293 | Freedman | Jun 2006 | A1 |
| 20060143442 | Smith | Jun 2006 | A1 |
| 20060146820 | Friedman et al. | Jul 2006 | A1 |
| 20060149529 | Nguyen et al. | Jul 2006 | A1 |
| 20060155823 | Tran et al. | Jul 2006 | A1 |
| 20060155862 | Kathi et al. | Jul 2006 | A1 |
| 20060161541 | Cencini | Jul 2006 | A1 |
| 20060165051 | Banerjee et al. | Jul 2006 | A1 |
| 20060168088 | Leighton et al. | Jul 2006 | A1 |
| 20060173957 | Robinson | Aug 2006 | A1 |
| 20060179080 | Meek et al. | Aug 2006 | A1 |
| 20060184936 | Abels et al. | Aug 2006 | A1 |
| 20060188097 | Taniguchi et al. | Aug 2006 | A1 |
| 20060190605 | Franz et al. | Aug 2006 | A1 |
| 20060193247 | Naseh et al. | Aug 2006 | A1 |
| 20060195866 | Thukral | Aug 2006 | A1 |
| 20060206568 | Verma et al. | Sep 2006 | A1 |
| 20060206586 | Ling et al. | Sep 2006 | A1 |
| 20060218265 | Farber et al. | Sep 2006 | A1 |
| 20060218304 | Mukherjee et al. | Sep 2006 | A1 |
| 20060221971 | Andrieux et al. | Sep 2006 | A1 |
| 20060224752 | Parekh et al. | Oct 2006 | A1 |
| 20060227740 | McLaughlin et al. | Oct 2006 | A1 |
| 20060227758 | Rana et al. | Oct 2006 | A1 |
| 20060230137 | Gare et al. | Oct 2006 | A1 |
| 20060230265 | Krishna | Oct 2006 | A1 |
| 20060233155 | Srivastava | Oct 2006 | A1 |
| 20060242227 | Rao | Oct 2006 | A1 |
| 20060253546 | Chang et al. | Nov 2006 | A1 |
| 20060253609 | Andreev et al. | Nov 2006 | A1 |
| 20060259581 | Piersol | Nov 2006 | A1 |
| 20060259690 | Vittal et al. | Nov 2006 | A1 |
| 20060259984 | Juneau | Nov 2006 | A1 |
| 20060265497 | Ohata et al. | Nov 2006 | A1 |
| 20060265508 | Angel et al. | Nov 2006 | A1 |
| 20060265516 | Schilling | Nov 2006 | A1 |
| 20060265720 | Cai et al. | Nov 2006 | A1 |
| 20060271641 | Stavrakos et al. | Nov 2006 | A1 |
| 20060282522 | Lewin et al. | Dec 2006 | A1 |
| 20060288119 | Kim et al. | Dec 2006 | A1 |
| 20060288424 | Saito | Dec 2006 | A1 |
| 20070005689 | Leighton et al. | Jan 2007 | A1 |
| 20070005801 | Kumar et al. | Jan 2007 | A1 |
| 20070005892 | Mullender et al. | Jan 2007 | A1 |
| 20070011267 | Overton et al. | Jan 2007 | A1 |
| 20070014241 | Banerjee et al. | Jan 2007 | A1 |
| 20070021998 | Laithwaite et al. | Jan 2007 | A1 |
| 20070028001 | Phillips et al. | Feb 2007 | A1 |
| 20070038729 | Sullivan et al. | Feb 2007 | A1 |
| 20070038994 | Davis et al. | Feb 2007 | A1 |
| 20070041393 | Westhead et al. | Feb 2007 | A1 |
| 20070043667 | Qawami et al. | Feb 2007 | A1 |
| 20070043859 | Ruul | Feb 2007 | A1 |
| 20070050522 | Grove et al. | Mar 2007 | A1 |
| 20070050703 | Lebel | Mar 2007 | A1 |
| 20070055764 | Dilley et al. | Mar 2007 | A1 |
| 20070055765 | Lisiecki et al. | Mar 2007 | A1 |
| 20070061440 | Sundaram et al. | Mar 2007 | A1 |
| 20070064610 | Khandani | Mar 2007 | A1 |
| 20070076872 | Juneau | Apr 2007 | A1 |
| 20070086429 | Lawrence et al. | Apr 2007 | A1 |
| 20070094361 | Hoynowski et al. | Apr 2007 | A1 |
| 20070101061 | Baskaran et al. | May 2007 | A1 |
| 20070101377 | Six et al. | May 2007 | A1 |
| 20070118667 | McCarthy et al. | May 2007 | A1 |
| 20070118668 | McCarthy et al. | May 2007 | A1 |
| 20070124309 | Takase et al. | May 2007 | A1 |
| 20070134641 | Lieu | Jun 2007 | A1 |
| 20070156726 | Levy | Jul 2007 | A1 |
| 20070156919 | Potti et al. | Jul 2007 | A1 |
| 20070162331 | Sullivan | Jul 2007 | A1 |
| 20070168336 | Ransil et al. | Jul 2007 | A1 |
| 20070168517 | Weller | Jul 2007 | A1 |
| 20070174426 | Swildens et al. | Jul 2007 | A1 |
| 20070174442 | Sherman et al. | Jul 2007 | A1 |
| 20070174490 | Choi et al. | Jul 2007 | A1 |
| 20070183342 | Wong et al. | Aug 2007 | A1 |
| 20070198982 | Bolan et al. | Aug 2007 | A1 |
| 20070204107 | Greenfield et al. | Aug 2007 | A1 |
| 20070208737 | Li et al. | Sep 2007 | A1 |
| 20070214232 | Belimpasakis et al. | Sep 2007 | A1 |
| 20070219795 | Park et al. | Sep 2007 | A1 |
| 20070220010 | Ertugrul | Sep 2007 | A1 |
| 20070226294 | Pruitt et al. | Sep 2007 | A1 |
| 20070233705 | Farber et al. | Oct 2007 | A1 |
| 20070233706 | Farber et al. | Oct 2007 | A1 |
| 20070233846 | Farber et al. | Oct 2007 | A1 |
| 20070233884 | Farber et al. | Oct 2007 | A1 |
| 20070233896 | Hilt et al. | Oct 2007 | A1 |
| 20070242824 | Vishik | Oct 2007 | A1 |
| 20070243860 | Aiello et al. | Oct 2007 | A1 |
| 20070244964 | Challenger et al. | Oct 2007 | A1 |
| 20070245022 | Olliphant et al. | Oct 2007 | A1 |
| 20070250467 | Mesnik et al. | Oct 2007 | A1 |
| 20070250468 | Pieper | Oct 2007 | A1 |
| 20070250560 | Wein et al. | Oct 2007 | A1 |
| 20070250601 | Amlekar et al. | Oct 2007 | A1 |
| 20070250611 | Bhogal et al. | Oct 2007 | A1 |
| 20070253377 | Janneteau et al. | Nov 2007 | A1 |
| 20070255843 | Zubev | Nov 2007 | A1 |
| 20070263604 | Tal | Nov 2007 | A1 |
| 20070266113 | Koopmans et al. | Nov 2007 | A1 |
| 20070266311 | Westphal | Nov 2007 | A1 |
| 20070266333 | Cossey et al. | Nov 2007 | A1 |
| 20070270165 | Poosala | Nov 2007 | A1 |
| 20070271375 | Hwang | Nov 2007 | A1 |
| 20070271385 | Davis et al. | Nov 2007 | A1 |
| 20070271560 | Wahlert et al. | Nov 2007 | A1 |
| 20070271608 | Shimizu et al. | Nov 2007 | A1 |
| 20070280197 | Pearlman et al. | Nov 2007 | A1 |
| 20070280229 | Kenney | Dec 2007 | A1 |
| 20070281689 | Altman et al. | Dec 2007 | A1 |
| 20070288588 | Wein et al. | Dec 2007 | A1 |
| 20070291739 | Sullivan et al. | Dec 2007 | A1 |
| 20070294419 | Ulevitch | Dec 2007 | A1 |
| 20080005057 | Ozzie et al. | Jan 2008 | A1 |
| 20080008089 | Bornstein et al. | Jan 2008 | A1 |
| 20080016233 | Schneider | Jan 2008 | A1 |
| 20080025304 | Venkataswami et al. | Jan 2008 | A1 |
| 20080028463 | Dagon et al. | Jan 2008 | A1 |
| 20080037536 | Padmanabhan et al. | Feb 2008 | A1 |
| 20080046550 | Mazur et al. | Feb 2008 | A1 |
| 20080046596 | Afergan et al. | Feb 2008 | A1 |
| 20080049615 | Bugenhagen | Feb 2008 | A1 |
| 20080056207 | Eriksson et al. | Mar 2008 | A1 |
| 20080062997 | Nix | Mar 2008 | A1 |
| 20080065724 | Seed et al. | Mar 2008 | A1 |
| 20080065745 | Leighton et al. | Mar 2008 | A1 |
| 20080066072 | Yurekli et al. | Mar 2008 | A1 |
| 20080071859 | Seed et al. | Mar 2008 | A1 |
| 20080071987 | Karn et al. | Mar 2008 | A1 |
| 20080072264 | Crayford | Mar 2008 | A1 |
| 20080082551 | Farber et al. | Apr 2008 | A1 |
| 20080082662 | Dandliker et al. | Apr 2008 | A1 |
| 20080086434 | Chesla | Apr 2008 | A1 |
| 20080086559 | Davis et al. | Apr 2008 | A1 |
| 20080086574 | Raciborski et al. | Apr 2008 | A1 |
| 20080092242 | Rowley | Apr 2008 | A1 |
| 20080101358 | Van Ewijk et al. | May 2008 | A1 |
| 20080103805 | Shear et al. | May 2008 | A1 |
| 20080104268 | Farber et al. | May 2008 | A1 |
| 20080109679 | Wright et al. | May 2008 | A1 |
| 20080114829 | Button et al. | May 2008 | A1 |
| 20080125077 | Velazquez et al. | May 2008 | A1 |
| 20080126706 | Newport et al. | May 2008 | A1 |
| 20080134043 | Georgis et al. | Jun 2008 | A1 |
| 20080140800 | Farber et al. | Jun 2008 | A1 |
| 20080147866 | Stolorz et al. | Jun 2008 | A1 |
| 20080147873 | Matsumoto | Jun 2008 | A1 |
| 20080155059 | Hardin et al. | Jun 2008 | A1 |
| 20080155061 | Afergan et al. | Jun 2008 | A1 |
| 20080155613 | Benya et al. | Jun 2008 | A1 |
| 20080155614 | Cooper et al. | Jun 2008 | A1 |
| 20080155694 | Kwon et al. | Jun 2008 | A1 |
| 20080162667 | Verma et al. | Jul 2008 | A1 |
| 20080162821 | Duran et al. | Jul 2008 | A1 |
| 20080162843 | Davis et al. | Jul 2008 | A1 |
| 20080172488 | Jawahar et al. | Jul 2008 | A1 |
| 20080184357 | Drako et al. | Jul 2008 | A1 |
| 20080189437 | Halley | Aug 2008 | A1 |
| 20080201332 | Souders et al. | Aug 2008 | A1 |
| 20080201401 | Pugh et al. | Aug 2008 | A1 |
| 20080215718 | Stolorz et al. | Sep 2008 | A1 |
| 20080215730 | Sundaram et al. | Sep 2008 | A1 |
| 20080215735 | Farber et al. | Sep 2008 | A1 |
| 20080215747 | Menon et al. | Sep 2008 | A1 |
| 20080215750 | Farber et al. | Sep 2008 | A1 |
| 20080215755 | Farber et al. | Sep 2008 | A1 |
| 20080222281 | Dilley et al. | Sep 2008 | A1 |
| 20080222291 | Weller et al. | Sep 2008 | A1 |
| 20080222295 | Robinson et al. | Sep 2008 | A1 |
| 20080222647 | Taylor et al. | Sep 2008 | A1 |
| 20080225779 | Bragiel et al. | Sep 2008 | A1 |
| 20080228574 | Stewart et al. | Sep 2008 | A1 |
| 20080228920 | Souders et al. | Sep 2008 | A1 |
| 20080235383 | Schneider | Sep 2008 | A1 |
| 20080235400 | Slocombe et al. | Sep 2008 | A1 |
| 20080256087 | Piironen et al. | Oct 2008 | A1 |
| 20080256175 | Lee et al. | Oct 2008 | A1 |
| 20080263135 | Olliphant | Oct 2008 | A1 |
| 20080270882 | Rollins et al. | Oct 2008 | A1 |
| 20080275772 | Suryanarayana et al. | Nov 2008 | A1 |
| 20080281946 | Swildens et al. | Nov 2008 | A1 |
| 20080281950 | Wald et al. | Nov 2008 | A1 |
| 20080288458 | Sun et al. | Nov 2008 | A1 |
| 20080288722 | Lecoq et al. | Nov 2008 | A1 |
| 20080301670 | Gouge et al. | Dec 2008 | A1 |
| 20080312766 | Couckuyt | Dec 2008 | A1 |
| 20080319862 | Golan et al. | Dec 2008 | A1 |
| 20080320123 | Houlihan et al. | Dec 2008 | A1 |
| 20080320269 | Houlihan et al. | Dec 2008 | A1 |
| 20090013063 | Soman | Jan 2009 | A1 |
| 20090016236 | Alcala et al. | Jan 2009 | A1 |
| 20090029644 | Sue et al. | Jan 2009 | A1 |
| 20090031042 | Phatak | Jan 2009 | A1 |
| 20090031367 | Sue | Jan 2009 | A1 |
| 20090031368 | Ling | Jan 2009 | A1 |
| 20090031376 | Riley et al. | Jan 2009 | A1 |
| 20090043900 | Barber | Feb 2009 | A1 |
| 20090049098 | Pickelsimer et al. | Feb 2009 | A1 |
| 20090063038 | Shrivathsan et al. | Mar 2009 | A1 |
| 20090063704 | Taylor et al. | Mar 2009 | A1 |
| 20090070533 | Elazary et al. | Mar 2009 | A1 |
| 20090083228 | Shatz et al. | Mar 2009 | A1 |
| 20090083279 | Hasek | Mar 2009 | A1 |
| 20090083413 | Levow et al. | Mar 2009 | A1 |
| 20090086728 | Gulati et al. | Apr 2009 | A1 |
| 20090086741 | Zhang | Apr 2009 | A1 |
| 20090089869 | Varghese | Apr 2009 | A1 |
| 20090094252 | Wong et al. | Apr 2009 | A1 |
| 20090103707 | McGary et al. | Apr 2009 | A1 |
| 20090106202 | Mizrahi | Apr 2009 | A1 |
| 20090106381 | Kasriel et al. | Apr 2009 | A1 |
| 20090112703 | Brown | Apr 2009 | A1 |
| 20090125393 | Hwang et al. | May 2009 | A1 |
| 20090125934 | Jones et al. | May 2009 | A1 |
| 20090132368 | Cotter et al. | May 2009 | A1 |
| 20090132640 | Verma et al. | May 2009 | A1 |
| 20090132648 | Swildens et al. | May 2009 | A1 |
| 20090138533 | Iwasaki et al. | May 2009 | A1 |
| 20090138582 | Turk | May 2009 | A1 |
| 20090144411 | Winkler et al. | Jun 2009 | A1 |
| 20090144412 | Ferguson et al. | Jun 2009 | A1 |
| 20090150926 | Schlack | Jun 2009 | A1 |
| 20090157504 | Braemer et al. | Jun 2009 | A1 |
| 20090157850 | Gagliardi et al. | Jun 2009 | A1 |
| 20090158163 | Stephens et al. | Jun 2009 | A1 |
| 20090164331 | Bishop et al. | Jun 2009 | A1 |
| 20090164614 | Christian et al. | Jun 2009 | A1 |
| 20090172167 | Drai et al. | Jul 2009 | A1 |
| 20090177667 | Ramos et al. | Jul 2009 | A1 |
| 20090182815 | Czechowski et al. | Jul 2009 | A1 |
| 20090182837 | Rogers | Jul 2009 | A1 |
| 20090182945 | Aviles et al. | Jul 2009 | A1 |
| 20090187575 | DaCosta | Jul 2009 | A1 |
| 20090198817 | Sundaram et al. | Aug 2009 | A1 |
| 20090204682 | Jeyaseelan et al. | Aug 2009 | A1 |
| 20090210549 | Hudson et al. | Aug 2009 | A1 |
| 20090228708 | Trostle | Sep 2009 | A1 |
| 20090233623 | Johnson | Sep 2009 | A1 |
| 20090241167 | Moore | Sep 2009 | A1 |
| 20090248697 | Richardson et al. | Oct 2009 | A1 |
| 20090248786 | Richardson et al. | Oct 2009 | A1 |
| 20090248787 | Sivasubramanian et al. | Oct 2009 | A1 |
| 20090248852 | Fuhrmann et al. | Oct 2009 | A1 |
| 20090248858 | Sivasubramanian et al. | Oct 2009 | A1 |
| 20090248893 | Richardson et al. | Oct 2009 | A1 |
| 20090249222 | Schmidt et al. | Oct 2009 | A1 |
| 20090253435 | Olofsson | Oct 2009 | A1 |
| 20090254661 | Fullagar et al. | Oct 2009 | A1 |
| 20090254989 | Achan et al. | Oct 2009 | A1 |
| 20090259588 | Lindsay | Oct 2009 | A1 |
| 20090259971 | Rankine et al. | Oct 2009 | A1 |
| 20090262741 | Jungck et al. | Oct 2009 | A1 |
| 20090265707 | Goodman et al. | Oct 2009 | A1 |
| 20090265786 | Xie et al. | Oct 2009 | A1 |
| 20090271498 | Cable | Oct 2009 | A1 |
| 20090271577 | Campana et al. | Oct 2009 | A1 |
| 20090271730 | Rose et al. | Oct 2009 | A1 |
| 20090276771 | Nickolov et al. | Nov 2009 | A1 |
| 20090279444 | Ravindran et al. | Nov 2009 | A1 |
| 20090282038 | Subotin et al. | Nov 2009 | A1 |
| 20090287750 | Banavar et al. | Nov 2009 | A1 |
| 20090307307 | Igarashi | Dec 2009 | A1 |
| 20090327489 | Swildens et al. | Dec 2009 | A1 |
| 20090327517 | Sivasubramanian et al. | Dec 2009 | A1 |
| 20090327914 | Adar et al. | Dec 2009 | A1 |
| 20100005175 | Swildens et al. | Jan 2010 | A1 |
| 20100011061 | Hudson et al. | Jan 2010 | A1 |
| 20100011126 | Hsu et al. | Jan 2010 | A1 |
| 20100020699 | On | Jan 2010 | A1 |
| 20100023601 | Lewin et al. | Jan 2010 | A1 |
| 20100023621 | Ezolt et al. | Jan 2010 | A1 |
| 20100030662 | Klein | Feb 2010 | A1 |
| 20100030914 | Sparks et al. | Feb 2010 | A1 |
| 20100034470 | Valencia-Campo et al. | Feb 2010 | A1 |
| 20100036944 | Douglis et al. | Feb 2010 | A1 |
| 20100037314 | Perdisci et al. | Feb 2010 | A1 |
| 20100042725 | Jeon et al. | Feb 2010 | A1 |
| 20100049862 | Dixon | Feb 2010 | A1 |
| 20100057894 | Glasser | Mar 2010 | A1 |
| 20100058352 | Esfahany et al. | Mar 2010 | A1 |
| 20100070603 | Moss et al. | Mar 2010 | A1 |
| 20100070700 | Borst et al. | Mar 2010 | A1 |
| 20100074268 | Raza | Mar 2010 | A1 |
| 20100082320 | Wood et al. | Apr 2010 | A1 |
| 20100082787 | Kommula et al. | Apr 2010 | A1 |
| 20100088367 | Brown et al. | Apr 2010 | A1 |
| 20100088405 | Huang et al. | Apr 2010 | A1 |
| 20100095008 | Joshi | Apr 2010 | A1 |
| 20100100629 | Raciborski et al. | Apr 2010 | A1 |
| 20100103837 | Jungck et al. | Apr 2010 | A1 |
| 20100106934 | Calder et al. | Apr 2010 | A1 |
| 20100111059 | Beppu et al. | May 2010 | A1 |
| 20100115133 | Joshi | May 2010 | A1 |
| 20100115342 | Shigeta et al. | May 2010 | A1 |
| 20100121953 | Friedman et al. | May 2010 | A1 |
| 20100121981 | Drako | May 2010 | A1 |
| 20100122069 | Gonion | May 2010 | A1 |
| 20100125626 | Lucas et al. | May 2010 | A1 |
| 20100125673 | Richardson et al. | May 2010 | A1 |
| 20100125675 | Richardson et al. | May 2010 | A1 |
| 20100131646 | Drako | May 2010 | A1 |
| 20100138559 | Sullivan et al. | Jun 2010 | A1 |
| 20100150155 | Napierala | Jun 2010 | A1 |
| 20100161564 | Lee et al. | Jun 2010 | A1 |
| 20100161565 | Lee et al. | Jun 2010 | A1 |
| 20100161799 | Maloo | Jun 2010 | A1 |
| 20100169392 | Lev Ran et al. | Jul 2010 | A1 |
| 20100169452 | Atluri et al. | Jul 2010 | A1 |
| 20100174811 | Musiri et al. | Jul 2010 | A1 |
| 20100191854 | Isci et al. | Jul 2010 | A1 |
| 20100192225 | Ma et al. | Jul 2010 | A1 |
| 20100217801 | Leighton et al. | Aug 2010 | A1 |
| 20100217856 | Falkena | Aug 2010 | A1 |
| 20100223364 | Wei | Sep 2010 | A1 |
| 20100226372 | Watanabe | Sep 2010 | A1 |
| 20100228819 | Wei | Sep 2010 | A1 |
| 20100235915 | Memon et al. | Sep 2010 | A1 |
| 20100250710 | Cadwell et al. | Sep 2010 | A1 |
| 20100257024 | Holmes et al. | Oct 2010 | A1 |
| 20100257266 | Holmes et al. | Oct 2010 | A1 |
| 20100257566 | Matila | Oct 2010 | A1 |
| 20100262964 | Uyeda et al. | Oct 2010 | A1 |
| 20100268789 | Yoo et al. | Oct 2010 | A1 |
| 20100268814 | Cross et al. | Oct 2010 | A1 |
| 20100274765 | Murphy et al. | Oct 2010 | A1 |
| 20100281482 | Pike et al. | Nov 2010 | A1 |
| 20100293296 | Hsu et al. | Nov 2010 | A1 |
| 20100293479 | Rousso et al. | Nov 2010 | A1 |
| 20100299427 | Joshi | Nov 2010 | A1 |
| 20100299438 | Zimmerman et al. | Nov 2010 | A1 |
| 20100299439 | McCarthy et al. | Nov 2010 | A1 |
| 20100306382 | Cardosa et al. | Nov 2010 | A1 |
| 20100312861 | Kolhi et al. | Dec 2010 | A1 |
| 20100318508 | Brawer et al. | Dec 2010 | A1 |
| 20100322255 | Hao et al. | Dec 2010 | A1 |
| 20100325365 | Colglazier et al. | Dec 2010 | A1 |
| 20100332595 | Fullagar et al. | Dec 2010 | A1 |
| 20100332601 | Walter et al. | Dec 2010 | A1 |
| 20100332658 | Elyashev | Dec 2010 | A1 |
| 20110010244 | Hatridge | Jan 2011 | A1 |
| 20110016214 | Jackson | Jan 2011 | A1 |
| 20110029398 | Boudville | Feb 2011 | A1 |
| 20110029598 | Arnold et al. | Feb 2011 | A1 |
| 20110035469 | Smith et al. | Feb 2011 | A1 |
| 20110040893 | Karaoguz et al. | Feb 2011 | A1 |
| 20110051738 | Xu | Mar 2011 | A1 |
| 20110055386 | Middleton et al. | Mar 2011 | A1 |
| 20110055714 | Vemulapalli et al. | Mar 2011 | A1 |
| 20110055921 | Narayanaswamy et al. | Mar 2011 | A1 |
| 20110057790 | Martin et al. | Mar 2011 | A1 |
| 20110058675 | Brueck et al. | Mar 2011 | A1 |
| 20110072138 | Canturk et al. | Mar 2011 | A1 |
| 20110072366 | Spencer | Mar 2011 | A1 |
| 20110078000 | Ma et al. | Mar 2011 | A1 |
| 20110078230 | Sepulveda | Mar 2011 | A1 |
| 20110082916 | Swanson et al. | Apr 2011 | A1 |
| 20110085654 | Jana et al. | Apr 2011 | A1 |
| 20110087769 | Holmes et al. | Apr 2011 | A1 |
| 20110093584 | Qiu et al. | Apr 2011 | A1 |
| 20110096987 | Morales et al. | Apr 2011 | A1 |
| 20110099294 | Kapur et al. | Apr 2011 | A1 |
| 20110106949 | Patel et al. | May 2011 | A1 |
| 20110113467 | Agarwal et al. | May 2011 | A1 |
| 20110125894 | Anderson et al. | May 2011 | A1 |
| 20110153938 | Verzunov et al. | Jun 2011 | A1 |
| 20110153941 | Spatscheck et al. | Jun 2011 | A1 |
| 20110154318 | Oshins et al. | Jun 2011 | A1 |
| 20110154350 | Doyle et al. | Jun 2011 | A1 |
| 20110161461 | Niven-Jenkins | Jun 2011 | A1 |
| 20110166935 | Armentrout et al. | Jul 2011 | A1 |
| 20110182290 | Perkins | Jul 2011 | A1 |
| 20110191445 | Dazzi | Aug 2011 | A1 |
| 20110191446 | Dazzi et al. | Aug 2011 | A1 |
| 20110191447 | Dazzi et al. | Aug 2011 | A1 |
| 20110191449 | Swildens et al. | Aug 2011 | A1 |
| 20110191459 | Joshi | Aug 2011 | A1 |
| 20110196892 | Xia | Aug 2011 | A1 |
| 20110208876 | Richardson et al. | Aug 2011 | A1 |
| 20110208958 | Stuedi et al. | Aug 2011 | A1 |
| 20110209064 | Jorgensen et al. | Aug 2011 | A1 |
| 20110219120 | Farber et al. | Sep 2011 | A1 |
| 20110219372 | Agarwal et al. | Sep 2011 | A1 |
| 20110238501 | Almeida | Sep 2011 | A1 |
| 20110238793 | Bedare et al. | Sep 2011 | A1 |
| 20110239215 | Sugai | Sep 2011 | A1 |
| 20110252142 | Richardson et al. | Oct 2011 | A1 |
| 20110252143 | Baumback et al. | Oct 2011 | A1 |
| 20110255445 | Johnson et al. | Oct 2011 | A1 |
| 20110258049 | Ramer et al. | Oct 2011 | A1 |
| 20110258614 | Tamm | Oct 2011 | A1 |
| 20110270964 | Huang et al. | Nov 2011 | A1 |
| 20110276623 | Girbal | Nov 2011 | A1 |
| 20110296053 | Medved et al. | Dec 2011 | A1 |
| 20110296370 | Ferris et al. | Dec 2011 | A1 |
| 20110296473 | Babic | Dec 2011 | A1 |
| 20110302304 | Baumback et al. | Dec 2011 | A1 |
| 20110307533 | Saeki | Dec 2011 | A1 |
| 20110320522 | Endres et al. | Dec 2011 | A1 |
| 20110320559 | Foti | Dec 2011 | A1 |
| 20120011190 | Driesen et al. | Jan 2012 | A1 |
| 20120014249 | Mao et al. | Jan 2012 | A1 |
| 20120023090 | Holloway et al. | Jan 2012 | A1 |
| 20120023226 | Petersen et al. | Jan 2012 | A1 |
| 20120031626 | Clayton et al. | Feb 2012 | A1 |
| 20120036238 | Sundaram et al. | Feb 2012 | A1 |
| 20120041899 | Greene et al. | Feb 2012 | A1 |
| 20120041970 | Ghosh et al. | Feb 2012 | A1 |
| 20120042381 | Antonakakis et al. | Feb 2012 | A1 |
| 20120054860 | Wyschogrod et al. | Feb 2012 | A1 |
| 20120066360 | Ghosh | Mar 2012 | A1 |
| 20120072600 | Richardson et al. | Mar 2012 | A1 |
| 20120072608 | Peters et al. | Mar 2012 | A1 |
| 20120078998 | Son et al. | Mar 2012 | A1 |
| 20120079096 | Cowan et al. | Mar 2012 | A1 |
| 20120079115 | Richardson et al. | Mar 2012 | A1 |
| 20120089700 | Safruti et al. | Apr 2012 | A1 |
| 20120089972 | Scheidel et al. | Apr 2012 | A1 |
| 20120096065 | Suit et al. | Apr 2012 | A1 |
| 20120096166 | Devarapalli et al. | Apr 2012 | A1 |
| 20120110515 | Abramoff et al. | May 2012 | A1 |
| 20120117621 | Kondamuru et al. | May 2012 | A1 |
| 20120124184 | Sakata et al. | May 2012 | A1 |
| 20120131177 | Brandt et al. | May 2012 | A1 |
| 20120136697 | Peles et al. | May 2012 | A1 |
| 20120142310 | Pugh et al. | Jun 2012 | A1 |
| 20120143688 | Alexander | Jun 2012 | A1 |
| 20120159476 | Ramteke et al. | Jun 2012 | A1 |
| 20120166516 | Simmons et al. | Jun 2012 | A1 |
| 20120169646 | Berkes et al. | Jul 2012 | A1 |
| 20120173760 | Jog et al. | Jul 2012 | A1 |
| 20120179796 | Nagaraj et al. | Jul 2012 | A1 |
| 20120179817 | Bade et al. | Jul 2012 | A1 |
| 20120179839 | Raciborski et al. | Jul 2012 | A1 |
| 20120198043 | Hesketh et al. | Aug 2012 | A1 |
| 20120198071 | Black et al. | Aug 2012 | A1 |
| 20120204176 | Tian et al. | Aug 2012 | A1 |
| 20120209942 | Zehavi et al. | Aug 2012 | A1 |
| 20120224516 | Stojanovski et al. | Sep 2012 | A1 |
| 20120226649 | Kovacs et al. | Sep 2012 | A1 |
| 20120233329 | Dickinson et al. | Sep 2012 | A1 |
| 20120233522 | Barton et al. | Sep 2012 | A1 |
| 20120233668 | Leafe et al. | Sep 2012 | A1 |
| 20120239725 | Hartrick et al. | Sep 2012 | A1 |
| 20120246129 | Rothschild et al. | Sep 2012 | A1 |
| 20120246257 | Brown | Sep 2012 | A1 |
| 20120254961 | Kim et al. | Oct 2012 | A1 |
| 20120257628 | Bu et al. | Oct 2012 | A1 |
| 20120259954 | McCarthy et al. | Oct 2012 | A1 |
| 20120272224 | Brackman | Oct 2012 | A1 |
| 20120278229 | Vishwanathan et al. | Nov 2012 | A1 |
| 20120278831 | van Coppenolle et al. | Nov 2012 | A1 |
| 20120278833 | Tam | Nov 2012 | A1 |
| 20120297009 | Amir et al. | Nov 2012 | A1 |
| 20120303785 | Sivasubramanian et al. | Nov 2012 | A1 |
| 20120303804 | Sundaram et al. | Nov 2012 | A1 |
| 20120311648 | Swildens et al. | Dec 2012 | A1 |
| 20120317573 | Osogami et al. | Dec 2012 | A1 |
| 20120324089 | Joshi | Dec 2012 | A1 |
| 20130003547 | Motwani et al. | Jan 2013 | A1 |
| 20130003735 | Chao et al. | Jan 2013 | A1 |
| 20130007100 | Trahan et al. | Jan 2013 | A1 |
| 20130007101 | Trahan et al. | Jan 2013 | A1 |
| 20130007102 | Trahan et al. | Jan 2013 | A1 |
| 20130007241 | Trahan et al. | Jan 2013 | A1 |
| 20130007273 | Baumback et al. | Jan 2013 | A1 |
| 20130013764 | Li et al. | Jan 2013 | A1 |
| 20130018945 | Vendrow et al. | Jan 2013 | A1 |
| 20130019311 | Swildens et al. | Jan 2013 | A1 |
| 20130034099 | Hikichi et al. | Feb 2013 | A1 |
| 20130036307 | Gagliano et al. | Feb 2013 | A1 |
| 20130041872 | Aizman et al. | Feb 2013 | A1 |
| 20130042328 | Padinjareveetil | Feb 2013 | A1 |
| 20130046869 | Jenkins et al. | Feb 2013 | A1 |
| 20130046883 | Lientz et al. | Feb 2013 | A1 |
| 20130054675 | Jenkins et al. | Feb 2013 | A1 |
| 20130055374 | Kustarz et al. | Feb 2013 | A1 |
| 20130061306 | Sinn | Mar 2013 | A1 |
| 20130067530 | Spektor et al. | Mar 2013 | A1 |
| 20130073808 | Puthalath et al. | Mar 2013 | A1 |
| 20130080420 | Taylor et al. | Mar 2013 | A1 |
| 20130080421 | Taylor et al. | Mar 2013 | A1 |
| 20130080576 | Taylor et al. | Mar 2013 | A1 |
| 20130080577 | Taylor et al. | Mar 2013 | A1 |
| 20130080623 | Thireault | Mar 2013 | A1 |
| 20130080627 | Kukreja et al. | Mar 2013 | A1 |
| 20130080636 | Friedman et al. | Mar 2013 | A1 |
| 20130084898 | Li et al. | Apr 2013 | A1 |
| 20130086001 | Bhogal et al. | Apr 2013 | A1 |
| 20130089005 | Li et al. | Apr 2013 | A1 |
| 20130111035 | Alapati et al. | May 2013 | A1 |
| 20130117282 | Mugali, Jr. et al. | May 2013 | A1 |
| 20130117849 | Golshan et al. | May 2013 | A1 |
| 20130130221 | Kortemeyer et al. | May 2013 | A1 |
| 20130133057 | Yoon et al. | May 2013 | A1 |
| 20130151646 | Chidambaram et al. | Jun 2013 | A1 |
| 20130191499 | Ludin et al. | Jul 2013 | A1 |
| 20130198341 | Kim | Aug 2013 | A1 |
| 20130212300 | Eggleston et al. | Aug 2013 | A1 |
| 20130219020 | McCarthy et al. | Aug 2013 | A1 |
| 20130227165 | Liu | Aug 2013 | A1 |
| 20130246567 | Green et al. | Sep 2013 | A1 |
| 20130254269 | Sivasubramanian et al. | Sep 2013 | A1 |
| 20130254879 | Chesla et al. | Sep 2013 | A1 |
| 20130263256 | Dickinson et al. | Oct 2013 | A1 |
| 20130268616 | Sakata et al. | Oct 2013 | A1 |
| 20130275549 | Field et al. | Oct 2013 | A1 |
| 20130279335 | Ahmadi | Oct 2013 | A1 |
| 20130283266 | Baset et al. | Oct 2013 | A1 |
| 20130305046 | Mankovski et al. | Nov 2013 | A1 |
| 20130305083 | Machida | Nov 2013 | A1 |
| 20130311555 | Laoutaris et al. | Nov 2013 | A1 |
| 20130311583 | Humphreys et al. | Nov 2013 | A1 |
| 20130311605 | Richardson et al. | Nov 2013 | A1 |
| 20130311989 | Ota et al. | Nov 2013 | A1 |
| 20130339429 | Richardson et al. | Dec 2013 | A1 |
| 20130346465 | Maltz et al. | Dec 2013 | A1 |
| 20130346470 | Obstfeld et al. | Dec 2013 | A1 |
| 20130346567 | Richardson et al. | Dec 2013 | A1 |
| 20130346614 | Baughman et al. | Dec 2013 | A1 |
| 20140006465 | Davis et al. | Jan 2014 | A1 |
| 20140006577 | Joe et al. | Jan 2014 | A1 |
| 20140007239 | Sharpe et al. | Jan 2014 | A1 |
| 20140013403 | Shuster | Jan 2014 | A1 |
| 20140019605 | Boberg | Jan 2014 | A1 |
| 20140022951 | Lemieux | Jan 2014 | A1 |
| 20140036675 | Wang et al. | Feb 2014 | A1 |
| 20140040478 | Hsu et al. | Feb 2014 | A1 |
| 20140047104 | Rodriguez | Feb 2014 | A1 |
| 20140053022 | Forgette et al. | Feb 2014 | A1 |
| 20140059198 | Richardson et al. | Feb 2014 | A1 |
| 20140059208 | Yan et al. | Feb 2014 | A1 |
| 20140059379 | Ren et al. | Feb 2014 | A1 |
| 20140082165 | Marr et al. | Mar 2014 | A1 |
| 20140082614 | Klein et al. | Mar 2014 | A1 |
| 20140089917 | Attalla et al. | Mar 2014 | A1 |
| 20140108474 | David et al. | Apr 2014 | A1 |
| 20140108672 | Ou et al. | Apr 2014 | A1 |
| 20140119194 | Raciborski et al. | May 2014 | A1 |
| 20140122698 | Batrouni et al. | May 2014 | A1 |
| 20140122725 | Batrouni et al. | May 2014 | A1 |
| 20140137111 | Dees, Jr. et al. | May 2014 | A1 |
| 20140143305 | Choi et al. | May 2014 | A1 |
| 20140149601 | Carney et al. | May 2014 | A1 |
| 20140164817 | Bartholomy et al. | Jun 2014 | A1 |
| 20140165061 | Greene et al. | Jun 2014 | A1 |
| 20140181268 | Stevens et al. | Jun 2014 | A1 |
| 20140195686 | Yeager et al. | Jul 2014 | A1 |
| 20140200036 | Egner et al. | Jul 2014 | A1 |
| 20140215019 | Ahrens | Jul 2014 | A1 |
| 20140244937 | Bloomstein et al. | Aug 2014 | A1 |
| 20140258523 | Kazerani et al. | Sep 2014 | A1 |
| 20140269371 | Badea et al. | Sep 2014 | A1 |
| 20140279852 | Chen | Sep 2014 | A1 |
| 20140280606 | Long | Sep 2014 | A1 |
| 20140280679 | Dey et al. | Sep 2014 | A1 |
| 20140297866 | Ennaji et al. | Oct 2014 | A1 |
| 20140297870 | Eggleston et al. | Oct 2014 | A1 |
| 20140298021 | Kwon et al. | Oct 2014 | A1 |
| 20140310402 | Giaretta et al. | Oct 2014 | A1 |
| 20140310811 | Hentunen | Oct 2014 | A1 |
| 20140324774 | Chen et al. | Oct 2014 | A1 |
| 20140325155 | Marshall et al. | Oct 2014 | A1 |
| 20140331328 | Wang et al. | Nov 2014 | A1 |
| 20140337472 | Newton et al. | Nov 2014 | A1 |
| 20140351413 | Smith et al. | Nov 2014 | A1 |
| 20140351871 | Bomfim et al. | Nov 2014 | A1 |
| 20150006615 | Wainner et al. | Jan 2015 | A1 |
| 20150019686 | Backholm | Jan 2015 | A1 |
| 20150026407 | Mclellan et al. | Jan 2015 | A1 |
| 20150067171 | Yum | Mar 2015 | A1 |
| 20150074228 | Drake | Mar 2015 | A1 |
| 20150081877 | Sethi et al. | Mar 2015 | A1 |
| 20150088586 | Pavlas et al. | Mar 2015 | A1 |
| 20150088964 | Shiell et al. | Mar 2015 | A1 |
| 20150088972 | Brand et al. | Mar 2015 | A1 |
| 20150089621 | Khalid | Mar 2015 | A1 |
| 20150095516 | Bergman | Mar 2015 | A1 |
| 20150106864 | Li et al. | Apr 2015 | A1 |
| 20150149600 | Thibeault et al. | May 2015 | A1 |
| 20150149631 | Lissack | May 2015 | A1 |
| 20150154051 | Kruglick | Jun 2015 | A1 |
| 20150156172 | Nandi et al. | Jun 2015 | A1 |
| 20150156279 | Vaswani et al. | Jun 2015 | A1 |
| 20150172379 | Richardson et al. | Jun 2015 | A1 |
| 20150172407 | MacCarthaigh et al. | Jun 2015 | A1 |
| 20150172414 | Richardson et al. | Jun 2015 | A1 |
| 20150172415 | Richardson et al. | Jun 2015 | A1 |
| 20150180995 | Hofmann | Jun 2015 | A1 |
| 20150188734 | Petrov | Jul 2015 | A1 |
| 20150189042 | Sun et al. | Jul 2015 | A1 |
| 20150195244 | Richardson et al. | Jul 2015 | A1 |
| 20150200991 | Kwon | Jul 2015 | A1 |
| 20150207733 | Richardson et al. | Jul 2015 | A1 |
| 20150215388 | Kontothanassis et al. | Jul 2015 | A1 |
| 20150215656 | Pulung et al. | Jul 2015 | A1 |
| 20150229710 | Sivasubramanian et al. | Aug 2015 | A1 |
| 20150242397 | Zhuang | Aug 2015 | A1 |
| 20150244580 | Saavedra | Aug 2015 | A1 |
| 20150256647 | Richardson et al. | Sep 2015 | A1 |
| 20150271031 | Beevers | Sep 2015 | A1 |
| 20150288647 | Chhabra et al. | Oct 2015 | A1 |
| 20150317118 | Orikasa et al. | Nov 2015 | A1 |
| 20150319260 | Watson | Nov 2015 | A1 |
| 20150339136 | Suryanarayanan et al. | Nov 2015 | A1 |
| 20150341431 | Hartrick et al. | Nov 2015 | A1 |
| 20150358276 | Liu et al. | Dec 2015 | A1 |
| 20150358436 | Kim et al. | Dec 2015 | A1 |
| 20150363113 | Rahman et al. | Dec 2015 | A1 |
| 20150363282 | Rangasamy | Dec 2015 | A1 |
| 20160006672 | Saavedra | Jan 2016 | A1 |
| 20160021197 | Pogrebinsky et al. | Jan 2016 | A1 |
| 20160026568 | Marshall et al. | Jan 2016 | A1 |
| 20160028598 | Khakpour et al. | Jan 2016 | A1 |
| 20160028755 | Vasseur et al. | Jan 2016 | A1 |
| 20160036857 | Foxhoven et al. | Feb 2016 | A1 |
| 20160041910 | Richardson et al. | Feb 2016 | A1 |
| 20160065475 | Hilt et al. | Feb 2016 | A1 |
| 20160065665 | Richardson et al. | Mar 2016 | A1 |
| 20160072669 | Saavedra | Mar 2016 | A1 |
| 20160072720 | Richardson et al. | Mar 2016 | A1 |
| 20160104346 | Ovalle et al. | Mar 2016 | A1 |
| 20160132600 | Woodhead et al. | May 2016 | A1 |
| 20160134492 | Ellsworth et al. | May 2016 | A1 |
| 20160142251 | Contreras et al. | May 2016 | A1 |
| 20160164761 | Sathyanarayana et al. | Jun 2016 | A1 |
| 20160164799 | Popli et al. | Jun 2016 | A1 |
| 20160182454 | Phonsa et al. | Jun 2016 | A1 |
| 20160182542 | Staniford | Jun 2016 | A1 |
| 20160205062 | Mosert | Jul 2016 | A1 |
| 20160226895 | Huang | Aug 2016 | A1 |
| 20160241637 | Marr et al. | Aug 2016 | A1 |
| 20160241639 | Brookins et al. | Aug 2016 | A1 |
| 20160253262 | Nadgowda | Sep 2016 | A1 |
| 20160255042 | Newton | Sep 2016 | A1 |
| 20160269927 | Kim et al. | Sep 2016 | A1 |
| 20160274929 | King | Sep 2016 | A1 |
| 20160294678 | Khakpour et al. | Oct 2016 | A1 |
| 20160308959 | Richardson et al. | Oct 2016 | A1 |
| 20160337426 | Shribman et al. | Nov 2016 | A1 |
| 20160366202 | Phillips et al. | Dec 2016 | A1 |
| 20160373789 | Tsukagoshi | Dec 2016 | A1 |
| 20170041428 | Katsev | Feb 2017 | A1 |
| 20170099254 | Leach et al. | Apr 2017 | A1 |
| 20170099345 | Leach | Apr 2017 | A1 |
| 20170109316 | Hack et al. | Apr 2017 | A1 |
| 20170126557 | Richardson et al. | May 2017 | A1 |
| 20170126796 | Hollis et al. | May 2017 | A1 |
| 20170142062 | Richardson et al. | May 2017 | A1 |
| 20170153980 | Araújo et al. | Jun 2017 | A1 |
| 20170155678 | Araújo et al. | Jun 2017 | A1 |
| 20170155732 | Araùjo et al. | Jun 2017 | A1 |
| 20170163425 | Kaliski, Jr. | Jun 2017 | A1 |
| 20170170973 | Gill et al. | Jun 2017 | A1 |
| 20170171146 | Sharma et al. | Jun 2017 | A1 |
| 20170180217 | Puchala et al. | Jun 2017 | A1 |
| 20170180267 | Puchala et al. | Jun 2017 | A1 |
| 20170214755 | Sivasubramanian et al. | Jul 2017 | A1 |
| 20170214761 | Hsu et al. | Jul 2017 | A1 |
| 20170250821 | Richardson et al. | Aug 2017 | A1 |
| 20170257340 | Richardson et al. | Sep 2017 | A1 |
| 20170262373 | Bedi | Sep 2017 | A1 |
| 20170353395 | Richardson et al. | Dec 2017 | A1 |
| 20170374121 | Phillips et al. | Dec 2017 | A1 |
| 20180011913 | Kapanipathi et al. | Jan 2018 | A1 |
| 20180027040 | Bae | Jan 2018 | A1 |
| 20180063027 | Rafferty | Mar 2018 | A1 |
| 20180063193 | Chandrashekhar et al. | Mar 2018 | A1 |
| 20180077109 | Hoeme et al. | Mar 2018 | A1 |
| 20180077110 | Huston, III et al. | Mar 2018 | A1 |
| 20180097631 | Uppal et al. | Apr 2018 | A1 |
| 20180097634 | Uppal et al. | Apr 2018 | A1 |
| 20180097831 | Uppal et al. | Apr 2018 | A1 |
| 20180109553 | Radlein et al. | Apr 2018 | A1 |
| 20180159757 | Uppal et al. | Jun 2018 | A1 |
| 20180159769 | Richardson et al. | Jun 2018 | A1 |
| 20180167444 | Sivasubramanian et al. | Jun 2018 | A1 |
| 20180167469 | Sivasubramanian et al. | Jun 2018 | A1 |
| 20180173526 | Prinsloo et al. | Jun 2018 | A1 |
| 20180176615 | Hannu et al. | Jun 2018 | A1 |
| 20180183689 | Ellsworth et al. | Jun 2018 | A1 |
| 20180191817 | Richardson et al. | Jul 2018 | A1 |
| 20180212880 | Mostert | Jul 2018 | A1 |
| 20180213052 | Maccarthaigh et al. | Jul 2018 | A1 |
| 20180278717 | Richardson et al. | Sep 2018 | A1 |
| 20180287916 | Mizik et al. | Oct 2018 | A1 |
| 20180302322 | Richardson et al. | Oct 2018 | A1 |
| 20180332107 | Marr et al. | Nov 2018 | A1 |
| 20180337885 | Singh et al. | Nov 2018 | A1 |
| 20180351904 | Mizik et al. | Dec 2018 | A1 |
| 20180367498 | Bliss et al. | Dec 2018 | A1 |
| 20190007515 | Baldwin et al. | Jan 2019 | A1 |
| 20190020562 | Richardson et al. | Jan 2019 | A1 |
| 20190028562 | Watson et al. | Jan 2019 | A1 |
| 20190044787 | Richardson et al. | Feb 2019 | A1 |
| 20190044846 | Howard et al. | Feb 2019 | A1 |
| 20190073303 | Marshall et al. | Feb 2019 | A1 |
| 20190089542 | Richardson et al. | Mar 2019 | A1 |
| 20190089818 | Choi | Mar 2019 | A1 |
| 20190098109 | Watson | Mar 2019 | A1 |
| 20190121739 | Richardson et al. | Apr 2019 | A1 |
| 20190129908 | Kumarasamy | Apr 2019 | A1 |
| 20190140922 | Ellsworth et al. | May 2019 | A1 |
| 20190173941 | Puchala et al. | May 2019 | A1 |
| 20190173972 | MacCarthaigh et al. | Jun 2019 | A1 |
| 20190190998 | Sivasubramanian et al. | Jun 2019 | A1 |
| 20190222666 | Uppal et al. | Jun 2019 | A1 |
| 20190268265 | Richardson et al. | Jul 2019 | A1 |
| 20190297137 | Richardson et al. | Sep 2019 | A1 |
| 20190327510 | Kalagi et al. | Oct 2019 | A1 |
| 20190354484 | Marshall et al. | Nov 2019 | A1 |
| 20200065132 | Mercier et al. | Feb 2020 | A1 |
| 20200084268 | Hollis et al. | Mar 2020 | A1 |
| 20200195677 | Uppal et al. | Jun 2020 | A1 |
| 20200195753 | Richardson et al. | Jun 2020 | A1 |
| 20200265096 | Raftery | Aug 2020 | A1 |
| 20200287817 | Howard et al. | Sep 2020 | A1 |
| 20200366638 | Vasquez et al. | Nov 2020 | A1 |
| 20200389534 | Sivasubramanian et al. | Dec 2020 | A1 |
| 20200389541 | Baldwin et al. | Dec 2020 | A1 |
| Number | Date | Country |
|---|---|---|
| 2741 895 | May 2010 | CA |
| 2765397 | Feb 2011 | CA |
| 1422468 | Jun 2003 | CN |
| 1511399 | Jul 2004 | CN |
| 1605182 | Apr 2005 | CN |
| 101189598 | May 2008 | CN |
| 101431539 | May 2009 | CN |
| 101460907 | Jun 2009 | CN |
| 101631133 | Jan 2010 | CN |
| 103731481 | Apr 2014 | CN |
| 1603307 | Dec 2005 | EP |
| 1351141 | Oct 2007 | EP |
| 2008167 | Dec 2008 | EP |
| 3156911 | Apr 2017 | EP |
| 2243052 | Oct 1991 | GB |
| 07-141305 | Jun 1995 | JP |
| 2001-0506093 | May 2001 | JP |
| 2001-249907 | Sep 2001 | JP |
| 2002-024192 | Jan 2002 | JP |
| 2002-044137 | Feb 2002 | JP |
| 2002-323986 | Nov 2002 | JP |
| 2003-167810 | Jun 2003 | JP |
| 2003-167813 | Jun 2003 | JP |
| 2003-188901 | Jul 2003 | JP |
| 2003-522358 | Jul 2003 | JP |
| 2004-070935 | Mar 2004 | JP |
| 2004-532471 | Oct 2004 | JP |
| 2004-533738 | Nov 2004 | JP |
| 2005-537687 | Dec 2005 | JP |
| 3748216 | Feb 2006 | JP |
| 2007-133896 | May 2007 | JP |
| 2007-207225 | Aug 2007 | JP |
| 2008-515106 | May 2008 | JP |
| 2009-071538 | Apr 2009 | JP |
| 2012-509623 | Apr 2012 | JP |
| 2012-209623 | Oct 2012 | JP |
| WO 2001045349 | Jun 2001 | WO |
| WO 2002069608 | Sep 2002 | WO |
| WO 2005071560 | Aug 2005 | WO |
| WO 2007007960 | Jan 2007 | WO |
| WO 2007126837 | Nov 2007 | WO |
| WO 2009124006 | Oct 2009 | WO |
| WO 2010002603 | Jan 2010 | WO |
| WO 2012044587 | Apr 2012 | WO |
| WO 2012065641 | May 2012 | WO |
| WO 2014047073 | Mar 2014 | WO |
| WO 2017106455 | Jun 2017 | WO |
| WO 2018236597 | Dec 2018 | WO |
| Entry |
|---|
| Cohen et al., “Proactive Caching of DNS Records: Addressing a Performance Bottleneck”, Proceedings of Saint 2001 Symposium on Applications and the Internet; 8-12, Jan. 8, 2001, IEEE Computer Society, pp. 85-94. |
| JH Software, Moving a DNS Server to a New IP Address, last updated Jan. 26, 2006, 1 page. |
| Office Action in European Application No. 11767118.0 dated Jul. 25, 2018. |
| Extended Search Report in European Application No. 18156163 dated Sep. 3, 2018. |
| Office Action in Chinese Application No. 2013800492635 dated Aug. 30, 2017. |
| Office Action in Application No. 09729072.0 dated May 14, 2018. |
| Examination Report in Indian Application No. 6213/CHENP/2010 dated May 23, 2018. |
| International Preliminary Report on Patentability in PCT/US/2016/ 066848 dated Jun. 19, 2018. |
| “Non-Final Office Action dated Jan. 3, 2012,” U.S. Appl. No. 12/652,541, filed Jan. 3, 2012; 35 pages. |
| “Final Office Action dated Sep. 5, 2012,” U.S. Appl. No. 12/652,541, filed Sep. 5, 2012; 40 pages. |
| “Notice of Allowance dated Jan. 4, 2013,” U.S. Appl. No. 12/652,541, filed Jan. 4, 2013; 11 pages. |
| “Non-Final Office Action dated Apr. 30, 2014,” U.S. Appl. No. 13/842,970; 20 pages. |
| “Final Office Action dated Aug. 19, 2014,” U.S. Appl. No. 13/842,970; 13 pages. |
| “Notice of Allowance dated Dec. 5, 2014,” U.S. Appl. No. 13/842,970; 6 pages. |
| Canonical Name (CNAME) DNS Records, domainavenue.com, Feb. 1, 2001, XP055153783, Retrieved from the Internet: URL:http://www.domainavenue.com/cname.htm [retrieved on Nov. 18, 2014]. |
| “Content delivery network”, Wikipedia, the free encyclopedia, Retrieved from the Internet: URL:http://en.wikipedia.org/w/index.php?title=Contentdelivery network&oldid=601009970, XP055153445, Mar. 24, 2008. |
| “Global Server Load Balancing with ServerIron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages. |
| “Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages. |
| “Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/bin/view/Sungrid/OtherGridOfferings, 8 pages. |
| “Recent Advances Boost System Virtualization,” eWeek.com, retrieved from May 3, 2006, http://www.eWeek.com/article2/0,1895,1772626,00.asp, 5 pages. |
| “Scaleable Trust of Next Generation Management (STRONGMAN),” retrieved May 17, 2006, from http://www.cis.upenn.edu/˜dsl/STRONGMAN/, 4 pages. |
| “Sun EDA Compute Ranch,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://sun.com/processors/ranch/brochure.pdf, 2 pages. |
| “Sun Microsystems Accelerates UltraSP ARC Processor Design Program With New Burlington, Mass. Compute Ranch,” Nov. 6, 2002, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2002-11/sunflash.20021106.3 .xml, 2 pages. |
| “Sun N1 Grid Engine 6,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/gridware/index.xml, 3 pages. |
| “Sun Opens New Processor Design Compute Ranch,” Nov. 30, 2001, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2001-11/sunflash.20011130.1.xml, 3 pages. |
| “The Softricity Desktop,” Softricity, Inc., retrieved May 3, 2006, from http://www.softricity.com/products/, 3 pages. |
| “Xen—The Xen virtual Machine Monitor,” University of Cambridge Computer Laboratory, retrieved Nov. 8, 2005, from http://www.cl.cam.ac.uk/Research/SRG/netos/xen/, 2 pages. |
| “XenFaq,” retrieved Nov. 8, 2005, from http://wiki.xensource.com/xenwiki/XenFaq?action=print, 9 pages. |
| Abi, Issam, et al., “A Business Driven Management Framework for Utility Computing Environments,” Oct. 12, 2004, HP Laboratories Bristol, HPL-2004-171, retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2004/HPL-2004-171.pdf, 14 pages. |
| American Bar Association; Digital Signature Guidelines Tutorial [online]; Feb. 10, 2002 [retrieved on Mar. 2, 2010]; American Bar Association Section of Science and Technology Information Security Committee; Retrieved from the internet: (URL: http://web.archive.org/web/20020210124615/www.abanet.org/scitech/ec/isc/dsg-tutorial.html; pp. 1-8. |
| Armour et al.: “A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities”; Management Science, vol. 9, No. 2 (Jan. 1963); pp. 294-309. |
| Baglioni et al., “Preprocessing and Mining Web Log Data for Web Personalization”, LNAI 2829, 2003, pp. 237-249. |
| Barbir, A., et al., “Known Content Network (CN) Request-Routing Mechanisms”, Request for Comments 3568, [online], IETF, Jul. 2003, [retrieved on Feb. 26, 2013], Retrieved from the Internet: (URL: http://tools.ietf.org/rfc/rfc3568.txt). |
| Bellovin, S., “Distributed Firewalls,” ;login;:37-39, Nov. 1999, http://www.cs.columbia.edu/-smb/papers/distfw. html, 10 pages, retrieved Nov. 11, 2005. |
| Blaze, M., “Using the KeyNote Trust Management System,” Mar. 1, 2001, from http://www.crypto.com/trustmgt/kn.html, 4 pages, retrieved May 17, 2006. |
| Brenton, C., “What is Egress Filtering and How Can I Implement It?—Egress Filtering v 0.2,” Feb. 29, 2000, SANS Institute, http://www.sans.org/infosecFAQ/firewall/egress.htm, 6 pages. |
| Byun et al., “A Dynamic Grid Services Deployment Mechanism for On-Demand Resource Provisioning”, IEEE International Symposium on Cluster Computing and the Grid:863-870, 2005. |
| Chipara et al, “Realtime Power-Aware Routing in Sensor Network”, IEEE, 2006, 10 pages. |
| Clark, C., “Live Migration of Virtual Machines,” May 2005, NSDI '05: 2nd Symposium on Networked Systems Design and Implementation, Boston, MA, May 2-4, 2005, retrieved from http://www.usenix.org/events/nsdi05/tech/full_papers/clark/clark.pdf, 14 pages. |
| Coulson, D., “Network Security Iptables,” Apr. 2003, Linuxpro, Part 2, retrieved from http://davidcoulson.net/writing/Ixf/38/iptables.pdf, 4 pages. |
| Coulson, D., “Network Security Iptables,” Mar. 2003, Linuxpro, Part 1, retrieved from http://davidcoulson.net/writing/Ixf/39/iptables.pdf, 4 pages. |
| Deleuze, C., et al., A DNS Based Mapping Peering System for Peering CDNs, draft-deleuze-cdnp-dnsmap-peer-00.txt, Nov. 20, 2000, 20 pages. |
| Demers, A., “Epidemic Algorithms for Replicated Database Maintenance,” 1987, Proceedings of the sixth annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, Aug. 10-12, 1987, 12 pages. |
| Gruener, J., “A Vision of Togetherness,” May 24, 2004, NetworkWorld, retrieved May 3, 2006, from, http://www.networkworld.com/supp/2004/ndc3/0524virt.html, 9 pages. |
| Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”,May 2005, in Proc. of Networking 2005, all pages. |
| Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”, Dec. 18, 2004, Technical University Berlin, all pages. |
| Guo, F., Understanding Memory Resource Management in Vmware vSphere 5.0, Vmware, 2011, pp. 1-29. |
| Hameed, CC, “Disk Fragmentation and System Performance”, Mar. 14, 2008, 3 pages. |
| Hartung et al.; Digital rights management and watermarking of multimedia content for m-commerce applications; Published in: Communications Magazine, IEEE (vol. 38, Issue: 11 ); Date of Publication: Nov. 2000; pp. 78-84; IEEE Xplore. |
| Horvath et al., “Enhancing Energy Efficiency in Multi-tier Web Server Clusters via Prioritization,” in Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International , vol., No., pp. 1-6, Mar. 26-30, 2007. |
| Ioannidis, S., et al., “Implementing a Distributed Firewall,” Nov. 2000, (ACM) Proceedings of the ACM Computer and Communications Security (CCS) 2000, Athens, Greece, pp. 190-199, retrieved from http://www.cis.upenn.edu/˜dls/STRONGMAN/Papers/df.pdf, 10 pages. |
| Joseph, Joshy, et al., “Introduction to Grid Computing,” Apr. 16, 2004, retrieved Aug. 30, 2007, from http://www.informit.com/articles/printerfriendly.aspx?p=169508, 19 pages. |
| Kalafut et al., Understanding Implications of DNS Zone Provisioning., Proceeding IMC '08 Proceedings of the 8th AMC SIGCOMM conference on Internet measurement., pp. 211-216., ACM New York, NY, USA., 2008. |
| Kato, Yoshinobu , Server load balancer—Difference in distribution technique and supported protocol—Focus on function to meet the needs, Nikkei Communications, Japan, Nikkei Business Publications, Inc., Mar. 20, 2000, vol. 314, pp. 114 to 123. |
| Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables _ Basics.html, 4 pages. |
| Liu, “The Ultimate Guide to Preventing DNS-based DDoS Attacks”, Retrieved from http://www.infoworld.com/article/2612835/security/the-ultimate-guide-to-preventing-dns-based-ddos-attacks.html, Published Oct. 30, 2013. |
| Liu et al., “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering 61 (2007) pp. 304-330. |
| Maesono, et al., “A Local Scheduling Method considering Data Transfer in Data Grid,” Technical Report of IEICE, vol. 104, No. 692, pp. 435-440, The Institute of Electronics, Information and Communication Engineers, Japan, Feb. 2005. |
| Meng et al., “Improving the Scalability of Data Center Networks with Traffic-Aware Virtual Machine Placement”; Proceedings of the 29th Conference on Information Communications, INFOCOM'10, pp. 1154-1162. Piscataway, NJ. IEEE Press, 2010. |
| Mulligan et al.; How DRM-based content delivery systems disrupt expectations of “personal use”; Published in: Proceeding DRM '03 Proceedings of the 3rd ACM workshop on Digital rights management; 2003; pp. 77-89; ACM Digital Library. |
| Ragan, “Three Types of DNS Attacks and How to Deal with Them”, Retrieved from http://www.csoonline.com/article/2133916/malware-cybercrime/three-types-of-dns-attacks-and-how-to-deal-with-them.html, Published Aug. 28, 2013. |
| Shankland, S., “Sun to buy start-up to bolster N1,” Jul. 30, 2003, CNet News.com, retrieved May 3, 2006, http://news.zdnet.com/2100-3513_22-5057752.html, 8 pages. |
| Sharif et al, “Secure In-VM Monitoring Using Hardware Virtualization”, Microsoft, Oct. 2009 http://research.microsoft.com/pubs/153179/sim-ccs09.pdf; 11 pages. |
| Strand, L., “Adaptive distributed firewall using intrusion detection,” Nov. 1, 2004, University of Oslo Department of Informatics, retrieved Mar. 8, 2006, from http://gnist.org/˜lars/studies/master/StrandLars-master.pdf, 158 pages. |
| Takizawa, et al., “Scalable MultiReplication Framework on the Grid,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2004, No. 81, pp. 247-252, Japan, Aug. 1, 2004. |
| Tan et al., “Classification: Basic Concepts, Decision Tree, and Model Evaluation”, Introduction in Data Mining; http://www-users.cs.umn.edu/˜kumar/dmbook/ch4.pdf, 2005, pp. 245-205. |
| Van Renesse, R., “Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining,” May 2003, ACM Transactions on Computer Systems (TOCS), 21(2): 164-206, 43 pages. |
| Vijayan, J., “Terraspring Gives Sun's N1 a Boost,” Nov. 25, 2002, Computerworld, retrieved May 3, 2006, from http://www.computerworld.com/printthis/2002/0,4814, 76159,00.html, 3 pages. |
| Virtual Iron Software Home, Virtual Iron, retrieved May 3, 2006, from http://www.virtualiron.com/, 1 page. |
| Waldspurger, CA., “Spawn: A Distributed Computational Economy,” Feb. 1992, IEEE Transactions on Software Engineering, 18(2): 103-117, 15 pages. |
| Watanabe, et al., “Remote Program Shipping System for GridRPC Systems,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2003, No. 102, pp. 73- 78, Japan, Oct. 16, 2003. |
| Xu et al., “Decision tree regression for soft classification of remote sensing data”, Remote Sensing of Environment 97 (2005) pp. 322-336. |
| Yamagata, et al., “A virtual-machine based fast deployment tool for Grid execution environment,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2006, No. 20, pp. 127-132, Japan, Feb. 28, 2006. |
| Zhu, Xiaoyun, et al., “Utility-Driven Workload Management Using Nested Control Design,” Mar. 29, 2006, HP Laboratories Palo Alto, HPL-2005-193(R.1), retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2005/HPL-2005-193R1.pdf, 9 pages. |
| Supplementary European Search Report in Application No. 09729072.0 2266064 dated Dec. 10, 2014. |
| First Singapore Written Opinion in Application No. 201006836-9, dated Oct. 12, 2011 in 12 pages. |
| Singapore Written Opinion in Application No. 201006836-9, dated Apr. 30, 2012 in 10 pages. |
| First Office Action in Chinese Application No. 200980111422.3 dated Apr. 13, 2012. |
| First Office Action in Japanese Application No. 2011-502138 dated Feb. 1, 2013. |
| Singapore Written Opinion in Application No. 201006837-7, dated Oct. 12, 2011 in 11 pages. |
| Supplementary European Search Report in Application No. 09727694.3 dated Jan. 30, 2012 in 6 pages. |
| Singapore Examination Report in Application No. 201006837-7 dated Mar. 16, 2012. |
| First Office Action in Chinese Application No. 200980111426.1 dated Feb. 16, 2013. |
| Second Office Action in Chinese Application No. 200980111426.1 dated Dec. 25, 2013. |
| Third Office Action in Chinese Application No. 200980111426.1 dated Jul. 7, 2014. |
| Fourth Office Action in Chinese Application No. 200980111426.1 dated Jan. 15, 2015. |
| Fifth Office Action in Chinese Application No. 200980111426.1 dated Aug. 14, 2015. |
| First Office Action in Japanese Application No. 2011-502139 dated Nov. 5, 2013. |
| Decision of Rejection in Application No. 2011-502139 dated Jun. 30, 2014. |
| Office Action in Japanese Application No. 2011-502139 dated Aug. 17, 2015. |
| Singapore Written Opinion in Application No. 201006874-0, dated Oct. 12, 2011 in 10 pages. |
| First Office Action in Japanese Application No. 2011-502140 dated Dec. 7, 2012. |
| First Office Action in Chinese Application No. 200980119995.0 dated Jul. 6, 2012. |
| Second Office Action in Chinese Application No. 200980119995.0 dated Apr. 15, 2013. |
| Examination Report in Singapore Application No. 201006874-0 dated May 16, 2012. |
| Search Report in European Application No. 09839809.2 dated May 11, 2015. |
| Office Action in European Application No. 09839809.2 dated Dec. 8, 2016. |
| Supplementary European Search Report in Application No. 09728756.9 dated Jan. 8, 2013. |
| First Office Action in Chinese Application No. 200980119993.1 dated Jul. 4, 2012. |
| Second Office Action in Chinese Application No. 200980119993.1 dated Mar. 12, 2013. |
| Third Office Action in Chinese Application No. 200980119993.1 dated Oct. 21, 2013. |
| First Office Action in Japanese Application No. 2011-503091 dated Nov. 18, 2013. |
| Office Action in Japanese Application No. 2014-225580 dated Oct. 26, 2015. |
| Office Action in Japanese Application No. 2014-225580 dated Oct. 3, 2016. |
| Search Report and Written Opinion issued in Singapore Application No. 201006873-2 dated Oct. 12, 2011. |
| First Office Action is Chinese Application No. 200980125551.8 dated Jul. 4, 2012. |
| First Office Action in Japanese Application No. 2011-516466 dated Mar. 6, 2013. |
| Second Office Action in Japanese Application No. 2011-516466 dated Mar. 17, 2014. |
| Decision of Refusal in Japanese Application No. 2011-516466 dated Jan. 16, 2015. |
| Office Action in Japanese Application No. 2011-516466 dated May 30, 2016. |
| Office Action in Canadian Application No. 2726915 dated May 13, 2013. |
| First Office Action in Korean Application No. 10-2011-7002461 dated May 29, 2013. |
| First Office Action in Chinese Application No. 200980145872.4 dated Nov. 29, 2012. |
| First Office Action in Canadian Application No. 2741895 dated Feb. 25, 2013. |
| Second Office Action in Canadian Application No. 2741895 dated Oct. 21, 2013. |
| Partial Supplementary Search Report in European Application No. 09826977.2 dated Oct. 4, 2016. |
| Search Report and Written Opinion in Singapore Application No. 201103333-9 dated Nov. 19, 2012. |
| Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013. |
| Office Action in Chinese Application No. 201310717573.1 dated Jul. 29, 2016. |
| Office Action in European Application No. 11767118.0 dated Feb. 3, 2017. |
| International Search Report and Written Opinion in PCT/US2011/053302 dated Nov. 28, 2011 in 11 pages. |
| International Preliminary Report on Patentability in PCT/US2011/053302 dated Apr. 2, 2013. |
| First Office Action in Japanese Application No. 2013-529454 dated Feb. 3, 2014 in 6 pages. |
| Office Action in Japanese Application No. 2013-529454 dated Mar. 9, 2015 in 8 pages. |
| First Office Action issued in Australian Application No. 2011307319 dated Mar. 6, 2014 in 5 pages. |
| Search Report and Written Opinion in Singapore Application No. 201301573-0 dated Jul. 1, 2014. |
| First Office Action in Chinese Application No. 201180046104.0 dated Nov. 3, 2014. |
| Second Office Action in Chinese Application No. 201180046104.0 dated Sep. 29, 2015. |
| Third Office Action in Chinese Application No. 201180046104.0 dated Apr. 14, 2016. |
| Decision of Rejection in Chinese Application No. 201180046104.0 dated Oct. 17, 2016. |
| Examination Report in Singapore Application No. 201301573-0 dated Dec. 22, 2014. |
| International Preliminary Report on Patentability in PCT/US2011/061486 dated May 22, 2013. |
| International Search Report and Written Opinion in PCT/US2011/061486 dated Mar. 30, 2012 in 11 pages. |
| Office Action in Canadian Application No. 2816612 dated Nov. 3, 2015. |
| Office Action in Canadian Application No. 2816612 dated Oct. 7, 2016. |
| Office Action in Canadian Application No. 2816612 dated Aug. 8, 2017. |
| First Office Action in Chinese Application No. 201180053405.6 dated Feb. 10, 2015. |
| Second Office Action in Chinese Application No. 201180053405.6 dated Dec. 4, 2015. |
| Office Action in Japanese Application No. 2013-540982 dated Jun. 2, 2014. |
| Written Opinion in Singapore Application No. 201303521-7 dated May 20, 2014. |
| Office Action in Japanese Application No. 2015-533132 dated Apr. 25, 2016. |
| Office Action in Canadian Application No. 2884796 dated Apr. 28, 2016. |
| Office Action in Russian Application No. 2015114568 dated May 16, 2016. |
| Supplementary Examination Report in Singapore Application No. 11201501987U dated May 17, 2017. |
| International Search Report and Written Opinion in PCT/US07/07601 dated Jul. 18, 2008 in 11 pages. |
| International Preliminary Report on Patentability in PCT/US2007/007601 dated Sep. 30, 2008 in 8 pages. |
| Supplementary European Search Report in Application No. 07754164.7 dated Dec. 20, 2010 in 7 pages. |
| Office Action in Chinese Application No. 200780020255.2 dated Mar. 4, 2013. |
| Office Action in Indian Application No. 3742/KOLNP/2008 dated Nov. 22, 2013. |
| Office Action in Japanese Application No. 2012-052264 dated Dec. 11, 2012 in 26 pages. |
| Office Action in Japanese Application No. 2013-123086 dated Apr. 15, 2014 in 3 pages. |
| Office Action in Japanese Application No. 2013-123086 dated Dec. 2, 2014 in 4 pages. |
| Office Action in Japanese Application No. 2015-075644 dated Apr. 5, 2016. |
| Office Action in European Application No. 07754164.7 dated Dec. 14, 2015. |
| Office Action in Chinese Application No. 201310537815.9 dated Jul. 5, 2016. |
| Office Action in Chinese Application No. 201310537815.9 dated Jun. 2, 2017. |
| International Search Report and Written Opinion in PCT/US/2016/ 066848 dated May 1, 2017. |
| Arends et al., DNS Security Introduction and Requirements, RFC 4033, Mar. 2005, 21 pages. |
| Ariyapperuma et al., “Security Vulnerabilities in DNS and DNSSEC.” The Second International Conference on Availability, Reliability and Security, IEEE, 2007, 8 pages. |
| Chandramouli et al., “Challenges in Securing the Domain Name System.” IEEE Security & Privacy4.1 (2006),pp. 84-87. |
| Eastlake, Donald, Domain Name System Security Extensions, RFC 2535, Mar. 1999, 47 pages. |
| Office Action in Application No. 09729072.0 dated Dec. 7, 2018. |
| Examination Report in Indian Application No. 4487/DELNP/2013 dated Dec. 28, 2018. |
| Krsul et al., “VMPlants: Providing and Managing Virtual Machine Execution Environments for Grid Computing”, Nov. 6, 2004 (Nov. 6, 2004), Supercomputing, 2004. Proceedings of the ACM/IEEE SC2004 Conference Pittsburgh, PA, USA Nov. 6-12, 2004, Piscataway, NJ, USA, IEEE, 1730 Massachusetts Ave., NW Washington, DC 20036-1992 USA, 12 pages. |
| Zhao et al., “Distributed file system support for virtual machines in grid computing”, Jun. 4, 2004 (Jun. 4, 2004), High Performance Distributed Computing, 2004. Proceedings. 13th IEEE International Symposium on Honolulu, HI, USA Jun. 4-6, 2004, Piscataway, NJ, USA, IEEE, p. 202-211. |
| Office Action in Indian Application No. 5937/CHENP/2010 dated Jan. 19, 2018. |
| Office Action in Indian Application No. 6210/CHENP/2010 dated Mar. 27, 2018. |
| Office Action in Chinese Application No. 201310537815.9 dated Feb. 1, 2018. |
| Office Action in European Application No. 07754164.7 dated Jan. 25, 2018. |
| International Search Report and Written Opinion in PCT/US2017/055156 dated Dec. 13, 2017. |
| Zaman et al., “Combinatorial Auction-Based Dynamic VM Provisioning and Allocation in Clouds”, Department of Computer Science, Wayne State University, Sep. 2011 http://www.cs.wayne.edu/-dgrosu/pub/ccgrid12-symp.pdf. |
| Office Action in European Application No. 11767118.0 dated Jan. 29, 2019. |
| Examination Report in Indian Application No. 3105/DELNP/2013, dated Feb. 19, 2019. |
| Office Action in European Application No. 13770602.4 dated Mar. 11, 2019. |
| Extended European Search Report in Application No. 16876655.8 dated Aug. 20, 2019. |
| Frangoudis et al., “PTPv2-based network load estimation and its application to QoE monitoring for Over-the-Top services”, IEEE, The 5th International conference on Information, Intelligence, Systems and Applications, IISA 2014, XP032629858, Jul. 7, 2014, pp. 176-181. |
| Office Action in Indian Application No. 2823/DELNP/2015 dated Oct. 25, 2019. |
| Partial Search Report in European Application No. 16876655.8 May 15, 2019. |
| International Preliminary Report on Patentability and Written Opinion in PCT/US2017/055156 dated Apr. 9, 2019. |
| International Search Report and Written Opinion in PCT/US2018/036634 dated Sep. 11, 2018. |
| Partial Search Report in European Application No. 16876655.8 dated May 15, 2019. |
| Extended Search Report in European Applicaton No. 19184826.6 dated Jan. 17, 2020. |
| International Preliminary Report on Patentability and Written Opinion in PCT/US2018/036634 dated Dec. 24, 2019. |
| Office Action in Brazilian Application No. BR112015005588-5 dated Jan. 14, 2020. |
| Office Action in Chinese Application No. 201810426428.0 dated Jul. 20, 2020 in 25 pages. |
| Second Office Action in Chinese Application No. 201610828846.3 dated Aug. 5, 2020. |
| Office Action issued in connection with European Patent Application No. 18734734 dated Oct. 19, 2020. |
