Network addresses with encoded DNS-level information

Information

  • Patent Grant
  • 11330008
  • Patent Number
    11,330,008
  • Date Filed
    Monday, February 24, 2020
    4 years ago
  • Date Issued
    Tuesday, May 10, 2022
    2 years ago
Abstract
Systems and methods are described to enable a DNS service to encode information into a network address to be advertised by the DNS service. Information encoded by a DNS service may include, for example, an identifier of a content set to which the network address corresponds (e.g., a domain name) and validity information, such as a digital signature, that verifies the validity of the network address. On receiving a request to communicate with the network address, a destination device associated with the network address may decode the encoded information within the network address to assist in processing the request. In some instances, the encoded information may be used to identify malicious network transmissions, such as transmissions forming part of a network attack, potentially without reliance on other data, such as separate mappings or contents of the data transmission.
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.


To provide access to content, server computing devices are generally associated with network addresses, enabling requests for communication with the server computing devices to be routed across a network. These network addresses are generally formed by a series of bits formatted according to a defined protocol, such as the Internet Protocol (IP) version four (IPv4) or version 6 (IPv6). Because network addresses may be difficult for humans to recognize and remember, CDNs can utilize resolution systems that function to resolve human-readable identifiers into corresponding network addresses. One example of such a resolution system is the Domain Name System (DNS), which functions to resolve domain names into corresponding network addresses.


Generally, DNS services and CDNs operate independently and according to differing protocols. For example, DNS requests from a client computing device are generally routed via the DNS protocol through multiple DNS components to a DNS service, where a network address corresponding to a domain name is returned via the DNS protocol. When a network address is obtained, the client computing device may then communicate with a server computing device associated with the network address (e.g., via the hypertext transport protocol, or “HTTP”). The respective processes of DNS resolution and communication with a network address are therefore generally logically distinct, such that a server computing device obtaining a request for content at a network address is unaware of a prior DNS resolution (if any) that facilitated the request.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram depicting an illustrative logical network including multiple accessing computing devices 102 and content providers 104, as well as a content delivery system 110 including a DNS service and multiple POPs;



FIG. 2 is a block diagram depicting an illustrative configuration of one embodiment of a server that may implement the DNS service of FIG. 1;



FIG. 3A is a block diagram depicting interactions between an accessing computing device and the DNS service of FIG. 1 to resolve a distribution identifier into a network address including encoded DNS-level information;



FIG. 3B is a block diagram depicting interactions between an accessing computing device and a POP of FIG. 1 to provide content corresponding to a distribution identifier via a network address including encoded DNS-level information; and



FIG. 4 is an illustrative visualization of a format for encoding DNS-level information into a network address.





DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to the utilization of specifically formatted network addresses in order to facilitate the retrieval and transmission of content on a content delivery system. More particularly, aspects of the present disclosure enable a domain name system (DNS) service to generate and use network addresses that include encoded information available to the DNS service at least at a time that a client computing device requests to resolve an identifier, such as a domain name, into a corresponding network address. Such information may be generally referred to herein as “DNS-level information” or “DNS-level data,” and may include, for example, a domain name that a client computing device requested to resolve, security information (such as transport security layer [“TLS”] or secure sockets layer [“SSL”] certificates associated with a domain name), validity information (such as time-to-live, or “TTL,” information), or other information available at a DNS service. In particular, a DNS service may encode all or a portion of such DNS-level information within a network address advertised by the DNS service (e.g., included within DNS records provided by the DNS service), and thus make such DNS-level information available to routers or other computing devices that receive requests to communicate with the network address. In this manner, these routers or other computing devices may gain access to the DNS-level information, which would otherwise not be communicated to the routers or other computing devices in a traditional request addressed to a network address. Use of such information may enable more efficient operation of such routers or other computing devices. For example, a router or computing device may directly obtain a domain name to which a request relates from a network address of the request, without relying on external information or mappings. As another example, a router or computing device may determine whether a request to communicate with a network address should be considered valid, based on validity information encoded into the network address. Should the request be invalid (e.g., due to an expired TTL), the request can be handled as erroneous or potentially malicious, thus enabling the router or computing device to determine validity as a function of a network address, potentially without referencing external information regarding the request. Thus, aspects of the present disclosure significantly increase the amount of information available to a computing device or router based on a network address, and enable such routers or computing devices to more efficiently handle network communications by utilizing this newly-available information.


Aspects of the present disclosure may be utilized, for example, by a content delivery system hosting content of a multitude of entities. Such a content delivery system can function to provide client computing devices with access to a variety of different sets of content hosted by the content delivery system on behalf of third-party content providers 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. Traditionally, such network addresses are very limited in the amount of information they convey, because the network addresses are generally formatted to identify one or more destination computing devices on a network, and in some instances to assist in routing requests to those destination computing devices. However, due to the limited number of possible network addresses under some formats, such as IPv4, it was common to utilize the same network address to provide multiple sets of content (e.g., web sites). Thus, the same IPv4 address may identify an endpoint for many different distributions, which may or may not be associated with one another. Such scenarios presented numerous difficulties. For example, in a scenario where a specific web site was under a denial of service (“DOS”) attack, data packets used to implement the attack could be addressed to a network address associated with many different web sites, making it difficult or impossible to determine the specific web site under attack based solely on the network address to which malicious data packets were addressed. Prior patent filings, such as U.S. Pat. No. 10,097,566, entitled “IDENTIFYING TARGETS OF NETWORK ATTACKS,” and issued Oct. 9, 2018, the entirety of which is hereby incorporated by reference, sought to address such shortcomings by, for example, providing web sites with unique or substantially unique collections of network addresses.


The present application provides an additional or alternative solution to the above-noted problems, among others. Specifically, embodiments of the present disclosure can utilize one or more encoding rules to encode DNS-level data, such as a domain name to which a DNS request is directed, into a network address. Thus, a router or other computing device receiving a data transmissions addressed to the network address may decode the network address itself in order to obtain the encoded DNS-level data. Illustratively, encoding of DNS-level data into a network address can enable routers or other computing devices to determine, from a network address to which a data packet is addressed, what domain name was included within a DNS request that preceded generation of the data packet. Advantageously, DNS-level data may therefore be determined subsequent to DNS resolution, without relying on independent or additional communication with a DNS service, and without relying on the content of data packets themselves (which, particularly in the case of network attacks, may be malformed). For example, a computing device may determine that malicious data packets transmitted to a given network address are the result of a DNS resolution of a particular domain name, and thus may further determine that the distribution associated with the domain name is the target of a network attack. The computing device may then take mitigating action to reduce or eliminate negative effects of the network attack.


Because the present disclosure enables encoding of DNS-level information into network addresses, embodiments of the present disclosure may be particularly suited for implementation with respect to network address formats having a large address space. One example of such a network address format is the IPv6 format, which utilizes 128 bit network addresses. The large number of potential network addresses within the IPv6 format (particularly in comparison to the IPv4 format) can enable DNS-level information to be encoded without negatively impacting the traditional identification and routing functions of network addresses.


While examples are provided above enabling domain names to be encoded into network addresses, other DNS-level information may additionally or alternatively be encoded into a network address under the present disclosure. For example, a DNS service may encode within a network address “hint information,” that enables a router or other computing device (e.g., a server within a POP) to more efficiently service requests to communicate with the network address. Illustratively, the hint information may include an identifier of a security certificate (e.g., and SSL or TLS certificate) associated with a domain name to which the request is directed. Accordingly, when a computing device receives a request to communicate with a network address including encoded hint information, the computing device may decode the hint information, determine the security certificate identified by the hint information, and establish a secure communication channel with a client computing device. In some instances, encoding of hint information within a network address may reduce or eliminate the need for a router or other computing device (e.g., of a CDN) to maintain a mapping of network addresses to associated security certificates, or to inspect data packets for information identifying a relevant security certificate (e.g., a “host header” within an HTTP packet). Because decoding of hint information within a network address may require less processing power or memory usage than would packet inspection or using lookups to external mappings, use of hint information can reduce the computing resources used by a router or other computing device.


Additional examples of hint information may include a network address or other information of a device from which a DNS resolution request was received (e.g., an accessing computing device, a DNS resolver used by that accessing computing device, etc.). In some instances, components of a CDN may use such information to determine how to handle subsequent requests to access content, stemming from an initial DNS resolution request. For example, where request to access content results in a “cache miss” at a POP of a CDN (e.g., where an accessing computing device requests content not stored at the POP), a POP can be configured to retrieve the requested information from another server (sometimes referred to as an “origin server”). Where the content is available at multiple origin servers, the POP may in some instances use hint information to select an appropriate origin server. For example, where a content request is addressed to a network address with hint information identifying a particular geographic or network location (e.g., as the region from which a corresponding DNS request originated), the POP may select an origin server nearby to that geographic or network location from which to obtain the relevant content.


In some embodiments, DNS-level information may further include validity information encoded into a network address by a DNS service. When such validity information is encoded into a network address, and a client computing device attempts to communicate with a destination computing device (e.g., a server within a POP) associated with the network address, that destination computing device may verify the validity information prior to initiating communication with the client computing device. In this way, a DNS service and a destination computing device may work cooperatively to ensure that all client computing devices accessing the destination computing device are legitimate users of the DNS service. Such cooperation may assist, for example, in mitigating network attacks. For example, some types of DoS attack function by instructing a first device to resolve a domain name of an attack target into an IP address using a DNS service, and then instructing a large number of additional devices to transmit malicious data packets to the IP address. These additional devices do not interact directly with the DNS service, but instead repeat IP address information maintained by the first device. Thus, embedding validity information within an IP address that is tied specifically to the first device may enable an attack target (or other computing device) to distinguish between the first device and the additional device, substantially reducing the volume of attack traffic.


Further, network attacks are in some instances “non-re-resolving,” such that resolution of a domain name of an attack target into a network address occurs only once (or very infrequently). Thus, changes to DNS records for an attack target, such as changing the network address of the attack target, can function to redirect legitimate traffic to a new network address while malicious traffic continues to flow to the defunct network address. To reduce the effect of such malicious traffic, some systems may modify configurations of routers or other computing devices to halt processing of traffic directed to a defunct network address. Such halting is sometimes referred to as “blackholing” the defunct network address, and generally involves discarding or “dropping” packets addressed to the defunct network address, either at a receiving computing device or at an intermediary network device. Traditional creation of a blackhole network address generally involves propagation of new routing information (e.g., routing tables, such as a forwarding information base or “FIB”) across a network, a process that introduces additional traffic into a network and therefore can utilize significant computing resources. By inclusion of validity information into a network address, blackholing can be automated without requiring distribution of new routing information across a network. Rather, each device on a network may be configured such that any packet with invalid validity information is automatically dropped by a router or other computing device. In some instances, the protocol by which validity information is generated or verified may be modified over time, such as on an hourly basis. Thus, a network attacks that continue after modification of validity information, without re-resolving a domain name into a corresponding valid network address, would result in data packets being transmitted to an invalid network address, and such data packets could be automatically dropped within a network. Thus, the inclusion of validity information within a network address can enable computing devices to readily and efficiently distinguish legitimate from illegitimate traffic.


While illustrative examples of DNS-level information are provided above, a network address encoded according to embodiments of the present disclosure may include additional or alternative DNS-level data. For example, a DNS service may in some instances encode a unique “request identifier” into each network address provided in response to a DNS request, in order to uniquely identify content requests that stem from the DNS request. Thereafter, data can be collected from both the DNS service and corresponding POPs of a CDN, in order to determine correlations between DNS requests and subsequent content requests. For example, the CDN may determine that a given DNS request resulted in n content requests to the network address referenced in the DNS request. Thus, the examples of DNS-level data provided herein are illustrative in nature.


To enable encoding and decoding of information within a network address, a DNS service and a destination computing device (e.g., a device associated with a network address identified within a DNS record, which maps a domain name or other identifier to a network address) can each maintain one or more rules indicating how information is encoded within a network address. The rules may specify, for example, which bits of a network address represent different types of DNS-level information, and how that information is represented. Illustratively, a rule may specify that the last 16 bits of a network address represent an identifier of a distribution associated with the network address (e.g., a domain name or other unique identifier of the distribution). A rule may further specify that the penultimate 16 bits of a network address represent validity information for the network address, hint information, etc. For each type of information encoded within a network address, the rule may specify how that information is encoded. For example, a domain name may be encoded by processing the domain name according to a hash algorithm, to result in a hash value of the corresponding number of bits. Thereafter, the hash value may be included in a network address as an encoded domain name. In some instances, information may be encoded according to a cryptographic hash algorithm, such as an algorithm of the Secure Hash Algorithm family (e.g., SHA-2 or SHA-3) or an algorithm of the Message-Digest Algorithm family (e.g., MD6). For example, validity information may be generated by passing some set of inputs (e.g., values of the remaining fields encoded within a network address, a current time, an identifier of a client computing device, etc.) through a cryptographic hash to produce a digest, and then encrypting the digest with a private key to produce a digital signature that can be included in the validity information. The process of utilizing cryptographic hashes and encoding via private keys to result in digital signatures is sometimes referred to as “public key cryptography” or “asymmetric cryptography.” This process is known in the art and therefore will not be described in detail herein. However, with application to the embodiments of the present disclosure, the use of public key cryptography to generate digital signatures for inclusion in a network address can provide substantial certainty that any valid network address (e.g., with a verifiable digital signature) was obtained by interaction with a DNS service that had access to a corresponding private key.


In some instances, all or a portion of a network address may be encrypted, to avoid conveyance or modification of information to unauthorized parties. For example, DNS-level data (e.g., including a digital signature value) may be encrypted according to public key encryption. Illustratively, a DNS service may utilize a public key associated with a content server to encrypt DNS-level data of a network address (or any given portion of a network address), and the content server, on receiving data addressed to the network address, may utilize a corresponding private key to decrypt the portion and utilize the DNS-level data (or other data represented by the portion) in provide the requested information. As a further illustration, a router of the CDN may utilize a corresponding private key to decrypt a network address to which data is addressed, and utilize a decrypted value to route the data on the CDN. Encryption of DNS-level data (or other values represented in network addresses) may be beneficial in preventing authorized entities from obtaining knowledge of actual network addresses utilized within the CDN (e.g., where the decrypted network address represents a network address of a content server), or obtaining knowledge of DNS-level data encoded within a network address. In some embodiments, digital signatures and encryption of network address information may be used in conjunction to provide confidentiality, integrity, and authenticity of the network address. To ensure routability of data addressed to an encrypted network addresses, a portion of such network addresses (e.g., a routing prefix) may be left encrypted.


In some instances, network addresses may be formatted to enable an alteration of the rules for encoding information within those network addresses. For example, one or more bits of a network address may be assigned to represent a version identifier, indicative of a format of the network address. On receiving a request from a client computing device to communicate with a network address, a destination device may inspect the version identifier to determine corresponding rules, indicative of how DNS-level information is encoded within the network address. Thus, a DNS service and corresponding CDN may alter encoding rules for network addresses periodically, or in some instances utilize multiple different encoding formats simultaneously. In one embodiment, the DNS service and CDN may identify “high risk” distributions, associated with a higher likelihood of being targeted in a network attack, and provide a distinct set of encoding rules for network address of these distributions. These rules, for example, may include stronger validity information, or may by altered more rapidly than network addresses of other, non-high risk distributions. In some instances, the rules may specify a similar or identical encoding format of information, but may vary other parameters used in such encoding. For example, the rules may specify a particular public/private key pair to utilize in encoding network addresses. Version information encoded within a network address can enable the DNS service and CDN to determine the rules under which a given network address has been encoded.


While the above description refers generally to a DNS service and corresponding destination device (e.g., as part of a CDN) that each maintain knowledge of rules for encoding network addresses, some embodiments of the present disclosure may utilize a distinct service to maintain such rules. Illustratively, both a DNS service and destination devices of a CDN may be provided with access to an application programming interface (API) of a network address encoding service, such that the DNS service and destination devices may transmit requests to the network address encoding service to generate network addresses for a given distribution or to decode DNS-level information from a network address. Use of such a network address encoding service may, for example, simplify requirements to synchronize rules between a DNS service and destination devices.


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. Thus, the examples provided herein are intended to be illustrative, and not exhaustive, in nature.


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 handle network communications. Specifically, embodiments disclosed herein enable more efficient routing or communication handling by providing hint information directly within a network address, reducing or eliminating the need for routing or destination devices to maintain such information separately. Moreover, embodiments disclosed herein enable identification of a specific set of content (a distribution) to which transmissions are directed, based on the network address of the transmission and regardless of the contents of the transmission. Still further, embodiments disclosed herein enable inclusion of validity information, such as a digital signature, within a network address, to assist in distinguishing legitimate communications from invalid and potentially malicious communications. 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 more efficiently route and handle communications, to more efficiently identify and discard malicious communications, and 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 reliance of traditional network routing technologies on external information when routing requests to communicate with a network address, and the disassociation between a DNS service and a destination network device caused by commonly used network communication protocols. These technical problems are addressed by the various technical solutions described herein, including the encoding at a DNS service of DNS-level data within a network address, the decoding of such information at a destination device, and the use of such information to handle requests to communicate with the network address. 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. As shown in FIG. 1, the content delivery system 110 includes a DNS service 112 enabling accessing computing devices 102 to resolve identifiers of distributions on the content delivery system 110 (e.g., domain names) into network addresses. The content delivery system 110 further includes one or more points-of-presence (POPs) providing access to content of the distributions on the content delivery system 110. 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 service 112 and POPs 124 within the content delivery system 110 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.


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 wholly or partially hosted in POPs 120. Each POP 120 may include a variety of computing devices configured to serve content to accessing computing devices 102. Specifically, each POP 120 may include one or more content servers 122 associated with network addresses to which accessing computing devices 102 may address requests to obtain content from the content delivery system 110. Each POP 120 may further include a data cache 126 on which such content can be stored. Because the amount of storage space of each data cache 126 may be limited, content servers 122 of the POPs 112 can be configured to detect “cache misses”—instances in which data requested by an accessing computing device 102 is not available in the data cache 126—and to retrieve such data from another device (e.g., the content providers 104 or other data stores not shown in FIG. 1). Thus, the content servers 112 may be logically viewed as “edge” devices, providing a first-level cache of content on the content delivery system 110. The general operation of content servers 112 within a POP 120 to obtain and provide content is known within the art, and therefore will not be described in detail herein. In accordance with embodiments of the present disclosure, each POP 120 may further include a decoding rules data store 124 configured to store one or more rules indicating how DNS-level data is encoded into network addresses. As will be described below, such rules may indicate the specific bits of a network address that represent different types of DNS-level information, and the algorithms or encoding by which such information is encoded.


Each POP 120 may be associated with a number of network addresses via which accessing computing devices 102 may address the POP 120 via the network 106. In one embodiment, each network address is an 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 “2001:db8::/48” block of IPv6 addresses (represented in classless inter-domain routing or “CIDR” notation, as is common in the art). Further, each POP 120 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, such as a web site, available from the POP 114 or the content delivery system 110 generally. As described below, network addresses encoded with DNS-level information may include a first section, sometimes referred to as a routing prefix, corresponding to the block of network addresses associated with a POP 120. Thus, communications transmitted to these network addresses via the network 106 would be expected to arrive at the POP 120 associated with the routing prefix. One or more remaining bits of such network addresses (e.g., other than the routing prefix) may be used to designate a distribution of the content delivery system 110 from which content is requested, as well as other information utilizable by the content servers 112 to handle requests to communicate with the network addresses.


The illustrative content delivery system 110 of FIG. 1 further includes a DNS service 112 configured to enable accessing computing devices 102 to resolve human-readable network identifiers of distributions (such as domain names or URLs) into network addresses (such as IP addresses) encoded with DNS-level information, to which requests to access content of a distribution may be transmitted. Specifically, the DNS service 112 includes one or more DNS servers 114, each including 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 one or more network addresses, associated with one or more computing devices within a POP 120, at which content of that distribution may be obtained. In accordance with embodiments of the present disclosure, such network addresses may include encoded DNS-level information (e.g., information available at the DNS service 112 at least at the time of the request). Thereafter, the accessing computing device 114 may communicate with the POP 120, via the network addresses, to access the distribution. In one embodiment, network addresses corresponding to an identifier of content on the content distribution system 110 (a “distribution identifier,” which may correspond, for example, to a domain name or uniform resource identifier [“URI”]) may be included within DNS records pre-generated by the DNS service 112, and stored within a DNS record data store 119. Illustratively, one or more DNS servers 114 may generate DNS records based on one or more rules included within the encoding rules data store 116, which rules specify the format of network addresses encoded with DNS-level information, as well as information regarding a distribution to which the network address should correspond. Such information may be stored, for example, within the distribution data store 118, and may comprise prefix information for one or more POPs 120 at which the distribution can be accessed, hint information for the distribution (e.g., an identifier of a security certificate applicable to the distribution, an identifier of a resolver from which a corresponding DNS request was received or a location of that resolver, etc.), identifiers of rules applicable to the distribution, etc. For example, the DNS service 112 may identify a prefix associated with a POP 120 from which the distribution can be accessed in order to determine the first portion of a network address for the distribution. The DNS service 112 may further utilize the one or more rules to determine a set of bits corresponding to an identifier of the distribution, a set of bits corresponding to hint information for the distribution, a set of bits corresponding to validity information for the network address, and a set of bits corresponding to a version identifier for the one or more rules. The DNS service 112 may then concatenate the prefix, set of bits for the identifier, set of bits for the hint information, set of bits for the validity information, and the set of bits for the version identifier to result in a network address in an applicable format specified under the one or more rules (e.g., IPv6). The DNS server 112 may then store a DNS record associating the identifier of the distribution with the generated network address with the DNS record data store 119. When a request is obtained from an accessing computing device 102 to resolve the identifier of the distribution, the DNS server 112 may retrieve a DNS record corresponding to the identifier (e.g., identifying one or more network addresses mapped to the identifier), and return the DNS record to the accessing computing device 102. In some instances, a DNS server 112 may generate DNS records for a distribution periodically (e.g., every hour). In other instances, a DNS server 112 may generate DNS records for a distribution “on-the-fly,” in response to requests from accessing computing devices 102 to resolve a distribution identifier. Such on-the-fly record generation may be beneficial, for example, in order to allow for use of request-specific information during generation of a network address. For example, in some instances, a DNS server 114 may use a region identifier associated with a resolution request (e.g., an identifier of a geographical or logical region from which the resolution request stemmed) as an input to an algorithm for generating validity information for a network address, such that POPs 120 respond to requests to communicate with the network address only if such requests stem from the same region.


The encoding rules data store 116, distribution data store 118, and DNS record data store 119 of the DNS service 112, as well as the decoding rules data store 124 and data cache 126 of the POPs 120, may correspond to any persistent or substantially persistent data storage, such as a hard drive (HDD), a solid state drive (SDD), network attached storage (NAS), a tape drive, or any combination thereof.


As noted above, while the encoding and decoding of DNS-level data into or from network addresses is generally described with reference to the DNS server 112 and POPs 120, either or both the DNS server 112 and POPs 120 may in some embodiments utilize an external address encoding service (not shown in FIG. 1) to encode or decode DNS-level data into or from network addresses. For example, the address encoding may include one or more servers configured to provide an API or other interface through which requests may be received to encode DNS-level data into a network address of a distribution, or to decode DNS-level data from a network address. Such servers may be in communication with a rules data store, and utilize rules from such a data store to encode or decode network addresses, in accordance with embodiments of the present disclosure.


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 DNS server 112, 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, encoding rules data store 116, DNS record data store 119, distribution data store 118, content servers 122, decoding rules data store 124, and data cache 126 may be embodied in a plurality of components, each executing an instance of the respective DNS servers 112, encoding rules data store 116, DNS record data store 119, distribution data store 118, content servers 122, decoding rules data store 124, and data cache 126. A server or other computing component implementing any one of DNS servers 112, encoding rules data store 116, DNS record data store 119, distribution data store 118, content servers 122, decoding rules data store 124, and data cache 126 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, encoding rules data store 116, DNS record data store 119, distribution data store 118, content servers 122, decoding rules data store 124, and data cache 126. The memory may generally include random access memory (RAM), read only memory (ROM), other persistent and auxiliary memory, and/or any non-transitory computer-readable media.



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


The memory 210 may include computer program instructions that the processing unit 204 executes in order to implement one or more embodiments. The memory 210 generally includes random access memory (RAM), read only memory (ROM) and/or other persistent or non-transitory memory. The memory 210 may store an operating system 214 that provides computer program instructions for use by the processing unit 204 in the general administration and operation of the server 200. The memory 210 may further include computer program instructions and other information for implementing aspects of the present disclosure. For example, in one embodiment, the memory 210 includes user interface software 212 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 210 may include or communicate with one or more auxiliary data stores, such as data store 226, which may correspond to any persistent or substantially persistent data storage, such as a hard drive (HDD), a solid state drive (SDD), network attached storage (NAS), a tape drive, or any combination thereof. Illustratively, the data store 226 may correspond to the encoding rules data store 116, the DNS record data store 119, the distribution data store 118, or any combination thereof.


In addition to the user interface module 212, the memory 210 may include address encoding software 216 that may be executed by the processing unit 204. In one embodiment, the address encoding software 216 implements various aspects of the present disclosure, e.g., the generation DNS records including network address encoded with DNS-level information.


With reference to FIGS. 3A and 3B, a set of illustrative interactions will be described for the generation and use of network addresses encoded with DNS-level information on a content delivery system 110. Specifically, FIG. 3A depicts illustrative interactions for the generation of DNS records mapping a distribution identifier to a network address encoded with DNS-level information, and for transmission of such a DNS record to an accessing computing device 102A. FIG. 3B depicts illustrative interactions for the handling of a communication request from the accessing computing device 102A to the network address encoded with DNS-level information. For the ease of illustration, the interactions of FIGS. 3A and 3B will be described with reference to an individual accessing computing device 102A requesting to access an individual distribution on the content delivery system 110, and with reference to an individual network address of that distribution. However, similar interactions may occur in some embodiments with respect to multiple accessing computing devices 102A (accessing one or more distributions), multiple distributions, multiple network addresses for a given distribution, or any combination thereof.


The interactions of FIG. 3A begin at (1), where the DNS service 112 loads encoding rules for encoding DNS-level information of a distribution into a network address. Illustratively, such rules may be loaded from the encoding rules data store 116. In some instances, the loaded rules may be generally static or constant across time or distributions. In other instances, the loaded rules may differ based on the specific distribution (e.g., as a high risk or non-high risk distribution), based on the time of day (e.g., to vary network address formats to prevent knowledge by unauthorized devices), or based on other criteria. Thereafter, at (2), the DNS service 112 encodes DNS-level data into a network address according to the obtained rules. Illustratively, the DNS service 112 may determine one or more fields for DNS-level information specified by the rules, generate data corresponding to each field according to an algorithm specified in the rule, and concatenate that data according to an ordering specified within the rule to result in a network address. Thereafter, at (3), the DNS service 112 can generate a DNS record mapping an identifier of the distribution, such as a domain name, to the network address encoded with DNS-level data, and store the DNS record within the DNS record data store 119.


Further detail regarding the generation of network addresses with encoded DNS-level data will be described with reference to FIG. 4, which is an illustrative visualization or graphical depiction of a potential format for network addresses with encoded DNS-level data. Specifically, FIG. 4 depicts an illustrative format for a 128 bit network address, which may conform, for example, to the IPv6 format. For ease of depiction, the 128 bit network address of FIG. 4 is divided into 8 logical bit groups, each corresponding to 16 of the 128 bits of the network address. Each field of DNS-level data within an encoded network address may be represented by the values of bits within a given bit group. For example, as shown in FIG. 4, the first 48 bits of the network address may be used to represent a routing prefix. Each routing prefix may be associated, for example, with one or more POPs 120, such that network packets addressed to any network address with a given prefix will be routed via the network 106 to the corresponding POP 120 to which the prefix is assigned. Illustratively, the length and content of the routing prefix may be collectively agreed on by participants in the network 106, and thus the DNS service 112 may be configured to maintain such prefixes without encoding DNS-level data into the prefixes. As shown in FIG. 4, all or a portion of the remaining bits of a network address (e.g., other than the routing prefix) may be used to represent encoded DNS-level information. For example, bit group 8 (the final 16 bits of the network address) may be used to uniquely identify a distribution associated with the network address. Illustratively, where each distribution on the content delivery system 110 is associated with a unique identifier representable in 16 bits or less, a network address encoded according to the format of FIG. 4 may directly represent that unique identifier within bit group 8. Where each distribution on the content delivery system 110 is associated with a unique identifier that may or may not be representable in 16 bits or less (e.g., a domain name of arbitrary length), a network address encoded according to the format of FIG. 4 may represent that unique identifier as a hash value, generated by passing the unique identifier through a hashing function. The specific number of bits utilized to represent a distribution identifier may vary, for example, on the number of different distribution identifiers supported under a given format, and the probability of collisions between different identifiers under a given encoding scheme. On receiving a request to communicate with the network address, a receiving device (e.g., a content server 122) may identify the distribution to which the request is directed based on the final bit group of the network address. Additional DNS-level information that may be included within a network address according to the illustrative format of FIG. 4 includes a rule identifier represented by bit group 4, validity information represented by bit group 5, and hint information represented by bit group 6. Illustratively, the bits of group 4, representing a rule identifier, may identify a rule that describes the network address encoding format shown in FIG. 4 (e.g., identifier “0001”), and may be used to identify network addresses encoded according to the network address encoding format shown in FIG. 4 from other potential formats. Thus, on receiving a request to communicate with the network address, a receiving device (e.g., a content server 122) may identify the format of the network address according to the bits of group 4 (e.g., enabling the receiving device to obtain rules specifying how other DNS-level data is encoded into the network address). The bits of group 5, representing validity information, may represent a digital signature generated based on a private key of the DNS service 112 along with a set of inputs, which may include, for example, the values of other bit groups of the network address. Thus, on receiving a request to communicate with the network address, a receiving device (e.g., a content server 122) may verify the validity of the network address by confirming the digital signature (e.g., decrypting the digital signature using a corresponding cryptographic public key and comparing a resulting value to an independent hash of the same set of inputs). The bits of groups 6 and 7, representing hint information, may represent information informing a receiving device of how to handle requests to communicate with the network address, such as an identifier of a security certificate to utilize in creating a secure communication channel with an accessing computing device 102. Thus, on receiving a request to communicate with the network address, a receiving device (e.g., a content server 122) may retrieve a security certificate corresponding to the hint information and use such a certificate to establish secure communications with the accessing computing device 102. Additional examples of hint information may include, for example, an identifier or network address of a resolver from which a DNS request corresponding to the encoded network address was received, a location of that resolver, etc.


While one potential format of a network address with encoded DNS-level information is shown in FIG. 4, other formats are possible and contemplated under the present disclosure. For example, more than 48 bits may be included within a routing prefix, or an additional bit group (e.g., bit group 4) may be used as a subnet prefix, in accordance with IPv6 protocols. Moreover, the specific bits used to identify each type of DNS-level data may vary according to different potential formats. While these bits are shown in FIG. 4 as 16-bit groups for ease of description, any number of bits may be used to identify each type of DNS-level data. For example, less than 16 or 32 bits may be sufficient to store a rule identifier or hint information, respectively (e.g., in the instance where less 65,536 total rule identifiers or 232 hint information values are intended to be supported). More than 16 bits may be used to store validity information (e.g., according to a strength of security desired) or distribution identifiers (e.g., according to the number of identifiers supported and a potential for collisions should a hash function be utilized). Any number of algorithms, including a variety of known hash algorithms, may be utilized to determine the bit values representative of given DNS-level data. Thus, the size, content, and arrangement of DNS-level data as encoded into a network address may vary.


As noted above, all or a portion of a network address may be encrypted. For example, the values of any one or more of bit groups 4 through 8 as shown in FIG. 4 may be encrypted according to public key encryption (using a public key) to represent an encrypted bit group, and a network address may be returned including at least one encrypted bit group. Thereafter, the values of the encrypted bit groups may be decrypted utilizing a corresponding private key, to determine the unencrypted values of the bit groups. Illustratively, a DNS server 112 may be configured to provide network addresses including at least one encrypted bit group within a DNS response, and one or more routers of the content delivery system 110 may be configured to decrypt the bit groups on receiving a data packet addressed to a network address including an encrypted bit group. In one embodiment, the router may validate or verify integrity of the network address (e.g., using validity information encoded into the network address, such as a digital signature), before forwarding the data packet within the content delivery system 110 (e.g., utilizing the unencrypted network address). In this manner, the network addresses utilized within the content delivery system 110 may be kept confidential to devices outside of the content delivery system 110 (or without a private key utilized by the content delivery system 110). While DNS-level information may be encrypted as described above, other data conveyed by a network address may additionally or alternatively be encrypted. For example, where a network assigns network addresses sequentially, randomly, or via another distribution mechanism, all or a portion of such network addresses may be encrypted before being provided in a DNS response, and a receiving device (e.g., a content server 112, a router, etc.) may be configured to decrypt the network address on receiving a data packet addressed to the encrypted network address


Returning to the interactions of FIG. 3A, once a DNS record for a distribution has been created, the DNS service 112 may function to obtain requests to resolve an identifier of the distribution from an accessing computing device 102A, as shown at (4). While this request is shown in FIG. 3A as beginning at the accessing computing device 102A and terminating at the DNS service 112, the request may be transmitted according to well-known DNS transmission protocols, and thus may pass through any number of intermediary devices (e.g., DNS resolvers) prior to arriving at the DNS service 112. Thus, the DNS service 112 may not be directly aware of the identity of the accessing computing device 102A.


At (5), in response to the request, the DNS service 112 may return the DNS record referencing the network address encoded with DNS-level data. Similarly to interaction (4), while this response is shown as beginning at the DNS service 112 and terminating at the accessing computing device 102A, the response may be transmitted according to well-known DNS transmission protocols, and thus may pass through any number of intermediary devices (e.g., DNS resolvers) prior to arriving at the accessing computing device 102A. On receiving the DNS record, the accessing computing device 102A may then transmit network data to the network address referenced in the DNS record, as will be described with reference to FIG. 3B.


While a simplified set of interactions are described with reference to FIG. 3A, additional or alternative interactions may occur under embodiments of the present disclosure. For example, the DNS service 112 may in some instances maintain multiple DNS records for a distribution (e.g., each including a network address associated with a different POP 120), and distribute the DNS records according to a load balancing or traffic shaping algorithm (e.g., round robin). As a further example, the DNS service 112 may in some instances operate to generate or modify DNS records on-the-fly, in response to requests to resolve a distribution identifier. For example, the DNS service 112 may generate validity data for a network address based at least in part on attributes of the request, such as a geographic or logical region from which the request was received. As another example, the DNS service 112 may in some instances modify a TTL value for a DNS record to corresponding to a length of time until the DNS service 112 is configured to generate new validity data for network addresses of a distribution associated with the DNS record. In this way, where accessing computing device 102A comply with the TTL value of the DNS record, these devices can be expected to consider a DNS record expired at or before the content delivery system 110 would consider the network address in the record as invalid due to a change in validity information. Thus, different accessing computing devices 102 may obtain different DNS records from the DNS service 112, even when requesting to resolve the same distribution identifier, and the ordering and content of the interactions of FIG. 3A should be viewed as illustrative in nature.


With reference to FIG. 3B, illustrative interactions will be described for the handling of a communication request from the accessing computing device 102A to the network address encoded with DNS-level information. For ease of reference, the interactions of FIG. 3B are numbered in sequence with those of FIG. 3A; however, the interactions of FIGS. 3A and 3B may in some instances occur separately (e.g., in the case of a network attack, where multiple accessing computing devices 102A may transmit data to a network address obtained by DNS request of a different accessing computing device 102A).


The interactions of FIG. 1 begin at (6), where the accessing computing device 102A transmits a request to access content of a distribution to a network address including encoded DNS-level data (e.g., as referenced within a DNS record obtained from the DNS service 112). The request may be routed via the network to a POP 120 associated with a routing prefix within the network address, where the request may be processed according to a content server 122 (e.g., as selected according to load balancing of the POP 120). Specifically, at (7), the POP 120 may load one or more decoding rules for the network address from the decoding rules data store 124. In some instances, the loaded rules may be generally static, and the POP 120 may load a current set of decoding rules. In other instances, the POP 120 may load a set of rules corresponding to a version identifier represented by bits of the encoded network address (e.g., where the bits of the encoded network address representing the version identifier are identifiable without the rules themselves, such as by locating the bits in a common position across a set of potential rules).


At (8), the POP 120 can decode DNS-level data from the network address, according to the decoding rules. For example, the POP 120 may utilize the decoding rules to determine a distribution identifier, hint information, and validity information associated with the request. Illustratively, each type of DNS-level data may be obtained my inspecting a set of bits corresponding to the DNS-level data, as identified in the decoding rules. In some instances, a set of bits may be further processed according to algorithms of the decoding rules to transform the bits into a format useable by the POP 120 (e.g., by reversing an encoding of a particular type of DNS-level data).


At (9), the POP 120 can validate the request to access content at least partly based on validity information included within the network address to which the request is transmitted. For example, validity information may include both a time of generation of a network address and a TTL value for the network address (or for a DNS record including the network address). Accordingly, a receiving device may decode the time of generation value and TTL value, and utilize these values to determine whether the network address should be considered valid (e.g., wherein if the time of generation value plus the TTL value does not meet or exceed a current time, the network address may be considered invalid. As another example, where the validity information is a digital signature generated based on a cryptographic hash of remaining bits of the network address, the POP 120 may generate a corresponding hash using those remaining bits of the network address and a decrypted value representing a decryption of the digital signature using a public key of the DNS service 112, and verify that the decrypted value and generated hash match. In some embodiments, the public/private key pair utilized to generate a digital signature may be specified within the network address (e.g., by a version identifier identifying a public/private key pair from a pre-established list). In other instances, the public/private key pair utilized to generate a digital signature may be separately agreed upon by the DNS service 112 and the POP 120. For example, the DNS server 112, the POP 120, or a third component (not shown in FIGS. 3A-3B) may periodically generate or select a new public/private key pair for use by the DNS service 112 and the POP 120, and the POP 120 may, after a threshold period of time subsequent to generation of a new public/private key pair (e.g., matching a TTL value of DNS records provided by the DNS service 112), consider network addresses with digital signatures generated under prior public/private key pairs to be invalid. This may enable the POP 120 to independently enforce TTL values of DNS records using digital signature verification.


In an instance where the decoding rules specify other inputs for validity information, such as a region from which the request originates, the POP 120 may verify the digital signature using such inputs. In the instance that the network address is considered valid, the POP 120 may continue to process the request. Otherwise, the POP 120 may consider the request invalid, and decline to further process the request (e.g., by “blackholing” the request). While validation of a request is described with reference to the POP 120 generally, such validation may occur at a variety of locations within the POP 120, such as at a content server 122 or at routers of the POP 120 (which routers are not shown in FIG. 3B) acting as intermediaries between a content server 112 and the accessing computing device 102A. In some instances, the public key corresponding to a digital signature may be made publically available by the content delivery system 110. Thus, components external to the content delivery system 110 may be enabled to verify digital signatures included within network addresses. For example, an accessing computing device 102 may include software configured to validate digital signatures in network addresses returned as part of a response to a DNS request, which may prevent or deter falsification or modification of DNS responses (e.g., via a man-in-the-middle attack). As another example, routers or communication devices on the network 106 may be configured to verify digitally signed network addresses before forwarding such addresses, to prevent malicious traffic on the network 106.


At (10), in the instance that the network address is considered valid, the POP 120 initiates communication with the accessing computing device 102A and obtains content responsive to the request, based at least partly on the DNS-level information. Illustratively, the POP 120 may initiate secure communications with the accessing computing device 102A based on a security certificate identified by the hint information of the network address. The POP 120 may further access a requested portion of content corresponding to the distribution within the data cache 126 based on a distribution identifier of the network address. Thereafter, the POP 120 can return the requested content to the accessing computing device 102, at (11). Thus, the accessing computing device 102A can utilize a network address encoded with DNS-level information to access content on the content delivery system 110.


While the interactions of FIG. 3B generally describe interactions that may occur with respect to a legitimate accessing computing device 102A, POPs 120 may additionally be configured to process and handle malicious communications from illegitimate accessing computing devices 102. Illustratively, such malicious communications may include invalid validity information (e.g., by virtue of the fact that the DNS service 112 has altered the validity information since a targeted network address was obtained by the illegitimate accessing computing devices 102), and thus may be ignored by the POP 120. Furthermore, because network addresses may include a distribution identifier as encoded DNS-level data, the POPs 120 may be enabled to identify, from the network address (and potentially without any additional information), a distribution targeted by a network attack. The POPs 120 may then undertake actions to mitigate the network attack, such as requesting that the DNS service 112 modify DNS records for the targeted distribution to include new validity information. Further illustrations of actions that may be used to mitigate network attacks are described in more detail within U.S. Pat. No. 9,742,795, entitled “MITIGATING NETWORK ATTACKS,” and issued Aug. 22, 2017, the entirety of which is hereby incorporated by reference.


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


Conditional language such as, among others, “can,” “could,” “might” or “may,” unless specifically stated otherwise, are otherwise understood within the context as used in general to present that certain embodiments include, while other embodiments do not include, certain features, elements and/or steps. Thus, such conditional language is not generally intended to imply that features, elements and/or steps are in any way required for one or more embodiments or that one or more embodiments necessarily include logic for deciding, with or without user input or prompting, whether these features, elements and/or steps are included or are to be performed in any particular embodiment.


Disjunctive language such as the phrase “at least one of X, Y or Z,” unless specifically stated otherwise, is otherwise understood with the context as used in general to present that an item, term, etc., may be either X, Y or Z, or any combination thereof (e.g., X, Y and/or Z). Thus, such disjunctive language is not generally intended to, and should not, imply that certain embodiments require at least one of X, at least one of Y or at least one of Z to each be present.


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


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


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

Claims
  • 1. A system comprising: a data store storing computer-executable instructions; anda processor configured to execute the computer-executable instructions to: obtain a request to resolve a name into a network address of a host device providing content associated with the name, wherein the request identifies the name, and wherein the name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device;generate the network address, wherein generating the network address comprises encoding into the network address: i) the name requested to be resolved as a first set of bits of the network address and ii) an identifier of the digital certificate associated with the name as a second set of bits of the network address distinct from the first set of bits;return the network address of the host device in response to the request;receive a network request associated with the network address of the host device;decode the network address of the host device to identify the digital certificate; andinitiate the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device.
  • 2. The system of claim 1, wherein the network address is formatted as an Internet Protocol version 6 (IPv6) address.
  • 3. The system of claim 1, wherein the network address comprises a first portion corresponding to routing information on a publically addressable network, and a second portion including the identifier of the digital certificate.
  • 4. The system of claim 1, wherein the computer-executable instructions further cause the processor to: encode into the network address validity information; anddetect that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel.
  • 5. The system of claim 4, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value.
  • 6. The system of claim 4, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key.
  • 7. A computer-implemented method comprising: obtaining a request to resolve a name into a network address of a host device providing content associated with the name, wherein the request identifies the name, and wherein the name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device;generating the network address, wherein generating the network address comprises encoding into the network address: i) the name requested to be resolved as a first set of bits of the network address and ii) an identifier of the digital certificate associated with the name as a second set of bits of the network address distinct from the first set of bits;returning the network address of the host device in response to the request;receiving a network request associated with the network address of the host device;decoding the network address of the host device to identify the digital certificate; andinitiating the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device.
  • 8. The computer-implemented method of claim 7 further comprising encoding into the network address at least one of security information associated with the name, timing information of the request for the network address, information specifying a source of the request for the network address, or validity information indicating a validity of the network address generated based at least in part on the request for the network address.
  • 9. The computer-implemented method of claim 7 further comprising: encoding into the network address validity information; anddetecting that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel.
  • 10. The computer-implemented method of claim 9, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value.
  • 11. The computer-implemented method of claim 9, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key.
  • 12. The computer-implemented method of claim 7, wherein encoding into the network address the name comprises: hashing the name according to a hash function to result in a hash value; andincluding the hash value as a portion of the network address.
  • 13. The computer-implemented method of claim 12, wherein the hash function is a cryptographic hash function.
  • 14. Non-transitory computer-readable media comprising computer-executable instructions that, when executed, cause a computing system to: obtain a request to resolve a name into a network address of a host device providing content associated with the name, wherein the request identifies the name, and wherein the name is associated with a digital certificate used to establish a secure communication channel between a requesting device and the host device;generate the network address, wherein generating the network address comprises encoding into the network address: i) the name requested to be resolved as a first set of bits of the network address and ii) an identifier of the digital certificate associated with the name as a second set of bits of the network address distinct from the first set of bits;return the network address of the host device in response to the request;receive a network request associated with the network address of the host device;decode the network address of the host device to identify the digital certificate; andinitiate the secure communication channel between the requesting device and the host device utilizing the digital certified identified by the identifier of the digital certificate encoded into the network address of the host device.
  • 15. The non-transitory computer-readable media of claim 14, wherein the computer-executable instructions further cause the computing system to: encode into the network address validity information; anddetect that the validity information indicates that the network request is addressed to a valid network address prior to initiating the secure communication channel.
  • 16. The non-transitory computer-readable media of claim 15, wherein the validity information indicates a time of the request for the network address, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes detecting that a period of time between a current time and the time of the request for the network address falls with a threshold time-to-live value.
  • 17. The non-transitory computer-readable media of claim 15, wherein the validity information includes a digital signature associated with a public key, and wherein detecting that the validity information indicates that the network request is addressed to the valid network address includes verifying the digital signature using the public key.
  • 18. The non-transitory computer-readable media of claim 15, wherein the identifier of the digital certificate is encoded into the network address according to one or more encoding rules that specify individual bits of the network addresses used to encode the identifier of the digital certificate.
  • 19. The non-transitory computer-readable media of claim 18, wherein the computer-executable instructions further cause the computing system to identify the one or more encoding rules, prior to encoding the identifier of the digital certificate into the network address, based at least in part on a current time and a security level associated with the name.
  • 20. The non-transitory computer-readable media of claim 18, wherein the computer-executable instructions further cause the computing system to: encode an identifier of the one or more encoding rules into the network address;identify the one or more encoding rules based on the identifier of the one or more encoding rules encoded into the network address; anddecode the network address of the host device based at least in part on the one or more encoding rules as identified based on the identifier of the one or more encoding rules encoded into the network address.
US Referenced Citations (1750)
Number Name Date Kind
1075551 D'Amours Oct 1913 A
5063500 Shorter Nov 1991 A
5341477 Pitkin et al. Aug 1994 A
5459837 Caccavale Oct 1995 A
5611049 Pitts Mar 1997 A
5627889 Eslambolchi Mar 1997 A
5701467 Freeston Sep 1997 A
5764910 Shachar Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5815649 Utter et al. Sep 1998 A
5852717 Bhide et al. Nov 1998 A
5892914 Pitts Apr 1999 A
5893116 Simmonds et al. Apr 1999 A
5895462 Toki Apr 1999 A
5905248 Russell et al. Apr 1999 A
5933811 Angles et al. May 1999 A
5937427 Shinagawa et al. Aug 1999 A
5974454 Apfel et al. Aug 1999 A
5991306 Burns et al. Oct 1999 A
5999274 Lee et al. Nov 1999 A
6006264 Colby et al. Dec 1999 A
6016512 Huitema Jan 2000 A
6026452 Pitts Jan 2000 A
6085234 Pitts et al. Jan 2000 A
6038601 Lambert et al. Feb 2000 A
6052718 Gifford Mar 2000 A
6078960 Ballard Apr 2000 A
6018619 Allard et al. Jun 2000 A
6092100 Berstis et al. Jul 2000 A
6098096 Tsirigotis et al. Jul 2000 A
6108703 Leighton et al. Aug 2000 A
6128279 O'Neil et al. Aug 2000 A
6151631 Ansell et al. Oct 2000 A
6157942 Chu et al. Nov 2000 A
6167438 Yates et al. Dec 2000 A
6167446 Lister et al. Dec 2000 A
6173316 De Boor et al. Jan 2001 B1
6178160 Bolton et al. Jan 2001 B1
6182111 Inohara et al. Jan 2001 B1
6182125 Borella et al. Jan 2001 B1
6185598 Farber et al. Jan 2001 B1
6192051 Lipman et al. Feb 2001 B1
6205475 Pitts Feb 2001 B1
6223288 Byrne Mar 2001 B1
6223209 Watson et al. Apr 2001 B1
6243761 Mogul et al. Apr 2001 B1
6275496 Burns et al. Jun 2001 B1
6256671 Strentzsch et al. Jul 2001 B1
6286043 Cuomo et al. Aug 2001 B1
6286084 Wexler et al. Sep 2001 B1
6304913 Rune Sep 2001 B1
6324580 Jindal et al. Oct 2001 B1
6330602 Law et al. Nov 2001 B1
6338082 Schneider Jan 2002 B1
6345308 Abe Jan 2002 B1
6351743 DeArdo et al. Feb 2002 B1
6351775 Yu Feb 2002 B1
6363411 Dugan et al. Feb 2002 B1
6366952 Pitts Mar 2002 B2
6374290 Scharber et al. Apr 2002 B1
6377257 Borrel et al. Apr 2002 B1
6386043 Millins Apr 2002 B1
6389532 Gupta et al. May 2002 B1
6405252 Gupta et al. May 2002 B1
6408360 Chamberlain et al. Jun 2002 B1
6411967 Van Renesse Jun 2002 B1
6415280 Farber et al. Jun 2002 B1
6430607 Kavner Jul 2002 B1
6438592 Killian Aug 2002 B1
6442165 Sitaraman et al. Aug 2002 B1
6452925 Sistanizadeh et al. Aug 2002 B1
6457047 Chandra et al. Sep 2002 B1
6459909 Bilcliff et al. Sep 2002 B1
6473804 Kaiser et al. Oct 2002 B1
6484143 Swildens et al. Oct 2002 B1
6484161 Chipalkatti et al. Nov 2002 B1
6493765 Cunningham et al. Nov 2002 B1
6505241 Pitts Jan 2003 B2
6513112 Craig et al. Jan 2003 B1
6523036 Hickman et al. Jan 2003 B1
6529910 Fleskes Feb 2003 B1
6529953 Van Renesse Mar 2003 B1
6553413 Leighton et al. Mar 2003 B1
6560610 Eatherton et al. Apr 2003 B1
6564380 Murphy May 2003 B1
6611873 Kanehara May 2003 B1
6622168 Datta Aug 2003 B1
6633324 Stephens, Jr. Sep 2003 B2
6643357 Lumsden Oct 2003 B2
6643707 Booth Nov 2003 B1
6654807 Farber et al. Nov 2003 B2
6658462 Dutta Nov 2003 B1
6665706 Kenner et al. Dec 2003 B2
6678717 Schneider Jan 2004 B1
6678791 Jacobs et al. Jan 2004 B1
6681282 Golden et al. Jan 2004 B1
6687846 Adrangi et al. Jan 2004 B1
6694358 Swildens et al. Feb 2004 B1
6697805 Choquier et al. Feb 2004 B1
6718324 Edlund et al. Mar 2004 B2
6724770 Van Renesse Apr 2004 B1
6732237 Jacobs et al. Apr 2004 B1
6754699 Swildens et al. May 2004 B2
6754706 Swildens et al. Jun 2004 B1
6760721 Chasen et al. Jun 2004 B1
6769031 Bero Jul 2004 B1
6782398 Bahl Jul 2004 B1
6785704 McCanne Aug 2004 B1
6795434 Kumar et al. Aug 2004 B1
6799214 Li Sep 2004 B1
6804706 Pitts Sep 2004 B2
6810291 Card et al. Oct 2004 B2
6810411 Coughlin et al. Oct 2004 B1
6829654 Jungck Nov 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. Mar 2005 B2
6925499 Chen et al. Jul 2005 B1
6928467 Peng et al. Aug 2005 B2
6928485 Krishnamurthy et al. Aug 2005 B1
6941562 Gao et al. Aug 2005 B2
6944167 McPherson Sep 2005 B1
6950848 Yousefi'zadeh et al. Sep 2005 B1
6961783 Cook et al. Sep 2005 B1
6963850 Bezos et al. Nov 2005 B1
6968389 Menditto et al. Nov 2005 B1
6976090 Ben-Shaul et al. Nov 2005 B2
6981017 Kasriel et al. Dec 2005 B1
6981025 Frazier et al. Dec 2005 B1
6985945 Farhat et al. Jan 2006 B2
6986018 O'Rourke et al. Jan 2006 B2
6990526 Zhu Jan 2006 B1
6996616 Leighton et al. Jan 2006 B1
7003555 Jungck Feb 2006 B1
7006099 Gut et al. Feb 2006 B2
7007089 Freedman Feb 2006 B2
7010578 Lewin et al. Mar 2006 B1
7010598 Sitaraman et al. Mar 2006 B2
7024466 Outten et al. Apr 2006 B2
7027582 Khello et al. Apr 2006 B2
7031445 Lumsden Apr 2006 B2
7032010 Swildens et al. Apr 2006 B1
7058633 Gnagy et al. Apr 2006 B1
7058706 Iyer et al. Jun 2006 B1
7058953 Willard et al. Jun 2006 B2
7062158 Ayaki Jun 2006 B1
7065587 Huitema et al. Jun 2006 B2
7072982 Teodosiu et al. Jun 2006 B2
7076633 Tormasov et al. Jul 2006 B2
7082476 Cohen et al. Jul 2006 B1
7086061 Joshi et al. Aug 2006 B1
7092505 Allison et al. Aug 2006 B2
7092997 Kasriel et al. Aug 2006 B1
7095715 Buckman et al. Aug 2006 B2
7096266 Lewin et al. Aug 2006 B2
7099936 Chase et al. Aug 2006 B2
7103645 Leighton et al. Aug 2006 B2
7114160 Suryanarayana et al. Sep 2006 B2
7117262 Bai et al. Sep 2006 B2
7133905 Dilley et al. Oct 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. Nov 2006 B2
7149747 Cheng et al. Dec 2006 B1
7149809 Barde et al. Dec 2006 B2
7152118 Anderson, IV et al. Dec 2006 B2
7162539 Garcie-Luna-Aceves Jan 2007 B2
7165117 Sitaraman et al. Jan 2007 B1
7171469 Ackaouy et al. Jan 2007 B2
7174382 Ramanathan et al. Jan 2007 B2
7185046 Ferstl et al. Feb 2007 B2
7185063 Kasriel et al. Feb 2007 B1
7185084 Sirivara et al. Feb 2007 B2
7188214 Kasriel et al. Feb 2007 B1
7194522 Swildens et al. Mar 2007 B1
7194552 Schneider Mar 2007 B1
7200667 Teodosiu et al. Mar 2007 B2
7200673 Augart Apr 2007 B1
7216170 Ludvig et al. Apr 2007 B2
7225254 Swildens et al. May 2007 B1
7228350 Hong et al. May 2007 B2
7228359 Monteiro Jun 2007 B1
7233978 Overton et al. Jun 2007 B2
7240100 Wein et al. Jun 2007 B1
7249196 Peiffer et al. Jul 2007 B1
7251675 Kamakura et al. Jul 2007 B1
7254626 Kommula et al. Jul 2007 B1
7272227 Beran Jul 2007 B1
7254634 Davis 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 Sep 2007 B2
7289519 Liskov Oct 2007 B1
7293093 Leighton Oct 2007 B2
7308499 Chavez Nov 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. Jan 2008 B2
7339937 Mitra et al. Mar 2008 B2
7340505 Lisiecki et al. Mar 2008 B2
7343397 Kochanski Mar 2008 B2
7350075 Eastham et al. Mar 2008 B1
7362703 Taft et al. Mar 2008 B1
7363291 Page Apr 2008 B1
7363626 Koutharapu et al. Apr 2008 B2
7370089 Boyd et al. Apr 2008 B2
7372809 Chen May 2008 B2
7373416 Kagan et al. May 2008 B2
7376716 Dilley et al. May 2008 B2
7376736 Sundaram et al. May 2008 B2
7380078 Ikegaya et al. May 2008 B2
7389354 Sitaraman et al. May 2008 B1
7392236 Rusch et al. Jun 2008 B2
7398301 Hennessey et al. Jun 2008 B2
7406512 Swildens et al. Jul 2008 B2
7406522 Riddle Jul 2008 B2
7409712 Brooks et al. Jul 2008 B1
7430610 Pace et al. Aug 2008 B2
7441045 Skene et al. Sep 2008 B2
7441261 Slater et al. Oct 2008 B2
7451230 Corrado et al. Oct 2008 B2
7454457 Lowery et al. Nov 2008 B1
7454500 Hsu et al. Nov 2008 B1
7461170 Taylor et al. Nov 2008 B1
7464142 Flurry et al. Dec 2008 B2
7472201 Aitken Dec 2008 B1
7478148 Neerdaels Jan 2009 B2
7492720 Pruthi et al. Jan 2009 B2
7496651 Joshi Feb 2009 B1
7499998 Toebes et al. Feb 2009 B2
7502836 Menditto et al. Mar 2009 B1
7505464 Okmianski et al. Mar 2009 B2
7506034 Coates et al. Mar 2009 B2
7519705 Papagiannaki et al. Mar 2009 B1
7519720 Fishman et al. Apr 2009 B2
7519726 Palliyil et al. Apr 2009 B2
7523181 Swildens et al. Apr 2009 B2
7543024 Holstege Apr 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. Jun 2009 B1
7565407 Hayball Jul 2009 B1
7568032 Feng et al. Jul 2009 B2
7573916 Bechtolsheim et al. Jul 2009 B1
7574499 Swildens et al. Aug 2009 B1
7581009 Hsu et al. Aug 2009 B1
7593935 Sullivan Aug 2009 B2
7584507 Nucci Sep 2009 B1
7594189 Walker et al. Sep 2009 B1
7596619 Leighton et al. Sep 2009 B2
7603439 Dilley et al. Sep 2009 B2
7613815 Prakash et al. Oct 2009 B1
7617222 Coulthard et al. Nov 2009 B2
7623460 Miyazaki Nov 2009 B2
7624169 Lisiecki et al. Nov 2009 B2
7624264 Aura et al. Nov 2009 B2
7631101 Sullivan et al. Nov 2009 B2
7626940 Jain Dec 2009 B2
7640296 Fuchs et al. Dec 2009 B2
7650376 Blumenau Jan 2010 B1
7653689 Champagne et al. Jan 2010 B1
7653700 Bahl et al. Jan 2010 B1
7653725 Yahiro et al. Jan 2010 B2
7657613 Hanson et al. Jan 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. Feb 2010 B2
7680897 Carter et al. Mar 2010 B1
7684394 Cutbill et al. Mar 2010 B1
7685109 Ransil et al. Mar 2010 B1
7685251 Houlihan et al. Mar 2010 B2
7685270 Vermeulen et al. Mar 2010 B1
7685273 Anastas et al. Mar 2010 B1
7693813 Cao et al. Mar 2010 B1
7693959 Leighton et al. Apr 2010 B2
7698418 Shimada et al. Apr 2010 B2
7702724 Brydon et al. Apr 2010 B1
7706740 Collins et al. Apr 2010 B2
7707071 Rigole Apr 2010 B2
7707314 McCarthy et al. Apr 2010 B2
7711647 Gunaseelan et al. Apr 2010 B2
7711788 Lev Ran et al. May 2010 B2
7716367 Leighton et al. May 2010 B1
7725602 Liu et al. May 2010 B2
7725658 Lang et al. May 2010 B2
7730187 Raciborski et al. May 2010 B2
7739400 Lindbo et al. Jun 2010 B2
7747720 Toebes et al. Jun 2010 B2
7748005 Romero et al. Jun 2010 B2
7756017 Goyal et al. Jul 2010 B2
7756032 Feick et al. Jul 2010 B2
7756913 Day Jul 2010 B1
7756965 Joshi Jul 2010 B2
7757202 Dahlsted et al. Jul 2010 B2
7761572 Auerbach Jul 2010 B1
7765295 Anastas et al. Jul 2010 B2
7765304 Davis et al. Jul 2010 B2
7769823 Jenny et al. Jul 2010 B2
7773596 Marques Aug 2010 B1
7774342 Virdy Aug 2010 B1
7783727 Foley et al. Aug 2010 B1
7787380 Aggarwal et al. Aug 2010 B1
7792989 Toebes et al. Aug 2010 B2
7805516 Kettler et al. Sep 2010 B2
7809597 Das et al. Sep 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. Oct 2010 B2
7836177 Kasriel et al. Nov 2010 B2
7853719 Cao et al. Nov 2010 B1
7853680 Phatak Dec 2010 B2
7860735 Evanitsky Dec 2010 B2
7865594 Baumback et al. Jan 2011 B1
7865953 Hsieh et al. Jan 2011 B1
7873065 Mukerji et al. Jan 2011 B1
7890612 Todd et al. Jan 2011 B2
7890989 Hofrichter et al. Feb 2011 B1
7899899 Joshi Feb 2011 B2
7904875 Hegyi Mar 2011 B2
7912921 O'Rourke et al. Mar 2011 B2
7925782 Sivasubramanian et al. Mar 2011 B2
7925713 Day et al. Apr 2011 B1
7930393 Baumback et al. Apr 2011 B1
7930402 Swildens et al. Apr 2011 B2
7930427 Josefsberg et al. Apr 2011 B2
7933988 Nasuto et al. Apr 2011 B2
7937456 McGrath Apr 2011 B2
7937477 Day et al. May 2011 B1
7945693 Farber et al. May 2011 B2
7949779 Farber et al. May 2011 B2
7949785 Alkhatib May 2011 B2
7958222 Pruitt et al. May 2011 B1
7958258 Yeung et al. Jun 2011 B2
7961736 Ayyagari Jun 2011 B2
7962597 Richardson et al. Jun 2011 B2
7966404 Hedin et al. Jun 2011 B2
7970816 Chess et al. Jun 2011 B2
7970940 van de Ven et al. Jun 2011 B1
7979509 Malmskog et al. Jun 2011 B1
7991910 Richardson et al. Jul 2011 B2
7996404 Wong et al. Aug 2011 B2
7996533 Leighton et al. Aug 2011 B2
7996535 Auerbach Aug 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8001187 Stochosky Aug 2011 B2
8010705 Sebastian et al. Aug 2011 B1
8010707 Elzur et al. Aug 2011 B2
8019869 Kriegsman Aug 2011 B2
8024441 Kommula et al. Sep 2011 B2
8028090 Richardson et al. Sep 2011 B2
8041773 Abu-Ghazaleh et al. Sep 2011 B2
8041809 Sundaram et al. Oct 2011 B2
8041818 Gupta et al. Oct 2011 B2
8042054 White et al. Oct 2011 B2
8051166 Baumback et al. Oct 2011 B1
8065275 Eriksen et al. Nov 2011 B2
8069231 Schran et al. Nov 2011 B2
8073940 Richardson et al. Nov 2011 B1
8079087 Spies et al. Dec 2011 B1
8082348 Averbuj et al. Dec 2011 B1
8099487 Smirnov et al. Jan 2012 B1
8108623 Krishnaprasad et al. Jan 2012 B2
8117306 Baumback et al. Jan 2012 B1
8122098 Richardson et al. Feb 2012 B1
8122124 Baumback et al. Feb 2012 B1
8132242 Wu Feb 2012 B1
8135820 Richardson et al. Mar 2012 B2
8155126 Mao et al. Mar 2012 B1
8156199 Hoche-Mong et al. Apr 2012 B1
8156243 Richardson et al. Apr 2012 B2
8161184 Sekar et al. Apr 2012 B2
8165915 Lucash Apr 2012 B1
8175863 Ostermeyer et al. Apr 2012 B1
8180720 Kovacs et al. May 2012 B1
8190682 Paterson-Jones et al. May 2012 B2
8195605 Chellappa et al. May 2012 B2
8195837 McCarthy et al. Jun 2012 B2
8209695 Pruyne et al. Jun 2012 B1
8224971 Miller et al. Jun 2012 B1
8218965 Uhlhorn et al. Jul 2012 B1
8219647 Harvell et al. Jul 2012 B2
8224942 Presotto 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. Jul 2012 B2
8250135 Driesen et al. Aug 2012 B2
8250211 Swildens et al. Aug 2012 B2
8250219 Raciborski et al. Aug 2012 B2
8260914 Ranjan Aug 2012 B1
8261062 Aura et al. Sep 2012 B2
8266288 Banerjee et al. Sep 2012 B2
8266327 Kumar et al. Sep 2012 B2
8271471 Kamvar et al. Sep 2012 B1
8280998 Joshi Sep 2012 B2
8281035 Farber et al. Oct 2012 B2
8286176 Baumback et al. Oct 2012 B1
8291046 Farber et al. Oct 2012 B2
8291117 Eggleston et al. Oct 2012 B1
8296375 Katzer et al. Oct 2012 B1
8296393 Alexander et al. Oct 2012 B2
8296429 Baumback et al. Oct 2012 B2
8296786 Faust et al. Oct 2012 B2
8301600 Helmick et al. Oct 2012 B1
8301645 Crook Oct 2012 B1
8316124 Baumback et al. Oct 2012 B1
8321568 Sivasubramanian et al. Nov 2012 B2
8321588 Richardson et al. Nov 2012 B2
8331370 Hamilton et al. Nov 2012 B2
8341745 Chat et al. Dec 2012 B1
8356074 Ehrlich et al. Jan 2013 B1
8380831 Barber Jan 2013 B2
8380851 McCarthy et al. Feb 2013 B2
8392928 Forys et al. Feb 2013 B1
8396908 Moore et al. Mar 2013 B2
8402137 Sivasuramanian et al. Mar 2013 B2
8423408 Barnes et al. Mar 2013 B1
8423662 Weihl et al. Apr 2013 B1
8423667 Richardson et al. Apr 2013 B2
8433749 Wee et al. Apr 2013 B2
8443167 Fallone et al. Apr 2013 B1
8447831 Sivasubramanian et al. May 2013 B1
8447854 Jasinskyj May 2013 B1
8447876 Verma et al. May 2013 B2
8452745 Ramakrishna May 2013 B2
8452870 Baumback et al. May 2013 B2
8452874 MacCarthaigh et al. May 2013 B2
8463877 Richardson May 2013 B1
8458360 Richardson et al. Jun 2013 B2
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. Jun 2013 B2
8478883 Day et al. Jul 2013 B2
8489737 Baumback et al. Jul 2013 B2
8504721 Hsu et al. Jul 2013 B2
8504775 Plamondon Aug 2013 B2
8510428 Joshi Aug 2013 B2
8510807 Elazary et al. Aug 2013 B1
8516082 Cadwell et al. Aug 2013 B2
8521851 Richardson et al. Aug 2013 B1
8521876 Goodman et al. Aug 2013 B2
8521880 Richardson et al. Aug 2013 B1
8521885 Richardson et al. Aug 2013 B1
8521908 Holmes et al. Aug 2013 B2
8526405 Curtis et al. Aug 2013 B2
8527639 Liskov et al. Sep 2013 B1
8527645 Proffit et al. Sep 2013 B1
8527658 Holmes et al. Sep 2013 B2
8549646 Stavrou et al. Sep 2013 B2
8572208 Farber et al. Oct 2013 B2
8572210 Farber et al. Oct 2013 B2
8577992 Richardson et al. Oct 2013 B1
8577963 Trahan et al. Nov 2013 B2
8589996 Ma et al. Nov 2013 B2
8606996 Richardson et al. Nov 2013 B2
8606926 Ulevitch Dec 2013 B2
8612565 Schneider Dec 2013 B2
8612588 Ehrlich et al. Dec 2013 B1
8615549 Knowles et al. Dec 2013 B2
8619780 Brandwine Dec 2013 B1
8626950 MacCarthaigh et al. Jan 2014 B1
8635340 Schneider Jan 2014 B1
8639817 Sivasubramanian et al. Jan 2014 B2
8645539 McCarthy et al. Jan 2014 B2
8645700 Smith et al. Feb 2014 B2
8667127 Bettis et al. Feb 2014 B2
8676918 Richardson et al. Mar 2014 B2
8683023 Brandwine et al. Mar 2014 B1
8683076 Farber et al. Mar 2014 B2
8688837 Richardson et al. Mar 2014 B1
8694642 Dempsky et al. Apr 2014 B2
8712950 Smith et al. Apr 2014 B2
8732309 Richardson et al. Apr 2014 B1
8738766 Kazerani et al. May 2014 B1
8745177 Kazerani et al. May 2014 B1
8756322 Lynch Jun 2014 B1
8756325 Sivasubramanian et al. Jun 2014 B2
8756341 Richardson et al. Jun 2014 B1
8762526 Baumback et al. Jun 2014 B2
8775553 Cansino et al. Jun 2014 B2
8782207 Qiu et al. Jul 2014 B2
8782236 Marshall et al. Jul 2014 B1
8782279 Eggleston et al. Jul 2014 B2
8788671 Richardson et al. Jul 2014 B2
8812727 Sorenson, III et al. Jul 2014 B1
8819187 Hofmann Aug 2014 B1
8819283 Richardson et al. Aug 2014 B2
8826032 Yahalom et al. Aug 2014 B1
8843625 Baumback et al. Sep 2014 B2
8902897 Hamilton et al. Sep 2014 B2
8885584 Praveenkumar et al. Nov 2014 B2
8904009 Marshall et al. Dec 2014 B1
8914514 Jenkins et al. Dec 2014 B1
8914626 Adogla et al. Dec 2014 B1
8914797 Osogami et al. Dec 2014 B2
8914814 Middleton et al. Dec 2014 B1
8924466 Seed et al. Dec 2014 B2
8924528 Richardson et al. Dec 2014 B1
8930513 Richardson et al. Jan 2015 B1
8930544 Richardson et al. Jan 2015 B2
8935744 Osterweil et al. Jan 2015 B2
8938526 Richardson et al. Jan 2015 B1
8949161 Borst et al. Jan 2015 B2
8949459 Scholl Feb 2015 B1
8966318 Shah Feb 2015 B1
8971328 Judge et al. Feb 2015 B2
8972580 Fleischman et al. Mar 2015 B2
8976711 Li et al. Mar 2015 B2
9003035 Richardson et al. Mar 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. Apr 2015 B2
9037975 Taylor et al. May 2015 B1
9071502 Baumback et al. May 2015 B2
9075777 Pope et al. Jun 2015 B1
9075893 Jenkins Jul 2015 B1
9083675 Richardson et al. Jul 2015 B2
9083743 Patel et al. Jul 2015 B1
9088460 Baumback et al. Jul 2015 B2
9092141 Hayashi Jul 2015 B2
9106701 Richardson et al. Jul 2015 B2
9116803 Agrawal et al. Aug 2015 B1
9118543 Baumback et al. Aug 2015 B2
9118680 Dunlap et al. Aug 2015 B1
9130756 Richardson et al. Aug 2015 B2
9130977 Zisapel et al. Sep 2015 B2
9137210 Joglekar et al. Sep 2015 B1
9137301 Dunlap et al. Sep 2015 B1
9137302 Makhijani et al. Sep 2015 B1
9154551 Watson Sep 2015 B1
9160641 Baumback et al. Oct 2015 B2
9160703 Richardson et al. Oct 2015 B2
9172674 Patel et al. Oct 2015 B1
9176894 Marshall et al. Oct 2015 B2
9185012 Richardson et al. Nov 2015 B2
9191338 Richardson et al. Nov 2015 B2
9191393 Tovar Nov 2015 B2
9191458 Richardson et al. Nov 2015 B2
9195996 Walsh et al. Nov 2015 B1
9208097 Richardson et al. Nov 2015 B2
9210099 Baumback et al. Dec 2015 B2
9210235 Sivasubramanian et al. Dec 2015 B2
9219686 Hilt et al. Dec 2015 B2
9237087 Risbood et al. Jan 2016 B1
9237114 Richardson et al. Jan 2016 B2
9240954 Ellsworth et al. Jan 2016 B1
9246776 Ellsworth et al. Jan 2016 B2
9253065 Richardson et al. Jan 2016 B2
9251112 Richardson et al. Feb 2016 B2
9276812 Nagargadde et al. Feb 2016 B1
9282032 Judge et al. Mar 2016 B2
9294391 Mostert Mar 2016 B1
9300535 Popli et al. Mar 2016 B2
9323577 Marr et al. Mar 2016 B2
9332078 Sivasubramanian et al. Apr 2016 B2
9367929 Bettis et al. May 2016 B2
9386038 Martini Jun 2016 B2
9391949 Richardson et al. Jul 2016 B1
9407676 Archer et al. Jul 2016 B2
9407539 Dickinson et al. Aug 2016 B1
9407681 Richardson et al. Aug 2016 B1
9407699 Sivasubramanian et al. Aug 2016 B2
9444718 Khakpour et al. Aug 2016 B2
9444759 Richardson et al. Sep 2016 B2
9479476 Richardson et al. Sep 2016 B2
9491073 Baumback et al. Oct 2016 B2
9495338 Hollis et al. Nov 2016 B1
9497259 Richardson et al. Nov 2016 B1
9515949 Richardson et al. Nov 2016 B2
9525659 Sonkin et al. Dec 2016 B1
9544388 Li et al. Jan 2017 B1
9544394 Richardson et al. Jan 2017 B2
9571389 Richardson et al. Jan 2017 B2
9584328 Graham-Cumming Feb 2017 B1
9590946 Richardson et al. Feb 2017 B2
9608957 Sivasubramanian et al. Mar 2017 B2
9621660 Sivasubramanian et al. Mar 2017 B2
9628403 Baumback et al. Apr 2017 B2
9628509 Holloway et al. Apr 2017 B2
9628554 Marshall et al. Apr 2017 B2
9645808 Turpie Apr 2017 B1
9660890 Baumback et al. May 2017 B2
9703713 Nadgowda May 2017 B2
9699108 Popli et al. Jul 2017 B2
9705922 Foxhoven et al. Jul 2017 B2
9712325 Richardson et al. Jul 2017 B2
9712484 Richardson et al. Jul 2017 B1
9734472 Richardson et al. Jul 2017 B2
9742795 Radlein et al. Aug 2017 B1
9760420 Letz et al. Aug 2017 B1
9769248 Krishnan et al. Sep 2017 B1
9774619 Radlein et al. Sep 2017 B1
9787599 Richardson et al. Sep 2017 B2
9787775 Richardson et al. Oct 2017 B1
9794188 Baumback et al. Oct 2017 B2
9794216 Richardson et al. Oct 2017 B2
9794281 Radlein et al. Oct 2017 B1
9800539 Richardson et al. Oct 2017 B2
9811451 Arguelles et al. Oct 2017 B1
9819567 Uppal et al. Nov 2017 B1
9825831 Baumback et al. Nov 2017 B2
9832141 Raftery Nov 2017 B1
9871794 Joffe et al. Jan 2018 B2
9887914 Bergman Jan 2018 B2
9887915 Richardson et al. Feb 2018 B2
9887931 Uppal et al. Feb 2018 B1
9887932 Uppal et al. Feb 2018 B1
9888089 Sivasubramanian et al. Feb 2018 B2
9893957 Ellsworth et al. Feb 2018 B2
9894168 Sivasubramanian et al. Feb 2018 B2
9900402 Li et al. Feb 2018 B1
9912740 Richardson et al. Feb 2018 B2
9929959 Mostert Mar 2018 B2
9930131 MacCarthaigh et al. Mar 2018 B2
9954934 Sivasubramanian et al. Mar 2018 B2
9985927 Richardson et al. Apr 2018 B2
9992086 Mizik et al. May 2018 B1
9992303 Richardson et al. Jun 2018 B2
9996501 Nelson et al. Jun 2018 B1
9996572 Calder et al. Jun 2018 B2
10015237 Richardson et al. Jun 2018 B2
10015241 Marr et al. Jul 2018 B2
10027582 Richardson et al. Jul 2018 B2
10027739 Krishnan et al. Jul 2018 B1
10033627 Howard et al. Jul 2018 B1
10033691 Mizik et al. Jul 2018 B1
10033699 Sullivan et al. Jul 2018 B2
10049051 Baldwin Jul 2018 B1
10162753 Marshall et al. Jul 2018 B2
10063459 Judge et al. Aug 2018 B2
10075551 Baldwin et al. Aug 2018 B1
10079742 Richardson et al. Sep 2018 B1
10091096 Howard et al. Sep 2018 B1
10097398 Richardson et al. Oct 2018 B1
10097448 Howard et al. Oct 2018 B1
10097566 Radlein et al. Oct 2018 B1
10104009 Baumback et al. Oct 2018 B2
10110694 Watson et al. Oct 2018 B1
10116584 Richardson et al. Oct 2018 B2
10135620 Richardson et al. Oct 2018 B2
10148542 Baumback et al. Nov 2018 B2
10021179 Velummylum et al. Dec 2018 B1
10157135 Richardson et al. Dec 2018 B2
10158729 Sivasubramanian et al. Dec 2018 B2
10180993 Raftery Jan 2019 B2
10200402 Radlein et al. Jan 2019 B2
10200492 MacCarthaigh et al. Feb 2019 B2
10205644 Baumback et al. Feb 2019 B2
10205698 Petersen et al. Feb 2019 B1
10218584 Ellsworth et al. Feb 2019 B2
10225322 Richardson et al. Feb 2019 B2
10225326 Puchala et al. Mar 2019 B1
10225362 Watson Mar 2019 B2
10225365 Hotchkies et al. Mar 2019 B1
10230819 Richardson et al. Mar 2019 B2
10257307 Baldwin Mar 2019 B1
10264062 Richardson et al. Apr 2019 B2
10270878 Uppal et al. Apr 2019 B1
10284446 Baumback et al. Apr 2019 B2
10305797 Richardson et al. May 2019 B2
10311371 Hotchkies et al. May 2019 B1
10348639 Puchala et al. Jul 2019 B2
10372499 Radhakrishnan et al. Aug 2019 B1
10374955 Mostert Aug 2019 B2
10410085 Bettis et al. Sep 2019 B2
10447648 Bliss et al. Oct 2019 B2
10462025 Baumback et al. Oct 2019 B2
10467042 Mercier et al. Nov 2019 B1
10469355 Uppal et al. Nov 2019 B2
10469513 Uppal et al. Nov 2019 B2
10491534 Richardson et al. Nov 2019 B2
10505961 Uppal et al. Dec 2019 B2
10506029 Hollis et al. Dec 2019 B2
10511567 Richardson et al. Dec 2019 B2
10516590 Mizik et al. Dec 2019 B2
10521348 Marshall et al. Dec 2019 B2
10523783 Richardson et al. Dec 2019 B2
10530874 Sivasubramanian et al. Jan 2020 B2
10542079 Marr et al. Jan 2020 B2
10554748 Sivasubramanian et al. Feb 2020 B2
10574787 Richardson et al. Feb 2020 B2
10601767 Richardson et al. Mar 2020 B2
10616250 Uppal et al. Apr 2020 B2
10623408 Marshall et al. Apr 2020 B1
10630771 Garza et al. Apr 2020 B1
10645149 Sivasubramanian et al. May 2020 B2
10666756 Baldwin et al. May 2020 B2
10691752 Raftery Jun 2020 B2
10742550 Richardson et al. Aug 2020 B2
10742593 Vasquez et al. Aug 2020 B1
10771552 Sivasubramanian et al. Sep 2020 B2
10778554 Richardson et al. Sep 2020 B2
10783077 Marshall et al. Sep 2020 B2
10785037 Richardson et al. Sep 2020 B2
10797995 Richardson et al. Oct 2020 B2
10812358 Navaneetha et al. Oct 2020 B2
10831549 Radhakrishnan et al. Nov 2020 B1
10931738 Radhakrishnan et al. Feb 2021 B2
10938884 Baldwin et al. Mar 2021 B1
10958501 Richardson et al. Mar 2021 B1
11108729 Richardson et al. Mar 2021 B2
11025747 Keogh Jun 2021 B1
11115500 Richardson et al. Sep 2021 B2
11134134 Uppal et al. Sep 2021 B2
20010000811 May et al. May 2001 A1
20010025305 Yoshiasa et al. Sep 2001 A1
20010027479 Delaney et al. Oct 2001 A1
20010032133 Moran Oct 2001 A1
20010034704 Farhat et al. Oct 2001 A1
20010049741 Skene et al. Dec 2001 A1
20010052016 Skene et al. Dec 2001 A1
20010056416 Garcia-Luna-Aceves Dec 2001 A1
20010056500 Farber et al. Dec 2001 A1
20020002613 Freeman et al. Jan 2002 A1
20020004816 Vange et al. Jan 2002 A1
20020004846 Garcia-Luna-Aceves et al. Jan 2002 A1
20020007404 Vange et al. Jan 2002 A1
20020007413 Garcia-Luna-Aceves et al. Jan 2002 A1
20020009079 Jungck et al. Jan 2002 A1
20020010783 Primak et al. Jan 2002 A1
20020010798 Ben-Shaul et al. Jan 2002 A1
20020013823 Eubanks Jan 2002 A1
20020016831 Peled et al. Feb 2002 A1
20020035624 Kim Mar 2002 A1
20020048269 Hong et al. Apr 2002 A1
20020049608 Hartsell et al. Apr 2002 A1
20020049842 Huetsch et al. Apr 2002 A1
20020049857 Farber et al. Apr 2002 A1
20020006591 Dutta May 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
20020083175 Afek Jun 2002 A1
20020083178 Brothers Jun 2002 A1
20020083198 Kim et al. Jun 2002 A1
20020087374 Boubez et al. Jul 2002 A1
20020087726 Macpherson et al. Jul 2002 A1
20020087797 Adrangi Jul 2002 A1
20020091786 Yamaguchi et al. Jul 2002 A1
20020091801 Lewin et al. Jul 2002 A1
20020092026 Janniello et al. Jul 2002 A1
20020099616 Sweldens Jul 2002 A1
20020099850 Farber et al. Jul 2002 A1
20020101836 Dorenbosch Aug 2002 A1
20020103820 Cartmell et al. Aug 2002 A1
20020103972 Satran et al. Aug 2002 A1
20020107944 Bai et al. Aug 2002 A1
20020112049 Elnozahy et al. Aug 2002 A1
20020112123 Becker et al. Aug 2002 A1
20020116481 Lee Aug 2002 A1
20020116491 Boyd et al. Aug 2002 A1
20020116582 Copeland et al. Aug 2002 A1
20020120666 Landsman et al. Aug 2002 A1
20020120782 Dillon et al. Aug 2002 A1
20020124047 Gartner et al. Sep 2002 A1
20020124098 Shaw Sep 2002 A1
20020129123 Johnson et al. Sep 2002 A1
20020131428 Pecus et al. Sep 2002 A1
20020133601 Kennamer et al. Sep 2002 A1
20020133741 Maeda et al. Sep 2002 A1
20020135611 Deosaran et al. Sep 2002 A1
20020138286 Engstrom Sep 2002 A1
20020138437 Lewin et al. Sep 2002 A1
20020138443 Schran et al. Sep 2002 A1
20020138649 Cartmell et al. Sep 2002 A1
20020138761 Kanemaki et al. Sep 2002 A1
20020143675 Orshan Oct 2002 A1
20020143798 Lisiecki et al. Oct 2002 A1
20020143989 Huitema et al. Oct 2002 A1
20020145993 Chowdhury et al. Oct 2002 A1
20020147770 Tang Oct 2002 A1
20020147774 Lisiecki et al. Oct 2002 A1
20020150094 Cheng et al. Oct 2002 A1
20020150276 Chang Oct 2002 A1
20020152326 Orshan Oct 2002 A1
20020154157 Sherr et al. Oct 2002 A1
20020156884 Bertram et al. Oct 2002 A1
20020156911 Croman et al. Oct 2002 A1
20020161745 Call Oct 2002 A1
20020161767 Shapiro et al. Oct 2002 A1
20020163882 Bornstein et al. Nov 2002 A1
20020165912 Wenocur et al. Nov 2002 A1
20020169890 Beaumont et al. Nov 2002 A1
20020184368 Wang Dec 2002 A1
20020187935 Redmond et al. Dec 2002 A1
20020188722 Banerjee et al. Dec 2002 A1
20020194324 Guha Dec 2002 A1
20020194382 Kausik et al. Dec 2002 A1
20020198953 O'Rourke et al. Dec 2002 A1
20030002484 Freedman Jan 2003 A1
20030004998 Datta Jan 2003 A1
20030005036 Mitzenmacher Jan 2003 A1
20030005111 Allan Jan 2003 A1
20030007482 Khello et al. Jan 2003 A1
20030009488 Hart, III Jan 2003 A1
20030009591 Hayball et al. Jan 2003 A1
20030026410 Lumsden Feb 2003 A1
20030028642 Agarwal et al. Feb 2003 A1
20030033283 Evans et al. Feb 2003 A1
20030037108 Peiffer et al. Feb 2003 A1
20030037139 Shteyn Feb 2003 A1
20030037284 Srinivasan et al. Feb 2003 A1
20030041094 Lara et al. Feb 2003 A1
20030046343 Krishnamurthy et al. Mar 2003 A1
20030065739 Shnier Apr 2003 A1
20030070096 Pazi et al. Apr 2003 A1
20030074401 Connell et al. Apr 2003 A1
20030074471 Anderson et al. Apr 2003 A1
20030074472 Lucco et al. Apr 2003 A1
20030079027 Slocombe et al. Apr 2003 A1
20030093523 Cranor et al. May 2003 A1
20030097564 Tewari et al. May 2003 A1
20030099202 Lear et al. May 2003 A1
20030099237 Mitra et al. May 2003 A1
20030101278 Garcia-Luna-Aceves et al. May 2003 A1
20030105829 Hayward Jun 2003 A1
20030105857 Kamen et al. Jun 2003 A1
20030112792 Cranor et al. Jun 2003 A1
20030120741 Wu et al. Jun 2003 A1
20030126387 Watanabe Jul 2003 A1
20030133554 Nykanen et al. Jul 2003 A1
20030135467 Okamoto Jul 2003 A1
20030135509 Davis et al. Jul 2003 A1
20030140087 Lincoln et al. Jul 2003 A1
20030145038 Bin Tariq et al. Jul 2003 A1
20030145066 Okada et al. Jul 2003 A1
20030149581 Chaudhri et al. Aug 2003 A1
20030154239 Davis et al. Aug 2003 A1
20030154284 Bernardin et al. Aug 2003 A1
20030163722 Anderson, IV Aug 2003 A1
20030172145 Nguyen Sep 2003 A1
20030172183 Anderson, IV et al. Sep 2003 A1
20030172291 Judge et al. Sep 2003 A1
20030174648 Wang et al. Sep 2003 A1
20030177321 Watanabe Sep 2003 A1
20030182305 Balva et al. Sep 2003 A1
20030182413 Allen et al. Sep 2003 A1
20030182447 Schilling Sep 2003 A1
20030187935 Agarwalla et al. Oct 2003 A1
20030187970 Chase et al. Oct 2003 A1
20030191822 Leighton et al. Oct 2003 A1
20030200394 Ashmore et al. Oct 2003 A1
20030204602 Hudson et al. Oct 2003 A1
20030204742 Gupta Oct 2003 A1
20030206520 Wu et al. Nov 2003 A1
20030221000 Cherkasova et al. Nov 2003 A1
20030225893 Roese et al. Dec 2003 A1
20030229682 Day Dec 2003 A1
20030233423 Dilley et al. Dec 2003 A1
20030233445 Levy et al. Dec 2003 A1
20030233455 Leber et al. Dec 2003 A1
20030236700 Arning et al. Dec 2003 A1
20030236779 Choi et al. Dec 2003 A1
20040003032 Ma et al. Jan 2004 A1
20040010562 Itonaga Jan 2004 A1
20040010563 Forte et al. Jan 2004 A1
20040010588 Slater et al. Jan 2004 A1
20040010601 Afergan et al. Jan 2004 A1
20040010621 Afergan et al. Jan 2004 A1
20040010683 Huitema Jan 2004 A1
20040015584 Cartmell et al. Jan 2004 A1
20040019518 Abraham et al. Jan 2004 A1
20040019781 Chari et al. Jan 2004 A1
20040024841 Becker et al. Jan 2004 A1
20040030620 Benjamin et al. Feb 2004 A1
20040032278 Orii et al. Feb 2004 A1
20040034744 Karlsson et al. Feb 2004 A1
20040039798 Hotz et al. Feb 2004 A1
20040044731 Chen et al. Feb 2004 A1
20040044791 Pouzzner Mar 2004 A1
20040054757 Ueda et al. Mar 2004 A1
20040059805 Dinker et al. Mar 2004 A1
20040064335 Yang Apr 2004 A1
20040064501 Jan et al. Apr 2004 A1
20040068542 Lalonde et al. Apr 2004 A1
20040073596 Kloninger et al. Apr 2004 A1
20040073707 Dillon Apr 2004 A1
20040073867 Kausik et al. Apr 2004 A1
20040078468 Hedin et al. Apr 2004 A1
20040078487 Cernohous et al. Apr 2004 A1
20040083283 Sundaram et al. Apr 2004 A1
20040083307 Uysal Apr 2004 A1
20040105544 Haneda et al. Apr 2004 A1
20040098478 Koetke et al. May 2004 A1
20040114579 Karaoguz et al. Jun 2004 A1
20040117309 Inoue et al. Jun 2004 A1
20040117455 Kaminksy et al. Jun 2004 A1
20040128344 Trossen Jun 2004 A1
20040128346 Melamed et al. Jul 2004 A1
20040148520 Talpade et al. Jul 2004 A1
20040167981 Douglas et al. Jul 2004 A1
20040167982 Cohen et al. Aug 2004 A1
20040170379 Yao et al. Aug 2004 A1
20040172466 Douglas et al. Sep 2004 A1
20040184456 Binding et al. Sep 2004 A1
20040194085 Beaubien et al. Sep 2004 A1
20040194102 Neerdaels Sep 2004 A1
20040203630 Wang Oct 2004 A1
20040205149 Dillon et al. Oct 2004 A1
20040205162 Parikh Oct 2004 A1
20040205374 Poletto et al. Oct 2004 A1
20040215823 Kleinfelter et al. Oct 2004 A1
20040221019 Swildens et al. Oct 2004 A1
20040221034 Kausik et al. Nov 2004 A1
20040246948 Lee et al. Nov 2004 A1
20040249939 Amini et al. Dec 2004 A1
20040249971 Klinker Dec 2004 A1
20040249975 Tuck et al. Dec 2004 A1
20040250119 Shelest et al. Dec 2004 A1
20040254921 Cohen et al. Dec 2004 A1
20040260769 Yamamoto Dec 2004 A1
20040267906 Truty Dec 2004 A1
20040267907 Gustafsson Dec 2004 A1
20050004945 Cossins et al. Jan 2005 A1
20050010653 McCanne Jan 2005 A1
20050015471 Zhang et al. Jan 2005 A1
20050021706 Maggi et al. Jan 2005 A1
20050021862 Schroeder et al. Jan 2005 A1
20050027882 Sullivan et al. Jan 2005 A1
20050038967 Umbehocker et al. Feb 2005 A1
20050039019 Delany Feb 2005 A1
20050044270 Grove et al. Feb 2005 A1
20050076137 Tang et al. Apr 2005 A1
20050102683 Branson et al. Apr 2005 A1
20050097445 Day 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 May 2005 A1
20050132083 Raciborski et al. Jun 2005 A1
20050147088 Bao et al. Jun 2005 A1
20050149529 Gutmans Jul 2005 A1
20050157712 Rangarajan et al. Jul 2005 A1
20050160133 Greenlee et al. Jul 2005 A1
20050163168 Sheth et al. Jul 2005 A1
20050168782 Kobashi et al. Jul 2005 A1
20050171959 Deforche et al. Aug 2005 A1
20050172080 Miyauchi Aug 2005 A1
20050174989 Chen et al. Aug 2005 A1
20050181769 Kogawa Aug 2005 A1
20050188073 Nakamichi et al. Aug 2005 A1
20050192814 Challener et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050198170 LeMay et al. Sep 2005 A1
20050198200 Subramanian et al. Sep 2005 A1
20050198303 Knauerhase et al. Sep 2005 A1
20050198334 Farber et al. Sep 2005 A1
20050198453 Osaki Sep 2005 A1
20050198571 Kramer et al. Sep 2005 A1
20050201302 Gaddis et al. Sep 2005 A1
20050216483 Armstrong et al. Sep 2005 A1
20050216569 Coppola et al. Sep 2005 A1
20050216674 Robbin et al. Sep 2005 A1
20050223095 Volz et al. Oct 2005 A1
20050228856 Swildens et al. Oct 2005 A1
20050229119 Torvinen Oct 2005 A1
20050232165 Brawn et al. Oct 2005 A1
20050234864 Shapiro Oct 2005 A1
20050240574 Challenger et al. Oct 2005 A1
20050256880 Nam Koong et al. Oct 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. Nov 2005 A1
20050267928 Anderson et al. Dec 2005 A1
20050267937 Daniels et al. Dec 2005 A1
20050267991 Huitema et al. Dec 2005 A1
20050267992 Huitema et al. Dec 2005 A1
20050267993 Huitema et al. Dec 2005 A1
20050278259 Gunaseelan et al. Dec 2005 A1
20050283759 Peteanu et al. Dec 2005 A1
20050283784 Suzuki Dec 2005 A1
20050286564 Hatley et al. Dec 2005 A1
20060005014 Aura et al. Jan 2006 A1
20060013158 Ahuja et al. Jan 2006 A1
20060020596 Liu et al. Jan 2006 A1
20060020684 Mukherjee et al. Jan 2006 A1
20060020714 Girouard et al. Jan 2006 A1
20060020715 Jungck Jan 2006 A1
20060020807 Aura Jan 2006 A1
20060021001 Giles et al. Jan 2006 A1
20060026067 Nicholas et al. Jan 2006 A1
20060026154 Altinel et al. Feb 2006 A1
20060031239 Koenig Feb 2006 A1
20060031319 Nelson et al. Feb 2006 A1
20060031503 Gilbert Feb 2006 A1
20060034494 Holloran Feb 2006 A1
20060036720 Faulk, Jr. Feb 2006 A1
20060036966 Yevdayev Feb 2006 A1
20060037037 Miranz Feb 2006 A1
20060039352 Karstens Feb 2006 A1
20060041614 Oe Feb 2006 A1
20060045005 Blackmore et al. Feb 2006 A1
20060047787 Aggarwal et al. Mar 2006 A1
20060047813 Aggarwal et al. Mar 2006 A1
20060059246 Grove Mar 2006 A1
20060063534 Kokkonen et al. Mar 2006 A1
20060064476 Decasper et al. Mar 2006 A1
20060064500 Roth et al. Mar 2006 A1
20060074750 Clark et al. Mar 2006 A1
20060075084 Lyon Apr 2006 A1
20060075139 Jungck Apr 2006 A1
20060083165 McLane et al. Apr 2006 A1
20060085536 Meyer et al. Apr 2006 A1
20060088026 Mazur et al. Apr 2006 A1
20060106938 Dini et al. Apr 2006 A1
20060107036 Randle et al. May 2006 A1
20060112066 Hamzy May 2006 A1
20060112176 Liu et al. May 2006 A1
20060120385 Atchison et al. May 2006 A1
20060129665 Toebes et al. Jun 2006 A1
20060129766 Cassia et al. Jun 2006 A1
20060136453 Kwan Jun 2006 A1
20060143293 Freedman Jun 2006 A1
20060143442 Smith Jun 2006 A1
20060146820 Friedman et al. Jun 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 Jul 2006 A1
20060173855 Turner et al. Aug 2006 A1
20060179080 Meek et al. Aug 2006 A1
20060184936 Abels et al. Aug 2006 A1
20060188097 Taniguchi et al. Aug 2006 A1
20060190605 Franz et al. Aug 2006 A1
20060193247 Naseh et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060206568 Verma et al. Aug 2006 A1
20060206586 Ling et al. Sep 2006 A1
20060218265 Farber et al. Sep 2006 A1
20060218304 Mukherjee et al. Sep 2006 A1
20060221971 Andrieux et al. Sep 2006 A1
20060224752 Parekh et al. Oct 2006 A1
20060227740 McLaughlin et al. Oct 2006 A1
20060227758 Rana et al. Oct 2006 A1
20060230137 Gare et al. Oct 2006 A1
20060230265 Krishna Oct 2006 A1
20060233155 Srivastava Oct 2006 A1
20060242227 Rao Oct 2006 A1
20060253546 Chang et al. Nov 2006 A1
20060253609 Andreev et al. Nov 2006 A1
20060259581 Piersol Nov 2006 A1
20060259690 Vittal et al. Nov 2006 A1
20060259984 Juneau Nov 2006 A1
20060265497 Ohata et al. Nov 2006 A1
20060265508 Angel et al. Nov 2006 A1
20060265516 Schilling Nov 2006 A1
20060265720 Cai et al. Nov 2006 A1
20060271641 Stavrakos et al. Nov 2006 A1
20060282522 Lewin et al. Nov 2006 A1
20060070060 Tantawi et al. Dec 2006 A1
20060282505 Hasha et al. Dec 2006 A1
20060288119 Kim et al. Dec 2006 A1
20060288424 Saito Dec 2006 A1
20070005689 Leighton et al. Jan 2007 A1
20070005801 Kumar et al. Jan 2007 A1
20070005892 Mullender et al. Jan 2007 A1
20070011267 Overton et al. Jan 2007 A1
20070014241 Banerjee et al. Jan 2007 A1
20070021998 Laithwaite et al. Jan 2007 A1
20070028001 Phillips et al. Jan 2007 A1
20070038729 Sullivan et al. Feb 2007 A1
20070038994 Davis et al. Feb 2007 A1
20070041393 Westhead et al. Feb 2007 A1
20070043667 Qawami et al. Feb 2007 A1
20070043859 Ruul Feb 2007 A1
20070050522 Grove et al. Feb 2007 A1
20070050703 Lebel Mar 2007 A1
20070055764 Dilley et al. Mar 2007 A1
20070055765 Lisiecki et al. Mar 2007 A1
20070061440 Sundaram et al. Mar 2007 A1
20070064610 Khandani Mar 2007 A1
20070076872 Juneau Mar 2007 A1
20070086429 Lawrence et al. Apr 2007 A1
20070094361 Hoynowski et al. Apr 2007 A1
20070101377 Six et al. Apr 2007 A1
20070101061 Baskaran et al. May 2007 A1
20070118667 McCarthy et al. May 2007 A1
20070118668 McCarthy et al. May 2007 A1
20070124309 Takase et al. May 2007 A1
20070134641 Lieu May 2007 A1
20070156726 Levy Jun 2007 A1
20070156919 Potti et al. Jul 2007 A1
20070162331 Sullivan Jul 2007 A1
20070168336 Ransil et al. Jul 2007 A1
20070168517 Weller Jul 2007 A1
20070174426 Swildens et al. Jul 2007 A1
20070174442 Sherman et al. Jul 2007 A1
20070174490 Choi et al. Jul 2007 A1
20070183342 Wong et al. Jul 2007 A1
20070195800 Yang et al. Aug 2007 A1
20070198982 Bolan et al. Aug 2007 A1
20070204107 Greenfield et al. Aug 2007 A1
20070208737 Li et al. Aug 2007 A1
20070214232 Belimpasakis et al. Sep 2007 A1
20070219795 Park et al. Sep 2007 A1
20070220010 Ertugrul Sep 2007 A1
20070226294 Pruitt et al. Sep 2007 A1
20070233705 Farber et al. Sep 2007 A1
20070233706 Farber et al. Oct 2007 A1
20070233846 Farber et al. Oct 2007 A1
20070233884 Farber et al. Oct 2007 A1
20070233896 Hilt et al. Oct 2007 A1
20070242824 Vishik Oct 2007 A1
20070243860 Aiello et al. Oct 2007 A1
20070244964 Challenger et al. Oct 2007 A1
20070245022 Olliphant et al. Oct 2007 A1
20070250467 Mesnik et al. Oct 2007 A1
20070250468 Pieper Oct 2007 A1
20070250560 Wein et al. Oct 2007 A1
20070250601 Amlekar et al. Oct 2007 A1
20070250611 Bhogal et al. Oct 2007 A1
20070253377 Janneteau et al. Oct 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
20070271608 Shimizu et al. Nov 2007 A1
20070280197 Pearlman et al. Nov 2007 A1
20070280229 Kenney Dec 2007 A1
20070281689 Altman et al. Dec 2007 A1
20070288588 Wein et al. Dec 2007 A1
20070291739 Sullivan et al. Dec 2007 A1
20070294419 Levitch Dec 2007 A1
20080005057 Ozzie et al. Jan 2008 A1
20080005275 Overton et al. Jan 2008 A1
20080008089 Bornstein et al. Jan 2008 A1
20080016233 Schneider Jan 2008 A1
20080028463 Dagon et al. Jan 2008 A1
20080222647 Taylor et al. Jan 2008 A1
20080037536 Padmanabhan et al. Feb 2008 A1
20080046550 Mazur et al. Feb 2008 A1
20080046596 Afergan et al. Feb 2008 A1
20080049615 Bugenhagen Feb 2008 A1
20080056207 Eriksson et al. Feb 2008 A1
20080062997 Nix Mar 2008 A1
20080065724 Seed et al. Mar 2008 A1
20080065745 Leighton et al. Mar 2008 A1
20080066072 Yurekli et al. Mar 2008 A1
20080071859 Seed et al. Mar 2008 A1
20080071925 Leighton et al. Mar 2008 A1
20080071987 Karn et al. Mar 2008 A1
20080072264 Crayford Mar 2008 A1
20080082551 Farber et al. Mar 2008 A1
20080082662 Dandliker et al. Apr 2008 A1
20080086434 Chesla Apr 2008 A1
20080086559 Davis et al. Apr 2008 A1
20080086574 Raciborski et al. Apr 2008 A1
20080092242 Rowley Apr 2008 A1
20080101358 Van Ewijk et al. 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. May 2008 A1
20080140800 Farber et al. Jun 2008 A1
20080147866 Stolorz et al. Jun 2008 A1
20080147873 Matsumoto Jun 2008 A1
20080155059 Hardin et al. Jun 2008 A1
20080155061 Afergan et al. Jun 2008 A1
20080155613 Benya et al. Jun 2008 A1
20080155614 Cooper et al. Jun 2008 A1
20080155694 Kwon et al. Jun 2008 A1
20080162667 Verma et al. Jun 2008 A1
20080162821 Duran et al. Jul 2008 A1
20080162843 Davis et al. Jul 2008 A1
20080172488 Jawahar et al. Jul 2008 A1
20080175222 Barnea et al. Jul 2008 A1
20080184357 Drako et al. Jul 2008 A1
20080189437 Halley Jul 2008 A1
20080201332 Souders et al. Aug 2008 A1
20080201401 Pugh et al. Aug 2008 A1
20080025304 Venkataswami et al. Sep 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
20080225779 Bragiel et al. Sep 2008 A1
20080228574 Stewart et al. Sep 2008 A1
20080228920 Souders et al. Sep 2008 A1
20080235383 Schneider Sep 2008 A1
20080235400 Slocombe et al. Sep 2008 A1
20080256087 Piironen et al. Oct 2008 A1
20080256175 Lee et al. Oct 2008 A1
20080263135 Olliphant Oct 2008 A1
20080270882 Rollins et al. Oct 2008 A1
20080275772 Suryanarayana et al. Oct 2008 A1
20080281946 Swildens et al. Nov 2008 A1
20080281950 Wald et al. Nov 2008 A1
20080288458 Sun et al. Nov 2008 A1
20080288722 Lecoq et al. Nov 2008 A1
20080301670 Gouge et al. Nov 2008 A1
20080312766 Couckuyt Dec 2008 A1
20080319862 Golan et al. Dec 2008 A1
20080320123 Houlihan et al. Dec 2008 A1
20080320269 Houlihan et al. Dec 2008 A1
20090013063 Soman Jan 2009 A1
20090016236 Alcala et al. Jan 2009 A1
20090029644 Sue et al. Jan 2009 A1
20090031042 Phatak Jan 2009 A1
20090031367 Sue Jan 2009 A1
20090031368 Ling Jan 2009 A1
20090031376 Riley et al. Jan 2009 A1
20090043900 Barber Feb 2009 A1
20090049098 Pickelsimer et al. Feb 2009 A1
20090063038 Shrivathsan et al. Feb 2009 A1
20090063704 Taylor et al. Mar 2009 A1
20090070533 Elazary et al. Mar 2009 A1
20090083228 Shatz et al. Mar 2009 A1
20090083279 Hasek Mar 2009 A1
20090083413 Levow et al. Mar 2009 A1
20090086728 Gulati et al. Mar 2009 A1
20090086741 Zhang Apr 2009 A1
20090089869 Varghese Apr 2009 A1
20090094252 Wong et al. Apr 2009 A1
20090103707 McGary et al. Apr 2009 A1
20090106202 Mizrahi Apr 2009 A1
20090106381 Kasriel et al. Apr 2009 A1
20090109854 Rajpathak Apr 2009 A1
20090112703 Brown Apr 2009 A1
20090125393 Hwang et al. May 2009 A1
20090125934 Jones et al. May 2009 A1
20090132368 Cotter et al. May 2009 A1
20090132640 Verma et al. May 2009 A1
20090132648 Swildens et al. May 2009 A1
20090138533 Iwasaki et al. May 2009 A1
20090138582 Turk May 2009 A1
20090144411 Winkler et al. May 2009 A1
20090144412 Ferguson et al. Jun 2009 A1
20090144496 Kawaguchi Jun 2009 A1
20090150926 Schlack Jun 2009 A1
20090157504 Braemer et al. Jun 2009 A1
20090157850 Gagliardi et al. Jun 2009 A1
20090157899 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. Jun 2009 A1
20090172167 Drai 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. Jul 2009 A1
20090204682 Jeyaseelan et al. Aug 2009 A1
20090210549 Hudson et al. Aug 2009 A1
20090228708 Trostle Aug 2009 A1
20090233623 Johnson Sep 2009 A1
20090241167 Moore Sep 2009 A1
20090248697 Richardson et al. Sep 2009 A1
20090248786 Richardson et al. Oct 2009 A1
20090248787 Sivasubramanian et al. Oct 2009 A1
20090248852 Fuhrmann et al. Oct 2009 A1
20090248858 Sivasubramanian et al. Oct 2009 A1
20090248893 Richardson et al. Oct 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090253435 Olofsson Oct 2009 A1
20090254661 Fullagar et al. Oct 2009 A1
20090254989 Achan et al. Oct 2009 A1
20090259588 Lindsay Oct 2009 A1
20090259971 Rankine et al. Oct 2009 A1
20090262741 Jungck et al. Oct 2009 A1
20090265707 Goodman et al. Oct 2009 A1
20090265786 Xie et al. Oct 2009 A1
20090271498 Cable Oct 2009 A1
20090271577 Campana et al. Oct 2009 A1
20090271730 Rose et al. Oct 2009 A1
20090276771 Nickolov et al. Oct 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 Nov 2009 A1
20090327489 Swildens et al. Dec 2009 A1
20090327517 Sivasubramanian et al. Dec 2009 A1
20090327914 Adar et al. Dec 2009 A1
20100005175 Swildens et al. Jan 2010 A1
20100011061 Hudson et al. Jan 2010 A1
20100011126 Hsu et al. Jan 2010 A1
20100020699 On Jan 2010 A1
20100023601 Lewin et al. Jan 2010 A1
20100023621 Ezolt et al. Jan 2010 A1
20100030662 Klein Jan 2010 A1
20100030914 Sparks et al. Feb 2010 A1
20100034381 Trace Feb 2010 A1
20100034470 Valencia-Campo et al. Feb 2010 A1
20100036944 Douglis et al. Feb 2010 A1
20100037314 Perdisci et al. Feb 2010 A1
20100042725 Jeon et al. Feb 2010 A1
20100049862 Dixon Feb 2010 A1
20100057894 Glasser Feb 2010 A1
20100058352 Esfahany et al. Mar 2010 A1
20100070603 Moss et al. Mar 2010 A1
20100070700 Borst et al. Mar 2010 A1
20100074268 Raza Mar 2010 A1
20100082320 Wood et al. Mar 2010 A1
20100082787 Kommula et al. Apr 2010 A1
20100088367 Brown et al. Apr 2010 A1
20100088405 Huang et al. Apr 2010 A1
20100095008 Joshi Apr 2010 A1
20100100629 Raciborski et al. Apr 2010 A1
20100103837 Jungck et al. Apr 2010 A1
20100111059 Bappu et al. Apr 2010 A1
20100161564 Lee et al. Apr 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. May 2010 A1
20100106934 Calder et al. Jun 2010 A1
20100150155 Napierala Jun 2010 A1
20100161565 Lee et al. Jun 2010 A1
20100161799 Maloo Jun 2010 A1
20100169392 Lev Ran et al. Jun 2010 A1
20100169452 Atluri et al. Jul 2010 A1
20100174811 Musiri et al. Jul 2010 A1
20100191854 Isci et al. Jul 2010 A1
20100192225 Ma et al. Jul 2010 A1
20100217801 Leighton et al. Aug 2010 A1
20100217856 Falkena Aug 2010 A1
20100223364 Wei Aug 2010 A1
20100025071 Cadwell et al. Sep 2010 A1
20100226372 Watanabe Sep 2010 A1
20100228819 Wei Sep 2010 A1
20100235915 Memon et al. Sep 2010 A1
20100257024 Holmes et al. Sep 2010 A1
20100257266 Holmes et al. Oct 2010 A1
20100257566 Matila Oct 2010 A1
20100262964 Uyeda et al. Oct 2010 A1
20100268789 Yoo et al. Oct 2010 A1
20100268814 Cross et al. Oct 2010 A1
20100274765 Murphy et al. Oct 2010 A1
20100281482 Pike et al. Oct 2010 A1
20100293296 Hsu et al. Nov 2010 A1
20100293479 Rousso et al. Nov 2010 A1
20100299427 Joshi Nov 2010 A1
20100299438 Zimmerman et al. Nov 2010 A1
20100299439 McCarthy et al. Nov 2010 A1
20100306382 Cardosa et al. Nov 2010 A1
20100312861 Kolhi et al. Dec 2010 A1
20100318508 Brawer et al. Dec 2010 A1
20100322255 Hao et al. Dec 2010 A1
20100325365 Colglazier et al. Dec 2010 A1
20100332595 Fullagar et al. Dec 2010 A1
20100332601 Walter et al. Dec 2010 A1
20100332658 Elyashev Dec 2010 A1
20110010244 Hatridge Jan 2011 A1
20110016214 Jackson Jan 2011 A1
20110029598 Arnold et al. Jan 2011 A1
20110029398 Boudville Feb 2011 A1
20110035469 Smith Feb 2011 A1
20110040893 Karaoguz et al. Feb 2011 A1
20110051738 Xu Feb 2011 A1
20110055386 Middleton et al. Mar 2011 A1
20110055714 Vemulapalli et al. Mar 2011 A1
20110055921 Narayanaswamy et al. Mar 2011 A1
20110057790 Martin et al. Mar 2011 A1
20110058675 Brueck et al. Mar 2011 A1
20110072138 Canturk et al. Mar 2011 A1
20110072366 Spencer Mar 2011 A1
20110078000 Ma et al. Mar 2011 A1
20110078230 Sepulveda Mar 2011 A1
20110085654 Jana et al. Mar 2011 A1
20110082916 Swanson et al. Apr 2011 A1
20110087769 Holmes et al. Apr 2011 A1
20110093584 Qiu et al. Apr 2011 A1
20110096987 Morales et al. Apr 2011 A1
20110099294 Kapur et al. Apr 2011 A1
20110106949 Patel et al. Apr 2011 A1
20110113467 Agarwal et al. May 2011 A1
20110125894 Anderson et al. May 2011 A1
20110153938 Verzunov et al. Jun 2011 A1
20110153941 Spatscheck et al. Jun 2011 A1
20110154318 Oshins et al. Jun 2011 A1
20110154350 Doyle et al. Jun 2011 A1
20110161461 Niven-Jenkins Jun 2011 A1
20110166935 Armentrout et al. Jun 2011 A1
20110182290 Perkins Jul 2011 A1
20110191445 Dazzi Jul 2011 A1
20110191446 Dazzi et al. Aug 2011 A1
20110191447 Dazzi et al. Aug 2011 A1
20110191449 Swildens et al. Aug 2011 A1
20110191459 Joshi Aug 2011 A1
20110196892 Xia Aug 2011 A1
20110202705 Hayashi et al. 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. Aug 2011 A1
20110219372 Agarwal et al. Sep 2011 A1
20110238501 Almeida Sep 2011 A1
20110238793 Bedare et al. Sep 2011 A1
20110239215 Sugai Sep 2011 A1
20110252142 Richardson et al. Sep 2011 A1
20110252143 Baumback et al. Oct 2011 A1
20110255445 Johnson et al. Oct 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110258614 Tamm Oct 2011 A1
20110270964 Huang et al. Oct 2011 A1
20110276623 Girbal Nov 2011 A1
20110282988 Wang et al. Nov 2011 A1
20110296053 Medved et al. Nov 2011 A1
20110295940 Saleem et al. Dec 2011 A1
20110295942 Raghunath et al. Dec 2011 A1
20110296370 Ferris et al. Dec 2011 A1
20110296473 Babic Dec 2011 A1
20110302304 Baumback et al. Dec 2011 A1
20110307533 Saeki Dec 2011 A1
20110320522 Endres et al. Dec 2011 A1
20110320559 Foti Dec 2011 A1
20120011190 Driesen et al. Jan 2012 A1
20120014249 Mao et al. Jan 2012 A1
20120023226 Petersen et al. Jan 2012 A1
20120036238 Sundaram et al. Jan 2012 A1
20120031626 Clayton et al. Feb 2012 A1
20120041899 Greene et al. Feb 2012 A1
20120041970 Ghosh et al. Feb 2012 A1
20120042381 Antonakakis et al. Feb 2012 A1
20120054860 Wyschogrod et al. Feb 2012 A1
20120066360 Ghosh Mar 2012 A1
20120072600 Richardson et al. Mar 2012 A1
20120072608 Peters et al. Mar 2012 A1
20120078998 Son et al. Mar 2012 A1
20120079096 Cowan et al. Mar 2012 A1
20120079115 Richardson et al. Mar 2012 A1
20120089700 Safruti et al. Mar 2012 A1
20120023090 Holloway et al. Apr 2012 A1
20120089972 Scheidel et al. Apr 2012 A1
20120096065 Suit et al. Apr 2012 A1
20120096166 Devarapalli et al. Apr 2012 A1
20120110515 Abramoff et al. Apr 2012 A1
20120117621 Kondamuru et al. May 2012 A1
20120124184 Sakata et al. May 2012 A1
20120131177 Brandt et al. May 2012 A1
20120136697 Peles et al. May 2012 A1
20120142310 Pugh et al. 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. Jun 2012 A1
20120173760 Jog et al. Jul 2012 A1
20120179796 Nagaraj et al. Jul 2012 A1
20120179817 Bade et al. Jul 2012 A1
20120179839 Raciborski et al. Jul 2012 A1
20120198043 Hesketh et al. Jul 2012 A1
20120198071 Black et al. Aug 2012 A1
20120204176 Tian et al. Aug 2012 A1
20120209942 Zehavi et al. Aug 2012 A1
20120222005 Harris et al. Aug 2012 A1
20120224516 Stojanovski et al. Aug 2012 A1
20120226649 Kovacs et al. Sep 2012 A1
20120233329 Dickinson et al. Sep 2012 A1
20120233522 Barton et al. Sep 2012 A1
20120233668 Leafe et al. Sep 2012 A1
20120239725 Hartrick et al. Sep 2012 A1
20120246129 Rothschild et al. Sep 2012 A1
20120246257 Brown Sep 2012 A1
20120254961 Kim et al. Sep 2012 A1
20120257628 Bu et al. Oct 2012 A1
20120259954 McCarthy et al. Oct 2012 A1
20120272224 Brackman Oct 2012 A1
20120278229 Vishwanathan et al. Oct 2012 A1
20120278831 van Coppenolle et al. Nov 2012 A1
20120278833 Tam Nov 2012 A1
20120297009 Amir et al. Nov 2012 A1
20120303785 Sivasubramanian et al. Nov 2012 A1
20120303804 Sundaram et al. Nov 2012 A1
20120311648 Swildens et al. Nov 2012 A1
20120317573 Osogami et al. Dec 2012 A1
20120324089 Joshi Dec 2012 A1
20130003547 Motwani et al. Jan 2013 A1
20130003735 Chao et al. Jan 2013 A1
20130007100 Trahan et al. Jan 2013 A1
20130007101 Trahan et al. Jan 2013 A1
20130007102 Trahan et al. Jan 2013 A1
20130007241 Trahan et al. Jan 2013 A1
20130007273 Baumback et al. Jan 2013 A1
20130013764 Li et al. Jan 2013 A1
20130018945 Vendrow et al. Jan 2013 A1
20130019311 Swildens et al. Jan 2013 A1
20130034099 Hikichi et al. Jan 2013 A1
20130036307 Gagliano et al. Feb 2013 A1
20130041872 Aizman et al. Feb 2013 A1
20130042328 Padinjareveetil Feb 2013 A1
20130046869 Jenkins et al. Feb 2013 A1
20130046883 Lientz et al. Feb 2013 A1
20130054675 Jenkins et al. Feb 2013 A1
20130055374 Kustarz et al. Feb 2013 A1
20130067530 Spektor et al. Feb 2013 A1
20130061306 Sinn Mar 2013 A1
20130073808 Puthalath et al. Mar 2013 A1
20130080420 Taylor et al. Mar 2013 A1
20130080421 Taylor et al. Mar 2013 A1
20130080576 Taylor et al. Mar 2013 A1
20130080577 Taylor et al. Mar 2013 A1
20130080623 Thireault Mar 2013 A1
20130080627 Kukreja et al. Mar 2013 A1
20130080636 Friedman et al. Mar 2013 A1
20130086001 Bhogal et al. Mar 2013 A1
20130084898 Li et al. Apr 2013 A1
20130089005 Li et al. Apr 2013 A1
20130095806 Salkintzis et al. Apr 2013 A1
20130103834 Dzerve et al. Apr 2013 A1
20130111035 Alapati et al. Apr 2013 A1
20130117282 Mugali, Jr. et al. May 2013 A1
20130117849 Golshan et al. May 2013 A1
20130130221 Kortemeyer et al. May 2013 A1
20130133057 Yoon et al. May 2013 A1
20130151646 Chidambaram et al. May 2013 A1
20130191499 Ludin et al. Jul 2013 A1
20130198341 Kim Aug 2013 A1
20130212300 Eggleston et al. Aug 2013 A1
20130219020 McCarthy et al. Aug 2013 A1
20130227165 Liu Aug 2013 A1
20130246567 Green et al. Aug 2013 A1
20130254269 Sivasubramanian et al. Sep 2013 A1
20130254879 Chesla et al. Sep 2013 A1
20130263256 Dickinson et al. Sep 2013 A1
20130268616 Sakata et al. Oct 2013 A1
20130275549 Field et al. Oct 2013 A1
20130279335 Ahmadi Oct 2013 A1
20130283266 Baset et al. Oct 2013 A1
20130305046 Mankovski et al. Oct 2013 A1
20130305083 Machida Nov 2013 A1
20130311555 Laoutaris et al. Nov 2013 A1
20130311583 Humphreys et al. Nov 2013 A1
20130311605 Richardson et al. Nov 2013 A1
20130311989 Ota et al. Nov 2013 A1
20130339429 Richardson et al. Nov 2013 A1
20130346465 Maltz et al. Dec 2013 A1
20130346470 Obstfeld et al. Dec 2013 A1
20130346567 Richardson et al. Dec 2013 A1
20130346614 Baughman et al. Dec 2013 A1
20140006465 Davis et al. Jan 2014 A1
20140006577 Joe et al. Jan 2014 A1
20140007239 Sharpe et al. Jan 2014 A1
20140013403 Shuster Jan 2014 A1
20140019605 Boberg Jan 2014 A1
20140022951 Lemieux Jan 2014 A1
20140032658 Falls Jan 2014 A1
20140036675 Wang et al. Jan 2014 A1
20140040478 Hsu et al. Feb 2014 A1
20140047104 Rodriguez Feb 2014 A1
20140053022 Forgette et al. Feb 2014 A1
20140059198 Richardson et al. Feb 2014 A1
20140059208 Yan et al. Feb 2014 A1
20140059379 Ren et al. Feb 2014 A1
20140082165 Marr et al. Feb 2014 A1
20140082614 Klein et al. Mar 2014 A1
20140089917 Attalla et al. Mar 2014 A1
20140108672 Ou et al. Mar 2014 A1
20140108474 David et al. Apr 2014 A1
20140122698 Batrouni et al. Apr 2014 A1
20140119194 Raciborski et al. May 2014 A1
20140122725 Batrouni et al. May 2014 A1
20140137111 Dees et al. May 2014 A1
20140143305 Choi et al. May 2014 A1
20140149601 Carney et al. May 2014 A1
20140164817 Bartholomy et al. May 2014 A1
20140164584 Joe et al. Jun 2014 A1
20140165061 Greene et al. Jun 2014 A1
20140172944 Newton et al. Jun 2014 A1
20140181268 Stevens et al. Jun 2014 A1
20140195686 Yeager et al. Jun 2014 A1
20140189069 Gero et al. Jul 2014 A1
20140200036 Egner et al. Jul 2014 A1
20140215019 Ahrens Jul 2014 A1
20140244937 Bloomstein et al. Aug 2014 A1
20140258523 Kazerani et al. Sep 2014 A1
20140269371 Badea et al. Sep 2014 A1
20140279852 Chen Sep 2014 A1
20140280606 Long Sep 2014 A1
20140280679 Dey et al. Sep 2014 A1
20140297870 Eggleston et al. Sep 2014 A1
20140297866 Ennaji et al. Oct 2014 A1
20140298021 Kwon et al. Oct 2014 A1
20140310402 Giaretta et al. Oct 2014 A1
20140310811 Hentunen Oct 2014 A1
20140324774 Chen et al. Oct 2014 A1
20140325155 Marshall et al. Oct 2014 A1
20140331328 Wang et al. Oct 2014 A1
20140337472 Newton et al. Nov 2014 A1
20140351413 Smith et al. Nov 2014 A1
20140351871 Bomfim et al. Nov 2014 A1
20150006615 Wainner et al. Jan 2015 A1
20150019686 Backholm Jan 2015 A1
20150026407 Mclellan et al. Jan 2015 A1
20150067171 Yum Jan 2015 A1
20150036493 Cj et al. Feb 2015 A1
20150074228 Drake Mar 2015 A1
20150081877 Sethi et al. Mar 2015 A1
20150088586 Pavlas et al. Mar 2015 A1
20150088964 Shiell et al. Mar 2015 A1
20150088972 Brand et al. Mar 2015 A1
20150089621 Khalid Mar 2015 A1
20150095516 Bergman Mar 2015 A1
20150106864 Li et al. Apr 2015 A1
20150154051 Kruglick Apr 2015 A1
20150149600 Thibeault et al. May 2015 A1
20150149631 Lissack May 2015 A1
20150156172 Nandi et al. Jun 2015 A1
20150156279 Vaswani et al. Jun 2015 A1
20150180995 Hofmann Jun 2015 A1
20150188734 Petrov Jun 2015 A1
20150189042 Sun et al. Jul 2015 A1
20150195244 Richardson et al. Jul 2015 A1
20150200991 Kwon Jul 2015 A1
20150215388 Kontothanassis et al. Jul 2015 A1
20150215656 Pulung et al. Jul 2015 A1
20150242397 Zhuang Aug 2015 A1
20150244580 Saavedra Aug 2015 A1
20150264009 Scharber et al. Sep 2015 A1
20150271031 Beevers Sep 2015 A1
20150288647 Chhabra et al. Oct 2015 A1
20150317118 Orikasa et al. Nov 2015 A1
20150339136 Suryanarayanan et al. Nov 2015 A1
20150341431 Hartrick et al. Nov 2015 A1
20150358276 Liu et al. Nov 2015 A1
20150347311 Tanaka et al. Dec 2015 A1
20150350365 Khakpour et al. Dec 2015 A1
20150358436 Kim et al. Dec 2015 A1
20150363113 Rahman et al. Dec 2015 A1
20150363282 Rangasamy Dec 2015 A1
20160006672 Saavedra Jan 2016 A1
20160021197 Pogrebinsky et al. Jan 2016 A1
20160028598 Khakpour et al. Jan 2016 A1
20160028755 Vasseur et al. Jan 2016 A1
20160036857 Foxhoven et al. Jan 2016 A1
20160065475 Hilt et al. Feb 2016 A1
20160072669 Saavedra Mar 2016 A1
20160104346 Ovalle et al. Mar 2016 A1
20160132600 Woodhead et al. Apr 2016 A1
20160142251 Contreras et al. May 2016 A1
20160182454 Phonsa et al. May 2016 A1
20160164761 Sathyanarayana et al. Jun 2016 A1
20160164799 Popli et al. Jun 2016 A1
20160182542 Staniford Jun 2016 A1
20160241639 Brookins et al. Jun 2016 A1
20160253262 Nadgowda Aug 2016 A1
20160255042 Newton Sep 2016 A1
20160269927 Kim et al. Sep 2016 A1
20160274929 King Sep 2016 A1
20160294678 Khakpour et al. Sep 2016 A1
20160337426 Shribman et al. Oct 2016 A1
20160366202 Phillips et al. Nov 2016 A1
20160373789 Tsukagoshi Dec 2016 A1
20170041333 Mahjoub Feb 2017 A1
20170041428 Katsev Feb 2017 A1
20170099345 Leach Mar 2017 A1
20170099254 Leach et al. Apr 2017 A1
20170109316 Hack et al. Apr 2017 A1
20170153980 Araujo et al. May 2017 A1
20170155678 Araujo et al. Jun 2017 A1
20170155732 Araujo et al. Jun 2017 A1
20170163425 Kaliski, Jr. Jun 2017 A1
20170170973 Gill et al. Jun 2017 A1
20170171146 Sharma et al. Jun 2017 A1
20170180217 Puchala et al. Jun 2017 A1
20170187768 Huang et al. Jun 2017 A1
20170214761 Hsu et al. Jun 2017 A1
20170257340 Richardson et al. Jul 2017 A1
20170374121 Phillips et al. Dec 2017 A1
20180011913 Kapanipathi et al. Jan 2018 A1
20180027040 Bae Jan 2018 A1
20180077109 Hoeme et al. Jan 2018 A1
20180063193 Chandrashekhar et al. Mar 2018 A1
20180077110 Huston, III et al. Mar 2018 A1
20180173526 Prinsloo et al. Jun 2018 A1
20180176615 Hannu et al. Jun 2018 A1
20180191817 Richardson et al. Jun 2018 A1
20180302322 Richardson et al. Oct 2018 A1
20180337885 Singh et al. Nov 2018 A1
20190007515 Baldwin et al. Jan 2019 A1
20190020562 Richardson et al. Jan 2019 A1
20190028562 Watson et al. Jan 2019 A1
20190044787 Richardson et al. Jan 2019 A1
20190044846 Howard et al. Feb 2019 A1
20190074982 Hughes Mar 2019 A1
20190089542 Richardson et al. Mar 2019 A1
20190089818 Choi Mar 2019 A1
20190098109 Watson Mar 2019 A1
20190121739 Richardson et al. Apr 2019 A1
20190129908 Kumarasamy Apr 2019 A1
20190140922 Ellsworth et al. May 2019 A1
20190173941 Puchala et al. May 2019 A1
20190173972 MacCarthaigh et al. Jun 2019 A1
20190222666 Uppal et al. Jun 2019 A1
20190268265 Richardson et al. Jul 2019 A1
20190297137 Richardson et al. Sep 2019 A1
20190032751 Kalagi et al. Oct 2019 A1
20190354484 Marshall et al. Nov 2019 A1
20200065132 Mercier et al. Feb 2020 A1
20200084268 Hollis et al. Mar 2020 A1
20200195753 Richardson et al. Jun 2020 A1
20200265096 Raftery Aug 2020 A1
20200287817 Howard et al. Sep 2020 A1
20200366638 Vasquez et al. Nov 2020 A1
20200389534 Sivasubramanian et al. Dec 2020 A1
20200389541 Baldwin et al. Dec 2020 A1
20210021692 Richardson et al. Jan 2021 A1
20210042163 Radhakrishnan et al. Feb 2021 A1
20210119961 Thunga et al. Apr 2021 A1
20210185114 Baldwin et al. Jun 2021 A1
20210194806 Richardson et al. Jun 2021 A1
20210297365 Richardson et al. Sep 2021 A1
Foreign Referenced Citations (50)
Number Date Country
2741 895 May 2010 CA
2765397 Feb 2011 CA
1422468 Jun 2003 CN
1511399 Jul 2004 CN
1605182 Apr 2005 CN
101189598 May 2008 CN
101431539 May 2009 CN
101460907 Jun 2009 CN
101631133 Jan 2010 CN
103152357 Jun 2013 CN
103731481 Apr 2014 CN
104995935 Oct 2015 CN
60318825 Jan 2009 DE
1603307 Dec 2005 EP
1351141 Oct 2007 EP
2008167 Dec 2008 EP
3156911 Apr 2017 EP
07-141305 Jun 1995 JP
2001-0506093 May 2001 JP
2001-249907 Sep 2001 JP
2002-024192 Jan 2002 JP
2002-044137 Feb 2002 JP
2002-323986 Nov 2002 JP
2003-167810 Jun 2003 JP
2003-167813 Jun 2003 JP
2003-188901 Jul 2003 JP
2003-522358 Jul 2003 JP
2004-070935 Mar 2004 JP
2004-532471 Oct 2004 JP
2004-533738 Nov 2004 JP
2005-537687 Dec 2005 JP
3748216 Feb 2006 JP
2007-133896 May 2007 JP
2007-207225 Aug 2007 JP
2008-515106 May 2008 JP
2009-071538 Apr 2009 JP
2012-509623 Apr 2012 JP
2012-209623 Oct 2012 JP
WO 2001045349 Jun 2001 WO
WO 2002069608 Sep 2002 WO
WO 2005071560 Aug 2005 WO
WO 2007007960 Jan 2007 WO
WO 2007126837 Nov 2007 WO
WO 2009124006 Oct 2009 WO
WO 2010002603 Jan 2010 WO
WO 2012044587 Apr 2012 WO
WO 2012065641 May 2012 WO
WO 2014047073 Mar 2014 WO
WO 2017106455 Jun 2017 WO
WO 2018236597 Dec 2018 WO
Non-Patent Literature Citations (189)
Entry
Kuhrer et al, Going Wild: Large-Scale Classification of Open DNS Resolvers, Oct. 28, 2015, ACM Digital Library, IMC '15: Proceedings of the 2015 Internet Measurement Conference, pp. 355-368 (Year: 2015).
Office Action in Chinese Application No. 201810426428.0 dated Jul. 20, 2020 in 25 pages.
Second Office Action in Chinese Application No. 201610828846.3 dated Aug. 5, 2020.
Office Action issued in connection with European Patent Application No. 18734734 dated Oct. 19, 2020.
Zaman et al., “Combinatorial Auction-Based Dynamic VM Provisioning and Allocation in Clouds”, Department of Computer Science, Wayne State University, Sep. 2011 http://www.cs.wayne.edu/-dgrosu/pub/ccgrid12-symp.pdf.
Singapore Written Opinion in Application No. 201006837-7, dated Oct. 12, 2011 in 11 pages.
Supplementary European Search Report in Application No. 09727694.3 dated Jan. 30, 2012 in 6 pages.
Office Action in Chinese Application No. 201310717573.1 dated Jul. 29, 2016.
Office Action in Indian Application No. 2823/DELNP/2015 dated Oct. 25, 2019.
Office Action in Brazilian Application No. BR112015005588-5 dated Jan. 14, 2020.
Extended European Search Report in Application No. 16876655.8 dated Aug. 20, 2019.
“Non-Final Office Action dated Jan. 3, 2012,” U.S. Appl. No. 12/652,541; Jan. 3, 2012; 35 pages.
“Final Office Action dated Sep. 5, 2012,” U.S. Appl. No. 12/652,541; Sep. 5, 2012; 40 pages.
“Notice of Allowance dated Jan. 4, 2013,” U.S. Appl. No. 12/652,541; 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=6010099 70, XP055153445, Mar. 24, 2008.
“Global Server Load Balancing with Serverlron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages.
“Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages.
“Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/bin/view/Sungrid/OtherGridOfferings, 8 pages.
“Recent Advances Boost System Virtualization,” eWeek.com, retrieved from May 3, 2006, http://www.eWeek.eom/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.eom/smi/Press/sunflash/2002-11/sunflash.20021106.3 .XML, 2 pages.
“Sun N1 Grid Engine 6,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/gridware/index.XML, 3 pages.
“Sun Opens New Processor Design Compute Ranch,” Nov. 30, 2001, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2001-11/sunflash.20011130.1 .xml, 3 pages.
“The Softricity Desktop,” Softricity, Inc., retrieved May 3, 2006, from http://www.softricity.com/products/, 3 pages.
“Xen—The Xen virtual Machine Monitor,” University of Cambridge Computer Laboratory, retrieved Nov. 8, 2005, from http://www.cl.cam.ac.uk/Research/SRG/netos/xen/, 2 pages.
“XenFaq,” retrieved Novembers, 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-20Q4-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.
Arends et al., DNS Security Introduction and Requirements, RFC 4033, Mar. 2005, 21 pages.
Ariyapperuma et al., “Security Vulnerabilities in DNS and DNSSEC.” The Second International Conference on Availability, Reliability and Security, IEEE, 2007, 8 pages.
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 v0.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.
Chandramouli et al., “Challenges in Securing the Domain Name System.” IEEE Security & Privacy4.1 (2006),pp. 84-87.
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.
Cohen et al., “Proactive Caching of DNS Records: Addressing a Performance Bottleneck”, Proceedings of Saint 2001 Symposium On Applications and the Internet; 8-12, Jan. 8, 2001, IEEE Computer Society, pp. 85-94.
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.
Eastlake, Donald, Domain Name System Security Extensions, RFC 2535, Mar. 1999, 47 pages.
Frangoudis et al., “PTPv2-based network load estimation and its application to QoE monitoring for Over-the-Top services”, IEEE, The 5th International conference on Information, Intelligence, Systems and Applications, USA 2014, XP032629858, Jul. 7, 2014, pp. 176-181.
Gruener, J., “A Vision Of Togetherness,” May 24, 2004, Networkworld, retrieved May 3, 2006, from, http://www.networkworld.com/supp/2004/ndc3/0524virt.html, 9 pages.
Gunther et al., “Measuring Round Trip Times to determine the Distance between WLAN Nodes”,May 2005, In Proc. Of Networking 2005, all pages.
Gunther et al., “Measuring Round Trip Times to determine the Distance between WLAN Nodes”, Dec. 18, 2004, Technical University Berlin, all pages.
Guo, F., Understanding Memory Resource Management in Vmware vSphere 5.0, Vmware, 2011, pp. 1-29.
Hameed, CC, “Disk Fragmentation and System Performance”, Mar. 14, 2008, 3 pages.
Hartung et al., Digital rights management and watermarking of multimedia content for m-commerce applications; Published in: Communications Magazine, IEEE (vol. 38, Issue: 11 ); Date of Publication: Nov. 2000; pp. 78-84; IEEE Xplore.
Horvath et al., “Enhancing Energy Efficiency in Multi-tier Web Server Clusters via Prioritization,” in Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International , vol., No., pp. 1-6, Mar. 26-30, 2007.
Ioannidis, S., et al., “Implementing a Distributed Firewall,” Nov. 2000, (ACM) Proceedings of the ACM Computer and Communications Security (CCS) 2000, Athens, Greece, pp. 190-199, retrieved from http://www.cis.upenn.edu/˜dls/STRONGMAN/Papers/df.pdf, 10 pages.
JH Software, Moving a DNS Server to a New IP Address, last updated Jan. 26, 2006, 1 page.
Joseph, Joshy, et al., “Introduction to Grid Computing,” Apr. 16, 2004, retrieved Aug. 30, 2007, from http://www.informit.com/articles/printerfriendly.aspx?p=169508, 19 pages.
Kalafut et al., Understanding Implications of DNS Zone Provisioning., Proceeding IMC '08 Proceedings of the 8th AMC SIGCOMM conference on Internet measurement., pp. 211-216., ACM New York, NY, USA., 2008.
Kato, Yoshinobu , Server load balancer—Difference in distribution technique and supported protocol—Focus on function to meet the needs, Nikkei Communications, Japan, Nikkei Business Publications, Inc., Mar. 20, 2000, vol. 314, pp. 114 to 123.
Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables _ Basics.html, 4 pages.
Krsul et al., “VMPlants: Providing and Managing Virtual Machine Execution Environments for Grid Computing”, Nov. 6, 2004 (Nov. 6, 2004), Supercomputing, 2004. Proceedings Of The ACM/IEEE SC2004 Conference Pittsburgh, PA, USA Nov. 6-12, 2004, Piscataway, NJ, USA, IEEE, 1730 Massachusetts Ave., NW Washington, DC 20036-1992 USA, 12 pages.
Liu, “The Ultimate Guide to Preventing DNS-based DDoS Attacks”, Retrieved from http://www.infoworld.com/article/2612835/security/the-ultimate-guide-to-preventing-dns-based-ddos-attacks.html, Published Oct. 30, 2013.
Liu et al., “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering 61 (2007) pp. 304-330.
Maesono, et al., “A Local Scheduling Method considering Data Transfer in Data Grid,” Technical Report of IEICE, vol. 104, No. 692, pp. 435-440, The Institute of Electronics, Information and Communication Engineers, Japan, Feb. 2005.
Meng et al., “Improving the Scalability of Data Center Networks with Traffic-Aware Virtual Machine Placement”; Proceedings of the 29th Conference on Information Communications, INFOCOM'10, pp. 1154-1162. Piscataway, NJ. IEEE Press, 2010.
Mulligan et al.; How DRM-based content delivery systems disrupt expectations of “personal use”; Published in: Proceeding DRM '03 Proceedings of the 3rd ACM workshop on Digital rights management; 2003; pp. 77-89; ACM Digital Library.
Ragan, “Three Types of DNS Attacks and How to Deal with Them”, Retrieved from http://www.csoonline.com/article/2133916/malware-cybercrime/three-types-of-dns-attacks-and-how-to-deal-with-them.html, Published Aug. 28, 2013.
Shankland, S., “Sun to buy start-up to bolster N1 ,” Jul. 30, 2003, CNet News.com, retrieved May 3, 2006, http://news.zdnet.com/2100-3513_22-5057752.html, 8 pages.
Sharif et al., “Secure In-VM Monitoring Using Hardware Virtualization”, Microsoft, Oct. 2009 http://research.microsoft.com/pubs/153179/sim-ccs09.pdf; 11 pages.
Strand, L., “Adaptive distributed firewall using intrusion detection,” Nov. 1, 2004, University of Oslo Department of Informatics, retrieved Mar. 8, 2006, from http://gnist.org/˜lars/studies/master/StrandLars-master.pdf, 158 pages.
Takizawa, et al., “Scalable MultiReplication Framework on The Grid,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2004, No. 81, pp. 247-252, Japan, Aug. 1, 2004.
Tan et al., “Classification: Basic Concepts, Decision Tree, and Model Evaluation”, Introduction in Data Mining; http://www-users.cs.umn.edu/˜kumar/dmbook/ch4.pdf, 2005, pp. 245-205.
Van Renesse, R., “Astrolabe: A Robust And Scalable Technology For Distributed System Monitoring, Management, And Data Mining,” May 2003, ACM Transactions On Computer Systems (TOCS), 21 (2): 164-206, 43 pages.
Vijayan, J., “Terraspring Gives Sun's N1 a Boost,” Nov. 25, 2002, Computerworld, retrieved May 3, 2006, from http://www.computerworld.com/printthis/2002/0,4814, 76159,00.html, 3 pages.
Virtual Iron Software Home, Virtual Iron, retrieved May 3, 2006, from http://www.virtualiron.com/, 1 page.
Waldspurger, CA., “Spawn: A Distributed Computational Economy,” Feb. 1992, IEEE Transactions on Software Engineering, 18(2): 103-117, 15 pages.
Watanabe, et al., “Remote Program Shipping System for GridRPC Systems,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2003, No. 102, pp. 73-78, Japan, Oct. 16, 2003.
Xu et al., “Decision tree regression for soft classification of remote sensing data”, Remote Sensing of Environment 97 (2005) pp. 322-336.
Yamagata, et al., “A virtual-machine based fast deployment tool for Grid execution environment,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2006, No. 20, pp. 127-132, Japan, Feb. 28, 2006.
Zhao et al., “Distributed file system support for virtual machines in grid computing”, Jun. 4, 2004 (Jun. 4, 2004), High Performance Distributed Computing, 2004. Proceedings. 13th IEEE International Symposium On Honolulu, HI, USA Jun. 4-6, 2004, Piscataway, NJ, USA, IEEE, pp. 202-211.
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.
Office Action in Application No. 09729072.0 dated May 14, 2018.
Office Action in Application No. 09729072.0 dated Dec. 7, 2018.
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 Examination Report in Application No. 201006837-7 dated Mar. 16, 2012.
First Office Action in Chinese Application No. 200980111426.1 dated Feb. 16, 2013.
Second Office Action in Chinese Application No. 200980111426.1 dated Dec. 25, 2013.
Third Office Action in Chinese Application No. 200980111426.1 dated Jul. 7, 2014.
Fourth Office Action in Chinese Application No. 200980111426.1 dated Jan. 15, 2015.
Fifth Office Action in Chinese Application No. 200980111426.1 dated Aug. 14, 2015.
First Office Action in Japanese Application No. 2011-502139 dated Nov. 5, 2013.
Decision of Rejection in Application No. 2011-502139 dated Jun. 30, 2014.
Office Action in Japanese Application No. 2011-502139 dated Aug. 17, 2015.
Office Action in Indian Application No. 5937/CHENP/2010 dated Jan. 19, 2018.
Singapore Written Opinion in Application No. 201006874-0, dated Oct. 12, 2011 in 10 pages.
First Office Action in Japanese Application No. 2011-502140 dated Dec. 7, 2012.
First Office Action in Chinese Application No. 200980119995.0 dated Jul. 6, 2012.
Second Office Action in Chinese Application No. 200980119995.0 dated Apr. 15, 2013.
Examination Report in Singapore Application No. 201006874-0 dated May 16, 2012.
Search Report in European Application No. 09839809.2 dated May 11, 2015.
Office Action in European Application No. 09839809.2 dated Dec. 8, 2016.
Office Action in Indian Application No. 6210/CHENP/2010 dated Mar. 27, 2018.
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.
Supplementary European Search Report in Application No. 09728756.9 dated Jan. 8, 2013.
First Office Action in Japanese Application No. 2011-503091 dated Nov. 18, 2013.
Office Action in Japanese Application No. 2014-225580 dated Oct. 26, 2015.
Office Action in Japanese Application No. 2014-225580 dated Oct. 3, 2016.
Search Report and Written Opinion issued in Singapore Application No. 201006873-2 dated Oct. 12, 2011.
Examination Report in Indian Application No. 6213/CHENP/2010 dated May 23, 2018.
First Office Action is Chinese Application No. 200980125551.8 dated Jul. 4, 2012.
First Office Action in Japanese Application No. 2011-516466 dated Mar. 6, 2013.
Second Office Action in Japanese Application No. 2011-516466 dated Mar. 17, 2014.
Decision of Refusal in Japanese Application No. 2011-516466 dated Jan. 16, 2015.
Office Action in Japanese Application No. 2011-516466 dated May 30, 2016.
Office Action in Canadian Application No. 2726915 dated May 13, 2013.
First Office Action in Korean Application No. 10-2011-7002461 dated May 29, 2013.
First Office Action in Chinese Application No. 200980145872.4 dated Nov. 29, 2012.
First Office Action in Canadian Application No. 2741895 dated Feb. 25, 2013.
Second Office Action in Canadian Application No. 2741895 dated Oct. 21, 2013.
Partial Supplementary Search Report in European Application No. 09826977.2 dated Oct. 4, 2016.
Extended Search Report in European Applicaton No. 19184826.6 dated Jan. 17, 2020.
Search Report and Written Opinion in Singapore Application No. 201103333-9 dated Nov. 19, 2012.
Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013.
Office Action in European Application No. 11767118.0 dated Feb. 3, 2017.
Office Action in European Application No. 11767118.0 dated Jul. 25, 2018.
Office Action in European Application No. 11767118.0 dated Jan. 29, 2019.
International Search Report and Written Opinion in PCT/US2011/053302 dated Nov. 28, 2011 in 11 pages.
International Preliminary Report on Patentability in PCT/US2011/053302 dated Apr. 2, 2013.
First Office Action in Japanese Application No. 2013-529454 dated Feb. 3, 2014 in 6 pages.
Office Action in Japanese Application No. 2013-529454 dated Mar. 9, 2015 in 8 pages.
First Office Action issued in Australian Application No. 2011307319 dated Mar. 6, 2014 in 5 pages.
Search Report and Written Opinion in Singapore Application No. 201301573-0 dated Jul. 1, 2014.
First Office Action in Chinese Application No. 201180046104.0 dated Nov. 3, 2014.
Second Office Action in Chinese Application No. 201180046104.0 dated Sep. 29, 2015.
Third Office Action in Chinese Application No. 201180046104.0 dated Apr. 14, 2016.
Decision of Rejection in Chinese Application No. 201180046104.0 dated Oct. 17, 2016.
Examination Report in Singapore Application No. 201301573-0 dated Dec. 22, 2014.
Examination Report in Indian Application No. 3105/DELNP/2013, dated Feb. 19, 2019.
International Preliminary Report on Patentability in PCT/US2011/061486 dated May 22, 2013.
International Search Report and Written Opinion in PCT/US2011/061486 dated Mar. 30, 2012 in 11 pages.
Office Action in Canadian Application No. 2816612 dated Nov. 3, 2015.
Office Action in Canadian Application No. 2816612 dated Oct. 7, 2016.
Office Action in Canadian Application No. 2816612 dated Aug. 8, 2017.
First Office Action in Chinese Application No. 201180053405.6 dated Feb. 10, 2015.
Second Office Action in Chinese Application No. 201180053405.6 dated Dec. 4, 2015.
Office Action in Japanese Application No. 2013-540982 dated Jun. 2, 2014.
Written Opinion in Singapore Application No. 201303521-7 dated May 20, 2014.
Extended Search Report in European Patent Application No. 18156163 dated Sep. 3, 2018.
Examination Report in Indian Application No. 4487/DELNP/2013 dated Dec. 28, 2018.
Office Action in Japanese Application No. 2015-533132 dated Apr. 25, 2016.
Office Action in Canadian Application No. 2884796 dated Apr. 28, 2016.
Office Action in Russian Application No. 2015114568 dated May 16, 2016.
Supplementary Examination Report in Singapore Application No. 11201501987U dated May 17, 2017.
Office Action in Chinese Application No. 2013800492635 dated Aug. 30, 2017.
Office Action in European Application No. 13770602.4 dated Mar. 11, 2019.
International Search Report and Written Opinion in PCT/US07/07601 dated Jul. 18, 2008 in 11 pages.
International Preliminary Report on Patentability in PCT/US2007/007601 dated Sep. 30, 2008 in 8 pages.
Supplementary European Search Report in Application No. 07754164.7 dated Dec. 20, 2010 in 7 pages.
Office Action in Chinese Application No. 200780020255.2 dated Mar. 4, 2013.
Office Action in Chinese Application No. 201310537815.9 dated Feb. 1, 2018.
Office Action in Indian Application No. 3742/KOLNP/2008 dated Nov. 22, 2013.
Office Action in Japanese Application No. 2012-052264 dated Dec. 11, 2012 in 26 pages.
Office Action in Japanese Application No. 2013-123086 dated Apr. 15, 2014 in 3 pages.
Office Action in Japanese Application No. 2013-123086 dated Dec. 2, 2014 in 4 pages.
Office Action in Japanese Application No. 2015-075644 dated Apr. 5, 2016.
Office Action in European Application No. 07754164.7 dated Dec. 14, 2015.
Office Action in European Application No. 07754164.7 dated Jan. 25, 2018.
Office Action in Chinese Application No. 201310537815.9 dated Jul. 5, 2016.
Office Action in Chinese Application No. 201310537815.9 dated Jun. 2, 2017.
International Search Report and Written Opinion in PCT/US/2016/ 066848 dated May 1, 2017.
International Preliminary Report on Patentability in PCT/US/2016/ 066848 dated Jun. 19, 2018.
Partial Search Report in European Patent Application No. 16876655.8 dated May 15, 2019.
International Search Report and Written Opinion in PCT/US2017/055156 dated Dec. 13, 2017.
International Preliminary Report on Patentability and Written Opinion in PCT/US2017/055156 dated Apr. 9, 2019.
International Search Report and Written Opinion in PCT/US2018/036634 dated Sep. 11, 2018.
International Preliminary Report on Patentability and Written Opinion in PCT/US2018/036634 dated Dec. 24, 2019.
First Office Action in Chinese Applicaton No. 201610112984.1 dated Mar. 20, 2018.
Second Office Action in Chinese Applicaton No. 201610112984.1 dated Feb. 2, 2019.
Related Publications (1)
Number Date Country
20200195677 A1 Jun 2020 US
Provisional Applications (1)
Number Date Country
62404723 Oct 2016 US
Continuations (1)
Number Date Country
Parent 15389276 Dec 2016 US
Child 16799625 US