Identifying sources of network attacks

Information

  • Patent Grant
  • 9794281
  • Patent Number
    9,794,281
  • Date Filed
    Thursday, September 24, 2015
    8 years ago
  • Date Issued
    Tuesday, October 17, 2017
    6 years ago
Abstract
Systems and methods are described to enable identification of computing devices associated with network attacks, such as denial of service attacks. Data packets used to execute a network attack often include forged source address information, such that the address of an attacker is difficult or impossible to determine based on those data packets. However, attackers generally provide legitimate address information when resolving an identifier, such as a universal resource identifier (URI), of an attack target into corresponding destination addresses. The application enables individual client computing devices to be provided with different combinations of destination addresses, such that when an attack is detected on a given combination of destination address, the client computing device to which that combination of destination addresses was provided can be identified as a source of the attack.
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.


Service providers or content creators (such as businesses, artists, media distribution services, etc.) can employ a series of interconnected data centers to deliver content (such as web sites, web content, or other digital data) to users or clients. These interconnected data centers are sometimes referred to as “content delivery networks” (CDNs) or content delivery systems. Existing routing and addressing technologies can enable multiple data centers associated with a content delivery system 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”). A content delivery system can maintain POPs over a wide area (or worldwide) to enable the system to efficiently service requests from clients in a variety of locations.


Malicious entities occasionally attempt to disrupt the operations of service providers or content creators via network-based attacks (“network attacks”). One mechanism for doing so is a “denial of service” (DoS) attack. These attacks generally attempt to make a target computing device or network resource, such as a web site, unavailable to legitimate clients. One common instance of a DoS attack involves saturating the target device or network with external communications requests, such that it cannot respond to legitimate traffic, or it responds so slowly as to be rendered effectively unavailable. Because of the number of requests required to mount such an attack, responsibility for implementing the attack is often distributed across many computing devices. These distributed attacks are therefore known as “distributed denial of service” (DDoS) attacks. Because attacked targets, such as specific web sites or domain names, are often hosted or associated with a content delivery system, that system itself may also be targeted by the attack. Further, the content delivery system often hosts content on behalf of non-targeted systems or networks, which may also be affected by the attack due to their use of the content delivery system.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram depicting an illustrative logical network 100 including multiple accessing computing devices 102 and content providers 104, as well as a content delivery system 110 including multiple points-of-presence 114;



FIG. 2 is a block diagram depicting interactions between a legitimate accessing computing device 102A and the content delivery system 110 of FIG. 1 to provide content hosted by the content delivery system 110 on behalf of a content provider 104;



FIG. 3 is a block diagram depicting implementation of a denial of service attack on the content delivery system 110 of FIG. 1 by a set of illegitimate accessing computing devices 102 and responsive actions of the content delivery system 110, including detection of the specific content targeted in the denial of service attack or an identity of an attacker associated with the attack; and



FIG. 4 is a flow chart depicting an illustrative routine for identifying the content hosted by the content delivery system 110 of FIG. 1 that is being targeted by a denial of service attack;



FIG. 5 is a block diagram depicting an illustrative configuration of one embodiment of the identification service 116 of FIG. 1;



FIG. 6 is a block diagram depicting interactions on the content delivery system 110 to gather impact information regarding an attack;



FIG. 7 is a block diagram depicting interactions on the content delivery system 110 to implement mitigation of a network attack based on modification of resolution records;



FIG. 8 is a block diagram depicting interactions on the content delivery system 110 to implement mitigation of a network attack based on modification of network routing;



FIG. 9 is a flow chart depicting an illustrative routine for mitigating a network attack based on modification of resolution records; and



FIG. 10 is a flow chart depicting an illustrative routine for mitigating a network attack based on modification of network routing;





DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to identifying the targets and sources (e.g., attackers) of a network attack, such as a denial of service (“DoS”) attack directed towards a content delivery system, by use of unique or semi-unique combinations of network addressing information. Specifically, aspects of the present disclosure enable each potential target or source of network attacks to be assigned to a unique or semi-unique set of network addressing information used to access content on a content delivery system. Thereafter, when an attack is detected on the content delivery system, the specific network addressing information utilized in the attack can be compared to those combinations assigned in order to identify potential sources of the attacks, targets of the attacks, or both. Thereafter, the content delivery system may mitigate the attack based on the identified attack source or target.


Embodiments of the present disclosure may be beneficial, for example, when implemented on a content delivery system hosting content of a multitude of potential targets. In such instances, a potential target on a content delivery system may correspond to a specific set of content hosted by the content delivery system on behalf of a third-party content provider or an operator of the content distribution service itself. Such a set of content can be generally referred to as a “distribution,” and may correspond to a specific web site (e.g., as associated with a specific domain name) or other network-accessible service. Content delivery systems generally make distributions available at one or more network addresses (e.g., internet protocol or “IP” addresses), to which a computing device—either legitimate or malicious—may transmit a request for information. However, due to the limited nature of network address formats, it may be impossible or infeasible to uniquely assign network addresses to individual distributions. Thus, it may be difficult or impossible to determine, based on the network address to which a network attack is directed, which distribution sharing a given network address is the target of the attack. This, in turn, may limit the potential mitigation techniques available to the content delivery system. Accordingly, embodiments of the present disclosure enable a content delivery system to associate a unique or semi-unique combination of network addresses (e.g., internet protocol or “IP” addresses) with each distribution. Thereafter, a network attack directed to a combination of network addresses that is unique to a specific distribution can be quickly determined to be targeting that distribution, which can aid in mitigation of the attack. In the context of the present application, “unique” combinations of network addresses refer to combinations of network addresses that can be used to specifically identify a distribution assigned to that unique combination of network addresses, or that can be used to identify a distribution assigned to that unique combination of network addresses with a degree of statistical certainty over a threshold level.


Embodiments of the present application further enable a targeted distribution to be identified even when an attack is directed to less than an entire combination of network addresses shared by multiple distributions. For example, assuming that distributions are assigned unique combinations of four network addresses, embodiments of the application can enable a distribution subject to attack to be identified even when the attack targets only two network addresses (which may be shared with non-attacked distributions). As will be described below, a content delivery system may respond to such an attack by limiting the network availability of attacked network addresses. For example, a content delivery system may halt advertisement of an attacked network address within domain name system (DNS) queries, or may halt all processing of network traffic directed to an attacked address. Limiting the availability of attacked addresses can both serve to mitigate the attack, and cause the attack (should it proceed) to target additional network addresses of a target distribution. The content delivery system may then utilize the additional network addresses, in conjunction with the previously attacked network addresses, to identify the attacked distribution. Accordingly, the content delivery system may implement mitigation techniques to both limit the effects of the attack on the attacked distribution, as well as to ensure the continued availability of non-attacked distributions.


In one embodiment, unique combinations of network addresses may be assigned to each distribution based on a hashing algorithm, in connection with information regarding the distribution. For example, where each distribution is to be associated with a set of eight network addresses, each network address can be determined based on hashing a combination of the distribution's human-readable network identifier (e.g., a “domain name”) and the index of the desired network address (e.g., zero through seven). In some instances, the unique network addresses assigned to a distribution may vary across different POPs of the content delivery system. As such, each network address for a given distribution can be based on hashing a combination of the distributions human-readable network identifier, the index of the desired network address, and an identifier of the POP (e.g., as assigned by the content delivery system). In some embodiments, network addresses assigned to a distribution can be caused to vary based on time by including a time value (e.g., a current date) within the hash algorithm. One example of a hashing algorithm that may be used in accordance with the present disclosure is the MD5 message-digest algorithm, which is a cryptographic hash function that produces a 128 bit hash value as an output. Various additional examples of hashing algorithms themselves are well known in the art, and therefore will not be discussed in detail herein.


Because the values produced by hashing algorithms are generally larger than the number of network addresses available to a content delivery system (or specific POPs within a content delivery system), the hash values may be reduced to produce values within a range suitable to the content delivery system. For example, a content distribution system may determine the result of a modulo operation dividing each hash value by the number of network addresses available to the content delivery system (or a specific POP within the content delivery system). The result of the modulo operation can then indicate the index of a specific network address, from a collection of available network address, that corresponds to the hash value. For example, assume a content delivery system (or POP within the system) has 256 network addresses available, and wishes to assign eight network addresses to each served distribution. The content delivery system may calculate eight hashes for each served distribution and determine the result of a modulo operation dividing each hash by 256, resulting in eight values each between zero and 255. This process would result in over four hundred trillion potential combinations of values, ensuring that each combination of eight network addresses is either unique or substantially unique.


After assigning a combination of network addresses to each distribution, the content delivery system can monitor for attacks, such as denial of service attacks, on the content delivery system. Due to the nature of such attacks, it is often trivial to determine the network addresses targeted by an attack but difficult to determine the targeted distribution. Specifically, a single network address (e.g., IP address) may serve content associated with distributions, each associated with a different human-readable network identifier (e.g., domain name or universal resource identifier [URI]). During an attack, resolution of a network address from a network identifier (e.g., via the well-known DNS resolution process) may occur separately from—and often less frequently than—actual implementation of the attack on the network address. Moreover, the packets that form a part of the attack, which are generally specially created by an attacker, often do not specify the network identifier to which the attack is targeted. Thus, when an attack on a specific network address occurs, a content delivery system may be generally unable to directly determine which distribution associated with that specific network address is actually under attack.


In accordance with aspects of the present disclosure, when an attack on a network address is detected, a content delivery system may attempt to do a “reverse lookup” of the attacked distribution, by utilizing a similar algorithm to that described above with respect to assignment of network addresses. Specifically, an identification service within the content delivery system may generate or obtain a listing of each distribution potentially targeted by the attack (e.g., each distribution on a specific POP under attack), and what combination of network addresses has been assigned to the distribution by the content delivery system. In some embodiments, this listing may be generated “on-the-fly” by the identification service, by calculating a combination of network addresses for each distribution (as described above) in response to a request to resolve a network address into a corresponding distribution. In other embodiments, the identification service may pre-compute a mapping of distributions and associated network address combinations using the hash-based calculation described above. In either instance, the identification service can utilize the submitted network addresses to determine which of the hosted distributions are assigned to the submitted combination of network addresses. In the instance that a small number of distributions (e.g., at or below a specified threshold value, which may be one) are assigned to the submitted network addresses, the identification service can identify those distributions. The content delivery system may then implement mitigation techniques to limit the effect of the attack on either or both of the attacked distribution or the content delivery system as a whole.


In the instance that a larger number of distributions (e.g., over a threshold value) are assigned to network addresses submitted to the identification service, the service may attempt to limit access to the submitted network addresses in an attempt to either halt the attack or force the attack to move to additional network addresses. In one embodiment, the identification service may instruct DNS servers associated with the content delivery system to remove the initially submitted network addresses (e.g., those currently under attack) from DNS service responses. Because client computing devices generally access distributions by first submitting a DNS request for the distribution, removing attacked network addresses from DNS service records may cause legitimate clients to attempt to connect to alternate network addresses, at least partially mitigating the attack.


In addition to removing attacked addresses from DNS record responses, the content delivery system 110 may also halt processing traffic directed to attacked addresses. Such halting is sometimes referred to as “blackholing” the network address, and generally involves discarding or “dropping” packets addressed to the network address, either at a receiving computing device or at an intermediary network device. This technique may be especially desirable during a denial of service attack, since intermediary network devices within the content delivery system (e.g., “edge devices”) may be able to process and discard packets that would otherwise overwhelm the resources of an attacked target.


In many instances, an attack on a distribution may continue even after access to the previously attacked network addresses has been limited (e.g., by removing the previously attacked network addresses from DNS responses or by “blackholing” the previously attacked network addresses). For example, an attacker may detect that the initial attack has been mitigated, and redirect the attack to additional network addresses associated with the distribution (which may be determined via DNS requests transmitted to the content delivery system either before or after limiting access to the previously attacked network addresses). Though continuation of the attack in undesirable, the content delivery system may utilize the additional network addresses to more specifically determine the distribution to which the attack is targeted. Specifically, the content delivery system may provide the additional network addresses to the identification service, and request that the identification service utilize the additional network addresses in conjunction with the initially attacked (and subsequently limited) network addresses to determine a distribution that is the target of the attack.


If this combination of network addresses is associated with a single distribution (or less than a predetermined threshold number of distributions), the content delivery system may implement mitigation techniques to mitigate the attack on that distribution. Alternatively, the content delivery system may continue to limit the availability of attacked network addresses until a single distribution (or less than a threshold number of distributions) has been identified as the target of the attack.


While examples are provided herein with respect to content distribution systems, embodiments of the present application may be implemented with respect to any network of computing devices that operates to serve discrete sets of content to client computing devices. Moreover, while some examples are provided with respect to a content distribution network as a whole, embodiments of the present application may also be implemented in whole or in part by discrete portions of the content delivery system. For example, each POP within a content delivery system may function to assign a unique or semi-unique combination of network addresses to the content of a distribution that is hosted at that POP, which may vary from the network addresses assigned to the same content of the distribution at a different POP. As a further example, each POP within a content delivery system may include an identification service configured to identify an attacked distribution or computing devices associated with a network attack based on a combination of attacked network addresses. Thus, the examples provided herein are intended to be illustrative, and not exhaustive, in nature.


Further, while examples are provided herein utilizing a combination of network addresses (such as IP addresses) to uniquely identify a distribution, embodiments of the present application may additionally or alternatively assign to distributions a unique (or statistically likely to be unique) set of other addressing information. As used herein, addressing information includes any information provided by an accessing computing device to connect to a service provided by the content distribution system. By way of non-limiting example, sets of addressing information may include a network address, port number, or transmission protocol. Illustratively, each distribution on the content distribution service may be assigned eight network address and port number pairs. Thereafter, a network attack directed at some number of address and port number pairs could be compared to those address and port number pairs assigned to each distribution to identify a target of the attack. Similarly, each distribution on the content distribution service may be assigned some n number of sets of addressing information composed of a network address, port, and protocol. Because the number of unique sets of addressing information is much larger than the number of unique network addresses, use of sets of addressing information may enable the content distribution service to uniquely identify specific sets of content (or other services) using smaller combinations of addressing information.


In addition, embodiments of the present application may be used to identify sources of network attacks. Attackers often include forged information within the data packets used to implement a network attack, such as a false source IP address. Thus, identification of an attacker from the data packets that form a part of an attack is often difficult or impossible. However, attackers are more likely to provide legitimate source address information when resolving a domain name (or other human-readable identifier) of an attack target into network addresses (or addressing information sets) at which the attack target can be accessed. In some cases, attackers are required by technical limitations to provide legitimate source address information in connection with domain name resolution requests, as providing a forged source address would result in a response to the request being sent to that forged source address and never reaching the attacker. Accordingly, aspects of the present disclosure enable the source address information (or other identifying information) provided by attackers during a name resolution request to be matched to later network attacks.


Specifically, when a client computing device—either legitimate or illegitimate—requests resolution of a domain name (or other identifier) of a set of content, that client computing device can be provided with a unique or semi-unique combination of network addresses (or addressing information sets) at which to access the set of content. Thereafter, any network attack directed to that combination of network addresses (or addressing information sets) can be attributed to the client computing device. By using combinations of network addresses, the content delivery system is not required to provide a unique network address to each client computing device. As such, a relatively large number of client computing devices may be provided with unique or semi-unique combinations of network addresses, from a relatively small pool of available network addresses. After identifying the source or target of an attack, the content delivery system may implement an appropriate mitigation technique. For example, where the source of an attack is identified, the content delivery system may cease to service requests originating from the source, or may handle requests originating from the source in a different manner (e.g., by redirecting those request to an alternate location separate from a location servicing legitimate access requests). As a further example, where the target of an attack is identified, such as a specific distribution, the content delivery system may modify an internal or external network configuration to cause access to the distribution on the content delivery system to be changed. For example, the content delivery system may halt providing access to the distribution via an original POP, and begin providing access to the distribution via an alternative POP, such as a POP with greater access to network resources or a POP implementing DDOS protection mechanisms or techniques. Illustratively, each POP within a content delivery system may be configured to service requests for any of a plurality of sets of content provided by the content delivery system. Thus, providing access to a distribution via an alternative POP may simply require the content delivery system to redirect requests to access the content to that alternative POP. As a further example, the content delivery system may increase the number of POPs providing access to the distribution (e.g., by utilizing anycast techniques, which are known in the art, to advertise access to network addresses of the distribution from multiple POPs). As yet another example, the content delivery system may modify network devices (e.g., routers) within the content delivery system, such that requests to access the distribution are routed over specific physical ports of those routers. Because routers are generally limited in the number of data packets that can be processed on any specific physical port, controlling the physical ports used to transfer requests associated with an distribution under attack may enable the content delivery system to reduce the impact of an attack to other physical ports (e.g., servicing other distributions).


While examples are described above with respect to modifying access on the content delivery system to a distribution that is under attack, the content delivery system may additionally or alternatively modify access to other distributions affected by an attack, such as other distributions sharing one or more network addresses with an attacked distribution. As discussed above, the limited nature of many network address formats may cause the content distribution system to provide access to multiple distributions via any single network address. Because network attacks generally target these network addresses generally, an attack against a first distribution on a network address may also affect other distributions on that network address. As such, when a distribution targeted in an attack has been identified on the content delivery system, the content delivery system may also modify access to other, non-attacked distributions to reduce or eliminate the effect of the attack on those distributions. For example, the content distribution system may modify an internal or external network configuration to ensure that non-targeted distributions that previous utilized attacked network addresses will subsequently utilize a new set of non-attacked network addresses. In some such embodiments, the content delivery system may modify network configurations to ensure that attacked network addresses are utilized only by an attacked distribution. Thus, modifying access to non-attacked distributions may serve to limit the overall effect of the network attack, even when the content distribution system is unable to prevent the attack from effecting the operation of the distribution that is under attack.


In some instances, the specific network modifications utilized to implement the above-described mitigations may depend at least in part on whether a network attack is or is not a “re-resolving” attack. Re-resolving attacks may generally be characterized by the repeated use of resolution requests (such as DNS requests) throughout the attack, such that the attack may “adapt” to target new network addresses when a resolution record for an attacked distribution is changed. An attack that is not re-resolving may generally be characterized by a lack of repeated resolution requests, such that the attack continues to target an initial set of network addresses even after resolution records of a distribution are modified to include an alternative set of network addresses.


In the instance that an attack is re-resolving, the content delivery system may redirect the attack by modifying resolution records of one or more affected distribution. For example, the content delivery system may modify DNS records of an attacked distribution to include one or more alternative network addresses (e.g., associated with a POP executing DDoS protection mechanisms, associated with multiple POPs via anycast, etc.), while also modifying the DNS records of affected, non-attacked distributions to include other network addresses, thus separating the non-attacked and attacked distributions.


In instances where an attack is not re-resolving, the content delivery system may redirect the attack by modifying the routing of data packets addressed to attacked network addresses. For example, the content delivery system may “blackhole” one or more attacked addresses by instructing routing devices within the content delivery system 110 to discard (or “drop”) packets directed to the attacked addresses, or may “tarpit” one or more attacked addresses by instructing routing devices within the content delivery system 110 to delay processing of packets directed to the attacked addresses. As a further example, the content delivery system may generate and transmit routing protocol data, such as Border Gateway Protocol (“BGP”) packets, to cause routers either within or external to the content distribution system to modify how data addressed to attacked network devices is routed. Illustratively, assume that an attack that is not re-resolving is initiated against a specific network address associated with an initial POP, and that the content delivery system is programmed to attempt to mitigate the attack by redirecting the attack to an alternative POP (such as one executing DDoS protection software). Because the attack is not re-resolving, modifications to resolution records, such as DNS records, will not affect the attack. Thus, in order to redirect the attack to an alternative POP, the content delivery system may transmit routing update packets to routing devices associated with the POP (either under control of the content delivery system or under the control of third parties) which indicate that the attacked network addresses is associated with the alternative, and not the initial, POP. For example, the content delivery system may instruct the initial POP (or routers associated with the initial POP) to transmit “withdraw” packets to connected network devices, indicating that the attacked network addresses are no longer accessible at the initial POP. The content delivery system may also instruct the alternative POP to transmit advertisement packets to connected network devices, indicating that the attacked network addresses are accessible at the alternative POP. These routing updates may then be propagated in accordance with their underlying protocol to cause packets destined for to the attacked network addresses to be routed to the alternative POP. Thus, the content delivery system may modify how data of an attack is routed, even when the attack is not re-resolving.


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 identity and mitigate network attacks on specific sets of content, such as a web site or domain name. Thus, the presently disclosed embodiments represent an improvement in the functioning of such computing systems, by enabling content delivery systems or other networked devices to continue to service legitimate client requests even while receiving large numbers of illegitimate requests. 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 number of network addresses available to computing systems, and the ambiguity in network addresses that results from providing content of multiple domain names from a single network address. These technical problems are addressed by the various technical solutions described herein, including the assignment and distribution of unique network address combinations for specific collections of content (e.g., individual distributions, network identifiers or domain names), the resolution of attacked network addresses to attack content, and the disambiguation of attacks directed to a non-unique combination of network addresses by iteratively limiting access to those attacked network addresses until a unique or semi-unique combination of network addresses is identified. Thus, the present application represents a substantial improvement on existing network systems and computing systems in general.


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 accessing computing devices 102 and multiple content providers 104 in communication with a content delivery system 110 via a network 106. While the accessing computing devices 102 and the content providers 104 are shown as a group within FIG. 1, the accessing computing devices 102 and content providers 104 may be geographically distant, and independently owned or operated. For example, the accessing computing devices 102 could represent a multitude of users in various global, continental, or regional locations accessing the content delivery system 110. Further, the content providers 104 could represent a multitude of related or distinct parties that have associated with the content delivery system 110 to provide content, such as web sites, multimedia, or other digital, network-deliverable content to the accessing computing devices 102. Accordingly, the groupings of accessing computing devices 102 and content providers 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 accessing computing devices 102, content providers 104, and content delivery system 110 is depicted as having a single connection to the network 106, individual components of the accessing computing devices 102, content providers 104, and content delivery system 110 may be connected to the network 106 at disparate points. Accordingly, communication times and capabilities may vary between the components of FIG. 1.


Accessing computing devices 102 may include any number of different computing devices capable of communicating with the content delivery system 110. For example, individual accessing 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. Further, accessing computing devices 102 may include devices utilized by both legitimate clients of the content delivery system 110 and devices utilized by malicious parties to undertake network-based attacks, such as DoS attacks, on the content delivery system 110. Accessing computing devices 102 may generally be identified on the network 106 by use of a computing device identifier, such as a media access control (MAC) address or IP address.


Content providers 104 may include any computing device owned or operated by an entity that has provided content to the content delivery system 110 for subsequent transmission to client computing devices (which may include one or more accessing computing devices 102). For example, content providers 104 may include servers hosting web sites, streaming audio, video, or multimedia services, data analytics services, or other network-accessible services. While illustratively shown in FIG. 1 as a network-attached computing device, content providers 104 may additionally or alternatively provide content to the content delivery system 110 via non-networked communication channels (e.g., via physical delivery of data).


The content provided to the content delivery system 110 by the content providers 104 may be hosted in POPs 114. Each POP 114 may include a variety of computing devices configured to serve content to accessing computing devices 102. Accordingly, though not shown in FIG. 1, each POP 114 may include any number of processors, data stores, or networking components operating in conjunction to facilitate retrieval of content. Each POP 114 may be associated with a limited number of network addresses via which accessing computing devices 102 may address the POP 114 via the network 110. In one embodiment, each network address is an internet protocol version 4 (IPv4) or internet protocol version 6 (IPv6) address. For example, each POP 114 may be associated with one or more specific “blocks” of network addresses, such as the “192.168.0.0/24” block of IPv4 addresses (represented in classless inter-domain routing or “CIDR” notation, as is common in the art). Further, each POP 114 may be configured to provide multiple sets of content, each of which may be associated with a specific content provider 104. Generally, these discrete sets of content may be referred to herein as a “distribution.” Each distribution may represent a specific network-accessible service available from the POP 114 or the content delivery system 110 generally.


Because the number of distributions provided by a POP 114 can exceed the number of network addresses available to the POP 114, each distribution may be available at multiple network addresses. For example, a first network address “192.168.0.1” may service requests directed to the distributions “www.domain1.tld” and “www.domain2.tld,” while a second network address “192.168.0.2” may service requests directed to the distributions “www.domain3.tld” and “www.domain4.tld.” Each of these illustrative distributions may correspond to a distinct content provider 104. One of ordinary skill in the art will recognize that the example network addresses and identifiers provided herein are illustrative in nature, and not intended to refer to any specific existing network address or identifier.


Each network address within a POP 114 may further be assigned to multiple computing devices (not separately shown in FIG. 1). Existing routing technologies, as are well known within the art, can enable the multiple computing devices to balance the load of requests directed to a specific network address. By varying the number of computing devices assigned to a given network address, as well as the combination of network addresses assigned to specific distributions, the capabilities of each POP 114 may be scaled to address virtually any number of accessing computing devices 102.


The illustrative content delivery system 110 of FIG. 1 further includes a set of DNS servers 112 configured to resolve human-readable network identifiers of distributions (such as domain names or URIs) into network addresses (such as IP addresses) or addressing information sets (composed of addressing information, such as network address, port numbers, protocols, or combinations thereof) at which content of the distributions may be obtained. Illustratively, each DNS server 112 may include one or more processors, memories, and data storage devices collectively configured to receive requests from accessing computing devices 102 for a specific domain name associated with a distribution. The DNS servers 112 may further be configured, in response, to provide a combination of network addresses, associated with one or more computing devices within a POP 114, at which content of that distribution may be obtained. Thereafter, the accessing computing device 114 may communicate with the POP 114, via the combination of network addresses, to access the distribution. The specific operation of DNS servers 112 to receive and resolve requests for network addresses is well known within the art, and thus will not be described in detail herein.


In accordance with embodiments of the present disclosure, each DNS server 112 may be configured to distribute a specific combination of network addresses (or addressing information sets) for individual distributions, which network addresses (or addressing information sets) are selected such that there is a high statistical probability of the combination of network addresses uniquely identifying the individual distribution. In one embodiment, each DNS server 112 may select an integer n number of network addresses from a pool of k available network addresses, such that the total possible unique combinations of network addresses may be represented as the equation:







k
!



n
!




(

k
-
n

)

!






The value k (representing a number of network addresses within a pool of network addresses available to a distribution on the content delivery system 110 or a specific POP 114 of the content delivery system 110) may be selected by an operator of the content delivery system 110 based on the number of network addresses assigned to the system 110, the number of network addresses utilized for other tasks within the system 110, etc. The value n may be selected by an operator of the content delivery system 110 accordingly to multiple criteria, including but not limited to: ensuring that a sufficient number n of network addresses is assigned to a distribution to ensure availability of the distribution in the case of network failure or congestion; ensuring that a sufficient number of combinations (derived according to the formula above) for the value n exist, such that each distribution is statistically likely to be provided with a unique combination of network addresses; and reducing the proportion of the n network addresses needed to unique identify a distribution under attack. In one embodiment, n is equal to eight, while k is at least 128. While the values of n and k may be modified to address the needs of the content delivery system 110 (or a specific POP 114 within the content delivery system 110), the value of k is generally expected to exceed that of n, such that there is a high probability that an individual distribution can be uniquely identified by n network addresses.


To attribute network addresses to an individual distribution, the DNS servers 112 may maintain a list of available network addresses within an address pool, each associated with an index (e.g., of 0 through k−1). Each index may identify a “slot” associated with a specific network address that can be assigned to a distribution. For example, an index ‘1’ may be associated with the IPv4 address “192.168.0.1,” while the index ‘2’ may be associated with the IPv4 address “192.168.0.2.” In some instances, the list of available addresses may be configured such that the index of each address is equal to the final segment of the network address (e.g., index ‘1’ is associated with network address “192.168.0.1,” etc.). In other instances, the index of each address may be unrelated to the actual network address (e.g., index ‘1 may be associated with ‘192.168.0.5’, or any arbitrary address available to the content delivery system 110). While examples provided herein utilize the same three initial octets “192.168.0,” network addresses available to the DNS servers 112 may include any network address representable within a network address format used by the DNS servers 112 (e.g., IPv4, IPv6, etc.). Given a list of k addresses, each DNS server 112 may determine the indexes of network addresses to assign to a distribution according to the equation

i=h(D+x)mod k

where i represents the index of each network address within the list of network addresses, the function h( ) represents any of a number of widely known hashing functions (such as the MD5 hashing function), D represents an identifier of other information uniquely describing the distribution (e.g., a domain name), and x represents the specific network address 1 through n from the n network addresses to be assigned to the distribution. Though not shown in the equation above, DNS servers 114 may include additional information into the hashing function h( ). For example, where a distribution is assigned a unique combination of network addresses at each individual POP 114, the hashing function may include an identifier of the POP 114 for which network addresses are sought. As a further example, the hashing function may include a temporal value (such as a current date), causing the combination of network addresses associated with a distribution to vary with time. Various additional values may be included within the hashing and are contemplated within the scope of the present disclosure. By utilizing the equation above, a DNS server 114 may determine a combination of network address from the list of available network addresses, and associate that network address to the distribution.


As discussed above, some embodiments of the present application may identify sets of content based on combinations of sets of addressing information, rather than network addresses. In such embodiments, the value of k within the equation above may represent the number of possible sets of addressing information (e.g., the possible combinations of available network addresses, ports, protocols, or other addressing information). The content delivery system may maintain a listing of each possible set of addressing information, and assign each distribution to a combination of sets of addressing information according to the algorithm above. Because the value of k when using sets of addressing information is likely to be much larger than when using networking addresses alone, a lower value of n may be possible while still maintaining a high likelihood that the combination of sets of addressing information uniquely identifies each distribution.


While some examples are provided herein with reference to a single pool of k addresses, in some embodiments, the content delivery system 110 (or each POP 114 within the content delivery system 110) may maintain multiple network address pools, each containing a set of network addresses available for association with distributions. In some instances, each pool may be associated with a different class of distribution, such that distributions with a normal risk of being targeted by a network attack may be classes as “normal” distributions, while distributions with a high risk of being targeted by a network attack (or which are currently potentially being targeted by a network attack are class as “high risk” distributions. Accordingly, the content delivery system 110 may be configured to determine a combination of network addresses for a “normal” distribution from a list of k addresses associated with a “normal” network address pool, and to determine a combination of network addresses for a “high risk” distribution from a list of k addresses associated with a “high risk” network address pool. In one embodiment, network address pools are contiguous blocks of IP addresses (e.g., a “/24” block in CIDR notation), and the IP addresses assigned to a specific distribution from any class of network address pool may vary only in the prefix of those IP addresses. For example, a given distribution may be assigned the addresses “192.168.0.1,” “192.168.0.3” and “192.168.0.19” if the distribution is classed as “normal” (where the “192.168.0/24” block of addresses is associated with “normal” distributions), and may be assigned the addresses “192.168.1.1,” “192.168.1.3” and “192.168.1.19” if the distribution is classed as “high risk” (where the “192.168.1/24” block of addresses is associated with “high risk” distributions). While two classes are illustratively described herein, the content delivery system 110 may maintain any number of classes of distributions, each associated with a pool of available network addresses. In some instances, a distribution may be re-classed in response to detection of a network attack, causing the combination of network addresses associated with the distribution to change from a first combination to a second combination. As described below, the content delivery system 110 may then monitor for a continuation of the network attack directed to additional network address from the second combination, and use those additional network addresses to determine a target of the attack on the content delivery system 110.


In some embodiments, the combination of network addresses associated with a distribution (or combinations, where multiple network address pools are utilized) may be precomputed by each DNS server 112, such that service of DNS requests to resolve a distribution identifier into a corresponding combination of network addresses may be fulfilled by referencing a pre-computed mapping of distribution identifiers to network addresses. In other embodiments, each DNS server 112 may calculate the combination (or combinations) of network addresses associated to a specific distribution in real time, while servicing a request to access the specific distribution. In yet other embodiments, the DNS server 112 may maintain a pre-computed list of network addresses for recently accessed distributions (e.g., within a cache memory), but calculate network addresses for other distributions in real time. While calculation of network addresses is described herein as executed by the DNS server 112 itself, other components of the content delivery system 112 may additionally or alternatively be configured to calculate network addresses for a distribution. For example, a central server (not shown in FIG. 1) may precompute network addresses for each distribution serviced by the content delivery system 110 (or specific POP 114) and transmit the precomputed network addresses to the relevant DNS servers 112 associated with those distributions. The DNS servers 112 may thereafter service requests by accessing computing devices 102 to resolve identifiers of distributions into a corresponding combination of network addresses.


In some instances, the DNS servers 112 may additionally or alternatively distribute unique or semi-unique combinations of network addresses to the accessing computing devices 102 on a per-device basis. Illustratively, multiple accessing computing devices 102 may request to resolve a human-readable identifier of a distribution into corresponding network addresses. The DNS server 112 may generate a unique or semi-unique combination of network addresses at which each accessing computing device 102 may access the distribution as a function of an address (e.g., a MAC address or IP address) or other identifier of the computing device 102. In this embodiment, the DNS server 112 may thus select a combination of n network addresses (or network addressing sets) for each client computing device from k network addresses (or network addressing sets) at which the distribution may be accessed, based on the equation:

i=h(D+x)mod k

where k represents a pool of network addresses at which a distribution may be accessed, i represents an individual network address within a combination of addresses distributed to a client computing device, the function h( ) represents any of a number of widely known hashing functions (such as the MD5 hashing function), D represents an identifier of other information describing the computing device (e.g., a MAC address or IP address), and x represents the specific “slot” of network address (e.g., 1 through n) of the n network addresses to be assigned to the accessing computing device 102. In some instances, additional parameters, such as a time factor or random seed value, may be added to the equation above to further vary the network addresses distributed to a accessing computing device 102.


In instances where DNS servers 112 are configured to distribute network addresses on a per-device basis, the DNS servers 112 may further be configured to store a listing of the specific combinations of network addresses distributed to individual client computing devices 102 (e.g., with a data store of the content delivery system 110 not shown in FIG. 1) for further use by the content delivery system 110, as described below.


The content delivery system 110 further includes an identification service 116, which is configured to enable identification of a distribution based on one or more network addresses. Illustratively, the identification service 116 may be utilized during an attack on the content delivery system 110 to enable the specific distribution targeted in the attack to be identified based on network addresses to which the attack is targeted. In one embodiment, the identification service 116 is implemented centrally on the content delivery system 110, at one or more computing devices accessible throughout the content delivery system 110. In another embodiment, the identification service 116 is a distributed service hosted at various locations within the content delivery system 110 (e.g., by computing devices associated with various POPs 114).


The identification service 116 is illustratively configured to receive requests from within the content delivery system 110 (e.g., from automated attack detection systems within the content delivery system 110 or from human operators) which specify one or more attacked network addresses, and to attempt to resolve the attacked network addresses into an identifier of a distribution (e.g., a domain name). In one embodiment, the identification service 116 utilizes the same algorithm described above with respect to the DNS servers 112, to compute a mapping between each potential distribution and a combination (or combinations) of network addresses. The identification service 116 may then inspect the mapping to determine which distributions are associated with the attacked network addresses. Where the number of attacked network addresses is large with respect to n (the number of network addresses assigned to each distribution) it is statistically likely that the attacked network addresses will correspond to a single distribution. The identification service 116 may therefore return an identifier of that distribution (e.g., a domain name) to the requesting party. In some instances, the content delivery system 110 may further be configured to utilize the returned identifier to attempt to mitigate the network attack.


However, especially where the number of attacked network addresses is small with respect to n, the identification service 116 may be unable to identify the attacked distribution specifically. In some instances, specific identification of an attacked distribution may not be required. Instead, the identification service 116 may be configured to identify the attacked distribution as one among no more than a threshold number of potential distributions that match the attacked network addresses. For example, assuming a threshold number of three, the identification service 116 may be configured to identify the attacked distribution as either distribution A, B, or C, each of which may be associated with the attacked network addresses specified to the identification service 116.


Where more than a threshold number of distributions are associated with a received combination of network addresses, the identification service 116 may attempt to redirect the attack to additional network addresses. Specific interactions and functionalities for redirecting an attack to additional network addresses will be described with respect to FIG. 4 below. After an attack has been redirected to additional network addresses, the identification service 116 can utilize the additional network addresses, in conjunction with those network addresses initially received, to uniquely identify the attacked distribution. For example, where a first set of three network addresses under attack are associated with both distributions A and B, the identification service 116 may attempt to redirect the attack to an additional network address. Assuming this additional network address is associated with only distribution A, the identification service 116 may identify distribution A as the distribution under attack. If the additional network address is associated with both distribution A and B, the identification service 116 may continue to redirect the attack to additional network addresses until a unique distribution (or no more than a threshold number of distributions) can be identified. The content delivery system 110 can thereafter utilize the identification of the attacked distribution to mitigate the attack with respect to either or both the attacked distribution or the content delivery system 110 as a whole.


The identification service 116 may further be configured to enable identification of a specific accessing computing device 102 associated with a network attack. As noted above, data packets used during network attacks frequently include false information, particularly source address information, to make identification of an attack source more difficult. Accordingly, the identification service 116 may be configured to identify a computing device associated with an attack based at least in part on the specific network addresses to which the attack is directed. As described above, the content delivery system 110 may be configured to vary the combination of network addresses distributed for a distribution on a per-device basis. Accordingly, when an attack is detected at the content delivery system 110 to a set of network addresses, the identification service 116 may determine whether any combination of network addresses distributed includes that set of network addresses. If so, the accessing computing devices 102 to which those combinations of network addresses were distributed can be identified as associated with the attack (e.g., by flagging the MAC or IP address of the accessing computing device 102 as associated with the attack). In some instances, the identification service 116 may determine whether any combination of network addresses distributed includes that set of network addresses under attack by retrieving a listing of network address combinations distributed by the DNS server 112 (e.g., from a data store of the content delivery system 110), which may also identify the accessing computing devices 102 to which the combinations were distributed. In other instances, the identification service 116 may independently determine combinations of network addresses associated with accessing computing devices 102 (e.g., by calculating a combination of network addresses for each potential accessing computing device 102). In instances where the attacked network addresses corresponding to more than a threshold number of accessing computing devices 102, the identification service 116 may instruct the content delivery system 110 to redirect the network attack to additional network addresses, in accordance with embodiments of the present disclosure.


The content delivery system 110 further includes a mitigation service 118, which is configured to redirect traffic of a network attack among the POPs 114 or other components of the content delivery system 110 in order to mitigate the network attack. In one embodiment, the mitigation service 118 is implemented centrally on the content delivery system 110, at one or more computing devices accessible throughout the content delivery system 110. In another embodiment, the mitigation service 118 is a distributed service hosted at various locations within the content delivery system 110 (e.g., by computing devices associated with various POPs 114). Operation of the mitigation service 118 is described in more detail below with respect to FIGS. 6-10.


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 in FIG. 1 should be taken as illustrative. For example, in some embodiments, components of the content delivery system 110, such as the identification 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 identification service 116 may be embodied in a plurality of components, each executing an instance of the respective DNS servers 112, POPs 114, and identification service 116. A server or other computing component implementing any one of the DNS servers 112, POPs 114, and demand analysis 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 demand analysis service 116. The memory may generally include RAM, ROM, other persistent and auxiliary memory, and/or any non-transitory computer-readable media.



FIG. 2 depicts a set of illustrative interactions for enabling a client to access a distribution on the content delivery system 110 via a combination of network addresses that uniquely or semi-uniquely identify the distribution, even where a portion of such network addresses are also associated with additional distributions. As noted above, utilization of a unique or semi-unique combination of network addresses to identify a distribution on a content delivery system 110 can enable a large number of distributions to be accessible via a limited combination of network addresses, while still enabling identification of a specific distribution targeted during a network attack. While FIG. 2 depicts a single interaction between an accessing computing device 102A and the content delivery system 110, these interactions may be repeated by any number of accessing computing devices 102 in order to access content on the content delivery system 110.


The interactions of FIG. 2 begin at (1), where an accessing computing device 102A requests a network address of a distribution of content on the content delivery system 110. For the purposes of description, the accessing computing device 102A is assumed to represent a legitimate client of the content delivery system 110. As such, the request for a network address may be automatically generated by software on the accessing computing device (e.g., a web browser) in response to a user's entry of a distribution identifier (e.g., a URI or domain name associated with the distribution). In one embodiment, the request of interaction (1) is a DNS request transmitted in accordance with the well-known DNS protocol. Though not shown in FIG. 1, the communication shown in interaction (1), as well as all communication shown in the various figures, may pass through any number of intermediary communication devices. For example, the request for a network address shown in interaction (1) may be initially transmitted from the accessing computing device 102A to an intermediary DNS server (such as those commonly provided by internet service providers), which may pass the request to the DNS server 112A.


Thereafter, at (2), the DNS server 112A may generate a combination of network addresses for the distribution identified in the request. In one embodiment, such a combination of network addresses may be determined on a per-distribution basis. For example, the combination of network addresses may be generated by selecting a set of n addresses for the distribution from a list of k network addresses within a network address pool maintained by the DNS server 112A (or k possible sets of addressing information, formed from a combination of network address, port, protocol, etc.). Each network address (or set of addressing information) within the list may be assigned an index location i, and the addresses assigned to each index location associated with a given distribution may be determined according to the equation:

i=h(D+x)mod k

where h represents a hash function, such as the MD5 hash function; D represents data uniquely identifying the distribution, such as a domain name; and x is a value from 1 to n, representing the xth network address within the n total network addresses to be associated with the distribution. In some embodiments, additional information may be included within the hash function. For example, the combinations of network addresses assigned to a distribution may be varied with time by including a temporal factor, such as the current date, within the hash function. As a further example, where distributions are to be assigned distinct combinations of network addresses on each POP 114A, the hash function may include an identifier of the POP 114A. The specific POP 114A selected for inclusion within the function may vary based on the specific distribution techniques of the content delivery system 110. Illustratively, the DNS server 112A may determine that the request should be resolved to network addresses of a specific POP 114A based on a geographic distance, network distance, latency, or other metric quantifying a relationship between the POP 114A and the accessing computing device 102A. Moreover, the DNS server 112A may determine that the request should be resolved to network addresses of a specific POP 114A based on the current load of various POPs 114A within the content delivery system 110 or other components of the content delivery system 110. Various additional techniques and mechanisms for selection of POPs in a content delivery system are well known within the art. In some instances, additional security information (e.g., a “salt”) may be added to reduce the likelihood that malicious parties can replicate the calculations achieved by the content delivery system 110.


In another embodiment, the combination of network addresses determined by the DNS server 112 may additionally or alternatively be determined on a per-device basis, such that the combination of network addresses is unique (or statistically likely to be unique) to the accessing computing device 102A. Accordingly, the algorithm listed above may be modified such that k represents a set of network addresses at which a distribution can be accessed (e.g., as determined in accordance with embodiments of the present disclosure), while D represents information unique (or substantially unique) to the accessing computing device 102A, such as a MAC or IP address. Accordingly, the DNS server 112A may determine a combination of n network addresses (or address information sets) from k network addresses (or address information sets) associated with the distribution based at least in part on hashing an identifier of the accessing computing device 102A. Thereafter, a network attack executed or instigated by the accessing computing device 102A may be identified based on the specific combination of network addresses to which the network attack is directed. In some instances, unique combinations of network addresses may be distributed on a per-device basis only for specific distributions, such as those determined to be potentially under attack in accordance with the embodiments described above.


As noted above, in some embodiments, the content delivery system 110 may utilize multiple network address pools, each associated with a class of distributions. In such embodiments, the interactions depicted at (2) may further include determining a current classification of the distribution identified in the request (e.g., as stored in one or more data stores of the content delivery system 110 not shown in FIG. 2). Thereafter, the DNS server 112A may select the n network addresses assigned to the distribution from a set of k network addresses within a pool associated with the current classification of the distribution. Thus, modifying the classification of the distribution may alter the combination of network addresses provided by the DNS server 112A for that distribution.


Generation of a combination of network addresses is illustratively described in FIG. 2 as occurring immediately in response to a request from the accessing computing device 102A. However, in some embodiments, combinations of network addresses for one or more distributions may be precomputed by the DNS server 112A, which may increase the speed at which the DNS server 112A may respond to such requests. For example, the DNS server 112A may include a cache memory (not shown in FIG. 2) that maintains a list of network addresses associated with frequently or recently accessed distributions. As a further example, the DNS server 112A may include a precomputed list of network addresses for all distributions associated with the DNS server 112A.


Thereafter, at (3), the DNS server 110 returns the generated combination of network addresses to the accessing computing device 102A. For the purposes of illustration, it is assumed that each of the returned combination of network addresses is associated with a computing device within the POP 114A. However, network addresses associated with multiple POPs 114 may be included within a single returned combination of network addresses. In one embodiment, each network address of the combination of network addresses may be included within a DNS “A record” (for IPv4 addresses) or “AAAA record” (for IPv6 addresses). The accessing computing device 102A may include software (e.g., a web browser) that automatically parses the returned information, and selects at least one network address from the combination of network addresses to which to transmit a request for content (e.g., a web page).


Thus, at (4), the accessing computing device 102A transmits a request for content, such as a web page, to a network address included within the returned combination of network addresses. This request is routed to the POP 114A, which as noted above includes a computing device associated with each network address within the returned combination of network addresses. Illustratively, the request may be a hypertext transfer protocol (HTTP) request, such as a GET request or POST request. In accordance with the HTTP protocol, the POP 114A can utilize information embedded within the request, such as a “host name” to identify a specific distribution (e.g., web site) from which content is requested.


Thereafter, the POP 114A can return the requested content to the accessing computing device 102A at (5). In this manner, a combination of network addresses may be associated each distribution of content on the content delivery system 110 to enable a large number of distributions to be served by a limited combination of network addresses, while still enabling identification of targeted distributions during a network attack.


One illustrative set of interactions for identifying a targeted distribution during an attack is shown within FIG. 3. Specifically, FIG. 3 depicts a network attack, such as a DDoS attack, being executed by a set of accessing computing devices 102 against the content delivery system 110. For the purposes of FIG. 3, it is assumed that the network attack has targeted a specific distribution (e.g., a specific web site) hosted on the content delivery system 110. In order to access that targeted distribution, the accessing computing devices 102, at (1), transmit a request to the DNS server 112A for a combination of network addresses associated with the distribution. Because it may be difficult or impossible to determine that a specific resolution request was created by malicious devices, the DNS server 112A, in response to the request, generates a combination of network addresses for the targeted distribution, and returns the network addresses to the accessing computing devices 102. These interactions (labeled as (2) and (3) in FIG. 3, respectively) are similar to the interactions (2) and (3) of FIG. 2, and therefore will not be described in detail with respect to FIG. 3.


Thereafter, at (4), the accessing computing devices 102 attempt to implement a network attack against one or more of the network addresses identified by the DNS server 112A. In some instances, the accessing computing devices 102 may implement an attack against each network address identified by the DNS server 112A. In other instances, the accessing computing devices may implement an attack against only a portion of the network addresses, or only a single network address identified by the DNS server 112.


In either instance, the interactions of FIG. 3 continue at (5), where the content delivery system 110 detects the network attack. In one embodiment, the content delivery system 110 detects the network attack by monitoring network traffic transmitted to the content delivery system 110, and identifying a large volume of anomalous traffic directed to the attacked network addresses. Additional illustrative systems and methods for detecting a network attack on a network communication system are provided within U.S. Pat. No. 8,997,227, entitled “Attack Traffic Signature Generation Using Statistical Pattern Recognition,” (the '227 patent) which is hereby incorporated by reference in its entirety.


Thereafter, at (6), the content delivery system 110 attempts to identify the specific distribution targeted by the network attack. As noted above, due to the limited number of network addresses available to the content delivery system 110, each attacked network address may be associated with a multitude of distributions. It may therefore be impossible to determine based on an individual network address which distribution is the target of an attack. Moreover, because data transmitted as part of a network attack is often malformed, it may be impossible or impractical to identify an attacked distribution by inspecting data packets transmitted as part of the attack.


However, because each distribution has been associated with a unique combination of network addresses, the content delivery system 110 may utilize the identification service 116 to determine the attacked distribution from one or more attacked network addresses. Specifically, the identification service 116 may obtain a listing of the currently attacked network addresses, and identify a set of distributions hosted by the content delivery system 110 that are associated with the attacked network addresses. In the instance that a single distribution is associated with the attack, the content delivery system may proceed to implement mitigation of the attack, as described below. In the instance that multiple distributions are associated with the attacked network addresses, the identification service 116 can attempt to redirect the attack to additional network addresses, in order to identify additional network addresses associated with the attack. Redirection of an attack will be described in more detail with respect to FIG. 4, below. Generally, the identification service 116 may continue to redirect an attack to additional network addresses until a combination of network addresses is obtained that uniquely identifies a targeted distribution.


After identifying a targeted distribution, the content delivery system 110, at (7), attempts to mitigate the network attack. In one embodiment, attack mitigation may include altering the configuration of the content delivery system 110 to reduce the effects of the attack on non-attacked distributions. For example, due to the shared nature of individual network addresses, there may be a set of distributions associated with one or more attacked network addresses, but not actually targeted by the attack. To partially mitigate the attack, the content delivery system 110 may disassociate these non-attacked distributions from attacked addresses (e.g., by removing the attacked network addresses from DNS responses for non-attacked distributions), or relocate content of the non-attacked distributions to alternate locations within the content delivery system. The content delivery system 110 may further modify the attacked distribution to mitigate the attack. For example, the content delivery system may expand the number of computing devices associated with the attacked distribution, the number of network addresses associated with the attacked distribution, or both. By increasing the resources available to the attacked distribution, the impact of the attack to legitimate clients can be minimized. Thus, the content delivery system 110 may utilize knowledge as to the specific distribution (or distributions) being attacked to more efficiently implement attack mitigation strategies. In some instances, these mitigation techniques may occur automatically in response to identification of a distribution targeted by the attack, without requiring initiation of the mitigation technique by an operator of the content delivery system 110. In other instances, an operator of the content delivery system 110 may manually implement mitigation techniques after identification of the distribution targeted by the attack.


While not depicted in FIG. 3, the content delivery system 110 may additionally or alternatively attempt to detect the source of a network attack based on the combination of network addresses to which the attack is directed. As described above, each accessing computing device 102 may be distributed a unique or semi-unique combination of network addresses at which to access a requested distribution. As such, the identification service 116 may compare the combinations of network addresses distributed to each accessing computing device 102 to the set of network addresses at which an attack is directed to identify one or more devices that are potentially associated with the attack. In the instance that the set of attacked network addresses was distributed to more than a threshold number of potential attacker devices (e.g., more than one), the content delivery system 110 may attempt to determine more particularly which of the potential attacker devices is associated with the attack. For example, the content delivery system 110 may redirect the network attack to additional network addresses, as described in detail below, and determine to which potential attacker devices any additional network addresses were distributed. As a further example, the identification service 116 may compare characteristics of the network attack to known characteristics of the potential attacker devices to distinguish between those potential attacker devices. For example, assume a given set of attacked network addresses were distributed to two potential attacker devices: a first associated with a first point of entry into the content delivery system 110 (e.g., a first POP 114), the second associated with a second point of entry into the content delivery system 110 (e.g., a second POP 114). Where packets of the network attack arrived at the content delivery system 110 via the first point of entry (e.g., the first POP 114), the identification service 116 may identify the first potential attacker device as the source of the network attack. The identification service 116 may compare additional or alternative characteristics of the network attack and each potential attacker devices to distinguish the particular device executing or implementing the attack.


In the instance that the set of attacked network addresses was distributed to less than or equal to the threshold number of accessing computing devices 102 (e.g., a single accessing computing device 102), those accessing computing devices 102 may be identified as the source of the network attack. The content delivery system 110 may thereafter take action to limit further access to the content delivery system 110 by the identified accessing client computing device 102. For example, the content delivery system 110 may be modified to drop or “blackhole” packets transmitted by the identified accessing computing device 102. As a further example, the DNS servers 112A may be modified to select network addresses for distribution to the identified accessing computing device 102 from a different pool of network addresses, such that the identified accessing computing device 102 is segregated from other computing devices 110 when subsequently accessing the content delivery system 110.


With reference to FIG. 4, one illustrative routine 400 for identifying the target of a network attack within a content distribution system is described. The routine 400 may be carried out, for example, by the identification service 116 of FIG. 1, either alone or in conjunction with additional elements of the content delivery system 110.


The routine 400 begins at block 402, where the identification service 116 monitors the content delivery system 110 to detect a network attack. Illustratively, the identification service 116 may detect a network attack on the content delivery system 110 by identifying a large number of anomalous packets transmitted to the system from one or more accessing computing devices. Further examples of systems and methods for detecting a network attack are described in more detail the '227 patent, incorporated by reference above.


Thereafter, the routine continues at block 404, wherein the identification service 116 identifies one or more network addresses targeted by the attack. Each targeted network address may be identified by inspecting data packets of the attack, to determine a network address to which the packet is directed. In some embodiments, actual inspection of attack packets to determine those network addresses under attack may occur at additional components of the content delivery system 110, such as routing components in communication with accessing computing devices and the identification service 116. Accordingly, the identification service 116 may, in some instances, determine attacked network addresses based on communication from those additional components of the content delivery system 110.


After obtaining a combination of network addresses under attack, the routine continues at block 406, where the identification service 116 maps the attacked network addresses to a set of distributions that are potential targets for the attack. Illustratively, the identification service 116 may map network addresses to distributions by utilizing the same algorithm used by the DNS servers to determine network addresses for a distribution (as described in FIG. 2, above). Accordingly, the identification service 116 may generate a mapping to identify, for each distribution within a specific POP 114 being attacked or for each distribution served by the content distribution system, a combination of network addresses associated with that distribution. One simplified illustration of a mapping between distributions and network addresses is shown below in TABLE 1. While only a limited number of network addresses is shown for each distribution within TABLE 1, distributions may be associated with any number of network addresses. The specific format and content of the distribution identifiers and network addresses shown in TABLE 1 is intended solely for illustrative purposes.












TABLE 1







Distribution Identifier
Network Addresses









distribution1.pop5.cdn.tld
192.168.0.1




192.168.0.2




192.168.0.3



distribution2.pop5.cdn.tld
192.168.0.1




192.168.0.3




192.168.0.4



distribution3.pop5.cdn.tld
192.168.0.2




192.168.0.4




192.168.0.5










As discussed above, the content delivery system 110 may, in some instances, utilize multiple pools of network addresses for distributions of different classes. Because a distribution's class may vary with time, the identification service 116 may be configured to map a distribution to a different combination of network addresses for each class potentially associated with the distribution. Illustratively, where the content delivery system 110 utilizes three classes of addresses, the identification service 116 may identify three combinations of network addresses associated with each distribution (one for each class), regardless of which class the distribution is currently classed within. In another embodiment, a history of classes associated with each distribution may be maintained within the content delivery system 110, such that the identification service 116 may identify, for each distribution, a combination of network addresses associated with each historical classification of the distribution. Accordingly, Table 1, above, may be modified to include, for each distribution, multiple combinations of network addresses, each combination being associated with a different network address pool.


The identification service 116 may then inspect the mapping to identify one or more distributions associated with the attacked network addresses, each of which constitutes a potential target for the attack. In reference to the illustrative data of TABLE 1, if a network attack were directed to the network address “192.168.0.5,” the identification service 116 may determine that the attacked distribution corresponds to distribution identifier “distribution3.pop5.cdn.tld.” Similarly, if a network attack were directed to the network address “192.168.0.1,” the identification service 116 may determine that the attacked distribution corresponds to either distribution identifier “distribution1.pop5.cdn.tld” or distribution identifier “distribution2.pop5.cdn.tld,” but not to distribution identifier “distribution3.pop5.cdn.tld”.


Thereafter, at block 408, the identification service 116 may determine whether the number of previously identified distributions is less than or equal to a threshold value. Illustratively, the threshold value may be set to one to require that only a single distribution be identified as the target of an attack. Alternatively, the threshold value may be increased to allow for more than a single distribution to be identified as the target of an attack. Increasing the threshold value may be beneficial, for example, to allow mitigation techniques to be implemented more rapidly, to reduce the need to redirect network attacks (as described below), or to allow for the possibility of multiple simultaneous attacks on different distributions.


In the instance that the number of identified distributions is less than or equal to the threshold value, the routine 400 continues at block 414, where the identification service 116 can attempt to mitigate the attack. As noted above, attack mitigation may include altering the configuration of the content delivery system 110 to reduce the effects of the attack on non-attacked distributions. Illustratively, the identification service 116 may cause the content delivery system 110 to disassociate non-attacked distributions from attacked addresses (e.g., by removing the attacked network addresses from DNS responses for non-attacked distributions), or relocate content of the non-attacked distributions to alternate locations within the content delivery system. The identification service 116 may further cause the content delivery system 110 to modify the attacked distribution in an effort to mitigate the attack (e.g., by expanding the number of computing devices associated with the attacked distribution, the number of network addresses associated with the attacked distribution, or both). Accordingly, the identification service 116 may utilize knowledge of the identity of the attacked distribution to more effectively mitigate the network attack. The routine may then end at block 416.


In the instance that the number of identified distributions is greater than the threshold value, the routine 400 continues at block 410, where the identification service 116 can attempt to redirect the network attack to additional network addresses. Specifically, at block 410, the identification service 116 may transmit instructions to the DNS servers 112 within the content delivery system that cause the DNS servers 112 to stop including the initially attacked network addresses within any DNS records. In addition to helping to mitigate the attack directly (by redirecting legitimate computing devices to non-attacked network addresses), removal of the attacked network addresses may also redirect the attack to additional network addresses. For example, where an attack had been carried out on the network address “192.168.0.1,” removal of that address from DNS records may cause the attack to redirect to the network address “192.168.0.2.” Redirection of an attack may occur automatically or manually within the set of computing devices implementing the attack. For example, software used to execute an attack may automatically and continuously resolve a distribution identifier (e.g., a domain name) into a combination of network addresses, and select a subset of the resolved addresses to target in an attack. By removal of initially attacked network addresses from DNS records, such software can be caused to attack additional network addresses, thereby allowing the content delivery system 110 to accurately determine the specific distribution targeted in the attack. In other instances, an attacker may automatically or manually detect that an initially attacked network address has been removed from DNS records (e.g., by analyzing DNS records for the attacked distribution, by observing that the attacked distribution is still accessible, etc.), and redirect the attack to additional network addresses of the targeted distribution. Such additional network addresses may be known to the attacker from prior DNS records (e.g., obtained prior to an attack), or from DNS records received from the DNS servers 112 after removal of the initially attacked network addresses.


In one embodiment, removal of an attacked network address from DNS records for a distribution may reduce the number of network addresses those DNS records. For example, where a combination of n addresses is assigned to a distribution, removal of a single attacked network address form DNS records for the distribution may result in DNS records including n−1 network addresses. In other embodiments, DNS servers 112 may replace removed network addresses with alternative addresses assigned to the distribution. For example, where the content delivery system 110 associates distributions with multiple classes, each associated with distinct pools of network addresses, removal of an attacked network address from DNS records for a distribution may be achieved by altering a class of the distribution on the content delivery system 110. Illustratively, each distribution associated with an attacked network address may be reclassified from the “normal” class to the “high risk” class. Because each class can be associated with a different network address pool, reclassification of the distributions can cause the combination of network addresses distributed by the DNS servers 112 for the distributions to change. For example, the DNS servers 112 may halt distributing IP addresses in the “192.168.0/24” IP block for each attacked distribution, and begin distributing IP addresses in the “192.168.1/24” IP block. Such substitution of network address combinations can enable attacked network addresses to be removed from DNS records, without reducing the number of network addresses reported for each distribution. After redirection of the attack to one or more additional network addresses, the routine 400 can continue at block 402, where the identification service 116 attempts to detect the attack on one or more additional network addresses. The identification service 116 can then, at blocks 404 and 406, use these additional network addresses, in addition to the initially attacked network addresses, to identify a set of distributions potentially under attack. The identification service 116 may continue to loop through blocks 402 through 410 until the decision at block 408 is satisfied. Thereafter, the routine 400 can continue at block 414, as described above. The routine 400 may then end at block 416.


One skilled in the art will appreciate that the routine 400 may include fewer or more interactions than described above. Illustratively, in addition to redirecting a network attack by removing attacked addresses from DNS records, the identification service 116 may directly limit traffic to an attacked address. In one embodiment, the identification service 116 may “blackhole” one or more attacked addresses by instructing routing devices within the content delivery system 110 to discard (or “drop”) packets directed to the attacked addresses. In addition to helping mitigate the network attack (by reducing the load on the content delivery system 110), this technique may serve to more effectively redirect a network attack to additional network addresses. As a further illustration, the routine 400 may be modified to enable identification of a source of a network attack, in addition to or exclusively of identifying the target of the network attack. For example, where network addresses for distributions are distributed on a per-device basis, block 404 may be modified or replaced, such that the routine 400 attempts to identify accessing computing devices 102 that were provided within the attacked network addresses (e.g., by comparing the attacked network addresses to the combinations of network addresses distributed to individual computing devices 102). Further, block 408 may be modified to determine whether a number of identified accessing computing devices 102 satisfies a threshold value. If so, the mitigation implemented at block 414 may include mitigations specifically targeted at the identified accessing computing devices 102 (e.g., by blackholing packets sent from the identified accessing computing devices 102, or by provided different network addresses to the identified accessing computing devices 102 in response to DNS requests by such devices). If the identified accessing computing devices do not satisfy the threshold value, the routine 400 may continue at block 410, where one or more attacked network addresses are removed from DNS records in an attempt to redirect the network attack to additional network addresses. As such, the routine 400 may be implemented to identify a source of a network attack, additionally or alternatively to identifying a target of the network attack. Accordingly, the interactions of routine 400 are intended to be illustrative in nature, rather than exhaustive.



FIG. 5 depicts one embodiment of an architecture of a server 500 that may implement the identification service 116 described herein. The general architecture of server 500 depicted in FIG. 5 includes an arrangement of computer hardware and software components that may be used to implement aspects of the present disclosure. As illustrated, the server 500 includes a processing unit 504, a network interface 306, a computer readable medium drive 507, an input/output device interface 520, a display 302, and an input device 524, all of which may communicate with one another by way of a communication bus. The network interface 306 may provide connectivity to one or more networks or computing systems, such as the network 106 of FIG. 1. The processing unit 504 may thus receive information and instructions from other computing systems or services via a network. The processing unit 504 may also communicate to and from memory 510 and further provide output information for an optional display 502 via the input/output device interface 520. The input/output device interface 520 may also accept input from the optional input device 524, such as a keyboard, mouse, digital pen, etc. In some embodiments, the server 500 may include more (or fewer) components than those shown in FIG. 5. For example, some embodiments of the server 500 may omit the display 502 and input device 524, while providing input/output capabilities through one or more alternative communication channel (e.g., via the network interface 306).


The memory 510 may include computer program instructions that the processing unit 504 executes in order to implement one or more embodiments. The memory 510 generally includes RAM, ROM and/or other persistent or non-transitory memory. The memory 510 may store an operating system 514 that provides computer program instructions for use by the processing unit 304 in the general administration and operation of the server 500. The memory 510 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 510 includes user interface software 512 that generates user interfaces (and/or instructions therefor) for display upon a computing device, e.g., via a navigation interface such as a web browser installed on the computing device. In addition, memory 510 may include or communicate with one or more auxiliary data stores, such as data store 120.


In addition to the user interface module 512, the memory 510 may include identification software 516 that may be executed by the processing unit 504. In one embodiment, the identification software 516 implements various aspects of the present disclosure, e.g., determining the target distribution of a network attack based on one or more received network addresses. While the identification software 516 is shown in FIG. 5 as part of the server 500, in other embodiments, all or a portion of the software may be implemented individual or collectively by one or more alternative computing devices within the content delivery system 110, such as computing devices within each POP 114.


While FIG. 5 is described above with reference to implementing the identification service 116, the server 500 may additionally or alternatively implement functionality corresponding to the mitigation service 118. Illustratively, the memory 510 may include additional mitigation software (not shown in FIG. 5) that contains computer-executable instructions that, when executed by the server 500, causes the server 500 to implement aspects of the present disclosure, e.g., by modifying the routing of requests for an attacked distribution. In other embodiments, all or a portion of the mitigation software may be implemented individually or collectively by one or more alternative computing devices within the content delivery system 110, such computing devices within each POP 114.


With reference to FIG. 6, a set of illustrative interactions are depicted for mitigating a network attack on a distribution of the content delivery system 110. The interactions of FIG. 6 begin at (1), where the content delivery system detects a network attack, such as by monitoring network traffic transmitted to the content delivery system 110 and identifying a large volume of anomalous traffic directed to the attacked network addresses. Thereafter, at (2), the content delivery system identifies one or more distributions on the content delivery system that are targeted in the attack, in accordance with embodiments of the present disclosure described above.


The content delivery system 110 may be programmed to carry out a variety of potential mitigations for a network attack, which may depend in part on the severity of the attack. Accordingly, at (2), one or more POPs experiencing the network attack (e.g., receiving data packets identified as forming part of the network attack), such as POP 114A, may generate attack impact information. In one embodiment, the attack impact information may include one or more metrics indicative of the effect of the attack on the POP 114A itself. For example, the attack impact information may include absolute metrics as to the amount of data associated with the attack, such as the number of packets-per-second (“pps”) or bits-per-second (“bps”) attributed to the attack. The attack impact information may further include relative metrics indicating what portion of the POP 114As capacity is utilized during the network attack (e.g., 50% of capacity, 100% of capacity, etc., where total capacity may be a pre-established value for a given POP 114), what level of CPU usage is experienced at individual computing devices of the POP 114A. Still further, the attack impact information may include other metrics, such as the percentage of packets dropped or timed-out at the POP 114A, the time taken to process each request at the POP 114, a status of a health check on the POP 114A (e.g., based on a response to network transmissions, such as an ICMP ping), automatic changes of configuration of the POP 114A (e.g., a change in IP addresses assigned to the POP 114A via an automated IP allocation process) or the number of service level agreement (SLA) violations by the POP 114A (where the SLA indicates, for example, standards for assessing the time taken by the POP 114A to service a client request). In some instances, one or more metrics may also indicate effects of the attack on devices outside of the POP 114A. For example, the POP 114A may monitor a number of retransmission packets received at the POP 114A, which may indicate that an upstream device (such as a router on the network 106) is overloaded.


At (4), the gathered attack impact information is transmitted to the mitigation service 118, which may, at (5), use the attack impact information to determine a mitigation for the attack. In one embodiment, the mitigation service 118 may maintain a set of rules indicating one or more mitigations to be implemented in response to specific impact metrics. For example, the mitigation service 118 may maintain a set of rules, each of which indicates a set of criteria corresponding to the attack impact metrics and a corresponding mitigation technique. Thereafter, the mitigation service may compare the received attack impact metrics to the rules in order to determine one or more applicable mitigation techniques, and may then implement those techniques. In some instances, the rules may be ordered or prioritized, such that the techniques are implemented in the order specified in the rules (e.g., with a predetermined period of time between each mitigation technique). For example, a rule may indicate that where an attack is under a first threshold level of bits-per-second, the attack should be rerouted to a POP 114 implementing DDoS protection software. A second rule may indicate that where an attack is at or over the first threshold, but under a second threshold, the attack should be rerouted to multiple POPs 114 via an anycast mechanism. Any number of additional or alternative rules may be established to reroute an attack in accordance with the requirements of the content delivery system 110.


Thereafter, at (6), the mitigation service 118 selects a new routing configuration used to implement the determined mitigation technique. In one embodiment, the routing configuration may be directly specified by mitigation rules (e.g., “reroute all attacks with under a threshold number of bit-per-second to POP 114C”). In another embodiment, the mitigation service 118 may be configured to determine an appropriate routing configuration based on parameters specified within mitigation rules (e.g., “reroute all attacks with under a threshold number of bits-per-second to a POP 114 executing DDoS protection software”). Thereafter, the mitigation service 118 may modify the content delivery system 110 or external routing devices in order to implement the determined routing configuration.


As discussed above, redirection of network attacks may depend at least in part on whether the attack is or is not re-resolving. Specifically, re-resolving attacks may be redirected based on modification of resolution records, while attacks that are not re-resolving may require redirection based on updating the routing for an attacked network address (e.g., via a routing protocol). Accordingly, interactions for modifying the content delivery system 110 or external routing devices in order to implement the determined routing configuration will be discussed with respect to both FIGS. 7 and 8, below, wherein FIG. 7 represents interactions for utilizing modified resolution records, such as DNS records, to implement a determined routing configuration, and wherein FIG. 8 represents interactions implementing a determined routing configuration by updating the routing for an attacked network address.


With reference to FIG. 7, the depicted interactions begin at (1), where the mitigation service generates instructions to DNS servers 112 of the content delivery system 110 to implement a routing configuration (e.g., the new routing configuration selected at interaction (6) of FIG. 6). In one embodiment, the instructions may specify one or more distributions affected by a network attack (e.g., those targeted in the attack, those sharing network addresses with a distribution targeted in the attack, etc.), and for each distribution, a specific set of network addresses to provide to clients in response to requests to resolve an identifier of that distribution. For example, where a distribution is associated with a URI “www.distributionA.tld,” the instructions may specify that DNS servers 112 are to resolve results for network addresses of the distribution into the IP addresses “10.1.1.2” and “10.1.1.3” (which may, for example, correspond to a POP 114 executing DDoS protection software, to multiple POPs 114 via anycast addressing, or to a network “blackhole route”). In another embodiment, the instructions may include other information enabling the DNS servers 112 to implement the routing configuration. For example, the instructions may specify that one or more distributions are to be disassociated with a first network address pool (e.g., a default network address pool), and associated with a second network address pool (e.g. a pool of addresses identifying POPs 114 executing anti DDoS software, a pool of anycast addresses, a pool of blackholed addresses, etc.).


Thereafter, at (2), the instructions are transmitted to DNS servers 112. Illustratively, the DNS servers 112 may receive and process the instructions, such that subsequent resolution requests for distributions identified in the instructions are modified in accordance with the instructions.


As noted above, re-resolving attacks are generally characterized in their use of repeated resolution requests for a targeted distribution. Accordingly, the remaining interactions of FIG. 7 illustrate how modification of DNS records at the DNS servers 112 enable a network attack on a distribution to be redirected from a first POP 114, such as POP 114A, to an alternate POP 114, such as POP 114C. Specifically, at (3), an accessing computing device 102V associated with the attack transmits to one or more DNS servers 112 a request to resolve an identifier of the targeted distributed into a network address. The DNS server 112 may then generate a network address set for the targeted distributed in accordance with the modified DNS records, and return the network address set to the accessing computing device 102B. In one embodiment, the generated network address set may be directly specified within the previously transmitted instructions. In another embodiment, the DNS servers 112 may generate a unique or semi-unique set of network address information for the targeted distribution, in accordance with embodiments described above (e.g., at FIG. 2).


Thereafter, at (5), the accessing computing device 102B attempts to access the targeted distribution using the received network addresses (e.g., as part of a network attack on the targeted distribution). Because the received network addresses have been generated by the content delivery system 110, these addresses may correspond to any POP 114 or collection of POPs 114 on the content delivery system 110. Thus, the network may be redirected to any location desirable on the content delivery system 110.


While the interactions of FIG. 7 are described above with respect to an accessing computing device 102B associated with a network attack, similar interactions may occur with respect to other accessing computing devices 102, including legitimate computing devices. In some instances, such as instances in which the content delivery system 110 is unable to accurately distinguish between legitimate and malicious accessing computing devices 102, all computing devices may be provided by the DNS server 112 with the same network addressing information for a distribution. Thus, traffic of both legitimate and malicious accessing computing devices 102 may be redirected to the same POP 114. In other instances, such as instances in which the content delivery system 110 is able to accurately distinguish between legitimate and malicious accessing computing devices 102, malicious accessing computing devices 112 may be provided by the DNS servers 112 with different network addressing information for a distribution than is provided to legitimate accessing computing devices 112. This may enable traffic of legitimate and malicious accessing computing devices 102 to be separated, thus ensuring that access to the distribution is maintained for legitimate accessing computing devices 102.


Furthermore, while the interactions of FIG. 7 are described with respect to modifying resolution records of an attacked distribution, similar interactions may be utilized to modify resolution records for non-attacked distributions, such as those previously sharing network addresses with an attacked distribution. For example, the interactions of FIG. 7 may be repeated for non-attacked distributions, such that traffic of those distributions is rerouted to POP 114B, and is thus segregated from traffic of an attacked distribution. Such segregation may enable the content delivery system 110 to ensure the continued availability of non-attacked distributions.


With reference to FIG. 8, a set of interactions is depicted for redirected traffic of distributions based on network routing updates. As noted above, the use of routing updates may enable the content delivery system 110 to redirect traffic associated with network attacks that are not re-solving (e.g., which continue to target network addresses previously associated with a distribution on the content delivery system 110, even where subsequent resolution requests for the distribution resolve to other network addresses). The interactions of FIG. 8 begin at (1), where the mitigation service 116 generates instructions corresponding to a desired routing update for transmittal to one or more POPs 114. Illustratively, the instructions may specify one or more network addresses (e.g., associated with a distribution targeted in an attack) to be disassociated with a first POP 114 (e.g., POP 114A) and associated with a second POP 114 (e.g., POP 114C). As such, implementation of the instructions may cause traffic, such as attack traffic, directed to the one or more network addresses to be redirected from the first POP 114 to the second POP 114. Thereafter, at (2′) and (2″), the mitigation service 116 transmits the instructions to the relevant POPs 114. Specifically, as shown in FIG. 8, the mitigation service 116 transmits, at (2′), a first set of instructions to POP 114A instructing the POP 114A issue a routing announcement withdrawing an association between POP 114A and network addresses under attack. Further, the mitigation service 116 transmits, at (2″), a second set of instructions to POP 114C instructing the POP 114C to issue a routing announcement creating an association between POP 114C and the network addresses under attack.


The relevant POPs 114, such as POPs 114A and 114C, then issue routing updates to associated network devices, such as devices within the network 106, at (3′) and (3″). In one embodiment, the routing updates corresponding to BGP-protocol packets, and are transmitted to at least one autonomous system (“AS”) in communication with the POPs 114. BGP-protocol packets are known in the art, and will not be discussed in detail herein. However, one of skill in the art will appreciate that BGP-protocol packets may be utilized to cause traffic directed to one or more network addresses to be rerouted to different POPs 114 within the content delivery system 110. Thereafter, at (4), when an accessing computing device 102 subsequently requests, as part of an attack, to access a targeted distribution, the request may be routed by the network 106, at (5′), to POP 114C. Thus, traffic associated with a network attack may be redirected from POP 114A to POP 114C, even when the attack is not re-resolving.


In some embodiments, mitigations implemented by the content delivery system 110 may utilize both resolution-based and routing-based techniques in conjunction. For example, where an attack that is not re-resolving is redirected to an alternative POP 114 via routing updates, access to non-targeted distributions initially sharing network addresses that are under attack may be redirected to still other POPs 114 via the resolution-based techniques of FIG. 7. Generally, legitimate access to the content delivery system 110 may be expected to re-resolve frequently. Thus, a combination of resolution-based and routing-based techniques may be helpful in segregating legitimate and malicious traffic.


With reference to FIG. 9, one illustrative routine 900 for implementing a resolution-based attack mitigation will be described. The routine 900 may be carried out, for example, by the mitigation service 118 of FIG. 1, either alone or in conjunction with additional elements of the content delivery system 110.


The routine 900 begins at block 902, where the mitigation service 118 identifies distributions affected by the attack. Illustratively, the affected distributions may include a targeted distribution (e.g., as identified in accordance with embodiments of the disclosure described above at FIG. 4), as well as non-targeted distributions sharing one or more network addresses with the targeted distribution.


At block 904, the mitigation service 118 gathers attack impact information corresponding to the attack. Illustratively, attack impact information may be gathered by interacting with or monitoring execution of various POPs 114 of the content distribution service 110, such as those POPs 114 currently associated with the affected distributions. Attack impact information may include, for example, absolute metrics as to the amount of data associated with the attack, such as the number of packets-per-second (“pps”) or bits-per-second (“bps”) attributed to the attack. The attack impact information may further include relative metrics indicating what portion of the POPs 114 capacity is utilized during the network attack (e.g., 50% of capacity, 100% of capacity, etc.,). Still further, the attack impact information may include other metrics, such as the percentage of packets dropped or timed-out at the POP 114A, the time taken to process each request at the POP 114 or the number of service level agreement (SLA) violations by the POP 114A. In some instances, one or more metrics may also indicate effects of the attack on devices outside of the POP 114A. For example, the attack impact information may indicate a number of retransmission packets received at each POP 114, which may indicate that an upstream device (such as a router on the network 106) is overloaded. In some embodiments, attack impact information may additionally or alternatively be gathered by use of one or more “web probes” transmitted from the mitigation service 118 or another component of the content delivery system 110. Illustratively, a number of web probes may be transmitted from the content delivery system 110, with the intention of provoking a response from a targeted network device, such as a router within the network 106. The content delivery system 110 may thereafter inspect the response to determine relevant metrics, such as the total time taken to receive the response after transmission of the web probe, or the number of web probes that did not provoke a response. These metrics may indicate a relative health of the targeted network device, and thus may be used as an indicator of the impact of the network attack on the targeted network device.


Thereafter, the routine 900 continues at block 905, where the mitigation service 118 selects a mitigation technique based at least in part on the attack impact information. In one embodiment, the mitigation technique may be selected according to one or more rules stored within a data store of the mitigation service 118. For example, the mitigation service 118 may maintain a set of rules indicating one or more criteria (e.g., corresponding to the gathered attack impact information), as well as a mitigation technique to employ when that criteria is satisfied. Illustratively, where a network attack is directed to a POP 114 not executing DDoS protection software and is causing a threshold number of SLA violations on the POP 114, a rule maintained by the mitigation service 118 may indicate that the attack should be redirected to a POP 114 executing DDoS protection software. Similarly, where an attack is directed to a POP 114 executing DDoS protection software and is causing a threshold number of SLA violations on the POP 114, a rule may indicate that the attack should be redirected to multiple POPs 114 via an anycast mechanism. The various criteria utilized by the rules may correspond to any gathered attack impact information, as well as additional or alternative information, such as client preferences for one or more affected distributions or a history of mitigation techniques already employed. The mitigations implemented by the mitigation service 118 based on the routine 900 may include any modification to resolution records (e.g., DNS records), including but not limited to: causing traffic for affected distributions to be redirected network addresses associated with alternative POPs 114, causing traffic for affected distributions to be redirected to network addresses advertised by multiple POPs 114 via anycast, causing traffic for affected distributions to be redirected to network addresses associated with specific physical ports on one or more routing devices, causing traffic for specific affected distributions (e.g., targeted and non-targeted distributions) to be redirected to different network addresses, and causing traffic for specific affected distributions to be redirected to network addresses that are specially handled by the content delivery system 110 (e.g., by “blackholing” or “tarpitting” techniques). After determining the specific mitigations to be implemented, the mitigation service 118 may, at block 906, transmit instructions to relevant components of the content delivery system 110, such as DNS servers 112, to cause traffic for affected distributions to be redirected in accordance with the mitigation technique.


Thereafter, at block 908, the mitigation service 118 may determine whether the implemented mitigation technique has been successful. In one embodiment, the mitigation service 118 may collect updated attack impact information, and analyze the attack impact information to determine whether the mitigation technique should be considered successful. For example, where a mitigation technique causes the number of SLA violations for a distribution to drop to within an acceptable threshold, the mitigation technique may be considered successful. The routine 900 may therefore end at block 912.


Alternatively, if the mitigation technique is not determined to be successful (e.g., if updated attack impact metrics do not fall within acceptable levels), the routine 900 returns to block 905, where the mitigation service 118 selects an additional or alternative mitigation. In some embodiments, the additional or alternative mitigation may be selected based on the updated attack impact information, according to rules maintained by the mitigation service 118. For example, where the updated attack impact information indicates that an attacked distribution continues to experience a threshold number of SLA violations even after redirecting traffic of that distribution to a POP 114 executing DDoS protection software, a rule maintained by the mitigation service 118 may indicate that traffic of that distribution be redirected to multiple POPs 114 via anycast network addresses. Thereafter, the routine 900 returns to block 906, when resolution records of the content delivery system 110 are modified to implement the additional or alternative mitigation technique. The routine 900 may thereafter continue until the attack is mitigated.


While the routine 900 is described above solely with respect to resolution-based redirection of traffic, the mitigation service 118 may additionally or alternatively implement routing-based redirection of traffic. For example, in some instances, at block 905, the mitigation service 118 may determine that routing-based mitigation techniques should be employed (e.g., based on attack impact information indicating that attack traffic continues to target a first set of network addresses, even after resolution requests for the distribution have been modified to include a second set of network addresses). As such, rather than proceed to block 906, the mitigation service 118 may halt execution of the routine 900 and begin implementation of a routine to implement routing-based mitigation of a network attack.


One example of such a routine is shown as routine 1000 of FIG. 10. As with the routine 900, above, the routine 1000 of FIG. 10 may be carried out by the mitigation service 118 of FIG. 1, either alone or in conjunction with additional elements of the content delivery system 110.


The routine 100 begins at 1002, where the mitigation service 118 identifies distributions affected by the attack, which may include a targeted distribution (e.g., as identified in accordance with embodiments of the disclosure described above at FIG. 4), as well as non-targeted distributions sharing one or more network addresses with the targeted distribution. The routine 1000 then continues to block 1004, where the mitigation service 118 gathers attack impact information corresponding to the attack. As described above, the attack impact information may include information gathered by interacting with or monitoring execution of various POPs 114 of the content distribution service 110, as well as information generated at the mitigation service 118 itself or generated by other components of the content delivery system 110 (e.g., via analysis of web probe packets).


At block 1005, the mitigation service 118 selects a mitigation technique to be employed based on the attack impact information. As described above with respect to FIG. 9, the mitigation service 118 may maintain a set of rules utilized to select an appropriate mitigation technique, each of which may specific a set of criteria and a corresponding mitigation technique to be implemented on satisfaction of the criteria. Illustratively, rules utilize by the mitigation service 118 to select a mitigation technique in accordance with the routine 1000 may specify any number of potential modifications to routing of packets destined for the content delivery system 100, including but not limited to: causing traffic for network addresses targeted in an attack to be redirected to an alternative POP 114, causing traffic for network addresses targeted in an attack to be redirected to multiple POPs 114 via anycast, causing traffic for network addresses targeted in an attack to be routed through specific physical ports on one or more routing devices of the content delivery system 110, and causing traffic for network addresses targeted in an attack to be specially handled by the content delivery system 110 (e.g., by “blackholing” or “tarpitting” those network addresses).


After determining the specific mitigations to be implemented, the mitigation service 118 may, at block 1006, transmit instructions to relevant components of the content delivery system 110, such as the POPs 114, to cause routing updates for network addresses targeted in the attack to be transmitted to relevant components of the network 106 or the content delivery system 110.


Thereafter, at block 1008, the mitigation service 118 may determine whether the implemented mitigation technique has been successful. In one embodiment, the mitigation service 118 may collect updated attack impact information, and analyze the attack impact information to determine whether the mitigation technique should be considered successful. For example, where a mitigation technique causes the number of SLA violations for a distribution to drop to within an acceptable threshold, the mitigation technique may be considered successful. The routine 1000 may therefore end at block 1012.


Alternatively, if the mitigation technique is not determined to be successful (e.g., if updated attack impact metrics do not fall within acceptable levels), the routine 1000 returns to block 1005, where the mitigation service 118 selects an additional or alternative mitigation. In some embodiments, the additional or alternative mitigation may be selected based on the updated attack impact information, according to rules maintained by the mitigation service 118. For example, where the updated attack impact information indicates that an attacked distribution continues to experience a threshold number of SLA violations even after redirecting traffic for network addresses of that distribution to a POP 114 executing DDoS protection software, a rule maintained by the mitigation service 118 may indicate that network addresses of that distribution should be advertised from multiple POPs 114 via anycast routing techniques. Thereafter, the routine 1000 returns to block 1006, when routing of traffic directed to the content delivery system 110 is further updated to implement the additional or alternative mitigation technique. The routine 1000 may thereafter continue until the attack is mitigated.


While the routines 900 and 1000 of FIGS. 9 and 10, respectively, are described separately above, embodiments of the present disclosure may in some instances implement the routines in combination. For example, the mitigation service 188 may, in some instances, maintain a set of rules that specifies, for a given set of attack impact information, whether a resolution-based mitigations, a routing-based mitigation, or a combination of mitigations should be employed to mitigate a network attack. Thus, the separate description of routines 900 and 1000 is not intended to imply that the techniques and functionalities described therein must be implemented separately.


All of the methods and processes described above may be embodied in, and fully automated via, software code modules executed by 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 name resolution server including a physical processor configured with specific computer-executable instructions to: receive, from a first computing device, a request to resolve an identifier of a set of content on a content delivery system;determine a first combination of network addresses for the set of content based at least in part on an identifier of the first computing device, wherein the first combination of network addresses is selected from a set of network addresses at which the set of content is made available by the content delivery system;transmit the first combination of network addresses to the first computing device;receive a request to resolve the identifier of the set of content from a second computing device;determine a second combination of network addresses for the set of content based at least in part on an identifier of the second computing device, wherein the second combination of network addresses is different from the first combination of network addresses;transmit the second combination of network addresses to the second computing device;a network attack source identification server including a physical processor configured with specific computer-executable instructions to: detect a network attack on the content delivery system, the network attack directed to a plurality of network addresses;determine that the plurality of network addresses to which the network attack is directed is included in the first combination of network addresses transmitted to the first computing device;derive the identifier of the first computing device from at least the first combination of network addresses transmitted to the first computing device; andidentify the first computing device as associated with the network attack.
  • 2. The system of claim 1, wherein the set of content is associated with a domain name hosted by the content delivery system.
  • 3. The system of claim 1, wherein the plurality of network addresses are internet protocol (IP) addresses.
  • 4. The system of claim 1, wherein the network attack is a denial of service (DoS) attack.
  • 5. The system of claim 1, wherein the name resolution server is further configured to transmit to the network attack source identification server information associating the first combination of network addresses and the identifier of the first computing device, and wherein the network attack source identification server is configured to derive the identifier of the first computing device from at least the information associating the first combination of network addresses and the identifier of the first computing device.
  • 6. A computer-implemented method comprising: receiving a request from a first computing device to resolve an identifier for a set of content on a content delivery system;determining a first combination of addressing information sets for the set of content based at least in part on an identifier of the first computing device, wherein the first combination of addressing information sets is distinct from a second combination of addressing information sets determined for a second computing device, and wherein the first combination addressing information sets is selected from a group of addressing information sets at which the set of content is made available by the content delivery system;transmitting the first combination of addressing information sets to the first computing device;detecting a network attack, on the content delivery system, directed to a plurality of addressing information sets;determining that the plurality of addressing information sets is included within the first combination of addressing information sets;deriving the identifier of the first computing device from at least the first combination of network addresses transmitted to the first computing device; andidentifying the first computing device as associated with the network attack.
  • 7. The computer-implemented method of claim 6, wherein addressing information sets comprise at least one of a network address, a port number, and a protocol.
  • 8. The computer-implemented method of claim 6, wherein detecting the network attack on the content delivery system comprises receiving a notification of the network attack and a listing of the plurality of addressing information sets.
  • 9. The computer-implemented method of claim 6, wherein the first combination of addressing information sets is selected from the group of addressing information sets based at least in part on hashing an identifier of the first computing device.
  • 10. The computer-implemented method of claim 9, wherein the identifier of the first computing device is at least one of an internet protocol (IP) address or a media access control (MAC) address.
  • 11. The computer-implemented method of claim 6, wherein at least one addressing information set is included in both the first combination of addressing information sets and the second combination of addressing information sets.
  • 12. The computer-implemented method of claim 6, wherein the first combination of addressing information sets is transmitted only to the first computing device.
  • 13. The computer-implemented method of claim 6 further comprising: subsequent to identifying of the first computing device as associated with the network attack, receiving a request from the first computing device to resolve an identifier of the set of content;determining one or more addressing information sets to be distributed to computing devices associated with network attacks; andtransmitting to the first computing device the one or more addressing information sets.
  • 14. The computer-implemented method of claim 13, wherein the content delivery system is configured to discard packets addressed to the one or more addressing information sets.
  • 15. The computer-implemented method of claim 6, wherein detecting a network attack, on the content delivery system, directed to a plurality of addressing information sets comprises: detecting that a first addressing information set of the plurality of addressing information sets is under attack; andmodifying the content delivery system to remove the first addressing information set from responses to resolution requests corresponding to the set of content.
  • 16. A system comprising: a computing device in communication with a content delivery system enabling a plurality of client computing devices to access a set of content, the computing device configured with specific computer-executable instructions to: detect a network attack on the content delivery system, the network attack directed to a plurality of addressing information sets at which a set of content may be accessed on the content delivery system;determine a mapping between individual client computing devices, of the plurality of client computing devices, and combinations of addressing information sets distributed to the individual client computing devices in response to requests to access the set of content, the combinations of addressing information sets selected from a group of addressing information sets at which the set of content is made available by the content delivery system;compare the plurality of addressing information sets to the mapping to derive an identifier of a first client computing device from at least the mapping and the plurality of addressing information sets; andidentify the first client computing device as associated with the network attack.
  • 17. The system of claim 16, wherein the specific computer-executable instructions configure the computing device to identify the first client computing device as associated with the network attack by associating the identifier of the first client computing device with the network attack.
  • 18. The system of claim 16, wherein the specific computer-executable instructions configure the computing device to transmit instructions to one or more network routing devices within the content delivery system to discard packets received from the first client computing device.
  • 19. The system of claim 16, wherein the specific computer-executable instructions configure the computing device to determine the mapping based at least in part on information received from a name resolution system, the information identifying combinations of addressing information sets distributed to individual client computing devices of the plurality of client computing devices.
  • 20. The system of claim 16 further comprising a name resolution server configured with specific computer-executable instructions to: receive, from individual client computing devices of the plurality of client computing devices, requests to resolve an identifier of the set of content;distribute to the individual client computing devices distinct combinations of addressing information sets.
  • 21. The system of claim 20, wherein the distinct combinations of addressing information sets are determined by the name resolution server based at least in part on identifiers of the individual client computing devices.
US Referenced Citations (1128)
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
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
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
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
6405252 Gupta et al. Jun 2002 B1
6408360 Chamberlain et al. Jun 2002 B1
6411967 Van Renesse Jun 2002 B1
6415280 Farber et al. Jul 2002 B1
6430607 Kavner Aug 2002 B1
6438592 Killian Aug 2002 B1
6442165 Sitaraman et al. Aug 2002 B1
6452925 Sistanizadeh et al. Sep 2002 B1
6457047 Chandra et al. Sep 2002 B1
6459909 Bilcliff et al. Oct 2002 B1
6473804 Kaiser et al. Oct 2002 B1
6484143 Swildens et al. Nov 2002 B1
6484161 Chipalkatti et al. Nov 2002 B1
6493765 Cunningham et al. Dec 2002 B1
6505241 Pitts Jan 2003 B2
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
6694358 Swildens et al. Feb 2004 B1
6697805 Choquier et al. Feb 2004 B1
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
6928467 Peng et al. Aug 2005 B2
6928485 Krishnamurthy et al. Aug 2005 B1
6941562 Gao et al. Sep 2005 B2
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
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
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
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
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
7376736 Sundaram et al. May 2008 B2
7380078 Ikegaya et al. May 2008 B2
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
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
7519720 Fishman et al. Apr 2009 B2
7519726 Palliyil et al. Apr 2009 B2
7523181 Swildens et al. Apr 2009 B2
7543024 Holstege Jun 2009 B2
7548947 Kasriel et al. Jun 2009 B2
7552235 Chase et al. Jun 2009 B2
7555542 Ayers et al. Jun 2009 B1
7561571 Lovett et al. Jul 2009 B1
7565407 Hayball Jul 2009 B1
7568032 Feng et al. Jul 2009 B2
7573916 Bechtolsheim et al. Aug 2009 B1
7574499 Swildens et al. Aug 2009 B1
7581009 Hsu et al. Aug 2009 B1
7594189 Walker et al. Sep 2009 B1
7596619 Leighton et al. Sep 2009 B2
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
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
7756913 Day Jul 2010 B1
7756965 Joshi Jul 2010 B2
7757202 Dahlstedt 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
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
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
8156199 Hoche-Mong et al. Apr 2012 B1
8156243 Richardson et al. Apr 2012 B2
8175863 Ostermeyer et al. May 2012 B1
8190682 Paterson-Jones et al. May 2012 B2
8195837 McCarthy et al. Jun 2012 B2
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 et al. Oct 2012 B1
8296393 Alexander et al. Oct 2012 B2
8301645 Crook Oct 2012 B1
8321568 Sivasubramanian et al. Nov 2012 B2
8380831 Barber Feb 2013 B2
8402137 Sivasubramanian et al. Mar 2013 B2
8433749 Wee et al. Apr 2013 B2
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
8521880 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
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 et al. 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
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
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
8782236 Marshall et al. Jul 2014 B1
8782279 Eggleston et al. Jul 2014 B2
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 et al. Dec 2014 B1
8930513 Richardson et al. Jan 2015 B1
8930544 Richardson et al. Jan 2015 B2
8938526 Richardson et al. Jan 2015 B1
8949459 Scholl Feb 2015 B1
8966318 Shah Feb 2015 B1
9003035 Richardson et al. Apr 2015 B1
9003040 MacCarthaigh et al. Apr 2015 B2
9009286 Sivasubramanian et al. Apr 2015 B2
9009334 Jenkins et al. Apr 2015 B1
9021127 Richardson et al. Apr 2015 B2
9021128 Sivasubramanian et al. Apr 2015 B2
9021129 Richardson et al. Apr 2015 B2
9026616 Sivasubramanian et al. May 2015 B2
9037975 Taylor et al. May 2015 B1
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
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
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
9407681 Richardson et al. Aug 2016 B1
9407699 Sivasubramanian et al. Aug 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
9590946 Richardson et al. Mar 2017 B2
9608957 Sivasubramanian et al. Mar 2017 B2
9621660 Sivasubramanian et al. Apr 2017 B2
9628554 Marshall et al. Apr 2017 B2
20010000811 May et al. May 2001 A1
20010025305 Yoshiasa et al. Sep 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
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
20020049857 Farber et al. Apr 2002 A1
20020052942 Swildens et al. May 2002 A1
20020062372 Hong et al. 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
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
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
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
20020143675 Orshan 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
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
20030041094 Lara et al. Feb 2003 A1
20030046343 Krishnamurthy et al. Mar 2003 A1
20030065739 Shnier 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
20030112792 Cranor et al. Jun 2003 A1
20030120741 Wu et al. Jun 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 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
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
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
20040010563 Forte et al. Jan 2004 A1
20040010588 Slater et al. 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
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
20040117455 Kaminsky 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
20040172466 Douglas 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
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
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
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
20050188073 Nakamichi et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050198334 Farber et al. Sep 2005 A1
20050198571 Kramer et al. Sep 2005 A1
20050216483 Armstrong et al. Sep 2005 A1
20050216569 Coppola et al. Sep 2005 A1
20050216674 Robbin et al. Sep 2005 A1
20050223095 Volz et al. Oct 2005 A1
20050228856 Swildens et al. Oct 2005 A1
20050229119 Torvinen Oct 2005 A1
20050232165 Brawn et al. Oct 2005 A1
20050234864 Shapiro Oct 2005 A1
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
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
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
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
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
20060047787 Agarwal 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
20060112066 Hamzy May 2006 A1
20060112176 Liu et al. May 2006 A1
20060120385 Atchison et al. Jun 2006 A1
20060129665 Toebes et al. Jun 2006 A1
20060136453 Kwan Jun 2006 A1
20060143293 Freedman 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
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
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
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
20070043859 Ruul Feb 2007 A1
20070050522 Grove et al. Mar 2007 A1
20070050703 Lebel Mar 2007 A1
20070055764 Dilley et al. Mar 2007 A1
20070061440 Sundaram et al. Mar 2007 A1
20070064610 Khandani Mar 2007 A1
20070076872 Juneau Apr 2007 A1
20070086429 Lawrence et al. Apr 2007 A1
20070094361 Hoynowski et al. Apr 2007 A1
20070101061 Baskaran et al. May 2007 A1
20070101377 Six et al. May 2007 A1
20070118667 McCarthy et al. May 2007 A1
20070118668 McCarthy et al. May 2007 A1
20070134641 Lieu Jun 2007 A1
20070156919 Potti et al. Jul 2007 A1
20070162331 Sullivan Jul 2007 A1
20070168517 Weller Jul 2007 A1
20070174426 Swildens et al. Jul 2007 A1
20070174442 Sherman et al. Jul 2007 A1
20070174490 Choi et al. Jul 2007 A1
20070183342 Wong et al. Aug 2007 A1
20070198982 Bolan et al. Aug 2007 A1
20070204107 Greenfield et al. Aug 2007 A1
20070208737 Li et al. Sep 2007 A1
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
20070243860 Aiello et al. Oct 2007 A1
20070244964 Challenger et al. Oct 2007 A1
20070250467 Mesnik et al. 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 Tai 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
20070280229 Kenney Dec 2007 A1
20070288588 Wein et al. Dec 2007 A1
20070291739 Sullivan et al. 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
20080056207 Eriksson et al. Mar 2008 A1
20080065724 Seed et al. Mar 2008 A1
20080065745 Leighton 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
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
20080228574 Stewart et al. Sep 2008 A1
20080228920 Souders et al. Sep 2008 A1
20080235400 Slocombe et al. Sep 2008 A1
20080256175 Lee et al. Oct 2008 A1
20080263135 Olliphant 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
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
20090103707 McGary et al. 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
20090132648 Swildens et al. May 2009 A1
20090144411 Winkler et al. Jun 2009 A1
20090144412 Ferguson et al. Jun 2009 A1
20090150926 Schlack 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
20090233623 Johnson Sep 2009 A1
20090241167 Moore Sep 2009 A1
20090248697 Richardson et al. Oct 2009 A1
20090248786 Richardson et al. Oct 2009 A1
20090248787 Sivasubramanian et al. Oct 2009 A1
20090248852 Fuhrmann et al. Oct 2009 A1
20090248858 Sivasubramanian et al. Oct 2009 A1
20090248893 Richardson et al. Oct 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090253435 Olofsson Oct 2009 A1
20090254661 Fullagar et al. Oct 2009 A1
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 et al. Dec 2009 A1
20090327914 Adar et al. Dec 2009 A1
20100005175 Swildens et al. Jan 2010 A1
20100011061 Hudson et al. Jan 2010 A1
20100011126 Hsu et al. Jan 2010 A1
20100023601 Lewin 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
20100057894 Glasser Mar 2010 A1
20100070603 Moss et al. 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
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 et al. May 2010 A1
20100125675 Richardson et al. May 2010 A1
20100131646 Drako May 2010 A1
20100138559 Sullivan et al. Jun 2010 A1
20100150155 Napierala Jun 2010 A1
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
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
20100312861 Kolhi et al. Dec 2010 A1
20100318508 Brawer et al. Dec 2010 A1
20100322255 Hao et al. Dec 2010 A1
20100332595 Fullagar et al. Dec 2010 A1
20110010244 Hatridge Jan 2011 A1
20110029598 Arnold et al. Feb 2011 A1
20110040893 Karaoguz et al. Feb 2011 A1
20110055714 Vemulapalli et al. Mar 2011 A1
20110055921 Narayanaswamy 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
20110113467 Agarwal 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
20110161461 Niven-Jenkins Jun 2011 A1
20110166935 Armentrout et al. Jul 2011 A1
20110182290 Perkins Jul 2011 A1
20110191445 Dazzi 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 Agrawal 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
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
20110302304 Baumback et al. Dec 2011 A1
20110320522 Endres et al. Dec 2011 A1
20110320559 Foti Dec 2011 A1
20120011190 Driesen et al. Jan 2012 A1
20120036238 Sundaram et al. Feb 2012 A1
20120066360 Ghosh Mar 2012 A1
20120072600 Richardson et al. Mar 2012 A1
20120078998 Son et al. Mar 2012 A1
20120079115 Richardson et al. Mar 2012 A1
20120089972 Scheidel et al. Apr 2012 A1
20120096065 Suit et al. Apr 2012 A1
20120110515 Abramoff 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
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
20120173677 Richardson et al. Jul 2012 A1
20120173760 Jog 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
20120224516 Stojanovski et al. Sep 2012 A1
20120233522 Barton et al. Sep 2012 A1
20120233668 Leafe et al. Sep 2012 A1
20120254961 Kim et al. Oct 2012 A1
20120257628 Bu et al. Oct 2012 A1
20120303785 Sivasubramanian et al. Nov 2012 A1
20120303804 Sundaram et al. Nov 2012 A1
20120311648 Swildens et al. Dec 2012 A1
20120324089 Joshi Dec 2012 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
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
20130067530 Spektor 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
20130086001 Bhogal et al. Apr 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
20130198341 Kim Aug 2013 A1
20130212300 Eggleston et al. Aug 2013 A1
20130227165 Liu Aug 2013 A1
20130246567 Green et al. Sep 2013 A1
20130254269 Sivasubramanian et al. Sep 2013 A1
20130263256 Dickinson et al. Oct 2013 A1
20130268616 Sakata et al. Oct 2013 A1
20130305046 Mankovski et al. Nov 2013 A1
20130311605 Richardson et al. Nov 2013 A1
20130311989 Ota et al. Nov 2013 A1
20130318153 Sivasubramanian et al. Nov 2013 A1
20130339429 Richardson et al. Dec 2013 A1
20130346567 Richardson et al. Dec 2013 A1
20140006577 Joe et al. Jan 2014 A1
20140007239 Sharpe et al. Jan 2014 A1
20140019605 Boberg Jan 2014 A1
20140036675 Wang et al. Feb 2014 A1
20140040478 Hsu et al. Feb 2014 A1
20140053022 Forgette et al. Feb 2014 A1
20140059120 Richardson et al. Feb 2014 A1
20140059198 Richardson et al. Feb 2014 A1
20140059379 Ren et al. Feb 2014 A1
20140075109 Richardson et al. Mar 2014 A1
20140089917 Attalla et al. Mar 2014 A1
20140108672 Ou et al. Apr 2014 A1
20140137111 Dees et al. May 2014 A1
20140143320 Sivasubramanian et al. May 2014 A1
20140164817 Bartholomy et al. Jun 2014 A1
20140165061 Greene et al. Jun 2014 A1
20140257891 Richardson et al. Sep 2014 A1
20140297870 Eggleston 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
20140365666 Richardson et al. Dec 2014 A1
20150006615 Wainner et al. Jan 2015 A1
20150067171 Yum Mar 2015 A1
20150081842 Richardson et al. Mar 2015 A1
20150089621 Khalid Mar 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
20150180988 Sivasubramanian et al. Jun 2015 A1
20150188994 Marshall et al. Jul 2015 A1
20150195244 Richardson et al. Jul 2015 A1
20150207733 Richardson et al. Jul 2015 A1
20150215270 Sivasubramanian et al. Jul 2015 A1
20150229710 Sivasubramanian et al. Aug 2015 A1
20150244580 Saavedra Aug 2015 A1
20150249579 Ellsworth et al. Sep 2015 A1
20150256647 Richardson et al. Sep 2015 A1
20150288647 Chhabra et al. Oct 2015 A1
20150319194 Richardson et al. Nov 2015 A1
20150319260 Watson Nov 2015 A1
20150334082 Richardson et al. Nov 2015 A1
20160006672 Saavedra Jan 2016 A1
20160021197 Pogrebinsky et al. Jan 2016 A1
20160026568 Marshall et al. Jan 2016 A1
20160028644 Richardson et al. Jan 2016 A1
20160041910 Richardson et al. Feb 2016 A1
20160065665 Richardson et al. Mar 2016 A1
20160072720 Richardson et al. Mar 2016 A1
20160134492 Ellsworth et al. May 2016 A1
20160142367 Richardson et al. May 2016 A1
20160182454 Phonsa et al. Jun 2016 A1
20160182542 Staniford Jun 2016 A1
20160205062 Mostert Jul 2016 A1
20160241637 Marr et al. Aug 2016 A1
20160241639 Brookins et al. Aug 2016 A1
20160241651 Sivasubramanian et al. Aug 2016 A1
20160308959 Richardson et al. Oct 2016 A1
20170085495 Richardson et al. Mar 2017 A1
20170126557 Richardson et al. May 2017 A1
Foreign Referenced Citations (39)
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-522358 Jul 2003 JP
2003188901 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 02069608 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
Non-Patent Literature Citations (146)
Entry
“Non-Final Office Action dated Jan. 3, 2012,” U.S. Appl. No. 12/652,541; dated Jan. 3, 2012; 35 pages.
“Final Office Action dated Sep. 5, 2012,” U.S. Appl. No. 12/652,541; dated Sep. 5, 2012; 40 pages.
“Notice of Allowance dated Jan. 4, 2013,” U.S. Appl. No. 12/652,541; dated Jan. 4, 2013; 11 pages.
“Non-Final Office Action dated Apr. 30, 2014,” U.S. Appl. No. 13/842,970; 20 pages.
“Final Office Action dated Aug. 19, 2014,” U.S. Appl. No. 13/842,970; 13 pages.
“Notice of Allowance dated Dec. 5, 2014,” U.S. Appl. No. 13/842,970; 6 pages.
Canonical Name (CNAME) DNS Records, domainavenue.com, Feb. 1, 2001, XP055153783, Retrieved from the Internet: URL:http://www.domainavenue.com/cname.htm [retrieved on Nov. 18, 2014].
“Content delivery network”, Wikipedia, the free encyclopedia, Retrieved from the Internet: URL:http://en.wikipedia.org/w/index.php?title=Contentdelivery network&oldid=601009970, XP055153445, Mar. 24, 2008.
“Global Server Load Balancing with ServerIron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages.
“Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages.
“Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/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/xeril, 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.
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.
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.
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.
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, mailed Oct. 12, 2011 in 11 pages.
Supplementary European Search Report in Application No. 09727694.3 mailed Jan. 30, 2012 in 6 pages.
Singapore Examination Report in Application No. 201006837-7 mailed Mar. 16, 2012.
First Office Action in Chinese Application No. 200980111426.1 mailed Feb. 16, 2013.
Second Office Action in Chinese Application No. 200980111426.1 mailed Dec. 25, 2013.
Third Office Action in Chinese Application No. 200980111426.1 mailed Jul. 7, 2014.
Fourth Office Action in Chinese Application No. 200980111426.1 mailed Jan. 15, 2015.
Fifth Office Action in Chinese Application No. 200980111426.1 mailed 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.
Singapore Written Opinion in Application No. 201006874-0, mailed Oct. 12, 2011 in 10 pages.
First Office Action in Japanese Application No. 2011-502140 mailed 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 for European Application No. 09839809.2 dated May 11, 2015.
Supplementary European Search Report in Application No. 09728756.9 mailed 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.
Search Report and Written Opinion issued in Singapore Application No. 201006873-2 mailed on Oct. 12, 2011.
First Office Action is Chinese Application No. 200980125551.8 mailed Jul. 4, 2012.
First Office Action in Japanese Application No. 2011-516466 mailed Mar. 6, 2013.
Second Office Action in Japanese Application No. 2011-516466 mailed Mar. 17, 2014.
Decision of Refusal in Japanese Application No. 2011-516466 mailed Jan. 16, 2015.
Office Action in Canadian Application No. 2726915 dated May 13, 2013.
First Office Action in Korean Application No. 10-2011-7002461 mailed 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.
Search Report and Written Opinion in Singapore Application No. 201103333-9 mailed Nov. 19, 2012.
Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013.
International Search Report and Written Opinion in PCT/US2011/053302 mailed Nov. 28, 2011 in 11 pages.
International Preliminary Report on Patentability in PCT/US2011/053302 mailed Apr. 2, 2013.
First Office Action in Japanese Application No. 2013-529454 mailed Feb. 3, 2014 in 6 pages.
Office Action in Japanese Application No. 2013-529454 mailed Mar. 9, 2015 in 8 pages.
First Office Action issued in Australian Application No. 2011307319 mailed Mar. 6, 2014 in 5 pages.
Search Report and Written Opinion in Singapore Application No. 201301573-0 mailed Jul. 1, 2014.
First Office Action in Chinese Application No. 201180046104.0 mailed Nov. 3, 2014.
Examination Report in Singapore Application No. 201301573-0 mailed Dec. 22, 2014.
International Preliminary Report on Patentability in PCT/US2011/061486 mailed May 22, 2013.
International Search Report and Written Opinion in PCT/US2011/061486 mailed Mar. 30, 2012 in 11 pages.
First Office Action in Chinese Application No. 201180053405.6 dated May 3, 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.
International Search Report and Written Opinion in PCT/US07/07601 mailed Jul. 18, 2008 in 11 pages.
International Preliminary Report on Patentability in PCT/US2007/007601 mailed Sep. 30, 2008 in 8 pages.
Supplementary European Search Report in Application No. 07754164.7 mailed 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 mailed Dec. 11, 2012 in 26 pages.
Office Action in Japanese Application No. 2013-123086 mailed Apr. 15, 2014 in 3 pages.
Office Action in Japanese Application No. 2013-123086 mailed Dec. 2, 2014 in 2 pages.
Office Action in Chinese Application No. 201310717573.1 dated Jul. 29, 2016.
Office Action in Japanese Application No. 2014-225580 dated Oct. 3, 2016.
Partial Supplementary Search Report in European Application No. 09826977.2 dated Oct. 4, 2016.
Decision of Rejection in Chinese Application No. 201180046104.0 dated Oct. 17, 2016.
Office Action in Canadian Application No. 2816612 dated Oct. 7, 2016.
Office Action in Japanese Application No. 2011-516466 mailed May 30, 2016.
Office Action in Russian Application No. 2015114568 dated May 16, 2016.
Office Action in Chinese Application No. 201310537815.9 dated Jul. 5, 2016.
Office Action in European Application No. 09839809.2 dated Dec. 8, 2016.
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.
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.
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.
Office Action in European Application No. 11767118.0 dated Feb. 3, 2017.
International Search Report and Written Opinion in PCT/US/2016/ 066848 mailed May 1, 2017.
Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables—Basics.html, 4 pages.
Office Action in Japanese Application No. 2014-225580 dated Oct. 26, 2015.
Second Office Action in Chinese Application No. 201180046104.0 mailed Sep. 29, 2015.
Office Action in Canadian Application No. 2816612 dated Nov. 3, 2015.
Office Action in Japanese Application No. 2011-502139 dated Aug. 17, 2015.
Third Office Action in Chinese Application No. 201180046104.0 mailed Apr. 14, 2016.
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 Japanese Application No. 2015-075644 mailed Apr. 5, 2016 in 15 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.
Second Office Action in Chinese Application No. 201180053405.6 dated Dec. 4, 2015.
Office Action in European Application No. 07754164.7 dated Dec. 14, 2015.