Assignment of a POP to a DNS resolver based on volume of communications over a link between client devices and the POP

Information

  • Patent Grant
  • 10447648
  • Patent Number
    10,447,648
  • Date Filed
    Monday, June 19, 2017
    8 years ago
  • Date Issued
    Tuesday, October 15, 2019
    6 years ago
Abstract
Systems and methods are described to enable routing of network communications in a content delivery system in a manner expected not to exceed the capacity of individual communication links of points of presence (POPs) within the content delivery system. Specifically, a route mapping service is disclosed that can determine the effect of potential DNS records on volumes of traffic expected to reach a POP through individual communication links, and that can alter DNS records such that the expected traffic does not exceed a capacity of those individual communication links. Illustratively, the DNS records may be altered at a level of individual DNS resolvers interacting with the content delivery system, and the volumes of traffic expected to reach a POP through individual communication links can be determined based on a volume of traffic of client computing devices associated with an individual DNS resolver.
Description
BACKGROUND

Generally described, computing devices utilize a communication network, or a series of communication networks, to exchange data. Companies and organizations operate computer networks that interconnect a number of computing devices to support operations or provide services to third parties. The computing systems can be located in a single geographic location or located in multiple, distinct geographic locations (e.g., interconnected via private or public communication networks). Specifically, data centers or data processing centers, herein generally referred to as “data centers,” may include a number of interconnected computing systems to provide computing resources to users of the data center. The data centers may be private data centers operated on behalf of an organization or public data centers operated on behalf, or for the benefit of, the general public.


Existing routing and addressing technologies can enable multiple data centers to provide similar or identical content to client computing devices. In some instances, each data center providing a set of content may be referred to as a point-of-presence (“POP”) for a content delivery system (or other organization) providing the content. Content delivery systems (sometimes referred to as “content delivery networks,” or “CDNs”) often prefer to connect users to a geographically-nearby POP, as such connections are commonly quicker and more reliable than connections between a user and a geographically-distant POP. Accordingly, a content delivery system can maintain POPs over a wide area (or worldwide). Thereafter, requests for content from the content delivery system can be routed to a nearby POP for fulfillment.


Each POP may be associated with an address on a computing network, such as an Internet Protocol (IP) address. However, requests for content are generally addressed to a human-readable identifier, such as a universal resource identifier (URI) or domain name. To enable use of human-readable identifiers in accessing content, a client computing device can interact with a Domain Name System (DNS) that operates to resolve a domain name into a corresponding network address (e.g., IP address). Typically, a CDN is associated with one or more domain names, and an operator of CDN will have authority to alter DNS records specifying IP addresses to which those domain names resolve. Thus, the operator of a CDN can utilize DNS records to control how requests to access content of the CDN are routed to POPs.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram depicting an illustrative logical network including multiple client computing devices and domain name system (DNS) resolvers, as well as a content delivery system including multiple points-of-presence (POPs), multiple DNS servers, and a DNS-to-POP routing mapping service that can determine a mapping between DNS resolvers and POPs for use by the DNS servers;



FIG. 2A is a block diagram depicting associations between subnets of a computer network (each subnet including one or more client computing devices), DNS resolvers, and POPs of the content delivery system of FIG. 1;



FIG. 2B is a block diagram depicting associations between subnets of a computer network and volume of communications to individual links associated with a POP of the content delivery system of FIG. 1;



FIG. 3 is a block diagram depicting illustrative interactions for determining mappings of DNS resolvers to POPs of the content delivery system of FIG. 1 based on a predicted load on individual links of POPs as a result of the mappings;



FIG. 4 is a flow-diagram of a routine to generate mappings of DNS resolvers to POPs of the content delivery system of FIG. 1, which mappings may be utilized by DNS servers of the content delivery system to respond to resolution requests from DNS resolvers;



FIG. 5 is a flow-diagram of a routine to determine an association between an individual DNS resolver and a POP of the content delivery system of FIG. 1 based on a predicted load on individual links of the POP as a result of the association; and



FIG. 6 is a block diagram depicting an illustrative configuration of one embodiment of a DNS-to-POP routing mapping system that may implement the DNS-to-POP routing mapping service of FIG. 1.





DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to managing a load at individual points of presence (“POPs”) of a content delivery system, and more particularly, to managing load at individual network communication links of a POP. Broadly described, individual POPs within a content delivery system can service client requests for content duplicated across the POPs. The specific POP used to provide content may be selected based on capacity-independent criteria, such as geographic location or network connectivity speed. However, each POP may also have limited capacity to service user requests. Therefore, the content delivery system may utilize load-balancing techniques to ensure that individual POPs are not overloaded with requests. While POPs generally include a number of different interconnected computing devices (e.g., within a physical data center), load-balancing techniques often consider POPs as an atomic unit. For example, load-balancing techniques may generally take into consideration the total compute capacity of a POP (e.g., a total amount of processing power, memory, etc. available at the POP) or a total network bandwidth available at the POP. Under some conditions, this approach can be effective. For example, a POP may include internal load-balancing that enables near total use of a POP's total compute capacity; thus, load-balancing between POPs based on total compute capacity can be relatively effective. However, it may not be possible at a POP to internally load balance all aspects of network communications. For example, a POP may have a limited number of physical connections, or links, to other networks, and (from the perspective of the POP) have little control over the connection used by incoming requests. Thus, excessive requests flowing to a POP over an individual links can overwhelm resources of the POP, even where aggregate bandwidth usage of the POP is relatively low.


Specifically, the present disclosure provides for the generation of DNS resolver-to-POP mappings based (at least partly) on an effect of such mappings on link utilizations at individual POPs. The mappings may specify how DNS requests from an individual DNS resolver should be handled by a DNS server of a content delivery system, and particularly, which POP of the content delivery system should be identified by the DNS server in a response to a DNS request. For example, the mappings may specify that DNS requests from resolver A should result in a return of an IP address for POP 1, while DNS requests from resolver B should result in a return of an IP address for POP 2.


By modifying resolver-to-POP mappings, a content delivery system may alter the load at individual POPs of the content delivery system. As a simplistic example, if all resolvers were mapped to an individual POP, the DNS servers of the content delivery system would respond to all DNS requests with the network address of the individual POP. That individual POP would then experience the total load of all requests to the content delivery system, and likely be overloaded. Meanwhile, other POPs would experience effectively zero load. However, by changing how the DNS servers respond to requests from some DNS resolvers, load associated with those resolvers can be rerouted to other POPs. For example, in a (simplistic) communication network with two resolvers, providing a first resolver with an address of a first POP and a second resolver with an address of a second POP can split load on the content delivery system between the POPs.


Determining effective resolver-to-POP mappings can be difficult in practice due to a number of complicating factors. One such factor is that DNS resolvers themselves represent little or none of the load actually experienced at a POP. Instead, the DNS resolvers act as proxies for client computing devices, enabling client computing devices to resolve domain names into network addresses. Those client computing devices, in turn, make requests of a POP and cause corresponding load. However, there is generally not a one-to-one correspondence between client computing device requests to a DNS resolver and requests from a DNS resolver to a DNS server within a content delivery system. Instead, DNS resolvers often utilize caching to respond to multiple client computing devices based on a single interaction with a DNS server. Moreover, DNS resolvers can utilize a hierarchical system, such that a DNS server is not aware of the identity of a client computing device ultimately being served by a resolution request. Thus, while a POP may be aware of the load at the POP caused by individual client computing devices, it can be difficult to attribute that load to operation of an individual DNS resolver.


An additional factor in determining resolver-to-POP mappings is the potential effect of those mappings on individual communication links within a communications network, such as the Internet. Generally, assigning a resolver to a POP via a resolver-to-POP mapping will direct traffic associated with the resolver (e.g., from client computing devices served by the resolver) to the POP. However, that POP may have many communication links to a communications network, and traffic associated with the resolver may reach the POP over any of those communication links. The specific link used can be controlled, for example, by routing protocols implemented by the communications network. One example of such a protocol is the Border Gateway Protocol (BGP), which enables routing devices on a communications network to exchange information as to the reachability of addresses on the network. While a POP's use of BGP or other protocols may provide the POP some control as to which link traffic with a client device uses, such links are generally selected to minimize communication metrics, such as latency, hop count, bandwidth, packet loss, or path reliability. Using BGP or another protocol to alter communications paths can have substantial detrimental effects, including temporary increases in resource usage to propagate path changes and enduring increases in communication metrics due to properties of the changed path. It is therefore often disadvantageous to alter routing protocols. For this reason, the link over which POP-to-client traffic flows is often substantially fixed.


Accordingly, a given resolver-to-POP mapping can cause a given amount of traffic not simply at a POP, but at individual communication links of the POP. Each communication link may have a capacity that is independent of other capacity constraints at the POP (e.g., memory and processing power). If a given resolver-to-POP mapping overwhelms the capacity of an individual link, capacity-related errors may occur at the POP, even the overall resource use of the POP is well below total capacity (e.g., when other links of the POP have sufficient bandwidth to service requests). Thus, overloading of an individual communication link at a POP can represent an artificial constraint on the POP's capacity.


To address this issue, the present disclosure provides for link-aware creation of resolver-to-POP mappings. Specifically, the present disclosure enables a content delivery system to determine an amount of traffic attributable to an individual resolver, to determine which communication link at any given POP would be used to service that traffic, and to assign the resolver to a POP such that the relevant communication link is not overloaded beyond its capacity. This assignment, in the form of a resolver-to-POP mapping, may then be used by DNS servers of the content delivery system to respond to DNS requests from the resolver, thus directing traffic associated with the resolver to the desired POP. In this manner, the overall efficiency of POPs to serve requests can be improved relative to prior implementations.


While aspects of the present disclosure are discussed with respect to link capacities, other capacities may additionally or alternatively be taken into account when generating resolver-to-POP mappings. For example, embodiments of the present disclosure may determine specific attributes of traffic information attributable to a given resolver, such as an amount of the traffic (e.g., as a percentage of overall traffic or as an absolute amount) that represents communication of a specific type of data. Embodiments of the present disclosure may then generate resolver-to-POP mappings based on a capacity of each POP to serve that specific type of data. As an illustration, each POP may be assigned by an administrator a maximum amount of bits per second of video content to be served by the POP. When determining resolver-to-POP mappings, a service may determine an amount of video content transmitted to client computing devices of a given resolver, and assign the resolver to a POP only when such an assignment would not exceed the total capacity of the POP to serve video content. In some instances, the type of content may be correlated to specific hardware computing resources of a POP, such as processing power. For example, service n bits of video content may be assumed to consume m cycles of processing power. Thus, when determining resolver-to-POP mappings, a service may determine an amount of video content transmitted to client computing devices of a given resolver, determine the number of cycles of processing power expected to be used to serve that video content, and assign the resolver to a POP only when such an assignment would not exceed the total capacity of the POP in terms of processing power. Additional specific capacities may be assigned in similar manners. For example, an administrator of a POP may establish a maximum number of files transmitted by a POP for any number of file types or formats, or may establish a maximum load of various hardware resources (e.g., processing cycles of a central processing unit (CPU) or graphical processing unit (GPU), memory (random access, disk memory, etc.), network bandwidth, etc.), each of which may be correlated based on predetermined mappings to various types of transmissions attributable to a resolver. Thus, any number of different capacities may be used to determine resolver-to-POP mappings in accordance with the present disclosure.


As will be appreciated by one of skill in the art in light of the description above, the embodiments disclosed herein substantially increase the ability of computing systems, such as content delivery systems, to service requests and provide content to client computing devices. Specifically, embodiments disclosed herein can use link-aware resolver-to-POP mappings to shape traffic to POPs, such that individual communication links at the POPs are not overloaded. This results in a reduction in communication errors experienced at the POP, and removal of artificial restrictions on the POPs' capacities. Thus, the presently disclosed embodiments represent an improvement in the functioning of such computing systems, by enabling more efficient communications to and from content delivery systems or other networked devices. Moreover, the presently disclosed embodiments address technical problems inherent within computing systems; specifically, the limited ability of computing systems to process network-based requests, the limited bandwidth available over individual communication networks, and the inefficiency of rerouting traffic over alternative communication links (e.g., the a detrimental effect on communication metrics resulting from such rerouting). These technical problems are addressed by the various technical solutions described herein, including the generation of link-aware resolver-to-POP mappings in accordance with the embodiments described herein. Thus, the present application represents a substantial improvement on existing network systems and computing systems in general.


For the purposes of the present disclosure, DNS resolution (e.g., the resolution of a domain name into a network address) will be assumed to be domain-name independent. Thus, it will be assumed that requests for any domain name associated with a content delivery system can be responded to with a network address of any POP of the content delivery system. This assumption holds, for example, where all POPs of a content delivery system operate to provide access to any content associated with the content delivery system. Thus, any POP can function to service requests for any content of the content delivery system. However, it will be appreciated that embodiments described herein could be modified to further account for variation in DNS responses based on a domain name included in a resolution request. For example, variation in DNS responses based on a domain name could be accomplished by generating domain-name specific resolver-to-DNS mappings (e.g., by generating, for each domain name, resolver-to-DNS mappings in accordance with the embodiments below).


The foregoing aspects and many of the attendant advantages of the present disclosure will become more readily appreciated as the same become better understood by reference to the following, when taken in conjunction with the accompanying drawings.



FIG. 1 is a block diagram depicting an illustrative logical network 100 including multiple client computing devices 102 and multiple DNS resolvers 104 in communication with a content delivery system 110 via a network 106. While the client computing devices 102 and the DNS resolvers 104 are shown as a group within FIG. 1, the client computing devices 102 and DNS resolvers 104 may be geographically distant, and independently owned or operated. For example, the client computing devices 102 could represent a multitude of users in various global, continental, or regional locations accessing the content delivery system 110. Further, the DNS resolvers 104 could represent a multitude of DNS devices operating globally, continentally or regionally. Accordingly, the groupings of client computing devices 102 and DNS resolvers 104 within FIG. 1 is intended to represent a logical, rather than physical, grouping. Similarly, each of the components of the content delivery system 110 may be located within geographically diverse areas. For example, the DNS servers 112 and POPS 114 within the content delivery system may be globally, continentally, or regionally disparate, in order to provide a wide geographical presence for the content delivery system 110.


Network 106 may be any wired network, wireless network or combination thereof. In addition, the network 106 may be a personal area network, local area network, wide area network, cable network, satellite network, cellular telephone network, or combination thereof. In the example environment of FIG. 1, network 106 is a global area network (GAN), such as the Internet. Protocols and components for communicating via the other aforementioned types of communication networks are well known to those skilled in the art of computer communications and thus, need not be described in more detail herein. While each of the client computing devices 102, DNS resolvers 104, and content delivery system 110 are depicted as having a single connection to the network 106, individual components of the client computing devices 102, DNS resolvers 104, and content delivery system 110 may be connected to the network 106 at disparate points. These disparate points are generally referred to herein as “communication links” or simply “links.” Illustratively, a communication link may include a single wire connection between a computing device and networking device, such as a single gigabit-speed Ethernet connection. In some instances, a communication link may include multiple connections in serial, parallel, or both. For example, a client computing device's communication link to the network 106 may include a connection between the client computing device and a routing device or modem on a local area network (LAN), such as a home network, as well as a connection between the routing device or modem and an internet service provider (ISP) that forms part of the network 106. The content delivery system may have multiple links to the communication network 106, each of which is formed by one or more physical network connections in serial, parallel, or both. Thus, for the purposes of the present disclosure, a communication link can be generally described as one or more physical connections that enable (or are configured via routing protocols to enable) communication between a first network (or individual device) and a given location on a second network, such as an individual “Internet exchange point” or interface with an ISP or other content delivery system.


Client computing devices 102 may include any number of different computing devices capable of communicating with the content delivery system 102. For example, individual client computing devices may correspond to a laptop or tablet computer, personal computer, wearable computer, server, personal digital assistant (PDA), hybrid PDA/mobile phone, mobile phone, electronic book reader, set-top box, camera, digital media player, and the like. Each client computing device 102 may utilize one or more DNS resolvers 104 to resolve hostnames for devices connected to the network 106 into network addresses, such as IP addresses. Accordingly, each DNS resolver 104 may correspond to a DNS server that serves DNS information to one or more client computing devices 102. For example, each DNS resolver 104 may correspond to a DNS server provided by an ISP of one or more users, a private DNS server, or a public DNS server. The detailed operation of DNS servers is well known within the art, and therefore will not be described in detail herein.


In order to resolve hostnames corresponding to the content delivery system, each DNS resolver 104 may communicate with a DNS server 112 within the content delivery system 110. DNS servers 112 can be operated on behalf of the content delivery system 110, and configured or otherwise operable to resolve hostnames of the content delivery system 110 into a network address of a corresponding POP 114. Illustratively, each DNS server can 112 be configured, on request from a DNS resolver 104 to resolve a specific hostname, to determine a POP 114 that should serve the DNS resolver 104 (or client computing devices 102 associated with the DNS resolver 104) and to return an IP address of the determined POP 114 to the DNS resolver 104. Thereafter, the DNS resolver 104 can return the IP address of the determined POP 114 to a requesting client computing device 102, which the client computing device 102 may use to contact the content delivery system 110 to retrieve content. In order to determine which POP 114 address into which to resolve a hostname request, each DNS server 112 may utilize a resolver-to-POP mapping generated in accordance with the present disclosure. Specifically, the DNS server 112 may respond to a request from a given resolver 104 by returning a network address of a POP assigned to that resolver within the resolver-to-POP mapping. As discussed above, in some embodiments, such responses may be independent of the particular hostname for which resolution is requested (e.g., when all POPs 114 are configured to provide content from all hostnames associated with the content delivery system 110).


On receiving an address of a POP 114, a client computing device 102 may communicate with the POP 114 to retrieve content from the content delivery service 110. Accordingly, each POP 114 may include one or more data stores configured to store content available from the content delivery system 110. Moreover, each POP 114 may include one or more computing devices configured to receive requests from client computing devices 102 and return requested content. The particular communication path used for communications between a client computing device 102 and a POP 114 may depend on routing protocols used by the POP 114 and the network 106. As noted above, excessive communications to or from a POP 114 over a given path (e.g., over a given communication link at the POP 114) can result in communication errors, even when the POP 114 otherwise has capacity to service the communications. Thus, it is desirable to shape traffic in such a manner that individual communication links of a POP 114 are not overloaded with traffic to client computing devices 102.


To facilitate such traffic shaping, the content delivery system 110 of FIG. 1 further includes a resolver-to-POP route mapping service 116. In accordance with aspects of the present disclosure, the resolver-to-POP route mapping service 116 may interact with the DNS servers 112 and POPs 114 in order to determine characteristics of traffic associated with individual DNS resolvers 104 (or collections of DNS resolvers 104), and to assign such DNS resolvers 104 to POPs 114 in a manner that is expected not to overload individual communication links of the POPs 114. Further, the resolver-to-POP route mapping service 116 can generate resolver-to-POP mappings that identify these assignments, and return the mappings to the DNS servers 112. Thereafter, the DNS servers 114 can respond to DNS requests from DNS resolvers 104 in accordance with the mappings, thus directing traffic between client computing devices 102 and the POPs 114 in a manner expected not to overload communication links of the POPs 114. Further detail regarding generation of resolver-to-POP mappings is provided below.


It will be appreciated by those skilled in the art that the content delivery system 110 may have fewer or greater components than are illustrated in FIG. 1. In addition, the content delivery system 110 could include various web services and/or peer-to-peer network configurations. Thus, the depiction of the content delivery system 110 should be taken as illustrative and not limiting to the present disclosure. For example, in some embodiments, components of the content delivery system 110, such as the resolver-to-POP route mapping service 116, may be executed by one more virtual machines implemented in a hosted computing environment. A hosted computing environment may include one or more rapidly provisioned and released computing resources, which computing resources may include computing, networking and/or storage devices. A hosted computing environment may also be referred to as a cloud computing environment.


Any one or more of the DNS servers 112, the POPs 114 and the resolver-to-POP route mapping service 116 may be embodied in a plurality of components, each executing an instance of the respective DNS servers 112, POPs 114 and resolver-to-POP route mapping service 116. A server or other computing component implementing any one of the DNS servers 112, POPs 114 and resolver-to-POP route mapping service 116 may include a network interface, memory, processing unit, and computer readable medium drive, all of which may communicate which each other may way of a communication bus. The network interface may provide connectivity over the network 106 and/or other networks or computer systems. The processing unit may communicate to and from memory containing program instructions that the processing unit executes in order to operate the respective DNS servers 112, POPs 114 and resolver-to-POP route mapping service 116. The memory may generally include RAM, ROM, other persistent and auxiliary memory, and/or any non-transitory computer-readable media.


With reference to FIG. 2A, an example of possible logical associations between client computing devices 102, DNS resolvers 104, and POPs 114 will be described. In FIG. 2, client computing devices 102 are represented as subnets 202, each representing one or more client computing devices 102. Each subnet 202 may correspond to a subnetwork including network addresses for one or more client computing devices 102. For example, where devices 102 utilize IP version 4 (IPv4) addresses, a subnet may represent all possible network addresses utilizing a common prefix (e.g., the prefix “10.0.1” within the network addresses “10.0.1.1” through “10.0.1.254”). These prefix are commonly referred to using Classless Inter-Domain Routing, or “CIDR,” notation, which specifies the length of a prefix using “slash notation.” Illustratively, a “/24” network may represent a block of 256 possible addresses under the IPv4 addressing scheme. The six of each subnet 202 may be vary in different embodiments, as larger subnets 202 may reduce the data processing required to generate resolver-to-POP mappings, while smaller subnets 202 may increase the granularity with which traffic can be shaped. In the illustrative examples provided herein, the subnets 202 are assumed to represent a /24 block of IPv4 addresses.


As shown in FIG. 2A, each subnet 202 is associated with a DNS resolver 104A. This association indicates that a client computing device 102 within a given subnet 202 is expected to communicate (as necessary) with a given DNS resolver 104 in order to resolve hostnames associated with the content delivery system 110. For example, client computing devices 102 corresponding to subnets 202A and 202B are expected to communicate with DNS resolver 104A when resolving hostnames of the content delivery system 110. Client computing devices 102 corresponding to subnet 202C are expected to communicate with DNS resolver 104B, computing devices 102 corresponding to subnet 202N are expected to communicate with DNS resolver 104N, etc. Similarly, FIG. 2A further depicts associations between DNS resolvers 104A and POPs 114 of the content delivery system. These associations indicate for example that, when a DNS request is received from a DNS resolver 104A to resolve a host name of the content delivery system 110, a DNS server 112 (not shown in FIG. 2A) of the content delivery system 110 will return a network address of POP 114A. Similarly, when a DNS request is received from a DNS resolver 104N to resolve a host name of the content delivery system 110, the DNS server 112 will return a network address of POP 114N. From the associations of FIG. 2A, it can then be seen that traffic associated with subnets 202A, 202B, and 202C is expected to occur at POP 114A, while traffic associated with subnet 202N is expected to occur at POP 114N. (While a limited number of subnets 202, DNS servers 104, and POPs 114 are shown in FIG. 2A for illustrative purposes, various embodiments may include any number of subnets 202, DNS servers 104, and POPs 114.)


One of skill in the art will appreciate that the associations of FIG. 2A are logical in nature, and are unlikely to represent actual network communications between subnets 202, DNS resolvers 104, and POPs 114. For example, devices 102 subnets 202A may not directly communicate with resolvers 104, but may instead utilize one or more intermediary DNS resolvers (according to the hierarchical nature of DNS infrastructure). Moreover, devices 102 may not generally use DNS resolvers 104 as an intermediary to communicate with a POP 114. Rather, devices 102 may utilize resolvers 104 to resolve a hostname or domain name to an address of a POP 114, and thereafter direct communications to that address of the POP 114. Further, DNS resolvers 104A may not generally communicate with a POP 114A, but may instead communicate with DNS servers 112 (not shown in FIG. 2A) to resolve hostnames associated with a content delivery system 110. Thus, the associations of FIG. 2A are not necessarily intended to depict actual network communications. Rather, these associations are intended to depict how traffic at a POP 114 can be conceptualized as a result of association between subnets 202, DNS resolvers 104, and POPs 114.


In some instances, the associations of FIG. 2A may not be readily apparent to a content delivery system 110. For example, POPs 114 may not generally be notified of communications between DNS resolvers 104A and client computing devices 102 within subnets 202. Moreover, communications that are received from a DNS resolver 104 may not indicate the subnet 202 from which the communications originated. Thus, in some embodiments, the content delivery system 112 may be configured to determine associations between subnets 202 and DNS resolvers 104.


One set of mechanisms for determining associations between subnets 202 and DNS resolvers 104 is described within U.S. patent application Ser. No. 14/565,042, entitled “Capacity Independent Demand Assessment” and filed Dec. 9, 2014 (the “'042 Application”), which is hereby incorporated by reference in its entirety. For example, as described at FIG. 2 of the '042 Application, POPs 114 of a content delivery system 110 may transmit “web beacons” to specific client computing devices 102, which web beacons cause the client computing devices 102 to resolve a specific hostname associated with the content delivery system 110. DNS servers 112 of the content delivery system 110 may then monitor for requests to resolve the specific hostname, and associate the client computing devices 102 (or a subnet 202 including the client computing devices 102) with the DNS resolver 104 from which the request was received.


Another set of mechanisms determining associations between subnets 202 and DNS resolvers 104 is described within U.S. patent application Ser. No. 15/389,276, entitled “Network Addresses with Encoded DNS-Level Information” and filed Dec. 22, 2016 (the “'276 Application”), which is hereby incorporated by reference in its entirety. As noted in the '276 Application (e.g., at ¶ 0019) DNS servers 112 of a content delivery system 110 may in some instances encode request information, such as an identifier of a DNS resolver 104, into network addresses provided in response to a DNS request. Thus, subsequent communications to those network addresses can be determined to have occurred as a result of those DNS requests, and an association can be created between client computing devices 102 transmitting the subsequent communications and the DNS resolver 104 that transmitted the DNS request. Embodiments of the present disclosure may utilize additional or alternative mechanisms for associating subnets 202 (or devices 102 themselves) with DNS resolvers 104.


In the illustrative depiction of FIG. 2A, for simplicity, each subnet 202 is shown as associated with a single DNS resolver 104A. However, in some embodiments of the present disclosure, a subnet 202 may be associated with multiple DNS resolvers 104. For example, as described in the '042 Application, a given subnet 202 may be associated with two or more different resolvers 104, such that a given percentage of DNS requests from the subnet 202 are predicted to be directed to a first DNS resolver 104, a given percentage are predicted to be directed to a second DNS resolver 104, etc. In these embodiments, the traffic from each subnet 202 may be partitioned according to the percentages assigned to each resolver 104. So, if 20% of DNS requests from subnet 202A are predicted to be routed to DNS resolver 104A, 20% of traffic from devices within subnet 202A would be predicted to occur based on communication with the DNS resolver 104A (and thus could be shaped according to interactions with DNS resolver 104A).


Moreover, for simplicity, each DNS resolver 104A is associated with a single POP 114. However, in some embodiments of the present disclosure, a resolver 104 may be associated with multiple POPs 114. For example, resolver-to-POP mappings may indicate a certain percentage of DNS requests from a given resolver 104 should be responded to with an address of POP 114A, another percentage should be responded to with an address of POP 114B, etc. In this manner, traffic associated with a single DNS resolver 104 may be directed to multiple POP 114.


While description is generally made herein with respect to individual DNS resolvers 104, embodiments of the present disclosure may in some instances group multiple DNS resolvers 104. For example, DNS resolvers 104 within a given subnet (e.g., sharing a /24 or other prefix) may be considered as a “single” DNS resolver 104 (or a resolver “group”) for purposes of creating a resolver-to-POP mapping.


With reference to FIG. 2B, an illustrative block diagram is shown depicting associations between the subnets 202A-N and volume of communications to individual links associated with POPs 114A and 114N. As discussed above with respect to FIG. 2A, it is assumed in the present example that communications related to subnets 202A-C occur at POP 114A, and that communications related to subnet 202 occur at POP 114N. These communications may include, for example, requests from devices 102 of the respective subnets 202 to obtain content from the POPs 114, as well as transmission of such content from the POPs 114 to devices 102 within the subnets 202. Communication from each subnet 202A may be associated with a given volume of traffic, which may be measured according to various metrics. For example, volumes may be measured as “requests per second,” or the number of requests from devices 102 within a subnet 202 for content from the POPs 114. In another instance, volumes may be measured as bits per second, or the actual bandwidth used to support communications (e.g., in gigabits per second). Volumes may be measured, for example, by routing devices or content delivery devices within a POP 114.


As also shown in FIG. 2B, communications with a POP 114 may be transmitted to the POP 114 through a number of communication links. Devices 102 of subnets 202A and 202B, for example, are shown to communicate with POP 114A through link A.1, while devices of subnet 202C is shown to communicate with POP 114A through link A.2, etc. As noted above, each link may represent one or more physical connections (e.g., an individual connection, or multiple connections in serial or parallel) to a network external to the POP 114. Thus, each link is associated with capacity constraints based on those connections. For example, a given link may be able to support communications of a limited bandwidth (e.g., 10 gigabits per second) before becoming congested. As discussed above, the specific link to which communications are routed is generally controlled by routing protocols between the POP 114 and an external network, and is often selected to minimize some aspect of communications, such as latency, hop count, bandwidth, packet loss, or path reliability. It can be disadvantageous, difficult, or impossible to manipulate the individual links through which communications reach a POP 114. If the volume of communications over an individual link exceed the capacity of that link, errors (such as request timeouts) are likely to be observed at client computing devices 102. Thus, for example, if the volume of communications from subnets 202A and B exceed the capacity of link A.1, client computing devices 102 of subnets 202A and B are likely to experience errors, even when the POP 114 otherwise has capacity to service those communications.


With reference to FIG. 3, illustrative interactions are depicted enabling a content delivery system 110 to determine resolver-to-POP mappings based at least partly on a predicted effect of such mappings on loads at individual links of POPs 114, such that those individual links are expected not to be overloaded. The interactions begin at (1), where DNS servers 112 of the content delivery system 110 determine resolver-to-subnet correlation information. This information may represent information gathered at or generated by the DNS servers 112 and usable by the resolver-to-POP route mapping service 116 to determine associations between resolvers 104 and subnets 202. For example, in accordance with embodiments of the '042 Application, the resolver-to-subnet correlation information may include identifying information for DNS resolvers 104 that requested resolution of hostnames included in a web beacon. This information may then, at (2), be transmitted to the route mapping service 116 for use in determining associations between resolvers 104 and subnets 202.


In some instances, the mapping service 116 may determine associations between resolvers 104 and subnets 202 without requiring any information from the DNS servers 112, and thus interactions (1) and (2) may be omitted. For example, in accordance with embodiments of the '276 Application, associations between resolvers 104 and subnets 202 may be determined based on information encoded within addresses of POPs 114, and thus no information need be transmitted from the DNS servers 112 to the route mapping service 116.


At (3), the POPs 114 similarly determine resolver-to-subnet correlation information. As stated above, this information may represent information usable by the route mapping service 116 to determine associations between resolvers 104 and subnets 202 (though in the instance of interaction (3), the information would be generated at or gathered by POPs 114). For example, in accordance with embodiments of the '042 Application, the resolver-to-subnet correlation information gathered at POPs 114 may include identifying information for client computing devices 102 to which instructions to request a web beacon were transmitted. As another example, in accordance with embodiments of the '276 Application, this information may include identifying information of client computing devices 102 that requested content from encoded network addresses, as well as identifying information of resolvers 104 that has been encoded into those network addresses.


In addition, at (4), the POPs 114 determine associations between individual subnets 202 and individual communication links at the POPs 114. Illustratively, this information may be determined based on routing information available at the POPs 114, such as BGP route announcements. For example, a POP 114 may determine that a particular subnet 202 (e.g., an individual “/24” subnetwork) is reachable through a first communication link, and thus associate the subnet 202 with the first communication link. In one embodiment, the POP 114 may determine subnet-to-link associations for all potential subnets (e.g., every /24 network under the IPv4 addressing format that may be potentially served by the content delivery system 110). In another embodiment, the POP 114 may determine subnet-to-link associations for only some subnets, such as the top N subnets served by the content delivery system 110 in terms of communications volume, or subnets representing a threshold percentage of traffic on the content delivery system 110.


Still further, at (5), the POPs 114 determine volumes of communications associated with each subnet 202, such as the requests per second received from each subnet 202 or the bits per second required to communicate with each subnet 202. These volumes may be determined by observing present or historical communications with each subnet 202. For example, volumes over a relatively short period of time (e.g., a few minutes) may be averaged to represent a current volume for a given subnet 202. In some instances, volumes may represent future projections for communications with a subnet 202. For example, if a current volume of communications with a subnet 202 represents n gigabits per second, and that volume has been increasing at a rate of 5% every ten minutes, the POP 114 may project that, over a subsequent ten minutes, the volume of communications to the subnet would be 1.1*n gigabytes per second. Various other mechanisms for projecting future demand are known in the art and thus will not be described herein. Generally, the period of the future projection may be set by the content delivery system 110 to encompass a time during which a resolver-to-POP mappings will be used at the content delivery system 110. Thus, if new resolver-to-POP mappings are generated every hour, demand may be forecasted to cover a future hour of time, etc.


In addition to volume of communication, the POPs 114 also determine latency of communications with the subnets 202. Latencies can be determined, for example, by monitoring current or past communications with devices 102 of the subnets 202. Alternatively, latencies can be determined by instigating communications with the subnet 202 and observing a latency of those communications. For example, a POP 114 may transmit a “ping” request to a device on the subnet 202 to determine a latency of communications with the subnet 202. While the communication metric of latency is provided as an example in the illustrative interactions of FIG. 3, the content delivery system 110 may additionally or alternatively determine other communication metrics, such as hop count, bandwidth, packet loss, or path reliability.


Thereafter, at (6), the information gathered at the POPs 114 is transmitted to the resolver-to-POP route mapping service 116. At (7), the service 116 uses the information received from the POPs 114 (and potentially information received from the DNS servers 112) to determine resolver-to-subnet mappings. As noted above, such mappings can represent associations or correlations between client computing devices 102 of a subnet 202 and a DNS resolver 104 used by a subnet to resolve hostnames. Illustrative embodiments for determining associations between client computing devices 102 and a DNS resolver 104 are described in more detail in the '276 and '042 Applications, incorporated by reference above, and are thus not repeated herein.


At (8), the resolver-to-POP route mapping service 116 determines traffic volumes attributable to various resolvers 104. Illustratively, the traffic volumes attributable to a resolver 104 can represent traffic expected to be received from client computing devices 102 associated with that resolver 104. For a given resolver 104, the traffic volume of the resolver 104 may be determined by aggregating traffic volumes of all subnets 202 associated with the resolver 104. In the instance that only a given percentage of traffic of a subnet 202 is associated with the resolver 104, only that percentage of traffic could be included in the aggregate traffic volume of the resolver. Thus, in order to determine resolver traffic volumes, the route mapping service 116 may combine information associating subnets to resolvers with information associating subnets with traffic volumes in order to result in information assigning traffic volumes to resolvers.


As an illustrative example, returning to the depictions of FIGS. 2A and 2B, assume that POP 114A observed a volume of 2 gigabytes per second from subnet 202A and a volume of 3 gigabytes per second from subnet 202B. Both subnet 202A and 202B are associated with resolver 104A. Thus, 5 gigabytes of traffic volume can be attributed to resolver 104A. In the instance that only 50% of traffic from subnet 202A is associated with resolver 104A, a total traffic volume of 4 gigabits per second can be attributed to resolver 104A (3 gigabits per second from subnet 202B and one half of 2 gigabits per second from subnet 202A). A similar calculation can be completed for each remaining resolver 104 (e.g., B-N). In some embodiments, traffic volumes for a resolver may be aggregated based on types of data transmitted. For example, where the POPs 114 provide a record of volumes of different data types provided to client computing devices 102 associated with a resolver 104, the resolver-to-POP route mapping service 116 may determine data type-specific volumes for the resolver 104 by aggregating traffic volumes of a data type served to the client computing devices 102. Data type-specific volumes may be used, for example, in generating resolver-to-POP mappings based on data type-specific capacities.


At (9), the resolver-to-POP route mapping service 116 further determines latencies to be assigned to various POP 114 and resolver 104 pairs. As will be discussed below, these latencies can be used to rank or sort POPs 114 to be potentially assigned to a resolver 104. For example, a POP 114 with a lowest latency of communications with a resolver 104 may be ranked highest for potential assignment, a POP 114 with a second lowest latency may be ranked second highest, etc. For an individual resolver 104, latencies to each POP 114 may be determined based on latencies between each POP 114 and the subnets 202 associated with the resolver 104. For example, if a given POP 114 has an average latency of 30 milliseconds (ms) to the subnets 202 associated with a resolver 104, the resolver and POP pair may be assigned a 30 ms latency. As noted above, while latency is provided as an example communication metric, the content delivery system 110 may utilize other monitored communication metrics, such as hop count, bandwidth, packet loss, or path reliability in a similar manner.


Returning to the depictions of FIGS. 2A and 2B for the purposes of example, assume that POP 114A observed an average latency of 10 ms when communicating with subnet 202A, and an average latency of 20 ms when communicating with subnet 202B. Because both subnets 202A and B are associated with resolver 104A, the route mapping service 116 may average the latencies of these subnets 202 to determine a latency to be attributed to the pair of resolver 104A and POP 114A. Thus, the latency attributed to this pairing would (in this illustrative example) be 15 ms. In some embodiments, other calculations of latency may be utilized. For example, a route mapping service 116 may utilize an actual observed latency for communications between a POP 114 and a resolver 104, may utilize a highest latency of any subnet 202 associated with the resolver 104, etc. In yet other embodiments, other communication metrics may be used, such as hop count, bandwidth, packet loss, or path reliability.


Thereafter, at (10), the route mapping service 116 may determine resolver-to-POP mappings based on resolver traffic volumes, resolver latencies, and an effect of a mappings on capacities of the POPs 114, both with respect to an overall capacity of the POP 114 and an expected effect of a mapping on individual communication links of the POPs 114. The resolver-to-POP mappings can then be returned to the DNS servers 112 at (11).


One illustrative routine 400 that may be utilized by the route mapping service 116 to determine resolver-to-POP mappings is depicted in FIG. 4. The routine 400 begins at block 402, where the route mapping service 116 obtains resolver-to-subnet mapping information (e.g., as determined at interaction (7) of FIG. 3). The routine 400 proceeds to block 404, where volume and latency information is received. This volume and latency information may include, for example, volume and latencies attributable to resolvers 104 (e.g., as determined at interactions (8) and (9) of FIG. 3), as well as volumes and latencies attributable to subnets 104 (e.g., as determined at interaction (5) of FIG. 3).


Thereafter, the routine 400 proceeds to block 406, where the route mapping service 116 selects a resolver 104 to which to assign a POP 114. As discussed above, assignment of a POP 114 to a resolver 104 can result in DNS requests from the resolver 104 being responded to with a network address of the POP 114. Thus, assignment of a POP 114 to a resolver 104 can result in the direction of traffic associated with the resolver 104 (e.g., traffic of client computing devices 102 serviced by the resolver 104) to the POP 114.


In one embodiment, the route mapping service 116 selects a resolver 104 by ranking potential resolvers 104, and selecting a highest ranked resolver. Illustratively, the route mapping service 116 may consider resolvers 104 in order of total traffic volume, such that a resolver 104 associated with the highest volume of traffic to the content delivery system 110 is considered first. In other embodiments, the route mapping service 116 may consider resolvers 104 in other orders (e.g., reverse volume load, random, in numerical order of network addresses, etc.).


The routine 400 then proceeds to block 408, where a POP 114 of the content distribution system 110 is assigned to the resolver 104. In one embodiment, block 408 is a subroutine corresponding to the routine 500 of FIG. 5. In brief, this subroutine may assign to the resolver 104 a POP 114 with the lowest latency to the resolver 104 (or other positive communication metric), but with sufficient capacity to service traffic associated with the resolver 104 both in terms of overall capacity, and capacity of individual links of the POP 114. Further details regarding a potential routine for the assignment of a POP 114 to a resolver 104 are provided below with respect to FIG. 5.


Thereafter, the routine 400 proceeds to block 410, where the route mapping service 116 determines whether any additional resolvers 104 that have not yet been assigned a POP 114. If so, the routine 400 returns to block 406, where a new resolver 104 is selected, and where, at block 408, a POP 114 is assigned to the selected resolver 104. The routine 400 proceeds in this manner until, at block 410, no resolvers 104 remain that require the assignment of a POP 114.


At block 412, the routine 400 builds a resolver-to-POP mapping based on the previously determined assignments. Illustratively, the resolver-to-POP mapping may specify, for each resolver 104, one or more POPs 114 to be identified in DNS responses to the resolver 104. At block 414, the resolver-to-POP mappings are transmitted to DNS servers 112 of the content delivery system 112, and the routine 400 ends at block 416.


Thereafter, the DNS servers 112 may respond to DNS requests from the resolvers 104 based on the resolver-to-POP mapping (e.g., by returning a network address of a POP 114 assigned to a resolver 104 from which a DNS request was received). Thus, traffic of client computing devices 102 associated with a resolver 104 would be expected to flow to a POP 114 assigned to that resolver. Because the resolver-to-POP mapping are selected such that this traffic is expected not to exceed the capacity of individual links of the POPs 114, the overall efficiency of the content delivery system 114 can be improved relative to prior systems.


With reference to FIG. 5, one illustrative routine 500 for assigning a POP 114 to a resolver 104 will be described. This routine 500 may be implemented, for example, by the route mapping system 116. Illustratively, the routine 500 may be implemented as a subroutine to the routine 400 of FIG. 4 (e.g., at block 408 of the routine 400).


The routine 500 begins at block 502, where the route mapping system 116 generates a ranking or sorting of potential POPs 114 according to the latency associated with the resolver 104 and POP 114 pair. For example, a POP 114 with the lowest latency to the resolver 104 may be ranked most highly, followed by a second lowest latency POP 114, etc. As noted above, while latency is provided as an example communication metric for the purposes of ranking, POPs 114 may additionally or alternatively be ranked based on other communication metrics, such as hop count, bandwidth, packet loss, or path reliability between the POPs 114 and the relevant resolver 104.


At block 504, the route mapping system 116 selects a first candidate POP 114 to potentially assign to the resolver 104. The first candidate POP 114 may be selected, for example, as the highest ranked POP 114 from the ranking of block 502.


At blocks 506-510, the route mapping service 116 determines whether assignment of the selected candidate POP 114 to the resolver 104 would be expected to exceed the capacity of the POP 114.


Specifically, at block 506, the route mapping service 116 may determine whether a total volume of communications associated with the resolver 104 would be expected to exceed an overall capacity of the POP 114 to service requests. For example, where the POP 114 is rated (e.g., by an administrator of the content delivery system 110) as being capable of servicing 100 gigabits per second of traffic, and prior assignment of the POP 114 to other resolvers 104 is expected to result in 40 gigabits per second of traffic, the route mapping service 116 may determine at block 504 whether a traffic volume of the present resolver 104 exceeds 60 gigabits per second (the remaining capacity of the POP 114 in view of prior assignments, if any).


In addition, at block 508, the route mapping service 116 determines whether assignment of a resolver 104 to a given POP 114 would exceed capacity of an individual links of the POP 114. Illustratively, the route mapping service 116 may determine what subnets 202 are associated with a resolver 104 being considered (as determined from resolver-to-subnet mappings) and the volume of traffic from those subnets 202 (as determined by observed subnet volumes at the POP). The route mapping service 116 may thereafter, for a given candidate POP 114, determine the one or more communication link of the POP 114 that would be used to service communications from those subnets 202 (as determined from routing information gathered at the POP 114).


For each communication link, the route mapping service 116 determines whether assignment of the POP 114 to the current resolver 104 would cause traffic expected to flow over the communication link to exceed the links capacity. As an illustrative example, assume that all traffic from subnets 202 associated with a resolver 104 would be expected to flow over a single communication link at a POP 114. Further assume that this communication link has a capacity of 9 gigabits per second (e.g., as determined by an administrator of the content delivery system 110 in view of the total bandwidth available on the communication link). Still further, assume that based on prior assignments to other resolvers 104, that communication link is expected to experience 3 gigabits per second of communications. In this scenario, the traffic of a current resolver 104 would not exceed the capacity of the communication link so long as that traffic was at or under 6 gigabits per second. Similar examples can be provided where a resolver 104 is associated with traffic expected to flow to a POP 104 over multiple communication links. In such an example, the route mapping service 116 would determine whether the traffic expected to flow over each link (e.g., from a particular subnet 202 associated with the resolver 104) exceeded the capacity of that link.


At block 510, the route mapping service 116 determines whether the candidate POP 114 has sufficient capacity to be assigned to the resolver 104. Illustratively, if the overall capacity of a POP 114 would not be exceeded by such assignment (e.g., as determined in block 506) and if no communication link of the POP 114 would have its capacity exceeded by such assignment (e.g., as determined in block 508), then block 510 evaluates as true, and the routine 500 proceeds to block 512. The candidate POP 114 is then assigned to the resolver 104, and the routine 500 ends at block 514.


If the capacity of any link of a POP 114 would be exceeded by assignment of the POP 114 to the resolver 104, or if the overall capacity of the POP 114 would be exceeded by such assignment, block 510 evaluates as false, and the routine 500 returns to block 504. The routine 500 then continues until a POP 114 is selected for assignment to the resolver. While not shown in FIG. 5, the routine 500 may exit with an error (e.g., a notification to an administrator) if no candidate POP 114 is found to have sufficient capacity to be assigned to a resolver 104.


While the illustrative routine 500 is described such that a single POP 114 is assigned to a resolver 104, the routine 500 in some embodiments may be modified such that multiple POPs 114 are assigned to a given resolver 104. For example, where a first POP 114 has sufficient capacity to service half (but not all) of the traffic volume associated with a resolver 104, both the first POP 114 and the second POP 114 may be assigned to the resolver 104 in an effort to split traffic from the resolver between the first and second POPs 114. In one embodiment, a resolver-to-POP mapping may specify a division of traffic between the first-and-second POPs 114 (e.g., 50/50, 25/75, etc.), and the route mapping service 116 may consider only a relevant portion of the traffic from a resolver 104 in the calculations discussed above. A DNS server 112, in responding to DNS requests from the resolver 104, may respond to the requests based on the division of traffic. For example, the DNS server 112 may respond to 50% of requests by providing an address of the first POP 114, and the other 50% of requests by providing an address of the second POP 114.


As noted above, while aspects of the present disclosure are discussed with respect to an overall POP capacity or link capacities, other capacities may additionally or alternatively be taken into account when generating resolver-to-POP mappings. Thus, the routine 500 may be modified to take into account these other capacities. For example, the routine 500 may be modified to obtain a record of the various types of data transmitted to client computing devices 102 and thus attributable to a resolver 104, and to predict an effect of those volumes of a given type of data on a corresponding capacity of each POP 114 to serve that type of data to ensure that the POP 114 has sufficient capacity to service the traffic attributable to the resolver. As noted above, the capacity of a POP 114 to serve a given type of data may be specified with respect to the data type itself (e.g., a specific capacity to serve video content, audio content, image content, data of a particular file type, etc.), or may be specified with respect to a hardware computing resource of the POP 114 (e.g., by mapping a volume of a specific data type to an expected usage of a hardware computing resource to that volume of the specific data type). Thus, the capacities discussed in FIG. 5 are intended to be illustrative in nature.



FIG. 6 depicts a general architecture of a resolver-to-POP route mapping system 600 that may implement functionalities of the resolver-to-POP route mapping service 116 described above. The general architecture of the resolver-to-POP route mapping system 600 depicted in FIG. 6 includes an arrangement of computer hardware and software elements that may be used to implement aspects of the present disclosure. The hardware elements may be implemented with physical electronic devices, as discussed in greater detail below. The resolver-to-POP route mapping system 600 may include many more (or fewer) elements than those shown in FIG. 6. It is not necessary, however, that all of these generally conventional elements be shown in order to provide an enabling disclosure. Additionally, the general architecture illustrated in FIG. 6 may be used to implement one or more of the other components illustrated in FIG. 1.


As illustrated, the resolver-to-POP route mapping system 600 includes a processing unit 604, a network interface 606, a computer readable medium drive 607, and an input/output device interface 620, all of which may communicate with one another by way of a communication bus. The network interface 606 may provide connectivity to one or more networks or computing systems, such as the network 106. The processing unit 604 may thus receive information and instructions from other computing systems or services via the network. The processing unit 604 may also communicate to and from memory 610 and further provide output information for an optional display (not shown) via the input/output device interface 620. The input/output device interface 620 may also accept input from an optional input device (not shown).


The memory 610 may contain computer program instructions (grouped as modules in some embodiments) that the processing unit 604 executes in order to implement one or more aspects of the present disclosure. The memory 610 generally includes random access memory (RAM), read only memory (ROM) and/or other persistent, auxiliary or non-transitory computer readable media. The memory 610 may store an operating system 614 that provides computer program instructions for use by the processing unit 604 in the general administration and operation of the resolver-to-POP route mapping system 600. The memory 610 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 610 includes a user interface unit 612 that generates user interfaces (and/or instructions therefor) for display upon a computing device, e.g., via a navigation and/or browsing interface such as a browser or application installed on the computing device. In addition, the memory 610 may include and/or communicate with one or more data repositories (not shown), for example, to access user program codes and/or libraries.


In addition to and/or in combination with the user interface unit 612, the memory 610 may include mapping software 616 that may be executed by the processing unit 604. In one embodiment, mapping software 616 implements various aspects of the present disclosure, e.g., assigning POP 114 of the content delivery system 110 to DNS resolvers 104 and generating resolver-to-POP mapping information identifying such assignments.


While the mapping software 616 is shown in FIG. 6 as part of the resolver-to-POP route mapping system 600, in other embodiments, all or a portion of the mapping software 616 may be implemented by other components of the content distribution system 110 and/or another computing device. For example, in certain embodiments of the present disclosure, a POP 114 of the content distribution system 110 may include mapping software 616 or otherwise be configured with executable instructions to operate similarly to the resolver-to-POP route mapping system 600.


In some embodiments, the resolver-to-POP route mapping system 600 may further include components other than those illustrated in FIG. 6. For example, the memory 610 may further include executable instructions to undertake other operations related to the present disclosure, such as the association of subnets 202 to DNS resolvers 104.


All of the methods and processes described above may be embodied in, and fully automated via, software code modules executed by one or more general purpose computers or processors. The code modules may be stored in any type of non-transitory computer-readable medium or other computer storage device. Some or all of the methods may alternatively be embodied in specialized computer hardware.


Conditional language such as, among others, “can,” “could,” “might” or “may,” unless specifically stated otherwise, are otherwise understood within the context as used in general to present that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/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 user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.


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 and/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 or at least one of Z to each be present.


Unless otherwise explicitly stated, articles such as ‘a’ or ‘an’ should generally be interpreted to include one or more described items. Accordingly, phrases such as “a device configured to” are intended to include one or more recited devices. Such one or more recited devices can also be collectively configured to carry out the stated recitations. For example, “a processor configured to carry out recitations A, B and C” can include a first processor configured to carry out recitation A working in conjunction with a second processor configured to carry out recitations B and C.


Any routine descriptions, elements or blocks in the flow diagrams described herein and/or depicted in the attached figures should be understood as potentially representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or elements in the routine. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, or executed out of order from that shown or discussed, including substantially synchronously or in reverse order, depending on the functionality involved as would be understood by those skilled in the art.


It should be emphasized that many variations and modifications may be made to the above-described embodiments, the elements of which are to be understood as being among other acceptable examples. All such modifications and variations are intended to be included herein within the scope of this disclosure and protected by the following claims.

Claims
  • 1. A system comprising: a plurality of points of presence (“POPs”), each POP comprising one or more computing devices configured to retrieve and transmit content, and each POP including at least two communication links with an external network;a domain name system (“DNS”) server configured to receive, from a DNS resolver, requests to resolve a hostname of a content delivery system into a network address of a POP of the plurality of POPs; andone or more processors implementing a demand analysis service, the one or more processors configured with specific computer-executable instructions to: determine an association between the DNS resolver and a client computing device;determine a volume of communications between the client computing device and the plurality of POPs;select a first POP, from the plurality of POPs, for potential assignment to the DNS resolver based at least partly on a latency of communications between the client computing device and the first POP;identify, based at least in part on routing information available at the first POP, a first communication link of the first POP over which communications between the first POP and the client computing device are routed;determine that the volume of communications does not exceed a network capacity of the first communication link; andtransmit to the DNS server an indication that the first POP has been assigned to the DNS resolver, wherein assignment of the first POP to the DNS resolver causes the DNS server to respond to resolution requests from the DNS resolver with a network address of the first POP.
  • 2. The content delivery system of claim 1, wherein the volume of communications represents at least one of a number of requests per second transmitted from the client computing device or a number of bits per second transmitted from the client computing device.
  • 3. The content delivery system of claim 1, wherein the client computing device is associated with a subnetwork including a plurality of client computing devices, and wherein the volume of communications between the client computing device and the plurality of POPs corresponds to a volume of communications between the subnetwork and the plurality of POPs.
  • 4. The content delivery system of claim 3, wherein the subnetwork corresponds to a block of network addresses of a predetermined size.
  • 5. The content delivery system of claim 1, wherein the one or more processors are further configured with the specific computer-executable instructions to: determine a volume of communications of a specific data type between the client computing device and the plurality of POPs; anddetermine that the volume of communications of the specific data type does not exceed a capacity of the first POP to service data of the specific data type.
  • 6. A computer-implemented method comprising: determining an association between a domain name system (“DNS”) resolver and a client computing device;determining a volume of communications between the client computing device and a point of presence (“POP”);identifying, based at least in part on routing information available at the POP, a communication link of the POP over which communications between the POP and the client computing device are routed;determining that the volume of communications does not exceed a network capacity of first communication link; andtransmitting to a DNS server an indication that the POP has been assigned to the DNS resolver.
  • 7. The computer-implemented method of claim 6, wherein determining an association between the DNS resolver and a client computing device comprises: transmitting a predetermined hostname to the client computing device;receiving a request from the DNS resolver to resolve the predetermined hostname into a network address; andassociating the client computing device with the DNS resolver.
  • 8. The computer-implemented method of claim 7, wherein the predetermined hostname is included within a universal resource locator (“URL”), and wherein the URL corresponds to a web beacon.
  • 9. The computer-implemented method of claim 6, wherein the POP is included within a plurality of POPs, wherein the computer-implemented method further comprises selecting the POP, from the plurality of POPs, for potential assignment to the DNS resolver based at least partly on a network metric between the client computing device and the POP, and wherein the network metric includes at least one of latency, hop count, bandwidth, packet loss, or path reliability.
  • 10. The computer-implemented method of claim 9 further comprising, prior to selecting the POP for potential assignment to the DNS resolver: selecting a second POP from the plurality of POPs for potential assignment to the DNS resolver;identifying, based at least in part on routing information available at the second POP, a communication link of the second POP over which communications between the second POP and the client computing device are routed; anddetermining that the volume of communications exceeds a network capacity of the communication link of the second POP.
  • 11. The computer-implemented method of claim 6, wherein the computer-implemented method further comprises: identifying, based at least in part on routing information available at a second POP, a communication link of the second POP over which communications between the second POP and the client computing device are routed;determining that a remaining percentage of the total volume of communications does not exceed a network capacity of the communication link of the second POP; andtransmitting to the DNS server an indication that the second POP has been assigned to the DNS resolver.
  • 12. The computer-implemented method of claim 11, wherein assignment of the second POP to the DNS resolver causes the DNS server to respond resolution portion of requests from the DNS resolver by providing an address of the second POP.
  • 13. The computer-implemented method of claim 12, wherein the portion is equal to the remaining percentage of the total volume of communications.
  • 14. The computer-implemented method of claim 6, wherein the client computing device is associated with a subnetwork including a plurality of client computing devices, and wherein the volume of communications between the client computing device and the POP corresponds to a volume of communications between the subnetwork and the POP.
  • 15. Non-transitory computer-readable media comprising computer-executable instructions, wherein the computer-executable instructions, when executed by a computing system, cause the computing system to: determine an association between a domain name system (“DNS”) resolver and a client computing device;determine a volume of communications between the client computing device and a point of presence (“POP”);identify, based at least in part on routing information available at the POP, a communication link of the POP over which communications between the POP and the client computing device are routed;determine that the volume of communications does not exceed a network capacity of the communication link; andtransmit to the DNS server an indication that the POP has been assigned to the DNS resolver.
  • 16. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions cause the computing system to determine the association between the DNS resolver and the client computing device at least partly by: receiving from the client computing device a request for content, wherein the request is addressed to an encoded network address;decoding, from the encoded network address, identifying information of the DNS resolver; andassociating the client computing device with the DNS resolver.
  • 17. The non-transitory computer-readable media of claim 15, wherein the routing information corresponds to a border gateway protocol (BGP) table.
  • 18. The non-transitory computer-readable media of claim 15, wherein the POP is included within a plurality of POPs, wherein the computer-executable instructions cause the computing system to select the POP, from the plurality of POPs, for potential assignment to the DNS resolver based at least partly on a network metric between the client computing device and the POP.
  • 19. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to: determine an association between a second DNS resolver and a second client computing device;determine a volume of communications between the second client computing device and the POP;identify, based at least in part on routing information available at the POP, that communications between the POP and the second client computing device are routed over the communication link;determine that a combination of the volume of communications associated with the first client computing device and the volume of communications associated with the second client computing device does not exceed a network capacity of the communication link; andtransmit to the DNS server an indication that the POP has been assigned to the second DNS resolver.
  • 20. The non-transitory computer-readable media of claim 15, wherein the association between the DNS resolver and the client computing device indicates a percentage of DNS requests transmitted by the client computing device that are expected to be routed to the DNS resolver, and wherein the volume of communications between the client computing device and the POP is a percentage of a total volume of communications between the client computing device and the POP equal to the percentage of DNS requests.
  • 21. The non-transitory computer-readable media of claim 15, wherein the computer-executable instructions further cause the computing system to, prior to transmitting to the DNS server the indication that the POP has been assigned to the DNS resolver: select a second POP as a candidate for assignment to the DNS resolver;identify, based at least in part on routing information available at the second POP, a communication link of the second POP over which communications between the second POP and the client computing device are routed;determine that the volume of communications exceeds a network capacity of the communication link of the second POP; andselect the first POP as a candidate for assignment to the DNS resolver.
US Referenced Citations (1486)
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 May 1997 A
5701467 Freeston Dec 1997 A
5764910 Shachar Jun 1998 A
5774660 Brendel et al. Jun 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 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
6223288 Byrne Apr 2001 B1
6243761 Mogul et al. Jun 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 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 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
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 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
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
6950848 Yousefi'zadeh et al. Sep 2005 B1
6961783 Cook et al. Nov 2005 B1
6963850 Bezos et al. Nov 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6981017 Kasriel 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
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
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
7149809 Barde et al. Dec 2006 B2
7152118 Anderson, IV et al. Dec 2006 B2
7162539 Garcie-Luna-Aceves 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
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
7350075 Eastham et al. Mar 2008 B1
7362703 Taft Apr 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 Nov 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
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 Apr 2009 B1
7519720 Fishman et al. Apr 2009 B2
7519726 Palliyil et al. Apr 2009 B2
7523181 Swildens 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 Aug 2009 B1
7581009 Hsu et al. Aug 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. Oct 2009 B2
7613815 Prakash et al. Nov 2009 B1
7617222 Coulthard et al. Nov 2009 B2
7623460 Miyazaki Nov 2009 B2
7624169 Lisiecki et al. Nov 2009 B2
7631101 Sullivan et al. Dec 2009 B2
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
7693813 Cao et al. Apr 2010 B1
7693959 Leighton et al. Apr 2010 B2
7702724 Brydon et al. Apr 2010 B1
7706740 Collins et al. 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
7730187 Raciborski et al. Jun 2010 B2
7739400 Lindbo et al. Jun 2010 B2
7747720 Toebes et al. Jun 2010 B2
7756017 Goyal 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
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
7853719 Cao et al. Dec 2010 B1
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
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
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
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
7996533 Leighton et al. Aug 2011 B2
7996535 Auerbach Aug 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8001187 Stochosky Aug 2011 B2
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
8065275 Eriksen et al. Nov 2011 B2
8069231 Schran et al. Nov 2011 B2
8073940 Richardson et al. Dec 2011 B1
8082348 Averbuj et al. Dec 2011 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 Apr 2012 B1
8156199 Hoche-Mong et al. Apr 2012 B1
8156243 Richardson et al. Apr 2012 B2
8161184 Sekar et al. Apr 2012 B2
8175863 Ostermeyer et al. May 2012 B1
8190682 Paterson-Jones et al. May 2012 B2
8195605 Chellappa et al. Jun 2012 B2
8195837 McCarthy et al. Jun 2012 B2
8209695 Pruyne et al. Jun 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
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
8291046 Farber et al. Oct 2012 B2
8291117 Eggleston Oct 2012 B1
8296393 Alexander et al. Oct 2012 B2
8301600 Helmick et al. Oct 2012 B1
8301645 Crook Oct 2012 B1
8321568 Sivasubramanian et al. Nov 2012 B2
8321588 Richardson et al. Nov 2012 B2
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
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
8447876 Verma et al. May 2013 B2
8452745 Ramakrishna 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
8478903 Farber et al. Jul 2013 B2
8504721 Hsu et al. Aug 2013 B2
8510428 Joshi Aug 2013 B2
8510807 Elazary et al. Aug 2013 B1
8521851 Richardson et al. 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
8577992 Richardson Nov 2013 B1
8589996 Ma et al. Nov 2013 B2
8606996 Richardson et al. Dec 2013 B2
8612565 Schneider Dec 2013 B2
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
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
8712950 Smith et al. Apr 2014 B2
8732309 Richardson 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
8775553 Cansino Jul 2014 B2
8782236 Marshall et al. Jul 2014 B1
8782279 Eggleston et al. Jul 2014 B2
8812727 Sorenson, III et al. Aug 2014 B1
8819283 Richardson et al. Aug 2014 B2
8826032 Yahalom et al. Sep 2014 B1
8904009 Marshall et al. Dec 2014 B1
8914514 Jenkins et al. Dec 2014 B1
8924528 Richardson Dec 2014 B1
8930513 Richardson Jan 2015 B1
8930544 Richardson et al. Jan 2015 B2
8935744 Osterweil et al. Jan 2015 B2
8938526 Richardson Jan 2015 B1
8949161 Borst et al. Feb 2015 B2
8949459 Scholl Feb 2015 B1
8966318 Shah Feb 2015 B1
8972580 Fleischman et al. Mar 2015 B2
8976711 Li Mar 2015 B2
9003035 Richardson 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
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
9106701 Richardson et al. Aug 2015 B2
9116803 Agrawal et al. Aug 2015 B1
9130756 Richardson et al. Sep 2015 B2
9130977 Zisapel et al. Sep 2015 B2
9137302 Makhijani et al. Sep 2015 B1
9154551 Watson Oct 2015 B1
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
9191458 Richardson et al. Nov 2015 B2
9195996 Walsh et al. Nov 2015 B1
9208097 Richardson 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
9294391 Mostert Mar 2016 B1
9323577 Marr et al. Apr 2016 B2
9332078 Sivasubramanian et al. May 2016 B2
9386038 Martini Jul 2016 B2
9391949 Richardson et al. Jul 2016 B1
9407676 Archer et al. Aug 2016 B2
9407681 Richardson 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
9495338 Hollis et al. Nov 2016 B1
9497259 Richardson et al. Nov 2016 B1
9515949 Richardson et al. Dec 2016 B2
9525659 Sonkin et al. Dec 2016 B1
9544394 Richardson et al. Jan 2017 B2
9571389 Richardson et al. 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
9628509 Holloway et al. Apr 2017 B2
9628554 Marshall et al. Apr 2017 B2
9645808 Turpie May 2017 B1
9703713 Nadgowda Jul 2017 B2
9705922 Foxhoven et al. Jul 2017 B2
9712325 Richardson et al. Jul 2017 B2
9712484 Richardson Jul 2017 B1
9734472 Richardson et al. Aug 2017 B2
9742795 Radlein et al. Aug 2017 B1
9760420 Letz et al. Sep 2017 B1
9774619 Radlein et al. Sep 2017 B1
9787599 Richardson et al. Oct 2017 B2
9787775 Richardson Oct 2017 B1
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
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 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
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
10033627 Howard Jul 2018 B1
10033691 Mizik et al. Jul 2018 B1
10033699 Sullivan et al. Jul 2018 B2
10049051 Baldwin Aug 2018 B1
10075551 Baldwin et al. Sep 2018 B1
10079742 Richardson et al. Sep 2018 B1
10091096 Howard Oct 2018 B1
10097398 Richardson et al. Oct 2018 B1
10097448 Howard Oct 2018 B1
10097566 Radlein et al. Oct 2018 B1
10110694 Watson et al. Oct 2018 B1
10116584 Richardson et al. Oct 2018 B2
10135620 Richardson et al. Nov 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
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
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
10305797 Richardson et al. May 2019 B2
10348639 Puchala et al. Jul 2019 B2
10374955 Mostert Aug 2019 B2
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
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
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
20020143675 Orshan Oct 2002 A1
20020143798 Lisiecki et al. 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
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
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
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
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
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 Aug 2005 A1
20050181769 Kogawa Aug 2005 A1
20050188073 Nakamichi et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050192814 Challener 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 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 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
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 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 Oct 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
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 May 2007 A1
20070118668 McCarthy 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 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
20070219795 Park et al. Sep 2007 A1
20070220010 Ertugrul 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
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 Dec 2007 A1
20070280229 Kenney 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
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
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
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
20080189437 Halley Aug 2008 A1
20080201332 Souders 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
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
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
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
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
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 Oct 2009 A1
20090248787 Sivasubramanian et al. Oct 2009 A1
20090248852 Fuhrmann et al. Oct 2009 A1
20090248858 Sivasubramanian Oct 2009 A1
20090248893 Richardson Oct 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090253435 Olofsson Oct 2009 A1
20090254661 Fullagar et al. Oct 2009 A1
20090259588 Lindsay Oct 2009 A1
20090259971 Rankine et al. Oct 2009 A1
20090262741 Jungck 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 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
20100042725 Jeon et al. Feb 2010 A1
20100049862 Dixon Feb 2010 A1
20100057894 Glasser 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 Bappu 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 May 2010 A1
20100125675 Richardson 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
20100257024 Holmes et al. Oct 2010 A1
20100257266 Holmes et al. Oct 2010 A1
20100257566 Matila 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. Dec 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
20110010244 Hatridge Jan 2011 A1
20110016214 Jackson Jan 2011 A1
20110029598 Arnold 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
20110085654 Jana et al. Apr 2011 A1
20110087769 Holmes et al. Apr 2011 A1
20110096987 Morales 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
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 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
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 Narendran Jan 2012 A1
20120023090 Holloway et al. Jan 2012 A1
20120023226 Petersen et al. Jan 2012 A1
20120036238 Sundaram et al. Feb 2012 A1
20120041899 Greene et al. Feb 2012 A1
20120041970 Ghosh 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 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
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
20120278229 Vishwanathan et al. Nov 2012 A1
20120278831 van Coppenolle 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
20130018945 Vendrow et al. Jan 2013 A1
20130019311 Swildens et al. Jan 2013 A1
20130034099 Hikichi et al. Feb 2013 A1
20130041872 Aizman et al. 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
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
20130086001 Bhogal et al. Apr 2013 A1
20130089005 Li 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
20130305046 Mankovski et al. Nov 2013 A1
20130305083 Machida 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
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
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
20140108672 Ou et al. Apr 2014 A1
20140122698 Batrouni et al. May 2014 A1
20140122725 Batrouni et al. May 2014 A1
20140137111 Dees 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
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
20140269371 Badea et al. 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
20140325155 Marshall et al. Oct 2014 A1
20140331328 Wang et al. Nov 2014 A1
20140337472 Newton et al. Nov 2014 A1
20140351413 Smith 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
20150088964 Shiell et al. Mar 2015 A1
20150088972 Brand et al. Mar 2015 A1
20150089621 Khalid Mar 2015 A1
20150095516 Bergman Apr 2015 A1
20150106864 Li et al. Apr 2015 A1
20150154051 Kruglick 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
20150188734 Petrov Jul 2015 A1
20150189042 Sun et al. Jul 2015 A1
20150195244 Richardson Jul 2015 A1
20150200991 Kwon Jul 2015 A1
20150207733 Richardson et al. Jul 2015 A1
20150215270 Sivasubramanian et al. Jul 2015 A1
20150215656 Pulung et al. Jul 2015 A1
20150229710 Sivasubramanian et al. 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
20150319260 Watson 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. Mar 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. Apr 2016 A1
20160132600 Woodhead et al. May 2016 A1
20160134492 Ellsworth et al. May 2016 A1
20160142251 Contreras et al. May 2016 A1
20160182454 Phonsa et al. Jun 2016 A1
20160182542 Staniford Jun 2016 A1
20160205062 Mosert Jul 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 Oct 2016 A1
20160337426 Shribman et al. Nov 2016 A1
20160366202 Phillips et al. Dec 2016 A1
20170041428 Katsev Feb 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
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
20170353395 Richardson Dec 2017 A1
20180063027 Rafferty 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
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
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. Mar 2019 A1
20190089542 Richardson et al. Mar 2019 A1
20190098109 Watson Mar 2019 A1
20190190998 Sivasubramanian et al. Jun 2019 A1
20190222666 Uppal et al. Jul 2019 A1
Foreign Referenced Citations (42)
Number Date Country
2741 895 May 2010 CA
1422468 Jun 2003 CN
1511399 Jul 2004 CN
1605182 Apr 2005 CN
101189598 May 2008 CN
101460907 Jun 2009 CN
103731481 Apr 2014 CN
1603307 Dec 2005 EP
1351141 Oct 2007 EP
2008167 Dec 2008 EP
3156911 Apr 2017 EP
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
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 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
Non-Patent Literature Citations (177)
Entry
“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, filed 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, 2018].
“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/lxf/38/iptables.pdf, 4 pages.
Coulson, D., “Network Security Iptables,” Mar. 2003, Linuxpro, Part 1, retrieved from http://davidcoulson.net/writing/lxf/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.
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.
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-10, 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.
Office Action in Application No. 09729072.0 dated Dec. 7, 2018.
Examination Report in Indian Application No. 4487/DELNP/2013 dated Dec. 28, 2018.
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.
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.
Frangoudis et al, PTPv2-based Network Load Estimation and Its Application to QoE Monitoring for Over-the-Top Services, IISA 2014, the 5th International Conference on Information, Intelligence, Systems and Application, IEEE, Jul. 7, 2014, pp. 176-181.
International Search Report and Written Opinion in PCT/US2018/036634 dated Sep. 11, 2018.
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.
Partial Search Report in European Application No. 16876655.8 dated May 15, 2019.
International Preliminary Report on Patentability and Written Opinion in PCT/US2017/055156 dated Apr. 9, 2019.
Related Publications (1)
Number Date Country
20180367498 A1 Dec 2018 US