Request routing processing

Information

  • Patent Grant
  • 9003040
  • Patent Number
    9,003,040
  • Date Filed
    Monday, April 29, 2013
    11 years ago
  • Date Issued
    Tuesday, April 7, 2015
    9 years ago
Abstract
Generally described, the present disclosure is directed to managing request routing functionality corresponding to resource requests for one or more resources associated with a content provider. The processing of the DNS requests by the service provider can include the selective filtering of DNS queries associated with a DNS query-based attack. A service provider can assign DNS servers corresponding to a distributed set of network addresses, or portions of network addresses, such that DNS queries exceeding a threshold, such as in DNS query-based attacks, can be filtered in a manner that can mitigate performance impact on for the content provider or service provider.
Description
BACKGROUND

Generally described, computing devices and communication networks can be utilized to exchange information. In a common application, a computing device can request content from another computing device via the communication network. For example, a user at a personal computing device can utilize a software browser application to request a Web page from a server computing device via the Internet. In such embodiments, the user computing device can be referred to as a client computing device and the server computing device can be referred to as a content provider.


Content providers are generally motivated to provide requested content to client computing devices often with consideration of efficient transmission of the requested content to the client computing device or consideration of a cost associated with the transmission of the content. For larger scale implementations, a content provider may receive content requests from a high volume of client computing devices which can place a strain on the content provider's computing resources. Additionally, the content requested by the client computing devices may have a number of components, which can further place additional strain on the content provider's computing resources.


In some embodiments, the content providers can utilize one or more service providers, such as content delivery network service providers and network storage service providers, to provide services related to the delivery of requested content. In a similar manner, service providers are generally motivated to provide services, such as hosting DNS request processing services or providing content to client computing devices, often with consideration of the efficiency and cost associated with the requested services. For example, service providers often consider factors such as latency of delivery of requested content in processing client computing device requests (either DNS queries or content requests) in order to meet service level agreements or to generally improve the quality of delivered service. In some situations, the service providers may encounter that a number of service requests processed on behalf of a content provider can exceed a threshold, such as in accordance with a malicious attack or beyond an agreed up level of service. In situations related to malicious attacks, such as a DNS-based attack, the level of service provided by the service provider to the targeted content provider can be impacted and in some situations, the overall function of the service provider can be affected.





BRIEF DESCRIPTION OF THE DRAWINGS

The foregoing aspects and many of the attendant advantages of this invention will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings, wherein:



FIG. 1 is a block diagram illustrative of content delivery environment including a number of client computing devices, a content provider, a network storage provider, and a content delivery network service provider;



FIG. 2 is a block diagram of the content delivery environment of FIG. 1 illustrating the registration of a content provider with a network storage provider;



FIG. 3 is a block diagram of the content delivery environment of FIG. 1 illustrating the registration of a content provider with a service provider for providing request routing services on behalf of the content provider;



FIG. 4 is a block diagram of the content delivery environment of FIG. 1 illustrating the processing of request routing requests by a service provider on behalf of the content provider;



FIGS. 5A and 5B are block diagrams of the content delivery environment of FIG. 1 illustrating one embodiment of the processing of resource routing requests generated by client computing devices;



FIG. 6 is a flow diagram illustrative of a content provider request routing registration processing routine implemented by a service provider; and



FIG. 7 is a flow diagram illustrative of a request routing processing routine implemented by a service provider.





DETAILED DESCRIPTION

Generally described, the present disclosure is directed to managing requesting routing functionality corresponding to resource requests for one or more resources associated with a content provider. Aspects of the disclosure will be described with regard to the management and processing request routing functionality by a service provider, such as a content delivery network (“CDN”) service provider, on behalf of an entity requesting the request routing functionality, such as a content provider. Illustratively, the request routing functionality can correspond to the processing, by computing devices associated with the service provider, such as a DNS server component associated with a specific network address, of domain name service (“DNS”) requests on behalf of a content provider. The service provider DNS server components resolve the received DNS queries by identifying a network address of a computing device that will provide requested resources, such as a cache component. Additionally, in embodiments in which the number of DNS queries issued to a targeted content provider domain exceeds a threshold, the service provider can selectively filter DNS queries to mitigate the effect of the incoming DNS queries. For example, in situations associated with a DNS query-based attack, some portion of the DNS queries can be filtered to mitigate the effect of the DNS query-based attack.


In one embodiment, the service provider can assign a number of DNS server components that will be authoritative for DNS queries to an identified content provider domain on behalf of a content provider. The assigned DNS server components correspond to network addresses that are selected by the service provider from a distributed set of service provider network addresses in a manner that takes into consideration a number of aspects. In one aspect, the service provider can implement processes for ensuring that no two domains, regardless of the owner, are serviced by service provider DNS server components in which the set DNS server components have matching network addresses. In another aspect, the service provider can implemented processes for ensuring that, for a specific domain, the portion of the network addresses of the assigned DNS server components significant for network routing purposes do not having matching values and that the portion of the network addresses of the assigned DNS server component not significant for network routing purposes also do not have matching values.


In embodiments in which the number of received DNS, queries exceeds a threshold, such as in DNS query-based attacks, the service provider can implement a number of techniques that results in the filtering of the DNS queries in a manner that can mitigate performance impact associated with the services provided to the content provider domain or the overall performance of the service provider components. For example, the service provider can facilitate the selective filtering of DNS queries from one or more of the ranges of network addresses. In another example, the service provider can facilitate the selective filtering of DNS queries by configuring DNS queries directed toward a specific DNS server network address to be processed by specific DNS server components, such as by forwarding DNS queries.


Although various aspects of the disclosure will be described with regard to illustrative examples and embodiments, one skilled in the art will appreciate that the disclosed embodiments and examples should not be construed as limiting. For example, the present disclosure may be described with regard to request routing services provided by a service provider, such as a CDN service provider, that may provide additional services and functionality including network-based storage services, caching services, and content delivery services. However, one skilled in the relevant art will appreciate that a service provider need not provide all, or any, of the additional services or functionality that may be associated with some service providers, such as a CDN service provider. Likewise, although the present application will be discussed with regard to a content provider as the requestor of services, such as the DNS request processing services, the one skilled in the relevant art will appreciate that the requestor of the service need not provide any additional functionality that may be otherwise attributed to content providers.



FIG. 1 is a block diagram illustrative of content delivery environment 100 for the managing registration of content provider with a service provider, such as a CDN service provider, and subsequent processing of at least a portion of content requests on behalf of the content provider. As illustrated in FIG. 1, the content delivery environment 100 includes a number of client computing devices 102 (generally referred to as clients) for requesting content from a content provider, a network storage provider 110, and/or a service provider 106. In an illustrative embodiment, the client computing devices 102 can correspond to a wide variety of computing devices including personal computing devices, laptop computing devices, hand-held computing devices, terminal computing devices, mobile devices, wireless devices, various electronic devices and appliances and the like. In an illustrative embodiment, the client computing devices 102 include necessary hardware and software components for establishing communications over a communication network 108, such as a wide area network or local area network. For example, the client computing devices 102 may be equipped with networking equipment and browser software applications that facilitate communications via the Internet or an intranet.


Although not illustrated in FIG. 1, each client computing device 102 utilizes some type of local DNS resolver component, such as a DNS Name server, that generates the DNS queries attributed to the client computing device. In one embodiment, the local DNS resolver component may be provide by an enterprise network to which the client computing device 102 belongs. In another embodiment, the local DNS resolver component may be provided by an Internet Service Provider (ISP) that provides the communication network connection to the client computing device 102.


The content delivery environment 100 can also include a content provider 104 in communication with the one or more client computing devices 102 via the communication network 108. The content provider 104 illustrated in FIG. 1 corresponds to a logical association of one or more computing devices associated with a content provider. Specifically, the content provider 104 can include a web server component 112 corresponding to one or more server computing devices for obtaining and processing requests for content (such as Web pages) from the client computing devices 102. The content provider 104 can further include an origin server component 114 and associated storage component 116 corresponding to one or more computing devices for obtaining and processing requests for network resources. One skilled in the relevant art will appreciate that the content provider 104 can be associated with various additional computing resources, such additional computing devices for administration of content and resources and the like. Additionally, although the origin server component 114 and associated storage component 116 are logically associated with the content provider 104, the origin server component 114 and associated storage components 116 may be geographically distributed throughout the communication network 108 in a manner to best serve various demographics of client computing devices 102. Still further, although illustrative components have been described with regard to the content provider 104, a content provider may have any configuration of components associated with a domain addressable on the communication network 108.


As further illustrated in FIG. 1, the content provider 104 can be associated with one or more DNS name server components 118 that are operative to receive DNS queries related to registered domain names associated with the content provider. The one or more DNS name servers can be authoritative to resolve client computing device DNS queries corresponding to the registered domain names of the content provider 104. A DNS name server component is considered to be authoritative to a DNS query if the DNS name server can resolve the query by providing a responsive IP address. As will be explained in greater detail below, in accordance with illustrative embodiments, at least a portion of the request routing functionality provider the DNS name server components 118 will be provided by a service provider on behalf of the content provider 104.


With continued reference to FIG. 1, the content delivery environment 100 can further include a service provider 106 in communication with the one or more client computing devices 102, the content provider 104, and the network storage provider 110 via the communication network 108. The service provider 106 illustrated in FIG. 1 corresponds to a logical association of one or more computing devices associated with a service provider. Specifically, the service provider 106 can include a number of Point of Presence (“POP”) locations 120, 126, 132 that correspond to nodes on the communication network 108. Each POP 120, 126, 132 includes a DNS component 122, 128, 134 made up of a number of DNS server computing devices for resolving DNS queries from the client computers 102. Each POP 120, 126, 132 also optionally includes a resource cache component 124, 130, 136 made up of a number of cache server computing devices for storing resources from content providers or network storage providers and transmitting various requested resources to various client computers. The DNS components 122, 128, 134 and the resource cache components 124, 130, 136 may further include additional software and/or hardware components that facilitate communications including, but not limited, load balancing or load sharing software/hardware components.


In an illustrative embodiment, the DNS component 122, 128, 134 and resource cache component 124, 130, 136 are considered to be logically grouped, regardless of whether the components, or portions of the components, are physically separate. Additionally, although the POPs 120, 126, 132 are illustrated in FIG. 1 as logically associated with the CDN service provider 106, the POPs will be geographically distributed throughout the communication network 108 in a manner to best serve various demographics of client computing devices 102. Additionally, one skilled in the relevant art will appreciate that the service provider 106 can be associated with various additional computing resources, such additional computing devices for administration of content and resources, and the like.


With further continued reference to FIG. 1, the content delivery environment 100 can also include a network storage provider 110 in communication with the one or more client computing devices 102, the service provider 106, and the content provider 104 via the communication network 108. The network storage provider 110 illustrated in FIG. 1 also corresponds to a logical association of one or more computing devices associated with a network storage provider. Specifically, the network storage provider 110 can include a number of network storage provider Point of Presence (“NSP POP”) locations 138, 142 that correspond to nodes on the communication network 108. Each NSP POP 138, 142 includes a storage component 140, 144 made up of a number of storage devices for storing resources from content providers which will be processed by the network storage provider 110 and transmitted to various client computers. The storage components 140, 144 may further include additional software and/or hardware components that facilitate communications including, but not limited to, load balancing or load sharing software/hardware components.


In an illustrative embodiment, the storage components 140, 144 are considered to be logically grouped, regardless of whether the components, or portions of the components, are physically separate. Additionally, although the NSP POPs 138, 142 are illustrated in FIG. 1 as logically associated with the network storage provider 110, the NSP POPs will be geographically distributed throughout the communication network 108 in a manner to best serve various demographics of client computing devices 102. Additionally, one skilled in the relevant art will appreciate that the network storage provider 110 can be associated with various additional computing resources, such additional computing devices for administration of content and resources, DNS name servers, and the like.


Even further, one skilled in the relevant art will appreciate that the components of the network storage provider 110 and components of the service provider 106 can be managed by the same or different entities. One skilled in the relevant art will also appreciate that the components and configurations provided in FIG. 1 are illustrative in nature. Accordingly, additional or alternative components and/or configurations, especially regarding the additional components, systems, and subsystems for facilitating communications may be utilized. Specifically, one skilled in the relevant art will appreciate the network storage provider 110 may be omitted from the content delivery environment 100.


With reference now to FIGS. 2-5B, the interaction between various components of the content delivery environment 100 of FIG. 1 will be illustrated. For purposes of the example, however, the illustration has been simplified such that many of the components utilized to facilitate communications are not shown. One skilled in the relevant art will appreciate that such components can be utilized and that additional interactions would accordingly occur without departing from the spirit and scope of the present disclosure.


With reference to FIG. 2, an illustrative interaction for the optional registration of a content provider 104 with the network storage provider 110 for hosting content on behalf of the content provider 104 will be described. As illustrated in FIG. 2, the storage provider content registration process begins with registration of the content provider 104 with the network storage provider 110. In an illustrative embodiment, the content provider 104 utilizes a registration application program interface (“API”) to register with the network storage provider 110 such that the network storage provider 110 can provide content on behalf of the content provider 104. The registration API can include the identification of the origin server 114 of the content provider 104 that may provide requested resources to the network storage provider 110. In addition or alternatively, the registration API can include the content to be stored by the network storage provider 110 on behalf of the content provider 104. In one embodiment, the network storage provider 110 may act as an origin server for the content provider 104.


With continued reference to FIG. 2, upon receiving the registration API, the network storage provider 110 obtains and processes the content provider registration information. In an illustrative embodiment, the network storage provider 110 can then generate additional information that will be used by the client computing devices 102 as part of the content requests. The additional information can include, without limitation, content provider identifiers, such as content provider identification codes, storage provider identifiers, such as storage provider identification codes, executable code for processing resource identifiers, such as script-based instructions, and the like. One skilled in the relevant art will appreciate that various types of additional information may be generated by the network storage provider 110 and that the additional information may be embodied in any one of a variety of formats.


In one embodiment, the network storage provider 110 returns an identification of applicable domains for the network storage provider (unless it has been previously provided) and any additional information to the content provider 104. In turn, the content provider 104 can then process the stored content with content provider specific information. In one example, as illustrated in FIG. 2, the content provider 104 translates resource identifiers originally directed toward a domain of the origin server 114 to a domain corresponding to the network storage provider 110. The translated URLs are embedded into requested content in a manner such that DNS queries for the translated URLs will resolve to a DNS server corresponding to the network storage provider 110 and not a DNS server corresponding to the content provider 104.


With reference now to FIG. 3, an illustrative interaction for registration, by the content provider 104, to utilize the request routing services provided by the service provider 106 will be described. As illustrated in FIG. 3, the request routing service registration process provided by the service provider 106 begins with registration of the content provider 104 with the service provider 106. In an illustrative embodiment, the content provider 104 utilizes a registration API to register with the service provider 106 such that the service provider 106 can provide request routing services on behalf of the content provider 104. The registration API includes the identification of the domains for which the service provider 106 will be authoritative (e.g., “contentprovider.com”), the identification of the storage component 140, 144 of the network storage provider 110 or origin servers 114 that will provide requested resources to the client computing devices 102. The registration API can also include additional information including request routing information, identification information, or other information that will be used to resolve client computing device DNS requests on behalf of the content provider 104, as will be explained below.


The service provider 106 obtains the registration API and processes the information. In one aspect, the service provider 106 can generate the necessary request processing rules or alternative identifiers that may be utilized in the resolution of client computing device DNS queries. In another aspect, the service provider 106 can cause the registration of its DNS nameserver components for the relevant domains specified by the content provider 104. The service provider 104 can then send a response to the content provider 104, such as a confirmation. Responsive to the processing of the registration API, the service provider 106 can identify the network addresses of the service provider DNS servers, such as an Internet Protocol address, that will process DNS queries on behalf of the content provider 104. The content provider 104 can then delegate the identified network addresses of the DNS servers that will be responsible for the identified content provider domain (e.g., “contentprovider.com”).


As will be explained in greater detail below, in one embodiment, the service provider 106 can distribute, or otherwise assign, network addresses associated with the DNS server components that will be authoritative to DNS requests to the content provider domain. Specifically, in embodiments in which the service provider 106 will assign a number of DNS server components that will be authoritative for a content provider domain, the service provider can first create a number of subdivisions, or zones, of network addresses available to the service provider. The number of subdivisions or zones corresponds to a distribution of the network addresses such that a selection of a network address from each of the subdivisions or zones ensures that a particular domain's DNS server components have distributed network addresses and avoids situations in which any two assigned DNS server components would have completely overlapping, or exactly matching, network addresses (unless the number of subdivisions or zones is less than the number of DNS server components being assigned as authoritative for a domain). The distribution from different subdivisions can be generally referred to as a “non-overlapping distribution.”


For purposes of an illustrative example, assume that the service provider 106 has a pool of available network addresses. The service provider 106 can organize the pool into two or more ranges of network addresses. For example, the ranges can be defined in a manner such that each network address having a common highest ordered octet could be considered to be in the same range. In another example, the ranges can be defined in a manner such two or more ranges may share a common highest ordered octet, but are distinguished by different second octets. Further, in another embodiment, the ranges of network addresses can correspond to a number of network addresses available for assignment. In alternative embodiments, at least one range of network address can correspond to a single network address for assignment.


As discussed above, each range of network addresses can be considered to a subdivision or zone of the available network addresses. In one aspect, if the number of subdivisions is equal or greater than the number of network addresses that need to be assigned, the service provider 106 ensures a distribution of network addresses for the DNS server components such that no two network addresses will be matching by selecting a network address from different subdivisions. With reference to the previous example in which ranges are determined according to the highest ordered octet of the network address, each selected network address would correspond to a different value of the highest order octet, which ensures that at least that portion of the network addresses do not overlap (e.g., the second, third, fourth octets) and that no two network addresses for the particular domain will be matching. With reference to another example in which two ranges share common first and second octets, each selected network address would correspond to a different value of the third order octet, which still ensures that at least that portion of the network addresses do not overlap and that no two network addresses for the particular domain will be matching. Depending on the pool of network addresses available to the service provider 106, the ranges of network addresses associated with each subdivision or zone can be configured in various manners depending on the desired distribution of network addresses, the total number of available network addresses and the differences in values among the available network addresses.


In some embodiments, in addition to ensuring a “non-overlapping” distribution of assigned network addresses for a specific domain, if the service provider 106 processes multiple requests for different domains, there is the possibility that such a non-overlapping distribution could result in two or more different domains having at least one assigned DNS network address that matches. In some embodiments, the service provider 106 may wish to establish a threshold number of network addresses that can be matched across unrelated domains (e.g., one, two, three, etc.) or, conversely, a minimum number of network addresses that are not exactly matching between any two non-related domains. Accordingly, the service provider 106 can include different levels of processing regarding any potentially matching assigned network address in accordance with the established threshold of number of acceptable matching network addresses.


In one embodiment, if the threshold is set to zero such that there can be no matching network addresses, the service provider 106 can ensure that the assigned network addresses of DNS servers do not overlap by removing a DNS server's network address from the pool of available network addresses has been assigned. One example of such a scenario is if there are two or more hosted domains that have a common name (e.g., www.domain.com) and therefore, cannot have any matching DNS server component network addresses. In another embodiment, it may be possible for two domains to share one or more assigned network address of a DNS server component. However, it may be desirable for the service provider 106 to ensure that no two specific domains are assigned the exact same network addresses from each of the subdivisions or that, for any two domains, no more than half of the assigned DNS sever component network addresses are matching. In such embodiments, the service provider 106 can conduct additional processing to ensure and correct for matching network addresses, such as by reducing the number of matching network addresses below the threshold.


In addition to ensuring that assigned network addresses for a specific domain are distributed in a non-overlapping manner and further ensuring that the number of matching network addresses with regard to another domain are not above a threshold, in another embodiment, the service provider 106 can select portions of the selected network addresses from each subdivision such that there is further no overlap in the portions of the selected network addresses that are not typically considered significant for purposes of routing. Specifically, in one embodiment, the network addresses can corresponds to a number of bits that are divided into octets having unique values. For example, a 16-bit network address can be represented in the form of xx.xx.xx.xx in which each xx pair is an octet. Likewise, a 24-bit network address can be represented in the form of yy.yy.yy.yy.yy.yy in which each yy pair represented by four bits. In accordance with network routing principles, a portion of the network address is utilized for network routing (e.g., the first 2 or 3 octets) and is generally referred to as the “most significant portion of the network address” or the “network portion of the network address.” The remaining portion of the network address (e.g., the last octet) is not considered to be significant for purposes of network routing and is generally referred to as the “non-significant portion of the network address” or the “host portion of the network address.” One skilled in the relevant art will appreciate that the number of octets in a network address that are considered “significant” or “non-significant” may vary according to the specific network protocol being utilized, the configuration of network routing equipment, and other criteria. Accordingly, the example number of octets utilized to illustrate the difference between the significant and non-significant portions of a network address are illustrative in nature and should not be construed as limiting.


For purposes of network routing, network addresses are considered to be non-overlapping or non-matching so long as the significant portions of the network addresses do not exactly match, regardless of whether there are one or more matching octets. The non-significant portions of the network address are effectively ignored for purposes of network routing. Accordingly, in this embodiment, the service provider 106 can select different values for the non-significant portions of the selected network addresses for a specific domain such that there is also no overlap the non-significant portions of the selected network address for a specific domain do not exactly match, even if there is some partial matching.


With reference to the previous example, if we assume that four network addresses are selected and the non-significant portion of the network addresses correspond to the last octet in the network address, the non-significant portion of the network addresses can be subdivided into four ranges of values such there is no overlap in the assigned values for the least most significant bits. Continuing with this example, the last octet has a range of 256 total potential values. Since each domain is illustratively associated with four network addresses, the potential values of the last octet can be divided into ranges of values of 1-63, 64-127, 128-191, and 192-255. Accordingly, the value of the last octet for the first assigned network address would be picked from the range of 1-63; the value of the last octet for the second assigned network address would be picked from the range of 64-127; the value of the last octet for the third assigned network address would be picked from the range of 128-191; and the value of the last octet for the fourth assigned network address would be picked from the range of 192-255. Thus, in this embodiment, the resulting assigned network addresses would be completely non-overlapping with regard to not only the significant portions of the network addresses but also with regard to the non-overlapping portions of the network addresses.


In the event that a number of DNS queries exceed a threshold, such due to a DNS query based attack or due to a spike in requests, the service provider 106 can selectively filter DNS queries from one or more selected network address. If the “excessive” DNS queries are targeted toward a specific content provider, the service provider 106 may be able to maintain some DNS query functionality by filtering out less than all the assigned subdivisions for the targeted domain. Additionally, the service provider 106 can also mitigate the impact of such excessive DNS queries to the request routing services provided to other non-targeted content providers by filtering out some or all of the assigned subdivisions for the targeted domain or by limiting the processing of DNS queries to a targeted domain to specific physical computing devices. Still further, the service provider 106 can forward some portion of the DNS queries to different points of presence or DNS server components to help mitigate the impact of the number of DNS queries.


Illustratively, upon the optional identification of appropriate storage component 140, 144, 148 of the network storage provider 110 and the registration for request routing functionality with the service provider 106, the content provider 104 can, in one embodiment as will be further described below in reference to FIGS. 4 and 5A and 5B, begin to process DNS requests for content generated on behalf of the client computing devices 102. Specifically, in accordance with DNS routing principles, a client computing device DNS query corresponding to a resource identifier would eventually be resolved by identifying a network address corresponding to either the origin server component 114 and associated storage component 116 or storage component 140, 144, 148 of the network storage provider 110 by a DNS nameserver associated with the service provider 106.


Turning now to FIG. 4, in accordance with one embodiment once the service provider 106 has begun processing request routing functionality on behalf of the content provider, a client computing device 102 issues a DNS query for the content provider domain (e.g., “contentprovider.com”). Illustratively, the client computing device 102, such as through a browser software application, issues a DNS query for the content provider domain that first results in the identification of a DNS server authoritative to the “.” and the “com” portions of the domain. After partially resolving the domain according to the “.” and “corn” portions of the domain, the client computing device 102 then issues another DNS query for the URL that results in “.contentprovider” portion of the domain. The issuance of DNS queries corresponding to the “.” and the “corn” portions of a domain are well known and have not been illustrated.


In an illustrative embodiment, the identification of the identification of a DNS server authoritative to the “contentprovider” corresponds to one of the assigned IP addresses of a DNS server associated with the service provider 106. In one embodiment, the IP address is a specific network address unique to DNS server component(s) of a specific POP associated with the service provider 106. In another embodiment, the IP address can be shared by one or more POPs associated with the service provider 106, which may be geographically or logically distributed. In this embodiment, a DNS query to the shared IP address utilizes a one-to-many network routing schema, such as anycast, such a specific POP will receive the request as a function of network topology. For example, in an anycast implementation, a DNS query issued by a client computing device 102 to a shared IP address will arrive at a DNS server component of the service provider 106 logically having the shortest network topology distance, often referred to as network hops, from the client computing device. The network topology distance does not necessarily correspond to geographic distance. However, in some embodiments, the network topology distance can be inferred to be the shortest network distance between a client computing device 102 and a service provider POP.


As illustrated in FIG. 4, a DNS server component of the service provider 106 obtains the DNS query and can resolve the DNS query by providing a network address, such as an IP address, of a component for providing the request content. For example, the receiving DNS server component may provide an IP address of a Web server that can provide a requested Web page. In another example, the DNS server may provider an IP address of a cache component that may provide a request resource or file. In an alternative embodiment, the DNS server component may also provide alternative identifiers, such as canonical names (“CNAMES”) that can be used to refine request routing processing. In the example illustrated in FIG. 4, it is assumed that the DNS query transmitted by the client computing device 102 can be processed.


Turning now to FIGS. 5A and 5B, in other embodiments, the service provider 106 may obtain a number of DNS queries for a domain such that the number of DNS queries exceeds a threshold. As illustrated in FIG. 5A, exceeded threshold may be indicative of a DNS-based network attack in which multiple client computing devices 102 attempt to overload a content provide domain with DNS queries. The exceeded threshold may also be indicative of spikes in content requests or correspond to a number of DNS queries that exceeds agreed upon service levels. In one aspect, the multiple DNS queries may be directed to one of the specific assigned network addresses of the DNS server components processing DNS queries on behalf of the content provider 104. In another aspect, the multiple DNS queries may be directed to all the specific assigned network addresses for the content provider 104. Still further, in another aspect, the multiple DNS queries may not be targeted only to a specific content provider domain and may indicative of a larger, network based attack.


In order to mitigate the impact of the DNS queries that have exceeded a threshold (or will exceed a threshold), the service provider 106 can begin causing the selective filtering at least portions of the DNS queries directed to one or more of the assigned network addresses. Specifically, in one embodiment, the service provider 106 can issue commands or utilize routing protocols that cause DNS queries to be filtered in the communication network 108 prior to being received by the service provider 106. For example, the service provider 106 can utilize a null route injection for identified network addresses that networking equipment, such as routers, to prevent the forwarding of the DNS queries.


With reference to FIG. 5B, in addition to the filtering of DNS queries in the communication network 108, the service provider 106 can utilize router access control lists to filter, or otherwise block, DNS queries directed to one or more of the assigned network address subdivisions or zones that are received at the service provider. If the DNS queries associated with the exceeded threshold are targeted to a particular subdivision or zone, the service provider 106 can further filter the excessive DNS queries to the targeted network address. If the DNS queries associated with the exceeded threshold are targeted to a larger number of subdivisions or zones, the service provider 106 can filter all the targeted domains to effectively stop queries.


Alternatively, the service provider can filter a percentage of zones in an effort to maintain a percentage DNS query processing functionality. For example, if a content provider 104 has been associated with a DNS server component for each of four zones, the service provider 106 can filter half of the assigned network addresses to maintain operation of the request routing functionality at least at a fifty percent level. As illustrated in FIG. 5B, by filtering only certain network address zones, at least some portion of DNS queries for the “targeted” content provider or other content providers, such as by client computing device 102Z can continued to be processed. Additionally, the service provider 106 can configure one or more specific DNS server components to process any remaining DNS queries that have not been filtered in the communication network 108 or by the service provider. Still further, the server provider 106 can forward at least a portion of the non-filtered DNS queries to other DNS server components that may be better suited to process the non-filtered DNS queries or to distribute the load at a specific POP.


With reference now to FIG. 6, one embodiment of a routine 600 implemented by a service provider 106 for managing registration of content provider 104 will be described. One skilled in the relevant art will appreciate that actions/steps outlined for routine 600 may be implemented by one or many computing devices/components that are associated with the service provider 106, such as a DNS query processing component or a point of presence associated with the service provider. Accordingly, routine 600 has been logically associated as being generally performed by the service provider 106, and thus the following illustrative embodiments should not be construed as limiting.


At block 602, the service provider 106 obtains a request for providing DNS request routing services on behalf of a content provider 104. Illustratively, the request for providing DNS request routing services may be facilitated through a registration API in which the content provider specifies information necessary for the service provider 106 to begin hosting DNS nameserver functionality on behalf of the content provider. The transmission of the registration API (and associated information) may be an automatic process corresponding to an exchange of information between computing devices without need for administrator, or other human interaction. Alternatively, the transmission of the registration API (and associated information) may be an automatic process may be a manual, or semi-manual, process in which an administrator specifies at least a portion of the information necessary for the service provider 106 to begin hosting DNS nameserver functionality on behalf of the content provider.


At block 604, the service provider 106 determines a number of assignable network address subdivisions or zones. As previously described, in one embodiment, the service provider 106 may maintain two or more ranges of DNS server network addresses that can be assigned to content providers. Illustratively, the service provider can maintain a pool of available network addresses that correspond to the DNS server components that can be assigned to a content provider. Accordingly, the service provider 106 can organize the pool into two or more ranges of network addresses in which each range of network addresses corresponds to a subdivision or zone. As explained above, the service provider 106 can further select network addresses from the subdivisions to ensure that, for a specific domain, at least the significant portions of the set of assigned network addresses will not have any exactly matching values, regardless of whether is at least some common values.


At block 606, the first network address subdivision is selected as a current network address subdivision and at block 608, the service provider 106 assigns a network address from the current network address subdivision. In an illustrative embodiment, in addition to the selection of a unique network address from the range of network addresses associated with the current network address subdivision, block 608 can also correspond to the service provider 106 selecting a value for the non-significant portion of the selected network addresses such that for a specific domain, at least the non-significant portions of the set of assigned network addresses also will not have any exactly matching values. One skilled in the relevant art will appreciate that the non-significant portions of the set of assigned network addresses will not be considered matching solely because some portion of the network addresses have common values. Still further, block 608 can also correspond to the service provider 106 can also conduct additional processing such that for two domains, regardless of ownership, the set of assigned network addresses (either significant portions or a combination of significant and non-significant portions) will have more than a threshold number of exactly matching network addresses. Additionally, the service provider 106 can also conduct some type of conflict resolution such that the assigned network address would not conflict with a previously assigned network address for any domain that would be considered a parent domain, a child domain, a sibling domain, etc. In such embodiment, the pool of available network addresses may be filtered to remove any potentially conflicting network addresses.


At decision block 610, a test is conducted to determine whether additional network subdivisions exist. If so, at block 612, the service provider 106 selects a next network address subdivision as the current network address subdivision and the routine 600 proceeds to block 608 to select another network address for the current subdivision. With reference to the previous example, the routine 600 can repeat to assign a network address for each of the remaining three network address subdivision ranges and values for the non-significant portions of the network address (e.g., ranges of 64-127, 128-191, and 192-254 for the last octet of the assigned network addresses). Additionally, the routine 600 can provide the additional conflict resolution or other limitation techniques, described above, to filter out network addresses that should not be assigned to the content provider. However, in alternative embodiment, the service provider 106 may not necessarily assign network addresses from all the available network address subdivisions or zones.


Once all the network addresses have been assigned, at block 614, the service provider 106 transmits assigned network addresses in response to the request for DNS service hosting. Based on the identified network addresses, the content provider can delegate the identified domain to the assigned network addresses. One skilled in the relevant art will appreciate that upon delegation of the assigned network addresses (or DNS nameserver names), the service provider 106 can host the DNS nameserver components on different computing devices in a manner the each physical computing device can correspond to one subdivision or zone or less than all the subdivisions or zones. At block 616, the routine 600 ends.


With reference now to FIG. 7, one embodiment of a routine 700 implemented by the service provider 106 for processing DNS requests will be described. Similar to FIG. 6, one skilled in the relevant art will appreciate that actions/steps outlined for routine 700 may be implemented by one or many computing devices/components that are associated with the service provider 106. Accordingly, routine 700 has been logically associated as being generally performed by the service provider 106, and thus the following illustrative embodiments should not be construed as limiting.


At block 702, the service provider 106 obtains one or more DNS queries from client computing devices 102. Illustratively, the DNS queries are described as originating from separate client computing devices 102. However, at least some portion of the DNS queries may be transmitted by the same client computing device 102 or from some other component configured in a manner to generate multiple DNS queries. Additionally, in an alternative embodiment, the service provider 106 may receive an indication as to the number of DNS queries being transmitted without actual receipt of the DNS queries by the service provider.


At block 704, the service provider 106 associates the DNS queries with a set of DNS queries that have exceeded a threshold. As previously described, the exceeded threshold may be indicative of a DNS-based network attack in which multiple client computing devices 102 attempt to overload a content provide domain with DNS queries. The exceeded threshold may also be indicative of spikes in content requests or correspond to a number of DNS queries that exceeds agreed upon service levels. In one aspect, the multiple DNS queries may be directed to a specific assigned network address for the content provider 104. In another aspect, the multiple DNS queries may be directed to all the specific assigned network addresses for the content provider 104. Still further, in another aspect, the multiple DNS queries may not be targeted only to a specific content provider domain and may indicative of a larger, network based attack. One skilled in the relevant art will appreciate that the association of the DNS queries may also be determined by criteria other than the number of DNS queries, such as by the source of the DNS query (e.g., from a known bad actor or IP address) or based on signature mapping of the DNS query (e.g., known identification information in the DNS query).


At block 706, the service provider 106 determines network address attributes of the DNS queries that have exceeded the threshold (e.g., the “DNS query attack”). In one aspect, the service provider 106 may identify all the specific network addresses that have been targeted. In another aspect, the service provider 106 may determine a percentage of targeted network addresses to attempt to block or filter. At decision block 708, a test is conducted to determine whether to filter the received DNS queries. As previously described, the service provider 106 may attempt to filter all DNS queries to a particular network address if only a portion of the network addresses associated with a content provider are targeted or based on a determination that the service provider request routing services would be compromised. In another example, if multiple network addresses are targeted the service provider 106 may determine to filter a percentage of the network address to maintain some request routing functionality on behalf of the content provider 104.


If the service provider 106 determines to filter the DNS queries, at block 710, the service provider filters, or otherwise blocks, the DNS queries. In one embodiment, the service provider 106 may utilize a communication or routing protocol to cause network-based equipment, such as routers, to filter all DNS queries corresponding to an identified IP address prior to being received by the service provider. As previously described, an example of such a routing protocol would be the utilization of null route injunction command/information. In another embodiment, the service provider 106 can filter the DNS queries as they are received by the service provider network. For example, the service provider can utilize router access control lists that can be configured to block requests to specific network addresses as the requests are received by the routers. Alternatively, if the service provider 106 determines not to filter, the service provider, through a receiving DNS server component, processes the received DNS query. As previously described, the service provider can configure specific hardware computing devices to be responsive to any non-blocked network addresses. In a further embodiment, the service provider 106 can also direct DNS queries targeted to one or more assigned network addresses to specific DNS components within the service provider network. For example, the service provider 106 can forward one or more DNS queries via the communication network, such as a communication tunnel. At block 714, the routine 700 ends.


It will be appreciated by those skilled in the art and others that all of the functions described in this disclosure may be embodied in software executed by one or more processors of the disclosed components and mobile communication devices. The software may be persistently stored in any type of non-volatile storage.


Conditional language, such as, among others, “can,” “could,” “might,” or “may,” unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements 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.


Any process 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 steps in the process. Alternate implementations are included within the scope of the embodiments described herein in which elements or functions may be deleted, executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those skilled in the art. It will further be appreciated that the data and/or components described above may be stored on a computer-readable medium and loaded into memory of the computing device using a drive mechanism associated with a computer readable storing the computer executable components such as a CD-ROM, DVD-ROM, or network interface further, the component and/or data can be included in a single device or distributed in any manner. Accordingly, general purpose computing devices may be configured to implement the processes, algorithms, and methodology of the present disclosure with the processing and/or execution of the various data and/or components described above.


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 computer-implemented method for managing DNS queries comprising: obtaining a request for hosting DNS query services for an identifiable domain, wherein the hosting of DNS query services includes providing services responsive to DNS queries;assigning a set of DNS servers for hosting the DNS query services, wherein each DNS server in the set of DNS servers is selected from defined network address zones, wherein the defined network address zones correspond to a division of assignable network addresses for service provider DNS servers, and wherein assigning the set of DNS servers for hosting the DNS query services includes selecting a non-significant portion of each assigned network address from unique values corresponding to a non-overlapping range of potential values; andcausing the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain.
  • 2. The method as recited in claim 1 further comprising determining a number of network address zones.
  • 3. The method as recited in claim 2, wherein the number of network address zones corresponds to a proportional distribution of available network addresses.
  • 4. The method as recited in claim 1, wherein assigning the set of DNS servers for hosting the DNS query services includes selecting a network address from each defined network address zone such that the significant portion of the assigned network addresses for the identifiable domain are not matching.
  • 5. The method as recited in claim 1, wherein causing the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain includes transmitting the assigned network address for each of the set of DNS servers.
  • 6. The method as recited in claim 1, wherein causing the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain includes transmitting a name associated with the assigned network address for each of the set of DNS servers, the name associated with the assigned network address previously configured with the assigned network addresses.
  • 7. The method as recited in Claim 1, wherein the range of values corresponds to the number of zones.
  • 8. A system for managing DNS queries comprising: a DNS query processor, at a service provider, couple to a memory and operative to: obtain a request for hosting DNS query services for an identifiable domain, wherein the hosting of DNS query services includes providing services responsive to DNS queries;assign a set of DNS servers for hosting the DNS query services, wherein each DNS server in the set of DNS servers is selected from defined network address zones, wherein the defined network address zones correspond to a division of assignable network addresses for service provider DNS servers, and wherein assigning the set of DNS servers for hosting the DNS query services includes selecting a non-significant portion of each assigned network address from unique values corresponding to a non-overlapping range of potential values; andcause the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain.
  • 9. The system as recited in claim 8, wherein causing the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain includes transmitting the assigned network address for each of the set of DNS servers.
  • 10. The system as recited in claim 8, wherein causing the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain includes transmitting a name associated with the assigned network address for each of the set of DNS servers, the name associated with the assigned network address previously configured with the assigned network addresses.
  • 11. The system as recited in claim 8, wherein the DNS query processor is further operative to determine a number of network address zones.
  • 12. The system as recited in claim 11, wherein the number of network address zones corresponds to a proportional distribution of available network addresses.
  • 13. The system as recited in claim 8, wherein assigning the set of DNS servers for hosting the DNS query services includes selecting a network address from each defined network address zone such that the significant portion of the assigned network addresses for the identifiable domain are not matching.
  • 14. The system as recited in claim 8, wherein the range of values corresponds to the number of zones.
  • 15. A non-transitory, computer-readable storage medium having one or more computer-executable components for managing DNS queries, the one or more computer-executable components comprising computer-executable instructions to: obtain, by a service provider, a request for hosting DNS query services for an identifiable domain, wherein the hosting of DNS query services includes providing services responsive to DNS queries;assign, by the service provider, a set of DNS servers for hosting the DNS query services, wherein each DNS server in the set of DNS servers is selected from defined network address zones, wherein the defined network address zones correspond to a division of assignable network addresses for service provider DNS servers, and wherein assigning the set of DNS servers for hosting the DNS query services includes selecting a non-significant portion of each assigned network address from unique values corresponding to a non-overlapping range of potential values; andcause, by the service provider, the DNS servers corresponding to the assigned network addresses to be authoritative to respond to DNS queries for the identifiable domain.
  • 16. The computer-readable storage medium as recited in claim 15, wherein the one or more computer-executable components further comprises computer-executable instructions to determine a number of network address zones.
  • 17. The computer-readable storage medium as recited in claim 16, wherein the number of network address zones corresponds to a proportional distribution of available network addresses.
  • 18. The computer-readable storage medium as recited in claim 15, wherein assigning a set of DNS servers for hosting the DNS query services includes selecting a network address from each defined network address zone such that the significant portion of the assigned network addresses for the identifiable domain are not matching.
CROSS REFERENCE TO RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 12/952,118 entitled “REQUEST ROUTING PROCESSING” and filed Nov. 22, 2010, the disclosure of which is incorporated herein by reference.

US Referenced Citations (631)
Number Name Date Kind
5341477 Pitkin et al. Aug 1994 A
5611049 Pitts Mar 1997 A
5774660 Brendel et al. Jun 1998 A
5852717 Bhide et al. Dec 1998 A
5892914 Pitts Apr 1999 A
5933811 Angles et al. Aug 1999 A
5974454 Apfel et al. Oct 1999 A
6016512 Huitema Jan 2000 A
6026452 Pitts Feb 2000 A
6052718 Gifford Apr 2000 A
6078960 Ballard Jun 2000 A
6085234 Pitts et al. Jul 2000 A
6098096 Tsirigotis et al. Aug 2000 A
6108703 Leighton et al. Aug 2000 A
6157942 Chu et al. Dec 2000 A
6167438 Yates et al. Dec 2000 A
6182111 Inohara et al. Jan 2001 B1
6185598 Farber et al. Feb 2001 B1
6192051 Lipman et al. Feb 2001 B1
6205475 Pitts Mar 2001 B1
6223288 Byrne Apr 2001 B1
6275496 Burns et al. Aug 2001 B1
6286043 Cuomo et al. Sep 2001 B1
6286084 Wexler et al. Sep 2001 B1
6304913 Rune Oct 2001 B1
6351743 DeArdo et al. Feb 2002 B1
6351775 Yu Feb 2002 B1
6363411 Dugan et al. Mar 2002 B1
6366952 Pitts Apr 2002 B2
6374290 Scharber et al. Apr 2002 B1
6405252 Gupta et al. Jun 2002 B1
6411967 Van Renesse Jun 2002 B1
6415280 Farber et al. Jul 2002 B1
6430607 Kavner Aug 2002 B1
6438592 Killian Aug 2002 B1
6452925 Sistanizadeh et al. Sep 2002 B1
6457047 Chandra et al. Sep 2002 B1
6459909 Bilcliff et al. Oct 2002 B1
6473804 Kaiser et al. Oct 2002 B1
6484143 Swildens et al. Nov 2002 B1
6505241 Pitts Jan 2003 B2
6529953 Van Renesse Mar 2003 B1
6553413 Leighton et al. Apr 2003 B1
6560610 Eatherton et al. May 2003 B1
6611873 Kanehara Aug 2003 B1
6654807 Farber et al. Nov 2003 B2
6658462 Dutta Dec 2003 B1
6665706 Kenner et al. Dec 2003 B2
6678791 Jacobs et al. Jan 2004 B1
6694358 Swildens et al. Feb 2004 B1
6697805 Choquier et al. Feb 2004 B1
6724770 Van Renesse Apr 2004 B1
6732237 Jacobs et al. May 2004 B1
6754699 Swildens et al. Jun 2004 B2
6754706 Swildens et al. Jun 2004 B1
6760721 Chasen et al. Jul 2004 B1
6769031 Bero Jul 2004 B1
6782398 Bahl Aug 2004 B1
6785704 McCanne Aug 2004 B1
6804706 Pitts Oct 2004 B2
6810291 Card et al. Oct 2004 B2
6810411 Coughlin et al. Oct 2004 B1
6829654 Jungck Dec 2004 B1
6874017 Inoue et al. Mar 2005 B1
6928467 Peng et al. Aug 2005 B2
6928485 Krishnamurthy et al. Aug 2005 B1
6941562 Gao et al. Sep 2005 B2
6963850 Bezos et al. Nov 2005 B1
6981017 Kasriel et al. Dec 2005 B1
6986018 O'Rourke et al. Jan 2006 B2
6990526 Zhu Jan 2006 B1
6996616 Leighton et al. Feb 2006 B1
7003555 Jungck Feb 2006 B1
7006099 Gut et al. Feb 2006 B2
7007089 Freedman Feb 2006 B2
7010578 Lewin et al. Mar 2006 B1
7010598 Sitaraman et al. Mar 2006 B2
7024466 Outten et al. Apr 2006 B2
7032010 Swildens et al. Apr 2006 B1
7058706 Iyer et al. Jun 2006 B1
7058953 Willard et al. Jun 2006 B2
7065587 Huitema et al. Jun 2006 B2
7072982 Teodosiu et al. Jul 2006 B2
7076633 Tormasov et al. Jul 2006 B2
7082476 Cohen et al. Jul 2006 B1
7086061 Joshi et al. Aug 2006 B1
7092505 Allison et al. Aug 2006 B2
7092997 Kasriel et al. Aug 2006 B1
7096266 Lewin et al. Aug 2006 B2
7099936 Chase et al. Aug 2006 B2
7103645 Leighton et al. Sep 2006 B2
7117262 Bai et al. Oct 2006 B2
7133905 Dilley et al. Nov 2006 B2
7136922 Sundaram et al. Nov 2006 B2
7139821 Shah et al. Nov 2006 B1
7143169 Champagne et al. Nov 2006 B1
7146560 Dang et al. Dec 2006 B2
7149809 Barde et al. Dec 2006 B2
7152118 Anderson, IV et al. Dec 2006 B2
7174382 Ramanathan et al. Feb 2007 B2
7185063 Kasriel et al. Feb 2007 B1
7188214 Kasriel et al. Mar 2007 B1
7194522 Swildens et al. Mar 2007 B1
7200667 Teodosiu et al. Apr 2007 B2
7216170 Danker et al. May 2007 B2
7225254 Swildens et al. May 2007 B1
7228350 Hong et al. Jun 2007 B2
7228359 Monteiro Jun 2007 B1
7233978 Overton et al. Jun 2007 B2
7240100 Wein et al. Jul 2007 B1
7251675 Kamakura et al. Jul 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
7269784 Kasriel et al. Sep 2007 B1
7274658 Bornstein et al. Sep 2007 B2
7289519 Liskov Oct 2007 B1
7293093 Leighton Nov 2007 B2
7310686 Uysal Dec 2007 B2
7316648 Kelly et al. Jan 2008 B2
7320131 O'Toole, Jr. Jan 2008 B1
7321918 Burd et al. Jan 2008 B2
7363291 Page Apr 2008 B1
7373416 Kagan et al. May 2008 B2
7376736 Sundaram et al. May 2008 B2
7380078 Ikegaya et al. May 2008 B2
7398301 Hennessey et al. Jul 2008 B2
7430610 Pace et al. Sep 2008 B2
7441045 Skene et al. Oct 2008 B2
7454500 Hsu et al. Nov 2008 B1
7461170 Taylor et al. Dec 2008 B1
7464142 Flurry et al. Dec 2008 B2
7478148 Neerdaels Jan 2009 B2
7492720 Pruthi et al. Feb 2009 B2
7499998 Toebes et al. Mar 2009 B2
7502836 Menditto et al. Mar 2009 B1
7519720 Fishman et al. Apr 2009 B2
7543024 Holstege Jun 2009 B2
7548947 Kasriel et al. Jun 2009 B2
7552235 Chase et al. Jun 2009 B2
7565407 Hayball Jul 2009 B1
7573916 Bechtolsheim et al. Aug 2009 B1
7594189 Walker et al. Sep 2009 B1
7596619 Leighton et al. Sep 2009 B2
7623460 Miyazaki Nov 2009 B2
7624169 Lisiecki et al. Nov 2009 B2
7640296 Fuchs et al. Dec 2009 B2
7650376 Blumenau Jan 2010 B1
7653700 Bahl et al. Jan 2010 B1
7653725 Yahiro et al. Jan 2010 B2
7657622 Douglis et al. Feb 2010 B1
7680897 Carter et al. Mar 2010 B1
7702724 Brydon et al. Apr 2010 B1
7706740 Collins et al. Apr 2010 B2
7707314 McCarthy et al. Apr 2010 B2
7711647 Gunaseelan et al. May 2010 B2
7711788 Lev Ran et al. May 2010 B2
7716367 Leighton et al. May 2010 B1
7725602 Liu et al. May 2010 B2
7730187 Raciborski et al. Jun 2010 B2
7739400 Lindbo et al. Jun 2010 B2
7747720 Toebes et al. Jun 2010 B2
7756913 Day Jul 2010 B1
7757202 Dahlsted et al. Jul 2010 B2
7761572 Auerbach Jul 2010 B1
7765304 Davis et al. Jul 2010 B2
7769823 Jenny et al. Aug 2010 B2
7773596 Marques Aug 2010 B1
7774342 Virdy Aug 2010 B1
7787380 Aggarwal et al. Aug 2010 B1
7792989 Toebes et al. Sep 2010 B2
7809597 Das et al. Oct 2010 B2
7813308 Reddy et al. Oct 2010 B2
7814229 Cabrera et al. Oct 2010 B1
7818454 Kim et al. Oct 2010 B2
7836177 Kasriel et al. Nov 2010 B2
7890612 Todd et al. Feb 2011 B2
7904875 Hegyi Mar 2011 B2
7912921 O'Rourke et al. Mar 2011 B2
7925782 Sivasubramanian et al. Apr 2011 B2
7930393 Baumback et al. Apr 2011 B1
7930427 Josefsberg et al. Apr 2011 B2
7933988 Nasuto et al. Apr 2011 B2
7937477 Day et al. May 2011 B1
7949779 Farber et al. May 2011 B2
7962597 Richardson et al. Jun 2011 B2
7966404 Hedin et al. Jun 2011 B2
7970816 Chess et al. Jun 2011 B2
7970940 van de Ven et al. Jun 2011 B1
7979509 Malmskog et al. Jul 2011 B1
7991910 Richardson et al. Aug 2011 B2
7996533 Leighton et al. Aug 2011 B2
7996535 Auerbach Aug 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8028090 Richardson et al. Sep 2011 B2
8041809 Sundaram et al. Oct 2011 B2
8041818 Gupta et al. Oct 2011 B2
8065275 Eriksen et al. Nov 2011 B2
8069231 Schran et al. Nov 2011 B2
8073940 Richardson et al. Dec 2011 B1
8082348 Averbuj et al. Dec 2011 B1
8117306 Baumback et al. Feb 2012 B1
8122098 Richardson et al. Feb 2012 B1
8122124 Baumback et al. Feb 2012 B1
8135820 Richardson et al. Mar 2012 B2
8156243 Richardson et al. Apr 2012 B2
8190682 Paterson-Jones et al. May 2012 B2
8224986 Liskov et al. Jul 2012 B1
8234403 Richardson et al. Jul 2012 B2
8239530 Sundaram et al. Aug 2012 B2
8250211 Swildens et al. Aug 2012 B2
8266288 Banerjee et al. Sep 2012 B2
8266327 Kumar et al. Sep 2012 B2
8291117 Eggleston et al. Oct 2012 B1
8301645 Crook Oct 2012 B1
8321568 Sivasubramanian et al. Nov 2012 B2
8402137 Sivasubramanian et al. Mar 2013 B2
8452874 MacCarthaigh et al. May 2013 B2
8468222 Sakata et al. Jun 2013 B2
8521851 Richardson et al. Aug 2013 B1
8521908 Holmes et al. Aug 2013 B2
8527658 Holmes et al. Sep 2013 B2
8577992 Richardson et al. Nov 2013 B1
8615549 Knowles et al. Dec 2013 B2
8626950 Richardson et al. Jan 2014 B1
8639817 Sivasubramanian et al. Jan 2014 B2
8676918 Richardson et al. Mar 2014 B2
8688837 Richardson et al. Apr 2014 B1
8732309 Richardson et al. May 2014 B1
8756325 Sivasubramanian et al. Jun 2014 B2
8756341 Richardson et al. Jun 2014 B1
8782236 Marshall et al. Jul 2014 B1
20010000811 May et al. May 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
20020007413 Garcia-Luna-Aceves et al. Jan 2002 A1
20020048269 Hong et al. Apr 2002 A1
20020049608 Hartsell et al. Apr 2002 A1
20020052942 Swildens et al. May 2002 A1
20020062372 Hong et al. May 2002 A1
20020068554 Dusse Jun 2002 A1
20020069420 Russell et al. Jun 2002 A1
20020078233 Biliris et al. Jun 2002 A1
20020082858 Heddaya et al. Jun 2002 A1
20020083118 Sim Jun 2002 A1
20020083148 Shaw et al. Jun 2002 A1
20020087374 Boubez 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
20020107944 Bai et al. Aug 2002 A1
20020112049 Elnozahy et al. Aug 2002 A1
20020116481 Lee Aug 2002 A1
20020116491 Boyd et al. Aug 2002 A1
20020124047 Gartner et al. Sep 2002 A1
20020124098 Shaw Sep 2002 A1
20020129123 Johnson et al. Sep 2002 A1
20020135611 Deosaran et al. Sep 2002 A1
20020138286 Engstrom Sep 2002 A1
20020138437 Lewin et al. Sep 2002 A1
20020143989 Huitema et al. Oct 2002 A1
20020147770 Tang Oct 2002 A1
20020147774 Lisiecki et al. Oct 2002 A1
20020150094 Cheng et al. Oct 2002 A1
20020156911 Croman et al. Oct 2002 A1
20020161767 Shapiro et al. Oct 2002 A1
20020163882 Bornstein et al. Nov 2002 A1
20020165912 Wenocur et al. Nov 2002 A1
20020188722 Banerjee et al. Dec 2002 A1
20020198953 O'Rourke et al. Dec 2002 A1
20030002484 Freedman Jan 2003 A1
20030009591 Hayball et al. Jan 2003 A1
20030028642 Agarwal et al. Feb 2003 A1
20030033283 Evans et al. Feb 2003 A1
20030037139 Shteyn Feb 2003 A1
20030065739 Shnier Apr 2003 A1
20030074401 Connell et al. Apr 2003 A1
20030079027 Slocombe et al. Apr 2003 A1
20030093523 Cranor et al. May 2003 A1
20030099202 Lear et al. May 2003 A1
20030101278 Garcia-Luna-Aceves et al. May 2003 A1
20030120741 Wu et al. Jun 2003 A1
20030133554 Nykanen et al. Jul 2003 A1
20030135509 Davis et al. Jul 2003 A1
20030140087 Lincoln et al. Jul 2003 A1
20030145038 Tariq et al. Jul 2003 A1
20030145066 Okada et al. Jul 2003 A1
20030149581 Chaudhri et al. Aug 2003 A1
20030154284 Bernardin et al. Aug 2003 A1
20030163722 Anderson, IV Aug 2003 A1
20030172145 Nguyen Sep 2003 A1
20030172183 Anderson, IV et al. Sep 2003 A1
20030172291 Judge et al. Sep 2003 A1
20030174648 Wang et al. Sep 2003 A1
20030182305 Balva et al. Sep 2003 A1
20030182413 Allen et al. Sep 2003 A1
20030182447 Schilling Sep 2003 A1
20030187935 Agarwalla et al. Oct 2003 A1
20030187970 Chase et al. Oct 2003 A1
20030191822 Leighton et al. Oct 2003 A1
20030200394 Ashmore et al. Oct 2003 A1
20030204602 Hudson et al. Oct 2003 A1
20030229682 Day Dec 2003 A1
20030233423 Dilley et al. Dec 2003 A1
20030233455 Leber et al. Dec 2003 A1
20030236700 Arning et al. Dec 2003 A1
20040010621 Afergan et al. Jan 2004 A1
20040019518 Abraham et al. Jan 2004 A1
20040024841 Becker et al. Feb 2004 A1
20040030620 Benjamin et al. Feb 2004 A1
20040034744 Karlsson et al. Feb 2004 A1
20040039798 Hotz et al. Feb 2004 A1
20040044731 Chen et al. Mar 2004 A1
20040044791 Pouzzner Mar 2004 A1
20040059805 Dinker et al. Mar 2004 A1
20040064501 Jan et al. Apr 2004 A1
20040073596 Kloninger et al. Apr 2004 A1
20040073867 Kausik et al. Apr 2004 A1
20040078468 Hedin et al. Apr 2004 A1
20040078487 Cernohous et al. Apr 2004 A1
20040083283 Sundaram et al. Apr 2004 A1
20040083307 Uysal Apr 2004 A1
20040117455 Kaminsky et al. Jun 2004 A1
20040128344 Trossen Jul 2004 A1
20040128346 Melamed et al. Jul 2004 A1
20040167981 Douglas et al. Aug 2004 A1
20040172466 Douglas et al. Sep 2004 A1
20040194085 Beaubien et al. Sep 2004 A1
20040194102 Neerdaels Sep 2004 A1
20040203630 Wang Oct 2004 A1
20040205149 Dillon et al. Oct 2004 A1
20040205162 Parikh Oct 2004 A1
20040215823 Kleinfelter et al. Oct 2004 A1
20040221034 Kausik et al. Nov 2004 A1
20040249939 Amini et al. Dec 2004 A1
20040249971 Klinker Dec 2004 A1
20040249975 Tuck et al. Dec 2004 A1
20040254921 Cohen et al. Dec 2004 A1
20040267906 Truty Dec 2004 A1
20040267907 Gustafsson Dec 2004 A1
20050010653 McCanne Jan 2005 A1
20050021706 Maggi et al. Jan 2005 A1
20050021862 Schroeder et al. Jan 2005 A1
20050038967 Umbehocker et al. Feb 2005 A1
20050044270 Grove et al. Feb 2005 A1
20050102683 Branson et al. May 2005 A1
20050108169 Balasubramanian et al. May 2005 A1
20050108529 Juneau May 2005 A1
20050114296 Farber et al. May 2005 A1
20050132083 Raciborski et al. Jun 2005 A1
20050157712 Rangarajan et al. Jul 2005 A1
20050163168 Sheth et al. Jul 2005 A1
20050168782 Kobashi et al. Aug 2005 A1
20050171959 Deforche et al. Aug 2005 A1
20050188073 Nakamichi et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050198571 Kramer et al. Sep 2005 A1
20050216569 Coppola et al. Sep 2005 A1
20050216674 Robbin et al. Sep 2005 A1
20050229119 Torvinen Oct 2005 A1
20050232165 Brawn et al. Oct 2005 A1
20050259672 Eduri Nov 2005 A1
20050262248 Jennings, III et al. Nov 2005 A1
20050267991 Huitema et al. Dec 2005 A1
20050267992 Huitema et al. Dec 2005 A1
20050267993 Huitema et al. Dec 2005 A1
20050278259 Gunaseelan et al. Dec 2005 A1
20050283759 Peteanu et al. Dec 2005 A1
20050283784 Suzuki Dec 2005 A1
20060013158 Ahuja et al. Jan 2006 A1
20060020596 Liu et al. Jan 2006 A1
20060020684 Mukherjee et al. Jan 2006 A1
20060020714 Girouard et al. Jan 2006 A1
20060020715 Jungck Jan 2006 A1
20060026067 Nicholas et al. Feb 2006 A1
20060026154 Altinel et al. Feb 2006 A1
20060036720 Faulk, Jr. Feb 2006 A1
20060036966 Yevdayev Feb 2006 A1
20060037037 Miranz Feb 2006 A1
20060041614 Oe Feb 2006 A1
20060047787 Agarwal et al. Mar 2006 A1
20060047813 Aggarwal et al. Mar 2006 A1
20060059246 Grove Mar 2006 A1
20060063534 Kokkonen et al. Mar 2006 A1
20060064476 Decasper et al. Mar 2006 A1
20060064500 Roth et al. Mar 2006 A1
20060074750 Clark et al. Apr 2006 A1
20060075084 Lyon Apr 2006 A1
20060075139 Jungck Apr 2006 A1
20060083165 McLane et al. Apr 2006 A1
20060085536 Meyer et al. Apr 2006 A1
20060088026 Mazur et al. Apr 2006 A1
20060112066 Hamzy May 2006 A1
20060112176 Liu et al. May 2006 A1
20060120385 Atchison et al. Jun 2006 A1
20060129665 Toebes et al. Jun 2006 A1
20060143293 Freedman Jun 2006 A1
20060149529 Nguyen et al. Jul 2006 A1
20060155823 Tran et al. Jul 2006 A1
20060161541 Cencini Jul 2006 A1
20060168088 Leighton et al. Jul 2006 A1
20060179080 Meek et al. Aug 2006 A1
20060184936 Abels et al. Aug 2006 A1
20060190605 Franz et al. Aug 2006 A1
20060193247 Naseh et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060218304 Mukherjee et al. Sep 2006 A1
20060227740 McLaughlin et al. Oct 2006 A1
20060227758 Rana et al. Oct 2006 A1
20060230137 Gare et al. Oct 2006 A1
20060233155 Srivastava Oct 2006 A1
20060253546 Chang et al. Nov 2006 A1
20060253609 Andreev et al. Nov 2006 A1
20060259581 Piersol Nov 2006 A1
20060259690 Vittal et al. Nov 2006 A1
20060259984 Juneau Nov 2006 A1
20060265497 Ohata et al. Nov 2006 A1
20060265508 Angel et al. Nov 2006 A1
20060265516 Schilling Nov 2006 A1
20060265720 Cai et al. Nov 2006 A1
20060271641 Stavrakos et al. Nov 2006 A1
20060282522 Lewin et al. Dec 2006 A1
20070005689 Leighton 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
20070038994 Davis et al. Feb 2007 A1
20070041393 Westhead et al. Feb 2007 A1
20070043859 Ruul Feb 2007 A1
20070050522 Grove et al. Mar 2007 A1
20070050703 Lebel Mar 2007 A1
20070055764 Dilley et al. Mar 2007 A1
20070061440 Sundaram et al. Mar 2007 A1
20070076872 Juneau Apr 2007 A1
20070086429 Lawrence et al. Apr 2007 A1
20070094361 Hoynowski et al. Apr 2007 A1
20070101377 Six et al. May 2007 A1
20070118667 McCarthy et al. May 2007 A1
20070118668 McCarthy et al. May 2007 A1
20070134641 Lieu Jun 2007 A1
20070162331 Sullivan Jul 2007 A1
20070168517 Weller Jul 2007 A1
20070174426 Swildens et al. Jul 2007 A1
20070174442 Sherman et al. Jul 2007 A1
20070174490 Choi et al. Jul 2007 A1
20070183342 Wong et al. Aug 2007 A1
20070198982 Bolan et al. Aug 2007 A1
20070204107 Greenfield et al. Aug 2007 A1
20070208737 Li et al. Sep 2007 A1
20070219795 Park et al. Sep 2007 A1
20070220010 Ertugrul Sep 2007 A1
20070244964 Challenger et al. Oct 2007 A1
20070250467 Mesnik et al. Oct 2007 A1
20070250560 Wein et al. Oct 2007 A1
20070250601 Amlekar et al. Oct 2007 A1
20070250611 Bhogal et al. Oct 2007 A1
20070253377 Janneteau et al. Nov 2007 A1
20070255843 Zubev Nov 2007 A1
20070263604 Tal Nov 2007 A1
20070266113 Koopmans et al. Nov 2007 A1
20070266311 Westphal Nov 2007 A1
20070266333 Cossey et al. Nov 2007 A1
20070271375 Hwang Nov 2007 A1
20070271385 Davis et al. Nov 2007 A1
20070280229 Kenney Dec 2007 A1
20070288588 Wein et al. Dec 2007 A1
20080005057 Ozzie et al. Jan 2008 A1
20080008089 Bornstein et al. Jan 2008 A1
20080025304 Venkataswami et al. Jan 2008 A1
20080046550 Mazur et al. Feb 2008 A1
20080046596 Afergan et al. Feb 2008 A1
20080065724 Seed et al. Mar 2008 A1
20080065745 Leighton et al. Mar 2008 A1
20080071859 Seed et al. Mar 2008 A1
20080071987 Karn et al. Mar 2008 A1
20080072264 Crayford Mar 2008 A1
20080082551 Farber et al. Apr 2008 A1
20080086574 Raciborski et al. Apr 2008 A1
20080103805 Shear et al. May 2008 A1
20080104268 Farber et al. May 2008 A1
20080114829 Button et al. May 2008 A1
20080134043 Georgis et al. Jun 2008 A1
20080147866 Stolorz et al. Jun 2008 A1
20080147873 Matsumoto Jun 2008 A1
20080155061 Afergan et al. Jun 2008 A1
20080155614 Cooper et al. Jun 2008 A1
20080162667 Verma et al. Jul 2008 A1
20080162821 Duran et al. Jul 2008 A1
20080172488 Jawahar et al. Jul 2008 A1
20080189437 Halley Aug 2008 A1
20080201332 Souders et al. Aug 2008 A1
20080215718 Stolorz et al. Sep 2008 A1
20080215730 Sundaram et al. Sep 2008 A1
20080215735 Farber et al. Sep 2008 A1
20080215750 Farber et al. Sep 2008 A1
20080215755 Farber et al. Sep 2008 A1
20080222281 Dilley et al. Sep 2008 A1
20080222291 Weller et al. Sep 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080228574 Stewart et al. Sep 2008 A1
20080228920 Souders et al. Sep 2008 A1
20080235400 Slocombe et al. Sep 2008 A1
20080256175 Lee et al. Oct 2008 A1
20080275772 Suryanarayana et al. Nov 2008 A1
20080281950 Wald et al. Nov 2008 A1
20080288722 Lecoq et al. Nov 2008 A1
20080301670 Gouge et al. Dec 2008 A1
20080319862 Golan et al. Dec 2008 A1
20090013063 Soman Jan 2009 A1
20090016236 Alcala et al. Jan 2009 A1
20090029644 Sue et al. Jan 2009 A1
20090031367 Sue Jan 2009 A1
20090031368 Ling Jan 2009 A1
20090031376 Riley et al. Jan 2009 A1
20090049098 Pickelsimer et al. Feb 2009 A1
20090063704 Taylor et al. Mar 2009 A1
20090070533 Elazary et al. Mar 2009 A1
20090083228 Shatz et al. Mar 2009 A1
20090086741 Zhang Apr 2009 A1
20090103707 McGary et al. Apr 2009 A1
20090106381 Kasriel et al. Apr 2009 A1
20090112703 Brown Apr 2009 A1
20090125934 Jones et al. May 2009 A1
20090132368 Cotter et al. May 2009 A1
20090132648 Swildens et al. May 2009 A1
20090144412 Ferguson et al. Jun 2009 A1
20090150926 Schlack Jun 2009 A1
20090157850 Gagliardi et al. Jun 2009 A1
20090158163 Stephens et al. Jun 2009 A1
20090164331 Bishop et al. Jun 2009 A1
20090177667 Ramos et al. Jul 2009 A1
20090182815 Czechowski et al. Jul 2009 A1
20090182945 Aviles et al. Jul 2009 A1
20090187575 DaCosta Jul 2009 A1
20090204682 Jeyaseelan et al. Aug 2009 A1
20090210549 Hudson et al. Aug 2009 A1
20090248852 Fuhrmann et al. Oct 2009 A1
20090248893 Richardson et al. Oct 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090259971 Rankine et al. Oct 2009 A1
20090271577 Campana et al. Oct 2009 A1
20090271730 Rose et al. Oct 2009 A1
20090279444 Ravindran et al. Nov 2009 A1
20090287750 Banavar et al. Nov 2009 A1
20090307307 Igarashi Dec 2009 A1
20090327489 Swildens et al. Dec 2009 A1
20090327517 Sivasubramanian et al. Dec 2009 A1
20090327914 Adar et al. Dec 2009 A1
20100005175 Swildens et al. Jan 2010 A1
20100011061 Hudson et al. Jan 2010 A1
20100023601 Lewin et al. Jan 2010 A1
20100030662 Klein Feb 2010 A1
20100034470 Valencia-Campo et al. Feb 2010 A1
20100036944 Douglis et al. Feb 2010 A1
20100057894 Glasser Mar 2010 A1
20100070603 Moss et al. Mar 2010 A1
20100088367 Brown et al. Apr 2010 A1
20100088405 Huang et al. Apr 2010 A1
20100100629 Raciborski et al. Apr 2010 A1
20100111059 Bappu et al. May 2010 A1
20100121953 Friedman et al. May 2010 A1
20100121981 Drako May 2010 A1
20100122069 Gonion May 2010 A1
20100125673 Richardson et al. May 2010 A1
20100125675 Richardson et al. May 2010 A1
20100131646 Drako May 2010 A1
20100150155 Napierala Jun 2010 A1
20100161799 Maloo Jun 2010 A1
20100169392 Lev Ran et al. Jul 2010 A1
20100192225 Ma et al. Jul 2010 A1
20100217801 Leighton et al. Aug 2010 A1
20100226372 Watanabe Sep 2010 A1
20100257024 Holmes et al. Oct 2010 A1
20100257266 Holmes et al. Oct 2010 A1
20100257566 Matila Oct 2010 A1
20100293479 Rousso et al. Nov 2010 A1
20100299438 Zimmerman et al. Nov 2010 A1
20100299439 McCarthy et al. Nov 2010 A1
20100312861 Kolhi et al. Dec 2010 A1
20100318508 Brawer et al. Dec 2010 A1
20100322255 Hao et al. Dec 2010 A1
20100332595 Fullagar et al. Dec 2010 A1
20110029598 Arnold et al. Feb 2011 A1
20110040893 Karaoguz et al. Feb 2011 A1
20110078000 Ma et al. Mar 2011 A1
20110078230 Sepulveda Mar 2011 A1
20110087769 Holmes et al. Apr 2011 A1
20110096987 Morales et al. Apr 2011 A1
20110113467 Agarwal et al. May 2011 A1
20110153938 Verzunov et al. Jun 2011 A1
20110153941 Spatscheck et al. Jun 2011 A1
20110191449 Swildens et al. Aug 2011 A1
20110219372 Agrawal et al. Sep 2011 A1
20110238501 Almeida Sep 2011 A1
20110238793 Bedare et al. Sep 2011 A1
20110252142 Richardson et al. Oct 2011 A1
20110252143 Baumback et al. Oct 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110276623 Girbal Nov 2011 A1
20110302304 Baumback et al. Dec 2011 A1
20120036238 Sundaram et al. Feb 2012 A1
20120066360 Ghosh Mar 2012 A1
20120124184 Sakata et al. May 2012 A1
20120131177 Brandt et al. May 2012 A1
20120166516 Simmons et al. Jun 2012 A1
20120169646 Berkes et al. Jul 2012 A1
20120179839 Raciborski et al. Jul 2012 A1
20120198043 Hesketh et al. Aug 2012 A1
20120233522 Barton et al. Sep 2012 A1
20120233668 Leafe et al. Sep 2012 A1
20120303804 Sundaram et al. Nov 2012 A1
20120311648 Swildens et al. Dec 2012 A1
20130041872 Aizman et al. Feb 2013 A1
20130086001 Bhogal et al. Apr 2013 A1
20130130221 Kortemeyer et al. May 2013 A1
20130198341 Kim Aug 2013 A1
20130212300 Eggleston et al. Aug 2013 A1
20130246567 Green et al. Sep 2013 A1
20130268616 Sakata et al. Oct 2013 A1
20130339429 Richardson et al. Dec 2013 A1
20140075109 Richardson et al. Mar 2014 A1
20140143320 Sivasubramanian et al. May 2014 A1
20140257891 Richardson et al. Sep 2014 A1
20140325155 Marshall et al. Oct 2014 A1
Foreign Referenced Citations (21)
Number Date Country
1422468 Jun 2003 CN
1605182 Apr 2005 CN
101189598 May 2008 CN
101460907 Jun 2009 CN
2008167 Dec 2008 EP
2001-0506093 May 2001 JP
2002-044137 Feb 2002 JP
2003-167810 Jun 2003 JP
2003-167813 Jun 2003 JP
2003188901 Jul 2003 JP
2003522358 Jul 2003 JP
2004-533738 Nov 2004 JP
2005-537687 Dec 2005 JP
2007-133896 May 2007 JP
2009-071538 Apr 2009 JP
2012-209623 Oct 2012 JP
WO 2007007960 Jan 2007 WO
WO 2007126837 Nov 2007 WO
WO 2010002603 Jan 2010 WO
WO 2012044587 Apr 2012 WO
WO 2012044587 Apr 2012 WO
Non-Patent Literature Citations (104)
Entry
Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013.
International Preliminary Report on Patentability in PCT/US2007/007601 mailed Sep. 30, 2008 in 8 pages.
International Search Report and Written Opinion in PCT/US07/07601 mailed Jul. 18, 2008 in 11 pages.
Office Action in Canadian Application No. 2741895 dated Oct. 21, 2013.
Office Action in Chinese Application No. 200980119993.1 dated Oct. 21, 2013.
Office Action in Japanese Application No. 2011-502138 mailed Feb. 1, 2013.
Office Action in Japanese Application No. 2011-502140 mailed Dec. 7, 2012.
Office Action in Japanese Application No. 2012-052264 mailed Dec. 11, 2012 in 26 pages.
First Office Action is Chinese Application No. 200980125551.8 mailed Jul. 4, 2012.
Office Action in Indian Application No. 3742/KOLNP/2008 dated Nov. 22, 2013.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”, Dec. 18, 2004, Technical University Berlin, all 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.
Second Office Action in Chinese Application No. 200980111426.1 mailed Dec. 25, 2013.
Third Office Action in Chinese Application No. 200980111426.1 mailed Jul. 7, 2014.
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.
First Office Action in Japanese Application No. 2011-502140 mailed Dec. 7, 2012.
Examination Report in Singapore Application No. 201006874-0 dated May 16, 2012.
First Office Action in Japanese Application No. 2011-503091 dated Nov. 18, 2013.
Search Report and Written Opinion issued in Singapore Application No. 201006873-2 mailed on Oct. 12, 2011.
Second Office Action in Japanese Application No. 2011-516466 mailed Mar. 17, 2014.
Preliminary Examination in Chinese Application No. 201310717573.1 dated Feb. 25, 2014. English Translation Not Yet Received.
First Office Action in Japanese Application No. 2013-529454 mailed Feb. 3, 2014 in 6 pages.
First Office Action issued in Australian Application No. 2011307319 mailed Mar. 6, 2014 in 5 pages.
Search Report and Written Opinion in Singapore Application No. 201301573-0 mailed Jul. 1, 2014.
Office Action in Japanese Application No. 2013-540982 dated Jun. 2, 2014 English Translation Not Yet Received.
Written Opinion in Singapore Application No. 201303521-7 dated May 20, 2014.
Office Action in Japanese Application No. 2013-123086 mailed Apr. 15, 2014 in 3 pages.
“Global Server Load Balancing with ServerIron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages.
“Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages.
“Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/bin/view/Sungrid/OtherGridOfferings, 8 pages.
“Recent Advances Boost System Virtualization,” eWeek.com, retrieved from May 3, 2006, http://www.eWeek.com/article2/0,1895,1772626,00.asp, 5 pages.
“Scaleable Trust of Next Generation Management (STRONGMAN),” retrieved May 17, 2006, from http://www.cis.upenn.edu/˜dsl/STRONGMAN/, 4 pages.
“Sun EDA Compute Ranch,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://sun.com/processors/ranch/brochure.pdf, 2 pages.
“Sun Microsystems Accelerates UltraSP ARC Processor Design Program With New Burlington, Mass. Compute Ranch,” Nov. 6, 2002, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2002-11/sunflash.20021106.3 .xml, 2 pages.
“Sun N1 Grid Engine 6,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/gridware/index.xml, 3 pages.
“Sun Opens New Processor Design Compute Ranch,” Nov. 30, 2001, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2001-11/sunflash.20011130.1.xml, 3 pages.
“The Softricity Desktop,” Softricity, Inc., retrieved May 3, 2006, from http://www.softricity.com/products/, 3 pages.
“Xen—The Xen virtual Machine Monitor,” University of Cambridge Computer Laboratory, retrieved Nov. 8, 2005, from http://www.cl.cam.ac.uk/Research/SRG/netos/xen/, 2 pages.
“XenFaq,” retrieved Nov. 8, 2005, from http://wiki.xensource.com/xenwiki/XenFaq?action=print, 9 pages.
Abi, Issam, et al., “A Business Driven Management Framework for Utility Computing Environments,” Oct. 12, 2004, HP Laboratories Bristol, HPL-2004-171, retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2004/HPL-2004-171.pdf, 14 pages.
American Bar Association; Digital Signature Guidelines Tutorial [online]; Feb. 10, 2002 [retrived 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.
Baglioni et al., “Preprocessing and Mining Web Log Data for Web Personalization”, LNAI 2829, 2003, pp. 237-249.
Bellovin, S., “Distributed Firewalls,” ;login;:37-39, Nov. 1999, http://www.cs.columbia.edu/-smb/papers/distfw. html, 10 pages, retrieved Nov. 11, 2005.
Blaze, M., “Using the KeyNote Trust Management System,” Mar. 1, 2001, from http://www.crypto.com/trustmgt/kn.html, 4 pages, retrieved May 17, 2006.
Brenton, C., “What is Egress Filtering and How Can I Implement It?—Egress Filtering v 0.2,” Feb. 29, 2000, SANS Institute, http://www.sans.org/infosecFAQ/firewall/egress.htm, 6 pages.
Byun et al., “A Dynamic Grid Services Deployment Mechanism for On-Demand Resource Provisioning”, IEEE International Symposium on Cluster Computing and the Grid:863-870, 2005.
Clark, C., “Live Migration of Virtual Machines,” May 2005, NSDI '05: 2nd Symposium on Networked Systems Design and Implementation, Boston, MA, May 2-4, 2005, retrieved from http://www.usenix.org/events/nsdi05/tech/full—papers/clark/clark.pdf, 14 pages.
Coulson, D., “Network Security Iptables,” Apr. 2003, Linuxpro, Part 2, retrieved from http://davidcoulson.net/writing/Ixf/38/iptables.pdf, 4 pages.
Coulson, D., “Network Security Iptables,” Mar. 2003, Linuxpro, Part 1, retrieved from http://davidcoulson.net/writing/Ixf/39/iptables.pdf, 4 pages.
Deleuze, C., et al., A DNS Based Mapping Peering System for Peering CDNs, draft-deleuze-cdnp-dnsmap-peer-00.txt, Nov. 20, 2000, 20 pages.
Demers, A., “Epidemic Algorithms for Replicated Database Maintenance,” 1987, Proceedings of the sixth annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, Aug. 10-12, 1987, 12 pages.
First Office Action in Chinese Application No. 200980111426.1 mailed Feb. 16, 2013.
First Office Action in Chinese Application No. 200980119993.1 dated Jul. 4, 2012.
First Office Action in Chinese Application No. 200980119995.0 dated Jul. 6, 2012.
First Office Action in Chinese Application No. 200980145872.4 dated Nov. 29, 2012.
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.
International Search Report and Written Opinion in PCT/US2010/060567 mailed on Mar. 28, 2012.
International Search Report and Written Opinion in PCT/US2011/053302 mailed Nov. 28, 2011 in 11 pages.
International Search Report and Written Opinion in PCT/US2011/061486 mailed Mar. 30, 2012 in 11 pages.
Ioannidis, S., et al., “Implementing a Distributed Firewall,” Nov. 2000, (ACM) Proceedings of the ACM Computer and Communications Security (CCS) 2000, Athens, Greece, pp. 190-199, retrieved from http://www.cis.upenn.edu/˜dls/STRONGMAN/Papers/df.pdf, 10 pages.
Joseph, Joshy, et al., “Introduction to Grid Computing,” Apr. 16, 2004, retrieved Aug. 30, 2007, from http://www.informit.com/articles/printerfriendly.aspx?p=169508, 19 pages.
Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables—Basics.html, 4 pages.
Liu 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.
Office Action in Candian Application No. 2741895 dated Feb. 25, 2013.
Search Report and Written Opinion in Singapore Application No. 201103333-9 mailed Nov. 19, 2012.
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.
Singapore Examination Report in Application No. 201006837-7 mailed May 16, 2012.
Singapore Written Opinion in Application No. 201006836-9, mailed Apr. 30, 2012 in 10 pages.
Singapore Written Opinion in Application No. 201006836-9, mailed Oct. 12, 2011 in 12 pages.
Singapore Written Opinion in Application No. 201006837-7, mailed Oct. 12, 2011 in 11 pages.
Singapore Written Opinion in Application No. 201006874-0, mailed Oct. 12, 2011 in 10 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.
Supplementary European Search Report in Application No. 07754164.7 mailed Dec. 20, 2010 in 7 pages.
Supplementary European Search Report in Application No. 09727694.3 mailed Jan. 30, 2012 in 6 pages.
Supplementary European Search Report in Application No. 09728756.9 mailed Jan. 8, 2013.
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, I5 pages.
Watanabe, et al., “Remote Program Shipping System for GridRPC Systems,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2003, No. 102, pp. 73-78, Japan, Oct. 16, 2003.
Xu et al., “Decision tree regression for soft classification of remote sensing data”, Remote Sensing of Environment 97 (2005) pp. 322-336.
Yamagata, et al., “A virtual-machine based fast deployment tool for Grid execution environment,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2006, No. 20, pp. 127-132, Japan, Feb. 28, 2006.
Zhu, Xiaoyun, et al., “Utility-Driven Workload Management Using Nested Control Design,” Mar. 29, 2006, HP Laboratories Palo Alto, HPL-2005-193(R.1), retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2005/HPL-2005-193R1.pdf, 9 pages.
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).
Bennami, M., et al., Resource Allocation for Autonomic Data Centers Using Analytic Performance Models, 2005, IEEE, 12 pages.
Chipara et al, “Realtime Power-Aware Routing in Sensor Network”, IEEE, 2006, 10 pages.
International Preliminary Report on Patentability and Written Opinion in PCT/US2010/060567 mailed on Jun. 19, 2012.
International Preliminary Report on Patentability and Written Opinion in PCT/US2010/060569 mailed Jun. 19, 2012.
International Preliminary Report on Patentability and Written Opinion in PCT/US2010/060573 mailed Jun. 19, 2012.
International Preliminary Report on Patentability in PCT/US2011/053302 mailed Apr. 2, 2013.
International Preliminary Report on Patentability in PCT/US2011/061486 mailed May 22, 2013.
Kounev, S., et al., Autonomic QoS-Aware Resource Management in Grid Computing Using Online Performance Models, 2007, ICST, Valuetools, 2007, 10 pages.
Office Action in Canadian Application No. 2726915 dated May 13, 2013.
Office Action in Chinese Application No. 200780020255.2 dated Mar. 4, 2013.
Office Action in Chinese Application No. 200980119995.0 dated Apr. 15, 2013.
Office Action in Japanese Application No. 2011-516466 mailed Mar. 6, 2013.
Office Action in Korean Appliation No. 10-2011-7002461 mailed May 29, 2013.
Preliminary Examination in Chinese Application No. 201180053405.6 dated May 28, 2013. English Translation Not Yet Received.
Second Office Action in Chinese Application No. 200980119993.1 dated Mar. 12, 2013.
Related Publications (1)
Number Date Country
20130246624 A1 Sep 2013 US
Continuations (1)
Number Date Country
Parent 12952118 Nov 2010 US
Child 13873040 US