Routing for origin-facing points of presence

Information

  • Patent Grant
  • 10270878
  • Patent Number
    10,270,878
  • Date Filed
    Tuesday, November 10, 2015
    8 years ago
  • Date Issued
    Tuesday, April 23, 2019
    5 years ago
Abstract
Systems and methods are described to enable and manage the use of origin-facing points of presence (“POPs”) within a content delivery network (“CDN”). Origin-facing POPs can provide a second-tier caching mechanisms in a CDN, such that cache misses occurring at first-tier POPs may be processed by using information maintained at the origin-facing POPs, rather than requiring interaction with an origin server. Associations between origin-facing POPs and origin servers may be automatically created based on a distance between the respective origin-facing POPs and origin servers, such that an operator of the origin server is not required to specify a location of an origin facing POP. First-tier POPs may selectively retrieve content from origin-facing POPs in instances where the origin-facing POP is expected to provide the content more rapidly than the origin server.
Description
BACKGROUND

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


Content providers (such as businesses, artists, media distribution services, etc.) can employ a series of interconnected data centers to deliver content (such as web sites, web content, or other digital data) to users or clients. These interconnected data centers are sometimes referred to as “content delivery networks” (CDNs) or content delivery systems. Existing routing and addressing technologies can enable multiple data centers associated with a content delivery system to provide similar or identical content to client computing devices. In some instances, each data center providing a set of content may be referred to as a point-of-presence (“POP”). A content delivery system can maintain POPs over a wide area (or worldwide) to enable the system to efficiently service requests from clients in a variety of locations.


To utilize a CDN, a content provider generally designates one or more computing devices or data centers to maintain primary copies of content, which are sometimes referred to as “origin servers.” Each POP within the CDN can maintain all or a portion of the content maintained on the origin server (e.g., within a data cache of the CDN). When a client requests a content item from a POP, the POP can determine whether that the requested content item is maintained at the POP. If so, the POP can provide the requested content item to the client directly. If not, the POP may first retrieve the content item from the origin server, and thereafter provide the content item to the client. This process of returning content not presently maintained at a POP is sometimes referred to as a “cache miss.” Cache misses are generally undesirable, in that they result in delays to fulfill client requests (e.g., due to the time required to retrieve content from the origin server) as well as increased load on the origin server itself.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a block diagram depicting an illustrative logical network 100 including multiple client computing devices and origin servers, as well as a content delivery network (“CDN”) including a point of presence (“POP”) manager, multiple edge POPs, and multiple mid-tier POPs;



FIG. 2 is a block diagram depicting an illustrative configuration of one embodiment of a server implementing an edge POP of FIG. 1;



FIG. 3 is a block diagram depicting interactions between an edge POP and other components of FIG. 1 to generate mid-tier POP and origin server routing information, which may be used by the edge POP to route client requests for content received at the CDN;



FIG. 4 is a block diagram depicting interactions between a content provider and other components of FIG. 1 to assign a mid-tier POP, within the CDN, to content associated with an origin server;



FIG. 5 is a block diagram depicting interactions for routing a client request, at an edge POP within the CDN of FIG. 1, for content that is not maintained at the edge POP; and



FIG. 6 is a flow chart depicting an illustrative routine for routing client requests, at an edge POP within the CDN of FIG. 1, for content that is not maintained at the edge POP.





DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to implementing and managing second-level points of presence (“POPs”) within a content delivery network (“CDN”). Second-level POPs can generally refer to a computing device or collection of computing devices that may act as intermediary sources for various sets of content (each of which can be generally referred to as a content “distribution”), between edge POPs of a CDN (e.g., those POPs that receive and process client requests for content on the CDN, which may also be referred to as “client-facing” POPs) and origin servers (e.g., those devices that serve as primary sources for content distributed via the CDN). Specifically, second-level POPs, which may also be referred to herein as “mid-tier POPs” or “origin-facing POPs” may enable cache misses to be handled on the CDN without requiring interaction with the origin server. Thus, the use of second-level POPs can substantially improve the performance of the CDN in handling cache misses, both by reducing the time required to provide content to a client and by reducing the computing resources needed at the origin server. The present disclosure further describes systems and methods for automatically determining locations for placement of second-level POPs based on the location of an origin server for a specific distribution (e.g., a specific set of content). Specifically, aspects of the present disclosure enable a second-level POP to be established in close geographic or network proximity to an origin server. Such placement of a second-level POP can improve the ability of the second-level POP and origin server to rapidly communicate, thus further reducing the computing resources required by the origin server. Still further, the present disclosure describes systems and methods for routing requests within a CDN utilizing second-level POPs. Specifically, aspects of the present disclosure enable edge POPs to selectively retrieve uncached content (e.g., content corresponding to a cache miss) from either second-level POPs or from origin servers, based at least partly on a geographic or network distance between the edge POP and the second-level POPs or origin servers. In this manner, retrieval of uncached content can occur via second-level POPs only when such retrieval is expected to improve the performance of the CDN (e.g., with respect to time required to service client requests, reduction of computing resources needed at an origin server, or both).


Content providers may generally maintain one or more primary sources for a distribution, such as web servers operated by the content providers, which are generally referred to as “origin servers.” Because a content provider may not wish to maintain an extensive network of origin servers, these servers are often located in one geographical location, and associated with limited computing resources. This configuration can lead to large geographic and network distance existing between the origin server and the various client devices that are provided content. To reduce the time required to provide content to client devices, and to reduce the computing resources required at an origin server, a content provider may utilize a CDN, which includes a set of edge POPs distributed at various geographical locations, each of can maintain at least a portion of the content of the distribution (e.g., as initially provided to the edge POP by the origin server). These edge POPs may receive client requests for content of the distribution, and respond to these requests utilizing versions of the content stored at the edge POP. However, the storage capabilities of edge POPs are generally also limited, such that not all content of all content of all distributions associated with the edge POP can be maintained concurrently. To address this issue, when a client requests content of a distribution, and that content is not maintained at the edge POP (sometimes referred to as a “cache miss”), the edge POP may first retrieve the content from an origin server associated with the distribution. The process of retrieving content from an origin server can increase the time required to service the request as well as increasing the load on the origin server, thus negating a portion of the benefit provided by the CDN.


In accordance with aspects of the present disclosure, the negative effects of cache misses on a CDN may be eliminated or reduced by use of one or more mid-tier POPs within the CDN. Each mid-tier POP may serve as a potential intermediary source of content for edge POPs, such that when a cache miss occurs at the edge POP, the requested content can be retrieved from a mid-tier POP, rather than an origin server providing that content. Because edge POPs and mid-tier POPs may communicate with one another via specialized communication protocols or via a private computing network, retrieval of content from a mid-tier POP may occur more rapidly than would be possible from an origin server. Moreover, retrieval of content from a mid-tier POP can reduce the use of computing resources at the origin server. Thus, the use of mid-tier POPs can enable the CDN to rapidly provide content to clients even in the instance that a cache miss occurs at an edge POP.


The CDN may provide multiple mid-tier POPs, each associated with specific distributions. In one embodiment, each mid-tier POP may be assigned to act as an intermediary content source for distributions with origin servers nearby to the mid-tier POP, either in geographical or network terms, to enable rapid communication between the mid-tier POP and the assigned origin servers. Thus, when a content provider requests the use of a mid-tier POP on the CDN for a distribution of content, the CDN may locate a mid-tier POP nearby to an origin server acting as a primary source for that distribution of content, and assign the origin server to that mid-tier POP, such that the mid-tier POP acts as an intermediary content source for the distribution. Such automatic location of mid-tier POPs may eliminate the need for content providers to manually specify desired mid-tier POPs within the CDN. As will be described in more detail below, the CDN may utilize passively obtained network data, actively obtained network data, or both to determine the proximity of mid-tier POPs to origin servers. In another embodiment, each mid-tier POP may be assigned to act as an intermediary content source for all distributions associated with the CDN. This may reduce the need to assign mid-tier POPs to specific distributions, but may also increase the computing resources utilized by each mid-tier POP.


In some instances, the use of mid-tier POPs may not be expected to increase the performance of the CDN. For example, where an origin server has excess unused computing resources, and where the origin server is closer (e.g., in geographic or network distance) to an edge POP than is an assigned mid-tier POP, it may be more beneficial for the edge POP to communicate directly with the origin server than to utilize the mid-tier POP as an intermediary content source. Thus, embodiments of the present application further enable an edge POP to selectively retrieve content of a distribution from either an origin server associated with that distribution or a mid-tier POP of the CDN storing content of the distribution, based on an expected performance of communications with the origin server and mid-tier POP. To enable such selective retrieval, the edge POP can maintain routing information for individual origin servers associated with each distribution, as well as for the mid-tier POPs provided by a CDN that are associated with one or more distributions. When a request for uncached content of a given distribution is processed at the edge POP, the edge POP can dynamically generate a routing table indicating a preferred source for the uncached content, and retrieve the uncached content from the preferred source. In this manner, edge POPs can be configured to utilize mid-tier POPs only in instances where use of mid-tier POPs is expected to increase the performance of the CDN (e.g., by reducing the time required to service client requests, by reducing the computing resources needed at the origin server, or both).


As will be appreciated by one of skill in the art in light of the description above, the embodiments disclosed herein substantially increase the ability of computing systems, such as CDNs, to rapidly and effectively distribute content to client computing devices, even in instances of cache misses. Thus, the presently disclosed embodiments represent an improvement in the functioning of such computing systems. Moreover, the presently disclosed embodiments address technical problems inherent within computing systems; specifically, the limited capacity of computing systems to store information, as well as the limited ability of such systems to process network-based requests. These technical problems are addressed by the various technical solutions described herein, including the utilization of mid-tier POPs, the assignment of mid-tier POPs to distributions based on geographic or network proximity to origin servers associated with those distributions, and the selective routing of requests for content to mid-tier POPs or origin servers (e.g., based on a dynamically created routing table related to the mid-tier POPs or origin servers). Thus, the present application represents a substantial improvement on existing network systems and computing systems in general.


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



FIG. 1 is a block diagram depicting an illustrative logical network 100 including multiple client computing devices 102 and origin servers 104 in communication with a CDN 110 via a network 106. As shown in FIG. 1, the CDN 110 includes a plurality of edge POPs 112, a plurality of mid-tier POPs 112, and a POP manager 116 in communication via a private network. The various elements of the CDN 110 are described in more detail below.


While the client computing devices 102 and the origin servers 104 are shown as a group within FIG. 1, the client computing devices 102 and origin servers 104 may be geographically distant, and independently owned or operated. For example, the client computing devices 102 could represent a multitude of users in various global, continental, or regional locations accessing the CDN 110. Further, the origin servers 104 could represent a multitude of related or distinct parties that have associated with the CDN 110 to provide sets of content, such as web sites, multimedia, or other digital, network-deliverable content (each generally referred to as a “distribution”) to the client computing devices 102. Accordingly, the groupings of client computing devices 102 and origin servers 104 within FIG. 1 is intended to represent a logical, rather than physical, grouping. Similarly, each of the components of the CDN 110 may be located within geographically diverse areas. For example, the edge POPs 112 and mid-tier POPs 114 within the CDN 110 (described in more detail below) may be globally, continentally, or regionally disparate, in order to provide a wide geographical presence for the CDN 110.


Network 106 may be any wired network, wireless network, or combination thereof. In addition, the network 106 may be a personal area network, local area network, wide area network, cable network, satellite network, cellular telephone network, or combination thereof. In the example environment of FIG. 1, network 106 is a global area network (GAN), such as the Internet. Protocols and components for communicating via the other aforementioned types of communication networks are well known to those skilled in the art of computer communications and thus, need not be described in more detail herein. While each of the client computing devices 102, origin servers 104, and CDN 110 is depicted as having a single connection to the network 106, individual components of the client computing devices 102, origin servers 104, and CDN 110 may be connected to the network 106 at disparate points. Accordingly, communication times and capabilities may vary between the components of FIG. 1.


Client computing devices 102 may include any number of different computing devices capable of communicating with the CDN 110. For example, individual accessing computing devices may correspond to a laptop or tablet computer, personal computer, wearable computer, server, personal digital assistant (PDA), hybrid PDA/mobile phone, mobile phone, electronic book reader, set-top box, camera, digital media player, and the like. Using client computing devices 102, clients may interact with and access distributions of content on the CDN 110 originating from or otherwise associated with origin servers 104 of various content providers. For example, after requesting content associated with a specific distribution (e.g., a specific web site, video file, etc.), the client computing devices 102 may be routed to an edge POP 112 configured to provide content of that distribution on behalf of the origin server 104. Various mechanisms for routing of client computing devices 102 to edge POPs 112 within a CDN 110 are known within the art, and thus will not be described in detail herein.


Origin servers 104 may include any computing device owned or operated by an entity that has provided one or more sets of content (“distributions”) to the CDN 110 for subsequent transmission to client computing devices 102. For example, origin servers 104 may include servers hosting web sites, streaming audio, video, or multimedia services, data analytics services, or other network-accessible services. The origin servers 104 may include primary versions of content within various distributions, which may be retrieved by various POPs of the CDN 110 for subsequent transmission to the client computing devices 102.


To receive and handle requests for content from client computing devices 102, the CDN 110 can include a plurality of edge POPs 112A through 112N. Each edge POP 112 may include a variety of computing devices collectively configured to maintain all or a portion of the content associated with the various distributions provided by origin servers 104. As will be discussed in more detail below with respect to FIG. 2, each edge POP 112 may include any number of processors, data stores, or networking components operating in conjunction to facilitate retrieval of content. Each edge POP 112 includes a cache of content from a variety of distributions. Because size of the cache may be limited (e.g., due to the limited size of a data store on which the cache is implemented), the edge POP 112 may implement various algorithms or procedures for determining what content should be maintained within the cache. Illustratively, each edge POP 112 may implement a cache eviction policy, which maintains within the cache a set of content items most recently requested by client computing devices 102, and evicts less recently used content.


Because the cache of an edge POP 112 is limited, it is possible for a client computing device 102 to transmit a request to an edge POP 112 for content that is not cached at the edge POP 112. Requests for uncached content can generally be referred to as “cache misses.” Traditionally, an edge POP 112 can handle a cache miss by initiating a request for the content to an origin server 104 associated with the content. However, as noted above, such processing is often undesirable, as it increases the time (e.g., latency) required to provide the requested content to the client computing device 102, and may increase the computing resources needed at the origin server 104. In instances were cache misses cause the edge POPs 112 to transmit a high volume of requests to the origin servers 104, the origin server 104 may fail to respond to all requests, thus resulting in errors at the client computing devices 102.


To reduce or eliminate the negative effects of cache misses, the illustrative CDN 110 of FIG. 1 also includes a plurality of mid-tier POPs 114. Each mid-tier POP 114 may function similarly to an edge POP 112, by receiving and processing requests for content associated with the origin servers 104. As in the case of an edge POP 112, each mid-tier POP 114 may maintain a limited cache of content associated with the origin servers 104, which can be utilized to service requests for that content. In the instance that a mid-tier POP 114 receives a request for content not available in the mid-tier POP 114's cache, the mid-tier POP 114 may retrieve the content from the origin server 104 before servicing the request.


The caches of edge POPs 112 and mid-tier POPs 114 may be configured according to both the desired speed and size of the cache. In some instances, cache size and speed are at least partially interchangeable, such that the same or similar hardware can provide either a high-speed, low-size cache or a low-speed, high-size cache. For example, where a cache is implemented by a set of hard disk drives (HDDs), a small set of content can be replicated across the drives, such that the drives can work in parallel to provide high-speed access to the content. Conversely, the set of hard disk drives may provide little or no replication of content, such that a higher amount of content can be stored, but that retrieval of the content is slowed due to the limited availability of that content. In other instances, the speed and size of a cache may be varied based on the hardware utilized to implement the cache. For example, a high-speed, low-sized cache may be implemented in a set of solid-state drives (SSDs), while a low-speed, large-sized cache may be implemented in magnetic HDDs. Accordingly, by modifying the configuration or hardware utilized, the edge POPs 112 may be configured to implement a high-speed, low-size cache when compared to the cache of the mid-tier POPs 114. This configuration can enable the edge POPs 112 to facilitate most content requests rapidly, while also ensuring that a substantial portion of requested uncached at the edge POP 112 are stored within the cache of the mid-tier POP 114, and thus may be serviced without interaction with a corresponding origin server 104.


In one embodiment, each mid-tier POP 114 may be associated with all distributions (e.g., sets of content made available by the origin servers 104), such that content of any distribution may be retrieved from each mid-tier POP 114. In this manner, each distribution's content may be highly replicated across the mid-tier POPs 114, reducing the requests made to the origin servers 104, especially for highly popular content. In another embodiment, a mid-tier POP 114 may be assigned to cache content only of specific distributions. For example, the mid-tier POP 114A may be assigned to cache content of a first distribution (e.g., associated with a first origin server 104), but not of a second distribution (e.g., associated with a second origin server 104). Such assignment may, for example, prevent the mid-tier POP 114A from evicting content of the first distribution based on the popularity of other distributions.


The components of the CDN 110, including the edge POPs 112, mid-tier POPs 114, and POP manager 116 may communicate via a private network 118. The private network 118 may include any combination of various network types described above operated on behalf of the CDN 110, alone or in conjunction with other services. While shown as distinct from the network 106, the private network 118 in some instances may be physically co-mingled with the network 106. For example, the private network 118 may be formed by one or more leased lines on the network 106 that provide dedicated communications to the CDN 110. Because the private network 118 is operated on behalf of the CDN 110 (e.g., independently or in conjunction with other services associated with the CDN 110), the number of delays and errors caused by transmission of data across the private network 118 may generally be less than the number of delays and errors caused by transmission of data across the network 106. Moreover, because the private network 118 is operated on behalf of the CDN 110, the functionality of the private network 118 (e.g., the protocols used therein or the configuration of network devices operating as part of the private network 118) may be modified by the CDN 110 without reducing the ability of the CDN 110 to interact with the network 106.


To facilitate assignment of mid-tier POPs 114 to origin servers 104, the CDN 110 can further include a POP manager 116 device. As will be described in more detail below, the POP manager 116 may obtain information regarding proximities of mid-tier POPs 114 and origin servers 104, and utilize that information to assign mid-tier POPs 114 to distributions originating from those origin servers 104. For example, where a content provider associated with a distribution initially provided by a first origin server 104 wishes to utilize the mid-tier POPs 114, the POP manger 116 may determine which mid-tier POP 114 of the CDN 110 is proximate to the first origin server 104, and assign that mid-tier POP 114 as a second-level cache for the distribution initially provided by the first origin server 104. Frequently, transmission times between computing devices over a network are dependent, at least in part, on the distance between the devices. Thus, assignment of mid-tier POPs 114 that are proximate to an origin server 104 can beneficially reduce the computing resources necessary to retrieve content from the origin server 104, increasing the performance of the CDN 110.


In one embodiment, proximity between mid-tier POPs 114 and origin servers 104 may be determined based at least in part on geographic distance. For example, the geographic location of each mid-tier POP 114 and origin server 104 may be provided to the CDN by an administrator of the respective mid-tier POPs 114 and servers 104, or may be determined by the POP manager 116 based on a network address of the respective mid-tier POPs 114 and servers 104 (e.g., utilizing internet protocol [“IP”] geo-location techniques that are known in the art). Thereafter, the POP manager 116 may determine a mid-tier POP 114 that is proximate to an origin server 104 by computing the distance between these geographic locations. In another embodiment, proximity between mid-tier POPs 114 and origin servers 104 may be determined based at least in part on passively gathered network information. For example, each mid-tier POP 114 may function to monitor the round trip communication time needed to communicate with various origin servers 104, or other computing devices that are similar to the origin servers 104 (e.g., computing devices that exist within the same subnet as the origin servers 104). This round trip communication time can then be utilized (exclusively or in connection with additional information) as a network distance between the mid-tier POP 114 and origin servers 104. In yet another embodiment, proximity between mid-tier POPs 114 and origin servers 104 may be determined based at least in part on actively gathered information, such as network probes (e.g., Internet Control Message Protocol [“ICMP”] packets) transmitted from the mid-tier POPs 114 to the origin servers 104 (or computing devices sharing a subnet with the origin servers 104).


In accordance with embodiments of the present disclosure, proximity information may also be utilized by edge POPs 112 to determine whether the use of a mid-tier POP 114 is preferable to direct communication with an origin server 104. Illustratively, each edge POP 112 may be configured to communicate with a mid-tier POP 114 assigned to a distribution only when that mid-tier POP 114 is nearer to the edge POP 112 than an origin server 104 associated with that distribution. In this manner, an edge POP 112 can be prevented from requesting content of a distribution from a distant mid-tier POP 114, when an origin server 104 of the distribution is nearby and available to service the request. To enable the selective routing of requests to either a mid-tier POP 114 of an origin server 104, each edge POP 112 may maintain routing information for both mid-tier POPs 114 and origin servers 104. This routing information may designate, for example, a distance (e.g., geographical or network) to each of the mid-tier POPs 114 and origin servers 104. Similarly to above, distances between the edge POPs 112 and the mid-tier POPs 114 and servers 104 may be determined based on geographic data, passively gathered network information, or actively gathered network information.


In one embodiment, an edge POP 112 can maintain routing information for mid-tier POPs 114 separately from routing information for origin servers 114, and can dynamically combine the information in order to service requests for content associated with an individual origin server 104. Utilization of separate routing information may be beneficial, for example, because while the number of origin servers 104 associated with the CDN 110 may be large, only one or a few of these origin servers 104 may be associated with content required at the edge POP 112. Thus, combination of routing information for both mid-tier POPs 112 and origin servers 104 would likely result in a routing table that includes substantial irrelevant information. However, by maintaining separate routing information for the mid-tier POPs 114 and the origin servers 112, an edge POP 112 may combine only those portions of each set of routing information that are relevant to a current request. For example, the edge POP 112 may retrieve, from the routing information for all origin servers 104, routing information for a set of origin servers 104 associated with a distribution including the required content. The edge POP 112 may further retrieve, from the routing information for all mid-tier POPs 104, routing information for a set of mid-tier POPs 104 assigned to the distribution. The edge POP 112 may then combine this routing information to determine a nearest mid-tier POP 114 or origin server 104 associated with the requested information. The edge POP 112 can then retrieve the required information from the nearest mid-tier POP 114 or origin server 104, and fulfill the request.


It will be appreciated by those skilled in the art that the CDN 110 may have fewer or greater components than are illustrated in FIG. 1. For example, while shown as distinct in FIG. 1, in some embodiments, POPs within the CDN 110 may operate as both edge POPs 112 and mid-tier POPs 114. As a further example, in some instances, each of the components of the CDN 110 may communicate with one another directly via the network 106, and thus, the private network 118 may be omitted. In addition, the CDN 110 could include various web services and/or peer-to-peer network configurations. Thus, the depiction of the CDN 110 in FIG. 1 should be taken as illustrative. For example, in some embodiments, components of the CDN 110, such as the POP manager 116, may be executed by one more virtual machines implemented within one or more of the edge POPs 112 or mid-tier POPs 114. In other embodiments, the POP manager 116 may be implemented collectively by the edge POPs 112 or mid-tier POPs 114 (e.g., as a peer-to-peer service). Further, any one or more of the edge POPs 112, mid-tier POPs 112, and POP manager 116 may be embodied in a plurality of components, each executing an instance of the respective edge POPs 112, mid-tier POPs 112, and POP manager 116. A server or other computing component implementing any one of the respective edge POPs 112, mid-tier POPs 112, and POP manager 116 may include a network interface, memory, processing unit, and computer readable medium drive, all of which may communicate with each other by way of a communication bus. The network interface may provide connectivity over the network 106, private network 118, and/or other networks or computer systems. The processing unit may communicate to and from memory containing program instructions that the processing unit executes in order to operate the respective edge POPs 112, mid-tier POPs 112, and/or POP manager 116. The memory may generally include RAM, ROM, other persistent and auxiliary memory, and/or any non-transitory computer-readable media.



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


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


The data stores 230 and 232 may be any persistent or substantially persistent storage device (e.g., a hard disk drive, solid state disk drive, flash memory, etc.) utilized to store information utilized by the server 200. Specifically, the data store 230 may be utilized to store content associated with various distributions (e.g., as a cache of the content of those distributions). The routing information data store 232 may be utilized to store routing information associated with other components of the CDN 110, such as mid-tier POP 114, as well as routing information associated with the various origin servers 104.


In addition to the user interface module 212, the memory 210 may include content delivery software 216 that may be executed by the processing unit 204. In one embodiment, the content delivery software 216 implements various aspects of the present disclosure, including processing requests for content cached at the edge POP server 200 (e.g., by use of the content stored within the content data store 230), and the selective routing of requests for uncached content to nearby mid-tier POPs 114 or origin servers 104 (e.g., utilizing the routing information within the routing information data store 232).


With reference to FIG. 3, an illustrative set of interactions are depicted for generating routing information at an edge POP 112A. As discussed above, this routing information may be utilized by the edge POP 112A to determine, in instances where requested content is not available at the edge POP 112A, whether the content should be retrieved from a mid-tier POP 114 or an origin server 104 associated with the content. The interactions begin at (1), where the edge POP 112A exchanges network information with the various mid-tier POPs 114. In one embodiment, this exchange of network information may include transmission, from the edge POP 112A, of network probes (e.g., ICMP packets). In another embodiment, this exchange of network information may occur during normal operating of the edge POP 112A (e.g., based on requests to retrieve content from the mid-tier POP 114).


Thereafter, at (2), the edge POP 112A utilizes information regarding communication with the mid-tier POPs 114 to generate routing information for each mid-tier POP 114. Illustratively, the edge POP 112A may record a round-trip time of communications with the mid-tier POPs 114, as well as a network bandwidth available between the edge POP 112A and the mid-tier POPs 114 and a number of intermediary devices between the edge POP 112A and the mid-tier POPs 114. These metrics may be utilized (e.g., individually or in combination) by the edge POP 112A to determine a network distance between the edge POP 112A and each mid-tier POP 114, which may be stored as mid-tier POP routing information.


At (3), the edge POP 112A further communicates with some or all of the origin servers 104. Similarly to the communication with the mid-tier POPs 114, communication with the origin servers 104 may include transmission of network probes as well as communications that occur during normal operation of the edge POP 112 (e.g., requests for content from the origin servers 104). At (4), the edge POP 112A may utilize information regarding communication with the origin servers 104 to generate routing information for some or all of the origin servers 114.


At (5), the edge POP 112A may communicate with the POP manager 116 to exchange routing information. Illustratively, the edge POP 112A may transmit to the POP manager 116 all or a portion of the mid-tier POP routing information or the origin server routing information to the POP manager 116. The POP manager 116, in turn, may notify the edge POP 112A of assignments between the mid-tier POPs 114 and the origin servers 104. In some embodiments, the POP manager 116 may further notify the edge POP 112A of additional information regarding the mid-tier POPs 114 or origin servers 104, such as load or capacity information of the mid-tier POPs 114 or origin servers 104. The edge POP 112A may incorporate some or all information received by the POP manager 116 into the mid-tier POPPOP routing information and/or the origin server routing information.


One illustrative example of mid-tier POP routing information that may be generated by the edge POP 112A in accordance with the present disclosure is shown below, as TABLE 1.














TABLE 1









Network
Allowed cache



Mid-tier
Served
distance
misses per



POP
distributions
(latency)
second





















114A
D1, D4
25 ms
 800



114B
D2
10 ms
1000



114C
D1, D5, D6
60 ms
2500










One of skill in the art will appreciate that the information of TABLE 1 may be modified to address the specific implementation of the CDN 110. For example, the reference numbers of the various mid-tier POPs 114 may be replaced with network identifiers (e.g., IP addresses or domain names) of the mid-tier POPs 114, while the reference numbers for various distributions (e.g., D1-D6) may be replaced with identifiers of the distributions. As a further example, the network distance of TABLE 1 may incorporate other network metrics in addition to or alternatively to latency, such as bandwidth or numbers of hops. As yet another example, alternatively or in addition to an amount of allowed cache misses per second, load information for each mid-tier POP may be represented in a variety of manners, such as a real-time load on the mid-tier POPs 114 (e.g., as reported by the POP manager 116). In some embodiments, information shown in TABLE 1 may be omitted from routing information generated by the edge POP 112A. For example, where each mid-tier POP 114 is assigned to cache content from each distribution, information regarding distributions served by mid-tier POPs 114 may be omitted from the routing information.


One illustrative example of origin server routing information that may be generated by the edge POP 112A in accordance with the present disclosure is shown below, as TABLE 2.














TABLE 2









Network
Allowed cache



Origin
Served
distance
misses per



server
distributions
(latency)
second









104A
D1
155 ms
100



104B
D2
 70 ms
 70



104C
D1
225 ms
300










As in Table 1, the information of TABLE 2 may be modified to address the specific implementation of the CDN 110. For example, the reference numbers of the various origin servers 104 may be replaced with network identifiers (e.g., IP addresses or domain names) of the origin servers 104, or network distance information may incorporate other network metrics in addition or alternatively to latency, such as bandwidth or number of hops. Alternatively or in addition to an amount of allowed cache misses per second, load information for each origin server may be represented in a variety of manners, such as a real-time load on the origin servers 104 (e.g., as reported by the POP manager 116).


In operation of the edge POP 112A, the routing information for the origin servers 104 and the mid-tier POPs 114 (e.g., as represented by TABLES 1 and 2, above) can be combined in order to selectively route requests for uncached content between the origin servers 104 and the mid-tier POPs 114. For example, where uncached content associated with distribution ‘D1’ is requested at the edge POP 112A, the edge POP 112A may extract routing information for origin servers associated with the distribution ‘D1’ from the maintained origin server routing information (shown above in TABLE 2). The edge POP 112A may further extractinformation for all mid-tier POPs 114 associated with the distribution ‘D1’ from maintained mid-tier POP routing information (shown above as TABLE 1). The edge POP 112A may then dynamically create a routing table for the distribution ‘D1’. One example of such a routing table is shown below as TABLE 3.













TABLE 3








Network
Allowed cache




distance
misses per



D1 Content Source
(latency)
second









Origin Server 104A
155 ms
 100



Origin Server 104C
225 ms
 300



Mid-tier POP 114A
 25 ms
 800



Mid-tier POP 114C
 60 ms
2500










Utilizing the information of TABLE 3, the edge POP 112A may selectively route requests for content associated with distribution ‘D1’ to one of the origin server 104A, the origin server 104C, the mid-tier POP 114A, or the mid-tier POP 114C. For example, based on the information above, the edge POP 112 may determine that a first 800 cache misses per second associated with origin server 104A should be routed to mid-tier POP 114A, a next 2500 cache misses per second should be routed to mid-tier POP 114C thereafter, that a next 100 cache misses should be routed to the origin server 104A, and that a next 300 cache misses should be routed to the origin server 104C. In instances where the number of cache misses per second exceeds the total allowed cache misses per second of all content sources, the edge server 112A may attempt to balance the cache misses between potential content sources, or may return an error. Thus, by utilizing the information of TABLE 3, the edge server 112A may selectively route cache misses to various content sources according to the proximity of those sources to the edge server 112A, the load on the content sources, or a combination thereof.


In some embodiments, an edge server 112 may maintain a set of information mapping one or more distributions to potential content sources for that distribution (e.g., one or more origin servers 104 or mid-tier POPs 114), as well as distinct routing information for each potential content source (e.g., origin servers 104 or mid-tier POPs 114). For example, an edge server 112 may maintain a first table correlating or mapping each distribution to one or more potential content sources, a second table indicating routing information for various origin servers 104 (with or without reference to distribution), and a third table indicating routing information for various mid-tier POPs 114 (with or without reference to distribution). On receiving a request for uncached content, the edge server 112 may determine a specific distribution which includes the content (e.g., based on a URI of the requested content), and reference the first table to determine potential sources for the content (e.g., one or more origin servers 104 and/or one or more mid-tier POPs 114). The edge server 112 may then extract routing information for each potential content source from the second and third tables, and dynamically combine this routing information to create a routing table for the distribution. The edge server 112 can thereafter utilize the routing table to retrieve the uncached content from a preferred content source.


While shown as an ordered series of operations, various interactions of FIG. 3 may occur at various different times, or may occur simultaneously. Illustratively, the edge POP 112A may function to continuously update its routing information based on communications to the mid-tier POPs 114 and origin servers 104, such that the routing information is repeatedly revised during operation of the edge POP 112. Furthermore, where no exchange of information occurs between the edge POP 112A and an individual mid-tier POP 114 or origin server 104, the edge server 112A may generate routing information for that mid-tier POP 114 or origin server 104 based on estimated metrics, such as an estimated geographic distance between the edge POP 112A and the individual mid-tier POP 114 or origin server 104.


Further, while the interactions of FIG. 3 are shown as occurring at an edge POP 112, similar interactions may additionally or alternatively be carried out by mid-tier POPs 114. For example, each mid-tier POP 114 may actively or passively monitor a network connection with various origin servers 104 to determine network distances between the mid-tier POP 114 and the origin servers 104. In some instances, this information may be transmitted to the POP manager 116 for use in assigning mid-tier POPs 114 to various origin servers 104.


With reference to FIG. 4, a set of illustrative interactions are depicted for assigning a mid-tier POP 114 to a distribution of content associated with an origin server 104A, in accordance with aspects of the present disclosure. The interactions begin at (1), where an origin server 104A associated with a specific distribution of content, submits a request to utilize mid-tier POP caching on the CDN 110. While the request, in FIG. 4, is illustrative shown as originating from the origin server 104A, the request may be transmitted to the CDN 110 by any computing device associated with the distribution of content, such as a computing device (not shown in FIG. 4) of an administrator or operator of the origin server 104A. The request is illustratively routed, within the CDN 110, to the POP manager 116. At (2), the POP manager 116 assigns a mid-tier POP 114 to the distribution based at least partly on a proximity between the mid-tier POP 114 and the origin server 104A. In one embodiment, the POP manager 116 may utilize network distance information gathered by the mid-tier POPs 114A to determine a specific mid-tier POP 114 that is proximate to the origin server 104A. In another embodiment, the POP manager 116 estimates distances between the mid-tier POPs 114 and the origin server 104A (e.g., using network address geolocation techniques, which are known within the art, and utilize a database of information mapping network addresses to specific geographic locations) to determine a specific mid-tier POP 114 that is proximate to the origin server 104A. In some instances, the POP manager 116 may utilize additional or alternative criteria to assign a mid-tier POP 114 to the distribution. For example, the POP manager 116A may utilize capacity information of the various mid-tier POPs 114 (e.g., as monitored based on operation of the mid-tier POPs 114, inferred based on the number of origin servers 104 associated with each mid-tier POP 114, etc.) to determine a closest mid-tier POP 114A to the origin server 104A that has capacity to be assigned to the distribution provided by the origin server 104A. For the purposes of FIG. 4, it will be assumed that the POP manager 116 assigns mid-tier POP 114A to maintain a distribution associated with the origin server 104A.


At (3), the POP manager 116 notifies the origin server 104A of the assigned mid-tier POP 114A. For example, POP manager 116 may return a network identifier of the mid-tier POP 114A, such as an internet protocol (“IP”) address or uniform resource identifier (“URI”), to the origin server 104A. Thereafter, at (4), the origin server 104A and the assigned mid-tier POP 114A may communicate in order to synchronize content of a distribution associated with the origin server 104A. In one embodiment, this synchronization may occur independently from other operations of the origin server 104A, such that the origin server 104A provides the mid-tier POP 114A an initial set of content to be cached. In other embodiments, the synchronization may occur during normal operation of the origin server 104A and the mid-tier POP 114A (e.g., in response to cache misses occurring at the mid-tier POP 114A subsequent to assignment to the origin server 104A).


With reference to FIG. 5, an illustrative set of interactions are depicted for utilizing a mid-tier POP 114A to process cache misses at an edge POP 112A without requiring interaction with an origin server 104A associated with the uncached content. The interactions of FIG. 5 begin at (1), where a client computing device 102A transmits a request for content to the edge POP 112A. As noted above, various algorithms and mechanisms for distribution of request from client computing devices 102 to edge POPs 112 are known in the art, and thus will not be described in detail herein.


Thereafter, at (2), the edge POP 112 detects that the requested content is not cached at the edge POP 112A (e.g., that a cache miss has occurred). To determine a content source from which to request the uncached content, the edge POP 112, at (3), generates a content routing table. One example of such a content routing table is shown above, as TABLE 3. As discussed above, the content routing table may be dynamically generated utilizing routing information for maintained at the edge POP 112A for a plurality of origin servers, as well as routing information for a plurality of mid-tier POPs 114A. Accordingly, the content routing table may reflect a variety of potential content sources for the uncached information, as well as information enabling the edge POP 112A to determine which content source to request the content from (e.g., network distance information, capacity information, etc.).


At (4), the edge POP 112A selects a content source from the generated content routing table. In the interactions of FIG. 5, it will be assumed that the edge POP 112A has selected mid-tier POP 114A. However, selection of other content sources, including the origin server 104A serving as a primary source for the content, are possible.


Thereafter, at (5), the edge POP 112A transmits a request for the uncached content to the mid-tier POP 114A. The mid-tier POP 114A, in turn, retrieves the content from its own cache, and returns the content to the edge POP 112, at (6). The content can then be cached at the edge POP 112A, at (7), and returned to the client computing device 102A, at (8). Thus, even in the instance of a cache miss at an edge server 112A, the client computing device 102A can be provided with requested content without interaction with the origin server 104A, and at a higher speed than such content would likely be provided if interaction with the origin server 104A were to occur.


In some instances, the edge POP 112A may communicate with the POP manager 116 to exchange information regarding processing of cache misses. For example, the edge POP 112A may, at (9), notify the POP manager 116 of each cache miss (e.g., immediately after a cache miss, or periodically). The POP manager 116, in turn, may generate new routing information, such as new capacity information for a content source utilized to process the cache miss, and return that new routing information to the edge POP 112A, at (10). Illustratively, such communication may enable the edge POP 112A to maintain real time availability information for the various content sources (e.g., mid-tier POPs 114 and origin servers 104) to ensure such content sources are not overwhelmed with content requests.


One of skill in the art will appreciate that FIG. 5 may include various additional or alternative interactions than are described above. For example, it is assumed for the purposes of FIG. 5 that the mid-tier POP 114A contains a version of the content requested by the client computing device 102A. However, in instances where the mid-tier POP 114A does not contain the requested information, the mid-tier POP 114A may communicate with the origin server 104A to retrieve the requested information before returning such information to the edge POP 112A. Further, in instances where a content source (such as the mid-tier POP 114A) fails to timely respond to requests from the edge POP 112a (e.g., within a threshold period of time), the edge POP 112A may request the content from an alternative content source, such as the origin server 104A. Thus, the interactions of FIG. 5 are intended to be illustrative in nature.


With reference to FIG. 6, one illustrative routine 600 for routing of requests for uncached content at an edge POP, such as an edge POP 112 of FIG. 1, is described. The routine 600 begins at block 602, where the edge POP obtains routing information corresponding to the origin servers and mid-tier POPs associated with the CDN. In one embodiment, the routing information may be generated at the edge POP itself, based on active or passive monitoring of network paths between the edge POP and the respective origin servers and mid-tier POPs. In another embodiment, the routing information is received at least from other components of the CDN, such as a POP manager. Illustrative representations of the routing information are shown above as TABLES 1 and 2.


At block 604, the edge POP receives a request from a client computing device for content not cached or maintained at the edge POP. Illustratively, the request may correspond to a request for content that is not frequently requested at the edge POP, and that therefore has been evicted from (or has never existed within) a cache of the edge POP. Thus, in order to service the request, the edge POP may determine that the content should be retrieved from an external content source.


To determine a content source from which to request the uncached content, the edge POP, at block 606, generates a routing table for the content based on the obtained routing information for mid-tier POPs and origin sources. Specifically, the edge POP may determine at a set of potential content sources associated with the requested information (e.g., based on a URL or other identifier of the information provided by a request client computing device). The edge POP may further extract routing information from each potential content source from the obtained origin server and origin routing information. The edge POP can thereafter combine the routing information into a content source routing table. One example of such a routing table is shown above as TABLE 3.


Thereafter, at block 608, the edge POP determines a preferred content source utilizing the content source routing table. A preferred content source may be based on any individual metric within the content routing table, such as a network distance to each potential content source, or on a combination of metrics, such as a combination of network distance to each potential content source and current load on each potential content source. For example, the edge POP may be configured to utilize the nearest potential content source (e.g., in terms of network distance), so long as the load on that content source does not exceed a threshold amount.


At block 610, the edge POP can retrieve the content from the preferred content source (e.g., an origin server of the content or a mid-tier POP assigned to the origin server). While not shown in FIG. 6, if the preferred content source fails to return the content in a threshold period of time, the edge POP may attempt to retrieve the content from a less preferred content source (e.g., the 2nd preferred content source) until the content source is retrieved or potential content sources are exhausted (resulting in an error).


In the instance that the content is retrieved, the routine 600 proceeds to block 612, where the content is returned to the requesting computing device. While not shown in FIG. 6, the edge POP may further place the content within its local cache, such that subsequent requests for the content may be serviced from that local cache.


Thus, by utilization of the routine 600, an edge POP may selectively retrieve uncached content from either origin servers for the content or mid-tier POPs assigned to cache that content. In this manner, edge POPs may utilize mid-tier POPs as second-tier caches for content only when such use is expected to increase the performance of the CDN (e.g., by reducing the time required to provide content, reducing the load on origin servers, or both).


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


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


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


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


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


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

Claims
  • 1. A content delivery system comprising: a client-facing point of presence (“POP”) comprising at least one computing device associated with a first non-transitory data store, the client-facing POP configured to receive requests for content associated with an origin server, and when the content is cached within the first non-transitory data store, return the content; andan origin-facing POP comprising at least one computing device associated with a second non-transitory data store, the origin-facing POP assigned to maintain the content associated with the origin server within the second non-transitory data store, the origin-facing POP configured to receive requests for the content associated with the origin server, and when the content is cached within the second non-transitory data store, return the content;wherein the client-facing POP is further configured to: obtain routing information identifying a network distance between the client-facing POP and the origin-facing POP and a network distance between the client-facing POP and the origin server;receive a request for content not cached within the first non-transitory data store of the client-facing POP;select either the origin-facing POP or the origin server as a content source for the requested content that is not cached within the first non-transitory data store of the client-facing POP, wherein either the origin-facing POP or the origin server is selected as the content source based at least in part on a comparison of the network distance between the client-facing POP and the origin-facing POP and the network distance between the client-facing POP and the origin server;retrieve the requested content from the content source; andreturn the requested content in response to the request.
  • 2. The content delivery system of claim 1, wherein the origin-facing POP is further configured, when requested content is not cached within the second non-transitory data store, to retrieve the requested content from the origin server.
  • 3. The content delivery system of claim 1 further comprising a POP manager including one or more computing devices configured with computer-executable instructions to assign the origin-facing POP to maintain the content associated with the origin server based at least in part on a network distance between the origin-facing POP and the origin server.
  • 4. The content delivery system of claim 1, wherein the client-facing POP is configured to obtain the routing information at least partly by monitoring communications between the client-facing POP and the origin-facing POP.
  • 5. The content delivery system of claim 1, wherein the client-facing POP is configured to obtain the routing information at least partly by transmitting a network probe to the origin-facing POP.
  • 6. The content delivery system of claim 1, wherein the routing information comprises a first set of routing information identifying network distances between the client-facing POP and a plurality of origin-facing POPs on the content delivery system and a second set of routing information identifying network distances between the client-facing POP and a plurality of origin servers.
  • 7. The content delivery system of claim 1, wherein the client-facing POP is configured to generate a routing table for the requested content at least partly by combining the first and second sets of routing information, and wherein the comparison of the network distance between the client-facing POP and the origin-facing POP and a network distance between the client-facing POP and the origin server is conducted by selecting a lowest network distance identified within the routing table.
  • 8. A computer-implemented method comprising: at a client-facing point of presence (“POP”) within a content delivery network: obtaining a request for content associated with an origin server;determining that the content is not maintained at the client-facing POP;obtaining first routing information identifying a network distance between the client-facing POP and the origin server;obtaining second routing information identifying a network distance between the client-facing POP and an origin-facing POP on the content delivery network associated with the origin server;selecting either the origin-facing POP or the origin server as a content source for the requested content that is not maintained at the client-facing POP based at least in part on a comparison of the network distance between the client-facing POP and the origin server, as identified in the first routing information, and a network distance between the client-facing POP and the origin-facing POP, as identified in the second routing information;retrieving the requested content from the content source; andreturning the requested content in response to the request.
  • 9. The computer-implemented method of claim 8 further comprising: receiving a request from a user associated with the origin server to utilize a secondary POP on the content delivery network; andselecting the origin-facing POP as the secondary POP based at least in part on a network distance between the origin-facing POP and the origin server.
  • 10. The computer-implemented method of claim 8, wherein the origin-facing POP is one of a plurality of origin-facing POPs associated with the origin server, and wherein the second routing information identifies a network distance between the client-facing POP and individual origin-facing POPs of the plurality of origin-facing POPs.
  • 11. The computer-implemented method of claim 8, wherein the first routing information further indicates a capacity of the origin server, and wherein selecting either the secondary POP or the origin server as a preferred content source for the requested content is further based at least in part on the capacity of the origin server.
  • 12. The computer-implemented method of claim 8, wherein selecting either the origin-facing POP or the origin server as a preferred content source for the requested content comprises combining at least a portion of the first and second routing information to form a routing table for the requested content, and wherein the preferred content source is selected based at least partly on the routing table.
  • 13. The computer-implemented method of claim 8, wherein the content source corresponds to the origin-facing POP, and wherein the method further comprises: determining that the requested content is not available at the origin-facing POP;retrieving, at the origin-facing POP, the requested content from the origin server; andreturning the requested content from the origin-facing POP to the client-facing POP.
  • 14. A client-facing point of presence (“POP”) associated with a content delivery network, the client-facing POP comprising: a non-transitory data store implementing a cache of content, wherein the content is associated with an origin server that acts as an primary source for the content; andone or more computing devices in communication with the non-transitory data store, the one or more computing devices configured with computer-executable instructions that, when executed, cause the one or more computing devices to: receive a request for content that is not included within the cache;obtain routing information identifying a network distance between the client-facing POP and the origin server and a network distance between the client-facing POP and an origin-facing POP associated with the origin server;select either the origin-facing POP or the origin server as a content source for the requested content that is not included within the cache of the client-facing POP based at least in part on the network distance between the client-facing POP and the origin server and the network distance between the client-facing POP and the origin-facing POP;retrieve the requested content from the content source; andreturn the requested content in response to the request.
  • 15. The system of claim 14 further comprising a POP manager including one or more computing devices configured with specific computer-executable instructions to: receive a request from a user associated with the origin server to utilize a secondary POP on the content delivery network; andselect the origin-facing POP as the secondary POP based at least in part on a network distance between the origin-facing POP and the origin server.
  • 16. The system of claim 15, wherein the network distance between the origin-facing POP and the origin server is estimated based at least in part on a geographic distance between the origin-facing POP and the origin server.
  • 17. The system of claim 16, wherein the geographic distance between the origin-facing POP and the origin server is determined based at least in part on network address geolocation techniques.
  • 18. The system of claim 15, wherein the network distance between the origin-facing POP and the origin server is estimated based at least in part on monitoring between communications between the origin-facing POP and at least one of the origin server or an additional computing device associated with the origin server.
  • 19. The system of claim 14, wherein the obtained routing information comprises a first set of routing information identifying the network distance between the client-facing POP and the origin server and a second set of routing information identifying the network distance between the client-facing POP and the origin-facing POP.
  • 20. The system of claim 19, wherein the computer-executable instructions cause the one or more computing devices to select either the origin-facing POP or the origin server as the content source for the requested content at least partly by combining the first and second sets of routing information.
US Referenced Citations (1364)
Number Name Date Kind
5063500 Shorter Nov 1991 A
5341477 Pitkin et al. Aug 1994 A
5459837 Caccavale Oct 1995 A
5611049 Pitts Mar 1997 A
5701467 Freeston Dec 1997 A
5764910 Shachar Jun 1998 A
5774660 Brendel et al. Jun 1998 A
5852717 Bhide et al. Dec 1998 A
5892914 Pitts Apr 1999 A
5893116 Simmonds et al. Apr 1999 A
5895462 Toki Apr 1999 A
5905248 Russell et al. May 1999 A
5933811 Angles et al. Aug 1999 A
5937427 Shinagawa et al. Aug 1999 A
5974454 Apfel et al. Oct 1999 A
5991306 Burns et al. Nov 1999 A
5999274 Lee et al. Dec 1999 A
6016512 Huitema Jan 2000 A
6018619 Allard et al. Jan 2000 A
6026452 Pitts Feb 2000 A
6038601 Lambert et al. Mar 2000 A
6052718 Gifford Apr 2000 A
6078960 Ballard Jun 2000 A
6085234 Pitts et al. Jul 2000 A
6092100 Berstis et al. Jul 2000 A
6098096 Tsirigotis et al. Aug 2000 A
6108703 Leighton et al. Aug 2000 A
6128279 O'Neil et al. Oct 2000 A
6151631 Ansell et al. Nov 2000 A
6157942 Chu et al. Dec 2000 A
6167438 Yates et al. Dec 2000 A
6167446 Lister et al. Dec 2000 A
6173316 De Boor et al. Jan 2001 B1
6182111 Inohara et al. Jan 2001 B1
6182125 Borella et al. Jan 2001 B1
6185598 Farber et al. Feb 2001 B1
6192051 Lipman et al. Feb 2001 B1
6205475 Pitts Mar 2001 B1
6223288 Byrne Apr 2001 B1
6243761 Mogul et al. Jun 2001 B1
6275496 Burns et al. Aug 2001 B1
6286043 Cuomo et al. Sep 2001 B1
6286084 Wexler et al. Sep 2001 B1
6304913 Rune Oct 2001 B1
6324580 Jindal et al. Nov 2001 B1
6330602 Law et al. Dec 2001 B1
6338082 Schneider Jan 2002 B1
6345308 Abe Feb 2002 B1
6351743 DeArdo et al. Feb 2002 B1
6351775 Yu Feb 2002 B1
6363411 Dugan et al. Mar 2002 B1
6366952 Pitts Apr 2002 B2
6374290 Scharber et al. Apr 2002 B1
6377257 Borrel et al. Apr 2002 B1
6386043 Millins May 2002 B1
6389532 Gupta et al. May 2002 B1
6405252 Gupta et al. Jun 2002 B1
6408360 Chamberlain et al. Jun 2002 B1
6411967 Van Renesse Jun 2002 B1
6415280 Farber et al. Jul 2002 B1
6430607 Kavner Aug 2002 B1
6438592 Killian Aug 2002 B1
6442165 Sitaraman et al. Aug 2002 B1
6452925 Sistanizadeh et al. Sep 2002 B1
6457047 Chandra et al. Sep 2002 B1
6459909 Bilcliff et al. Oct 2002 B1
6473804 Kaiser et al. Oct 2002 B1
6484143 Swildens et al. Nov 2002 B1
6484161 Chipalkatti et al. Nov 2002 B1
6493765 Cunningham et al. Dec 2002 B1
6505241 Pitts Jan 2003 B2
6523036 Hickman et al. Feb 2003 B1
6529910 Fleskes Mar 2003 B1
6529953 Van Renesse Mar 2003 B1
6553413 Leighton et al. Apr 2003 B1
6560610 Eatherton et al. May 2003 B1
6611873 Kanehara Aug 2003 B1
6622168 Datta Sep 2003 B1
6643357 Lumsden Nov 2003 B2
6643707 Booth Nov 2003 B1
6654807 Farber et al. Nov 2003 B2
6658462 Dutta Dec 2003 B1
6665706 Kenner et al. Dec 2003 B2
6678717 Schneider Jan 2004 B1
6678791 Jacobs et al. Jan 2004 B1
6681282 Golden et al. Jan 2004 B1
6687846 Adrangi Feb 2004 B1
6694358 Swildens et al. Feb 2004 B1
6697805 Choquier et al. Feb 2004 B1
6718324 Edlund et al. Apr 2004 B2
6724770 Van Renesse Apr 2004 B1
6732237 Jacobs et al. May 2004 B1
6754699 Swildens et al. Jun 2004 B2
6754706 Swildens et al. Jun 2004 B1
6760721 Chasen et al. Jul 2004 B1
6769031 Bero Jul 2004 B1
6782398 Bahl Aug 2004 B1
6785704 McCanne Aug 2004 B1
6795434 Kumar et al. Sep 2004 B1
6799214 Li Sep 2004 B1
6804706 Pitts Oct 2004 B2
6810291 Card et al. Oct 2004 B2
6810411 Coughlin et al. Oct 2004 B1
6829654 Jungck Dec 2004 B1
6862607 Vermeulen Mar 2005 B1
6868439 Basu et al. Mar 2005 B2
6874017 Inoue et al. Mar 2005 B1
6917951 Orbits et al. Jul 2005 B2
6925499 Chen et al. Aug 2005 B1
6928467 Peng et al. Aug 2005 B2
6928485 Krishnamurthy et al. Aug 2005 B1
6941562 Gao et al. Sep 2005 B2
6963850 Bezos et al. Nov 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6981017 Kasriel et al. Dec 2005 B1
6985945 Farhat et al. Jan 2006 B2
6986018 O'Rourke et al. Jan 2006 B2
6990526 Zhu Jan 2006 B1
6996616 Leighton et al. Feb 2006 B1
7003555 Jungck Feb 2006 B1
7006099 Gut et al. Feb 2006 B2
7007089 Freedman Feb 2006 B2
7010578 Lewin et al. Mar 2006 B1
7010598 Sitaraman et al. Mar 2006 B2
7024466 Outten et al. Apr 2006 B2
7027582 Khello et al. Apr 2006 B2
7031445 Lumsden Apr 2006 B2
7032010 Swildens et al. Apr 2006 B1
7058633 Gnagy et al. Jun 2006 B1
7058706 Iyer et al. Jun 2006 B1
7058953 Willard et al. Jun 2006 B2
7065587 Huitema et al. Jun 2006 B2
7072982 Teodosiu et al. Jul 2006 B2
7076633 Tormasov et al. Jul 2006 B2
7082476 Cohen et al. Jul 2006 B1
7086061 Joshi et al. Aug 2006 B1
7092505 Allison et al. Aug 2006 B2
7092997 Kasriel et al. Aug 2006 B1
7096266 Lewin et al. Aug 2006 B2
7099936 Chase et al. Aug 2006 B2
7103645 Leighton et al. Sep 2006 B2
7114160 Suryanarayana et al. Sep 2006 B2
7117262 Bai et al. Oct 2006 B2
7133905 Dilley et al. Nov 2006 B2
7136922 Sundaram et al. Nov 2006 B2
7139808 Anderson et al. Nov 2006 B2
7139821 Shah et al. Nov 2006 B1
7143169 Champagne et al. Nov 2006 B1
7143170 Swildens et al. Nov 2006 B2
7146560 Dang et al. Dec 2006 B2
7149809 Barde et al. Dec 2006 B2
7152118 Anderson, IV et al. Dec 2006 B2
7162539 Garcie-Luna-Aceves Jan 2007 B2
7174382 Ramanathan et al. Feb 2007 B2
7185046 Ferstl et al. Feb 2007 B2
7185063 Kasriel et al. Feb 2007 B1
7185084 Sirivara et al. Feb 2007 B2
7188214 Kasriel et al. Mar 2007 B1
7194522 Swildens et al. Mar 2007 B1
7194552 Schneider Mar 2007 B1
7200667 Teodosiu et al. Apr 2007 B2
7216170 Ludvig et al. May 2007 B2
7225254 Swildens et al. May 2007 B1
7228350 Hong et al. Jun 2007 B2
7228359 Monteiro Jun 2007 B1
7233978 Overton et al. Jun 2007 B2
7240100 Wein et al. Jul 2007 B1
7249196 Peiffer et al. Jul 2007 B1
7251675 Kamakura et al. Jul 2007 B1
7254626 Kommula et al. Aug 2007 B1
7254636 O'Toole, Jr. et al. Aug 2007 B1
7257581 Steele et al. Aug 2007 B1
7260598 Liskov et al. Aug 2007 B1
7260639 Afergan et al. Aug 2007 B2
7269784 Kasriel et al. Sep 2007 B1
7272227 Beran Sep 2007 B1
7274658 Bornstein et al. Sep 2007 B2
7284056 Ramig Oct 2007 B2
7289519 Liskov Oct 2007 B1
7293093 Leighton Nov 2007 B2
7308499 Chavez Dec 2007 B2
7310686 Uysal Dec 2007 B2
7316648 Kelly et al. Jan 2008 B2
7318074 Iyengar et al. Jan 2008 B2
7320131 O'Toole, Jr. Jan 2008 B1
7321918 Burd et al. Jan 2008 B2
7337968 Wilz, Sr. et al. Mar 2008 B2
7339937 Mitra et al. Mar 2008 B2
7340505 Lisiecki et al. Mar 2008 B2
7363291 Page Apr 2008 B1
7363626 Koutharapu et al. Apr 2008 B2
7370089 Boyd et al. May 2008 B2
7372809 Chen May 2008 B2
7373416 Kagan et al. May 2008 B2
7376736 Sundaram et al. May 2008 B2
7380078 Ikegaya et al. May 2008 B2
7389354 Sitaraman et al. Jun 2008 B1
7392236 Rusch et al. Jun 2008 B2
7398301 Hennessey et al. Jul 2008 B2
7406512 Swildens et al. Jul 2008 B2
7406522 Riddle Jul 2008 B2
7409712 Brooks et al. Aug 2008 B1
7430610 Pace et al. Sep 2008 B2
7441045 Skene et al. Oct 2008 B2
7441261 Slater et al. Oct 2008 B2
7454457 Lowery et al. Nov 2008 B1
7454500 Hsu et al. Nov 2008 B1
7461170 Taylor et al. Dec 2008 B1
7464142 Flurry et al. Dec 2008 B2
7478148 Neerdaels Jan 2009 B2
7492720 Pruthi et al. Feb 2009 B2
7496651 Joshi Feb 2009 B1
7499998 Toebes et al. Mar 2009 B2
7502836 Menditto et al. Mar 2009 B1
7505464 Okmianski et al. Mar 2009 B2
7506034 Coates et al. Mar 2009 B2
7519720 Fishman et al. Apr 2009 B2
7519726 Palliyil et al. Apr 2009 B2
7523181 Swildens et al. Apr 2009 B2
7543024 Holstege Jun 2009 B2
7548947 Kasriel et al. Jun 2009 B2
7552235 Chase et al. Jun 2009 B2
7555542 Ayers et al. Jun 2009 B1
7561571 Lovett et al. Jul 2009 B1
7565407 Hayball Jul 2009 B1
7568032 Feng et al. Jul 2009 B2
7573916 Bechtolsheim et al. Aug 2009 B1
7574499 Swildens et al. Aug 2009 B1
7581009 Hsu et al. Aug 2009 B1
7593935 Sullivan Sep 2009 B2
7594189 Walker et al. Sep 2009 B1
7596619 Leighton et al. Sep 2009 B2
7617222 Coulthard et al. Nov 2009 B2
7623460 Miyazaki Nov 2009 B2
7624169 Lisiecki et al. Nov 2009 B2
7631101 Sullivan et al. Dec 2009 B2
7640296 Fuchs et al. Dec 2009 B2
7650376 Blumenau Jan 2010 B1
7653700 Bahl et al. Jan 2010 B1
7653725 Yahiro et al. Jan 2010 B2
7657613 Hanson et al. Feb 2010 B1
7657622 Douglis et al. Feb 2010 B1
7661027 Langen et al. Feb 2010 B2
7664831 Cartmell et al. Feb 2010 B2
7664879 Chan et al. Feb 2010 B2
7676570 Levy et al. Mar 2010 B2
7680897 Carter et al. Mar 2010 B1
7684394 Cutbill et al. Mar 2010 B1
7685109 Ransil et al. Mar 2010 B1
7685251 Houlihan et al. Mar 2010 B2
7693813 Cao et al. Apr 2010 B1
7693959 Leighton et al. Apr 2010 B2
7702724 Brydon et al. Apr 2010 B1
7706740 Collins et al. Apr 2010 B2
7707314 McCarthy et al. Apr 2010 B2
7711647 Gunaseelan et al. May 2010 B2
7711788 Lev Ran et al. May 2010 B2
7716367 Leighton et al. May 2010 B1
7725602 Liu et al. May 2010 B2
7730187 Raciborski et al. Jun 2010 B2
7739400 Lindbo et al. Jun 2010 B2
7747720 Toebes et al. Jun 2010 B2
7756913 Day Jul 2010 B1
7756965 Joshi Jul 2010 B2
7757202 Dahlsted et al. Jul 2010 B2
7761572 Auerbach Jul 2010 B1
7765304 Davis et al. Jul 2010 B2
7769823 Jenny et al. Aug 2010 B2
7773596 Marques Aug 2010 B1
7774342 Virdy Aug 2010 B1
7783727 Foley et al. Aug 2010 B1
7787380 Aggarwal et al. Aug 2010 B1
7792989 Toebes et al. Sep 2010 B2
7805516 Kettler et al. Sep 2010 B2
7809597 Das et al. Oct 2010 B2
7813308 Reddy et al. Oct 2010 B2
7814229 Cabrera et al. Oct 2010 B1
7818454 Kim et al. Oct 2010 B2
7827256 Phillips et al. Nov 2010 B2
7836177 Kasriel et al. Nov 2010 B2
7853719 Cao et al. Dec 2010 B1
7865594 Baumback et al. Jan 2011 B1
7865953 Hsieh et al. Jan 2011 B1
7873065 Mukerji et al. Jan 2011 B1
7890612 Todd et al. Feb 2011 B2
7899899 Joshi Mar 2011 B2
7904875 Hegyi Mar 2011 B2
7912921 O'Rourke et al. Mar 2011 B2
7925782 Sivasubramanian et al. Apr 2011 B2
7930393 Baumback et al. Apr 2011 B1
7930402 Swildens et al. Apr 2011 B2
7930427 Josefsberg et al. Apr 2011 B2
7933988 Nasuto et al. Apr 2011 B2
7937477 Day et al. May 2011 B1
7945693 Farber et al. May 2011 B2
7949779 Farber et al. May 2011 B2
7958222 Pruitt et al. Jun 2011 B1
7958258 Yeung et al. Jun 2011 B2
7962597 Richardson et al. Jun 2011 B2
7966404 Hedin et al. Jun 2011 B2
7970816 Chess et al. Jun 2011 B2
7970940 van de Ven et al. Jun 2011 B1
7979509 Malmskog et al. Jul 2011 B1
7991910 Richardson et al. Aug 2011 B2
7996533 Leighton et al. Aug 2011 B2
7996535 Auerbach Aug 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8001187 Stochosky Aug 2011 B2
8010707 Elzur et al. Aug 2011 B2
8019869 Kriegsman Sep 2011 B2
8024441 Kommula et al. Sep 2011 B2
8028090 Richardson et al. Sep 2011 B2
8041773 Abu-Ghazaleh et al. Oct 2011 B2
8041809 Sundaram et al. Oct 2011 B2
8041818 Gupta et al. Oct 2011 B2
8042054 White et al. Oct 2011 B2
8065275 Eriksen et al. Nov 2011 B2
8069231 Schran et al. Nov 2011 B2
8073940 Richardson et al. Dec 2011 B1
8082348 Averbuj et al. Dec 2011 B1
8108623 Krishnaprasad et al. Jan 2012 B2
8117306 Baumback et al. Feb 2012 B1
8122098 Richardson et al. Feb 2012 B1
8122124 Baumback et al. Feb 2012 B1
8132242 Wu Mar 2012 B1
8135820 Richardson et al. Mar 2012 B2
8156199 Hoche-Mong et al. Apr 2012 B1
8156243 Richardson et al. Apr 2012 B2
8175863 Ostermeyer et al. May 2012 B1
8190682 Paterson-Jones et al. May 2012 B2
8195837 McCarthy et al. Jun 2012 B2
8209695 Pruyne et al. Jun 2012 B1
8224971 Miller et al. Jul 2012 B1
8224986 Liskov et al. Jul 2012 B1
8224994 Schneider Jul 2012 B1
8234403 Richardson et al. Jul 2012 B2
8239530 Sundaram et al. Aug 2012 B2
8250135 Driesen et al. Aug 2012 B2
8250211 Swildens et al. Aug 2012 B2
8250219 Raciborski et al. Aug 2012 B2
8266288 Banerjee et al. Sep 2012 B2
8266327 Kumar et al. Sep 2012 B2
8271471 Kamvar et al. Sep 2012 B1
8280998 Joshi Oct 2012 B2
8281035 Farber et al. Oct 2012 B2
8291046 Farber et al. Oct 2012 B2
8291117 Eggleston et al. Oct 2012 B1
8296393 Alexander et al. Oct 2012 B2
8301600 Helmick et al. Oct 2012 B1
8301645 Crook Oct 2012 B1
8321568 Sivasubramanian et al. Nov 2012 B2
8356074 Ehrlich Jan 2013 B1
8380831 Barber Feb 2013 B2
8380851 McCarthy et al. Feb 2013 B2
8402137 Sivasuramanian et al. Mar 2013 B2
8423408 Barnes et al. Apr 2013 B1
8423662 Weihl et al. Apr 2013 B1
8433749 Wee et al. Apr 2013 B2
8447831 Sivasubramanian et al. May 2013 B1
8447876 Verma et al. May 2013 B2
8452745 Ramakrishna May 2013 B2
8452874 MacCarthaigh et al. May 2013 B2
8463877 Richardson Jun 2013 B1
8468222 Sakata et al. Jun 2013 B2
8468245 Farber et al. Jun 2013 B2
8473613 Farber et al. Jun 2013 B2
8478903 Farber et al. Jul 2013 B2
8504721 Hsu et al. Aug 2013 B2
8510428 Joshi Aug 2013 B2
8510807 Elazary et al. Aug 2013 B1
8521851 Richardson et al. Aug 2013 B1
8521876 Goodman et al. Aug 2013 B2
8521880 Richardson et al. Aug 2013 B1
8521908 Holmes et al. Aug 2013 B2
8526405 Curtis et al. Sep 2013 B2
8527639 Liskov et al. Sep 2013 B1
8527645 Proffit Sep 2013 B1
8527658 Holmes et al. Sep 2013 B2
8549646 Stavrou et al. Oct 2013 B2
8572208 Farber et al. Oct 2013 B2
8572210 Farber et al. Oct 2013 B2
8577992 Richardson et al. Nov 2013 B1
8589996 Ma et al. Nov 2013 B2
8606996 Richardson et al. Dec 2013 B2
8612565 Schneider Dec 2013 B2
8615549 Knowles et al. Dec 2013 B2
8619780 Brandwine Dec 2013 B1
8626950 Richardson et al. Jan 2014 B1
8635340 Schneider Jan 2014 B1
8639817 Sivasubramanian et al. Jan 2014 B2
8645539 McCarthy et al. Feb 2014 B2
8676918 Richardson et al. Mar 2014 B2
8683023 Brandwine et al. Mar 2014 B1
8683076 Farber et al. Mar 2014 B2
8688837 Richardson et al. Apr 2014 B1
8712950 Smith et al. Apr 2014 B2
8732309 Richardson et al. May 2014 B1
8745177 Kazerani et al. Jun 2014 B1
8756322 Lynch Jun 2014 B1
8756325 Sivasubramanian et al. Jun 2014 B2
8756341 Richardson et al. Jun 2014 B1
8782236 Marshall et al. Jul 2014 B1
8782279 Eggleston et al. Jul 2014 B2
8812727 Sorenson, III et al. Aug 2014 B1
8819283 Richardson et al. Aug 2014 B2
8826032 Yahalom et al. Sep 2014 B1
8904009 Marshall et al. Dec 2014 B1
8914514 Jenkins et al. Dec 2014 B1
8924528 Richardson et al. Dec 2014 B1
8930513 Richardson et al. Jan 2015 B1
8930544 Richardson et al. Jan 2015 B2
8935744 Osterweil et al. Jan 2015 B2
8938526 Richardson et al. Jan 2015 B1
8949161 Borst et al. Feb 2015 B2
8949459 Scholl Feb 2015 B1
8966318 Shah Feb 2015 B1
8972580 Fleischman et al. Mar 2015 B2
9003035 Richardson et al. Apr 2015 B1
9003040 MacCarthaigh et al. Apr 2015 B2
9009286 Sivasubramanian et al. Apr 2015 B2
9009334 Jenkins et al. Apr 2015 B1
9021127 Richardson et al. Apr 2015 B2
9021128 Sivasubramanian et al. Apr 2015 B2
9021129 Richardson et al. Apr 2015 B2
9026616 Sivasubramanian et al. May 2015 B2
9037975 Taylor et al. May 2015 B1
9075777 Pope et al. Jul 2015 B1
9075893 Jenkins Jul 2015 B1
9083675 Richardson et al. Jul 2015 B2
9083743 Patel et al. Jul 2015 B1
9106701 Richardson et al. Aug 2015 B2
9116803 Agrawal et al. Aug 2015 B1
9130756 Richardson et al. Sep 2015 B2
9130977 Zisapel et al. Sep 2015 B2
9137302 Makhijani et al. Sep 2015 B1
9154551 Watson Oct 2015 B1
9160703 Richardson et al. Oct 2015 B2
9172674 Patel et al. Oct 2015 B1
9176894 Marshall et al. Nov 2015 B2
9185012 Richardson et al. Nov 2015 B2
9191338 Richardson et al. Nov 2015 B2
9191458 Richardson et al. Nov 2015 B2
9195996 Walsh et al. Nov 2015 B1
9208097 Richardson et al. Dec 2015 B2
9210235 Sivasubramanian et al. Dec 2015 B2
9237087 Risbood et al. Jan 2016 B1
9237114 Richardson et al. Jan 2016 B2
9240954 Ellsworth et al. Jan 2016 B1
9246776 Ellsworth et al. Jan 2016 B2
9251112 Richardson et al. Feb 2016 B2
9253065 Richardson et al. Feb 2016 B2
9276812 Nagargadde et al. Mar 2016 B1
9294391 Mostert Mar 2016 B1
9323577 Marr et al. Apr 2016 B2
9332078 Sivasubramanian et al. May 2016 B2
9386038 Martini Jul 2016 B2
9391949 Richardson et al. Jul 2016 B1
9407676 Archer et al. Aug 2016 B2
9407681 Richardson et al. Aug 2016 B1
9407699 Sivasubramanian et al. Aug 2016 B2
9444718 Khakpour Sep 2016 B2
9444759 Richardson et al. Sep 2016 B2
9479476 Richardson et al. Oct 2016 B2
9495338 Hollis et al. Nov 2016 B1
9497259 Richardson et al. Nov 2016 B1
9515949 Richardson et al. Dec 2016 B2
9525659 Sonkin et al. Dec 2016 B1
9544394 Richardson et al. Jan 2017 B2
9571389 Richardson et al. Feb 2017 B2
9584328 Graham-cumming Feb 2017 B1
9590946 Richardson et al. Mar 2017 B2
9608957 Sivasubramanian et al. Mar 2017 B2
9621660 Sivasubramanian et al. Apr 2017 B2
9628509 Holloway et al. Apr 2017 B2
9628554 Marshall et al. Apr 2017 B2
9645808 Turpie May 2017 B1
9703713 Nadgowda Jul 2017 B2
9705922 Foxhoven et al. Jul 2017 B2
9712325 Richardson et al. Jul 2017 B2
9712484 Richardson et al. Jul 2017 B1
9734472 Richardson et al. Aug 2017 B2
9742795 Radlein et al. Aug 2017 B1
9760420 Letz et al. Sep 2017 B1
9774619 Radlein et al. Sep 2017 B1
9787599 Richardson et al. Oct 2017 B2
9787775 Richardson et al. Oct 2017 B1
9794216 Richardson et al. Oct 2017 B2
9794281 Radlein et al. Oct 2017 B1
9800539 Richardson et al. Oct 2017 B2
9811451 Arguelles et al. Nov 2017 B1
9819567 Uppal et al. Nov 2017 B1
9832141 Raftery Nov 2017 B1
9871794 Joffe et al. Jan 2018 B2
9887914 Bergman Feb 2018 B2
9887915 Richardson et al. Feb 2018 B2
9887931 Uppal et al. Feb 2018 B1
9887932 Uppal et al. Feb 2018 B1
9888089 Sivasubramanian et al. Feb 2018 B2
9893957 Ellsworth et al. Feb 2018 B2
9894168 Sivasubramanian et al. Feb 2018 B2
9912740 Richardson et al. Mar 2018 B2
9929959 Mostert Mar 2018 B2
9930131 MacCarthaigh et al. Mar 2018 B2
9954934 Sivasubramanian et al. Apr 2018 B2
9985927 Richardson et al. May 2018 B2
9992086 Mizik et al. Jun 2018 B1
9992303 Richardson et al. Jun 2018 B2
10015237 Richardson et al. Jul 2018 B2
10015241 Marr et al. Jul 2018 B2
10021179 Velummylum et al. Jul 2018 B1
10027582 Richardson et al. Jul 2018 B2
10033627 Howard et al. Jul 2018 B1
10033691 Mizik et al. Jul 2018 B1
10049051 Baldwin Aug 2018 B1
10075551 Baldwin et al. Sep 2018 B1
10079742 Richardson et al. Sep 2018 B1
10091096 Howard et al. Oct 2018 B1
20010000811 May et al. May 2001 A1
20010025305 Yoshiasa et al. Sep 2001 A1
20010027479 Delaney et al. Oct 2001 A1
20010032133 Moran Oct 2001 A1
20010034704 Farhat et al. Oct 2001 A1
20010049741 Skene et al. Dec 2001 A1
20010052016 Skene et al. Dec 2001 A1
20010056416 Garcia-Luna-Aceves Dec 2001 A1
20010056500 Farber et al. Dec 2001 A1
20020002613 Freeman et al. Jan 2002 A1
20020004846 Garcia-Luna-Aceves et al. Jan 2002 A1
20020007413 Garcia-Luna-Aceves et al. Jan 2002 A1
20020010783 Primak et al. Jan 2002 A1
20020010798 Ben-Shaul et al. Jan 2002 A1
20020035624 Jun-hyeong Mar 2002 A1
20020048269 Hong et al. Apr 2002 A1
20020049608 Hartsell et al. Apr 2002 A1
20020049857 Farber et al. Apr 2002 A1
20020052942 Swildens et al. May 2002 A1
20020062372 Hong et al. May 2002 A1
20020065910 Dutta May 2002 A1
20020068554 Dusse Jun 2002 A1
20020069420 Russell et al. Jun 2002 A1
20020078233 Biliris et al. Jun 2002 A1
20020082858 Heddaya et al. Jun 2002 A1
20020083118 Sim Jun 2002 A1
20020083148 Shaw et al. Jun 2002 A1
20020083178 Brothers Jun 2002 A1
20020083198 Kim et al. Jun 2002 A1
20020087374 Boubez et al. Jul 2002 A1
20020091786 Yamaguchi et al. Jul 2002 A1
20020091801 Lewin et al. Jul 2002 A1
20020092026 Janniello et al. Jul 2002 A1
20020099616 Sweldens Jul 2002 A1
20020099850 Farber et al. Jul 2002 A1
20020101836 Dorenbosch Aug 2002 A1
20020103820 Cartmell et al. Aug 2002 A1
20020103972 Satran et al. Aug 2002 A1
20020107944 Bai et al. Aug 2002 A1
20020112049 Elnozahy et al. Aug 2002 A1
20020112123 Becker et al. Aug 2002 A1
20020116481 Lee Aug 2002 A1
20020116491 Boyd et al. Aug 2002 A1
20020116582 Copeland et al. Aug 2002 A1
20020120666 Landsman et al. Aug 2002 A1
20020120782 Dillon et al. Aug 2002 A1
20020124047 Gartner et al. Sep 2002 A1
20020124098 Shaw Sep 2002 A1
20020129123 Johnson et al. Sep 2002 A1
20020131428 Pecus et al. Sep 2002 A1
20020133741 Maeda et al. Sep 2002 A1
20020135611 Deosaran et al. Sep 2002 A1
20020138286 Engstrom Sep 2002 A1
20020138437 Lewin et al. Sep 2002 A1
20020138443 Schran et al. Sep 2002 A1
20020138649 Cartmell et al. Sep 2002 A1
20020143675 Orshan Oct 2002 A1
20020143989 Huitema et al. Oct 2002 A1
20020145993 Chowdhury et al. Oct 2002 A1
20020147770 Tang Oct 2002 A1
20020147774 Lisiecki et al. Oct 2002 A1
20020150094 Cheng et al. Oct 2002 A1
20020150276 Chang Oct 2002 A1
20020152326 Orshan Oct 2002 A1
20020154157 Sherr et al. Oct 2002 A1
20020156884 Bertram et al. Oct 2002 A1
20020156911 Croman et al. Oct 2002 A1
20020161745 Call Oct 2002 A1
20020161767 Shapiro et al. Oct 2002 A1
20020163882 Bornstein et al. Nov 2002 A1
20020165912 Wenocur et al. Nov 2002 A1
20020169890 Beaumont et al. Nov 2002 A1
20020184368 Wang Dec 2002 A1
20020188722 Banerjee et al. Dec 2002 A1
20020194324 Guha Dec 2002 A1
20020194382 Kausik et al. Dec 2002 A1
20020198953 O'Rourke et al. Dec 2002 A1
20030002484 Freedman Jan 2003 A1
20030004998 Datta Jan 2003 A1
20030005036 Mitzenmacher Jan 2003 A1
20030005111 Allan Jan 2003 A1
20030007482 Khello et al. Jan 2003 A1
20030009488 Hart, III Jan 2003 A1
20030009591 Hayball et al. Jan 2003 A1
20030026410 Lumsden Feb 2003 A1
20030028642 Agarwal et al. Feb 2003 A1
20030033283 Evans et al. Feb 2003 A1
20030037108 Peiffer et al. Feb 2003 A1
20030037139 Shteyn Feb 2003 A1
20030041094 Lara et al. Feb 2003 A1
20030046343 Krishnamurthy et al. Mar 2003 A1
20030065739 Shnier Apr 2003 A1
20030070096 Pazi et al. Apr 2003 A1
20030074401 Connell et al. Apr 2003 A1
20030074471 Anderson et al. Apr 2003 A1
20030074472 Lucco et al. Apr 2003 A1
20030079027 Slocombe et al. Apr 2003 A1
20030093523 Cranor et al. May 2003 A1
20030099202 Lear et al. May 2003 A1
20030099237 Mitra et al. May 2003 A1
20030101278 Garcia-Luna-Aceves et al. May 2003 A1
20030105829 Hayward Jun 2003 A1
20030105857 Kamen et al. Jun 2003 A1
20030112792 Cranor et al. Jun 2003 A1
20030120741 Wu et al. Jun 2003 A1
20030126387 Watanabe Jul 2003 A1
20030133554 Nykanen et al. Jul 2003 A1
20030135467 Okamoto Jul 2003 A1
20030135509 Davis et al. Jul 2003 A1
20030140087 Lincoln et al. Jul 2003 A1
20030145038 Tariq et al. Jul 2003 A1
20030145066 Okada et al. Jul 2003 A1
20030149581 Chaudhri et al. Aug 2003 A1
20030154239 Davis et al. Aug 2003 A1
20030154284 Bernardin et al. Aug 2003 A1
20030163722 Anderson, IV Aug 2003 A1
20030172145 Nguyen Sep 2003 A1
20030172183 Anderson, IV et al. Sep 2003 A1
20030172291 Judge et al. Sep 2003 A1
20030174648 Wang et al. Sep 2003 A1
20030177321 Watanabe Sep 2003 A1
20030182305 Balva et al. Sep 2003 A1
20030182413 Allen et al. Sep 2003 A1
20030182447 Schilling Sep 2003 A1
20030187935 Agarwalla et al. Oct 2003 A1
20030187970 Chase et al. Oct 2003 A1
20030191822 Leighton et al. Oct 2003 A1
20030200394 Ashmore et al. Oct 2003 A1
20030204602 Hudson et al. Oct 2003 A1
20030206520 Wu et al. Nov 2003 A1
20030229682 Day Dec 2003 A1
20030233423 Dilley et al. Dec 2003 A1
20030233445 Levy et al. Dec 2003 A1
20030233455 Leber et al. Dec 2003 A1
20030236700 Arning et al. Dec 2003 A1
20030236779 Choi et al. Dec 2003 A1
20040003032 Ma et al. Jan 2004 A1
20040010562 Itonaga Jan 2004 A1
20040010563 Forte et al. Jan 2004 A1
20040010588 Slater et al. Jan 2004 A1
20040010601 Afergan Jan 2004 A1
20040010621 Afergan et al. Jan 2004 A1
20040015584 Cartmell et al. Jan 2004 A1
20040019518 Abraham et al. Jan 2004 A1
20040024841 Becker et al. Feb 2004 A1
20040030620 Benjamin et al. Feb 2004 A1
20040032278 Orii et al. Feb 2004 A1
20040034744 Karlsson et al. Feb 2004 A1
20040039798 Hotz et al. Feb 2004 A1
20040044731 Chen et al. Mar 2004 A1
20040044791 Pouzzner Mar 2004 A1
20040054757 Ueda et al. Mar 2004 A1
20040059805 Dinker et al. Mar 2004 A1
20040064335 Yang Apr 2004 A1
20040064501 Jan et al. Apr 2004 A1
20040068542 Lalonde et al. Apr 2004 A1
20040073596 Kloninger et al. Apr 2004 A1
20040073707 Dillon Apr 2004 A1
20040073867 Kausik et al. Apr 2004 A1
20040078468 Hedin et al. Apr 2004 A1
20040078487 Cernohous et al. Apr 2004 A1
20040083283 Sundaram et al. Apr 2004 A1
20040083307 Uysal Apr 2004 A1
20040105544 Haneda et al. Jun 2004 A1
20040117309 Inoue et al. Jun 2004 A1
20040117455 Kaminksy et al. Jun 2004 A1
20040128344 Trossen Jul 2004 A1
20040128346 Melamed et al. Jul 2004 A1
20040148520 Talpade et al. Jul 2004 A1
20040167981 Douglas et al. Aug 2004 A1
20040167982 Cohen et al. Aug 2004 A1
20040170379 Yao et al. Sep 2004 A1
20040172466 Douglas et al. Sep 2004 A1
20040184456 Binding et al. Sep 2004 A1
20040194085 Beaubien et al. Sep 2004 A1
20040194102 Neerdaels Sep 2004 A1
20040203630 Wang Oct 2004 A1
20040205149 Dillon et al. Oct 2004 A1
20040205162 Parikh Oct 2004 A1
20040215823 Kleinfelter et al. Oct 2004 A1
20040221019 Swildens et al. Nov 2004 A1
20040221034 Kausik et al. Nov 2004 A1
20040246948 Lee et al. Dec 2004 A1
20040249939 Amini et al. Dec 2004 A1
20040249971 Klinker Dec 2004 A1
20040249975 Tuck et al. Dec 2004 A1
20040250119 Shelest et al. Dec 2004 A1
20040254921 Cohen et al. Dec 2004 A1
20040267906 Truty Dec 2004 A1
20040267907 Gustafsson Dec 2004 A1
20050010653 McCanne Jan 2005 A1
20050021706 Maggi et al. Jan 2005 A1
20050021862 Schroeder et al. Jan 2005 A1
20050027882 Sullivan et al. Feb 2005 A1
20050038967 Umbehocker et al. Feb 2005 A1
20050044270 Grove et al. Feb 2005 A1
20050102683 Branson et al. May 2005 A1
20050108169 Balasubramanian et al. May 2005 A1
20050108262 Fawcett May 2005 A1
20050108529 Juneau May 2005 A1
20050114296 Farber et al. May 2005 A1
20050117717 Lumsden Jun 2005 A1
20050132083 Raciborski et al. Jun 2005 A1
20050147088 Bao et al. Jul 2005 A1
20050149529 Gutmans Jul 2005 A1
20050157712 Rangarajan et al. Jul 2005 A1
20050160133 Greenlee et al. Jul 2005 A1
20050163168 Sheth et al. Jul 2005 A1
20050168782 Kobashi et al. Aug 2005 A1
20050171959 Deforche et al. Aug 2005 A1
20050172080 Miyauchi Aug 2005 A1
20050181769 Kogawa Aug 2005 A1
20050188073 Nakamichi et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050198170 LeMay et al. Sep 2005 A1
20050198303 Knauerhase et al. Sep 2005 A1
20050198334 Farber et al. Sep 2005 A1
20050198453 Osaki Sep 2005 A1
20050198571 Kramer et al. Sep 2005 A1
20050216483 Armstrong et al. Sep 2005 A1
20050216569 Coppola et al. Sep 2005 A1
20050216674 Robbin et al. Sep 2005 A1
20050223095 Volz et al. Oct 2005 A1
20050228856 Swildens et al. Oct 2005 A1
20050229119 Torvinen Oct 2005 A1
20050232165 Brawn et al. Oct 2005 A1
20050234864 Shapiro Oct 2005 A1
20050240574 Challenger et al. Oct 2005 A1
20050256880 Nam Koong et al. Nov 2005 A1
20050259645 Chen et al. Nov 2005 A1
20050259672 Eduri Nov 2005 A1
20050262248 Jennings, III et al. Nov 2005 A1
20050266835 Agrawal et al. Dec 2005 A1
20050267937 Daniels et al. Dec 2005 A1
20050267991 Huitema et al. Dec 2005 A1
20050267992 Huitema et al. Dec 2005 A1
20050267993 Huitema et al. Dec 2005 A1
20050278259 Gunaseelan et al. Dec 2005 A1
20050283759 Peteanu et al. Dec 2005 A1
20050283784 Suzuki Dec 2005 A1
20060005014 Aura et al. Jan 2006 A1
20060013158 Ahuja et al. Jan 2006 A1
20060020596 Liu et al. Jan 2006 A1
20060020684 Mukherjee et al. Jan 2006 A1
20060020714 Girouard et al. Jan 2006 A1
20060020715 Jungck Jan 2006 A1
20060021001 Giles et al. Jan 2006 A1
20060026067 Nicholas et al. Feb 2006 A1
20060026154 Altinel et al. Feb 2006 A1
20060031239 Koenig Feb 2006 A1
20060031319 Nelson et al. Feb 2006 A1
20060031503 Gilbert Feb 2006 A1
20060034494 Holloran Feb 2006 A1
20060036720 Faulk, Jr. Feb 2006 A1
20060036966 Yevdayev Feb 2006 A1
20060037037 Miranz Feb 2006 A1
20060039352 Karstens Feb 2006 A1
20060041614 Oe Feb 2006 A1
20060045005 Blackmore et al. Mar 2006 A1
20060047787 Aggarwal et al. Mar 2006 A1
20060047813 Aggarwal et al. Mar 2006 A1
20060059246 Grove Mar 2006 A1
20060063534 Kokkonen et al. Mar 2006 A1
20060064476 Decasper et al. Mar 2006 A1
20060064500 Roth et al. Mar 2006 A1
20060070060 Tantawi et al. Mar 2006 A1
20060074750 Clark et al. Apr 2006 A1
20060075084 Lyon Apr 2006 A1
20060075139 Jungck Apr 2006 A1
20060083165 McLane et al. Apr 2006 A1
20060085536 Meyer et al. Apr 2006 A1
20060088026 Mazur et al. Apr 2006 A1
20060107036 Randle et al. May 2006 A1
20060112066 Hamzy May 2006 A1
20060112176 Liu et al. May 2006 A1
20060120385 Atchison et al. Jun 2006 A1
20060129665 Toebes et al. Jun 2006 A1
20060129766 Cassia et al. Jun 2006 A1
20060136453 Kwan Jun 2006 A1
20060143293 Freedman Jun 2006 A1
20060146820 Friedman et al. Jul 2006 A1
20060149529 Nguyen et al. Jul 2006 A1
20060155823 Tran et al. Jul 2006 A1
20060155862 Kathi et al. Jul 2006 A1
20060161541 Cencini Jul 2006 A1
20060165051 Banerjee et al. Jul 2006 A1
20060168088 Leighton et al. Jul 2006 A1
20060173957 Robinson Aug 2006 A1
20060179080 Meek et al. Aug 2006 A1
20060184936 Abels et al. Aug 2006 A1
20060188097 Taniguchi et al. Aug 2006 A1
20060190605 Franz et al. Aug 2006 A1
20060193247 Naseh et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060206568 Verma et al. Sep 2006 A1
20060206586 Ling et al. Sep 2006 A1
20060218265 Farber et al. Sep 2006 A1
20060218304 Mukherjee et al. Sep 2006 A1
20060224752 Parekh et al. Oct 2006 A1
20060227740 McLaughlin et al. Oct 2006 A1
20060227758 Rana et al. Oct 2006 A1
20060230137 Gare et al. Oct 2006 A1
20060230265 Krishna Oct 2006 A1
20060233155 Srivastava Oct 2006 A1
20060253546 Chang et al. Nov 2006 A1
20060253609 Andreev et al. Nov 2006 A1
20060259581 Piersol Nov 2006 A1
20060259690 Vittal et al. Nov 2006 A1
20060259984 Juneau Nov 2006 A1
20060265497 Ohata et al. Nov 2006 A1
20060265508 Angel et al. Nov 2006 A1
20060265516 Schilling Nov 2006 A1
20060265720 Cai et al. Nov 2006 A1
20060271641 Stavrakos et al. Nov 2006 A1
20060282522 Lewin et al. Dec 2006 A1
20060288119 Kim et al. Dec 2006 A1
20060288424 Saito Dec 2006 A1
20070005689 Leighton et al. Jan 2007 A1
20070005801 Kumar et al. Jan 2007 A1
20070005892 Mullender et al. Jan 2007 A1
20070011267 Overton et al. Jan 2007 A1
20070014241 Banerjee et al. Jan 2007 A1
20070021998 Laithwaite et al. Jan 2007 A1
20070028001 Phillips et al. Feb 2007 A1
20070038729 Sullivan et al. Feb 2007 A1
20070038994 Davis et al. Feb 2007 A1
20070041393 Westhead et al. Feb 2007 A1
20070043667 Qawami et al. Feb 2007 A1
20070043859 Ruul Feb 2007 A1
20070050522 Grove et al. Mar 2007 A1
20070050703 Lebel Mar 2007 A1
20070055764 Dilley et al. Mar 2007 A1
20070061440 Sundaram et al. Mar 2007 A1
20070064610 Khandani Mar 2007 A1
20070076872 Juneau Apr 2007 A1
20070086429 Lawrence et al. Apr 2007 A1
20070094361 Hoynowski et al. Apr 2007 A1
20070101061 Baskaran et al. May 2007 A1
20070101377 Six et al. May 2007 A1
20070118667 McCarthy et al. May 2007 A1
20070118668 McCarthy et al. May 2007 A1
20070134641 Lieu Jun 2007 A1
20070156726 Levy Jul 2007 A1
20070156919 Potti et al. Jul 2007 A1
20070162331 Sullivan Jul 2007 A1
20070168336 Ransil et al. Jul 2007 A1
20070168517 Weller Jul 2007 A1
20070174426 Swildens et al. Jul 2007 A1
20070174442 Sherman et al. Jul 2007 A1
20070174490 Choi et al. Jul 2007 A1
20070183342 Wong et al. Aug 2007 A1
20070198982 Bolan et al. Aug 2007 A1
20070204107 Greenfield et al. Aug 2007 A1
20070208737 Li et al. Sep 2007 A1
20070219795 Park et al. Sep 2007 A1
20070220010 Ertugrul Sep 2007 A1
20070233705 Farber et al. Oct 2007 A1
20070233706 Farber et al. Oct 2007 A1
20070233846 Farber et al. Oct 2007 A1
20070233884 Farber et al. Oct 2007 A1
20070243860 Aiello et al. Oct 2007 A1
20070244964 Challenger et al. Oct 2007 A1
20070245022 Olliphant et al. Oct 2007 A1
20070250467 Mesnik et al. Oct 2007 A1
20070250468 Pieper Oct 2007 A1
20070250560 Wein et al. Oct 2007 A1
20070250601 Amlekar et al. Oct 2007 A1
20070250611 Bhogal et al. Oct 2007 A1
20070253377 Janneteau et al. Nov 2007 A1
20070255843 Zubev Nov 2007 A1
20070263604 Tal Nov 2007 A1
20070266113 Koopmans et al. Nov 2007 A1
20070266311 Westphal Nov 2007 A1
20070266333 Cossey et al. Nov 2007 A1
20070270165 Poosala Nov 2007 A1
20070271375 Hwang Nov 2007 A1
20070271385 Davis et al. Nov 2007 A1
20070271560 Wahlert et al. Nov 2007 A1
20070271608 Shimizu et al. Nov 2007 A1
20070280229 Kenney Dec 2007 A1
20070288588 Wein et al. Dec 2007 A1
20070291739 Sullivan et al. Dec 2007 A1
20080005057 Ozzie et al. Jan 2008 A1
20080008089 Bornstein et al. Jan 2008 A1
20080016233 Schneider Jan 2008 A1
20080025304 Venkataswami et al. Jan 2008 A1
20080037536 Padmanabhan et al. Feb 2008 A1
20080046550 Mazur et al. Feb 2008 A1
20080046596 Afergan et al. Feb 2008 A1
20080056207 Eriksson et al. Mar 2008 A1
20080065724 Seed et al. Mar 2008 A1
20080065745 Leighton et al. Mar 2008 A1
20080071859 Seed et al. Mar 2008 A1
20080071987 Karn et al. Mar 2008 A1
20080072264 Crayford Mar 2008 A1
20080082551 Farber et al. Apr 2008 A1
20080082662 Dandliker et al. Apr 2008 A1
20080086434 Chesla Apr 2008 A1
20080086559 Davis et al. Apr 2008 A1
20080086574 Raciborski et al. Apr 2008 A1
20080092242 Rowley Apr 2008 A1
20080101358 Van Ewijk et al. May 2008 A1
20080103805 Shear et al. May 2008 A1
20080104268 Farber et al. May 2008 A1
20080109679 Wright et al. May 2008 A1
20080114829 Button et al. May 2008 A1
20080125077 Velazquez et al. May 2008 A1
20080126706 Newport et al. May 2008 A1
20080134043 Georgis et al. Jun 2008 A1
20080140800 Farber et al. Jun 2008 A1
20080147866 Stolorz et al. Jun 2008 A1
20080147873 Matsumoto Jun 2008 A1
20080155059 Hardin et al. Jun 2008 A1
20080155061 Afergan et al. Jun 2008 A1
20080155613 Benya et al. Jun 2008 A1
20080155614 Cooper et al. Jun 2008 A1
20080162667 Verma et al. Jul 2008 A1
20080162821 Duran et al. Jul 2008 A1
20080162843 Davis et al. Jul 2008 A1
20080172488 Jawahar et al. Jul 2008 A1
20080189437 Halley Aug 2008 A1
20080201332 Souders et al. Aug 2008 A1
20080215718 Stolorz et al. Sep 2008 A1
20080215730 Sundaram et al. Sep 2008 A1
20080215735 Farber et al. Sep 2008 A1
20080215747 Menon et al. Sep 2008 A1
20080215750 Farber et al. Sep 2008 A1
20080215755 Farber et al. Sep 2008 A1
20080222281 Dilley et al. Sep 2008 A1
20080222291 Weller et al. Sep 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080228574 Stewart et al. Sep 2008 A1
20080228920 Souders et al. Sep 2008 A1
20080235383 Schneider Sep 2008 A1
20080235400 Slocombe et al. Sep 2008 A1
20080256087 Piironen et al. Oct 2008 A1
20080256175 Lee et al. Oct 2008 A1
20080263135 Olliphant Oct 2008 A1
20080275772 Suryanarayana et al. Nov 2008 A1
20080281946 Swildens et al. Nov 2008 A1
20080281950 Wald et al. Nov 2008 A1
20080288722 Lecoq et al. Nov 2008 A1
20080301670 Gouge et al. Dec 2008 A1
20080312766 Couckuyt Dec 2008 A1
20080319862 Golan et al. Dec 2008 A1
20080320123 Houlihan et al. Dec 2008 A1
20080320269 Houlihan et al. Dec 2008 A1
20090013063 Soman Jan 2009 A1
20090016236 Alcala et al. Jan 2009 A1
20090029644 Sue et al. Jan 2009 A1
20090031367 Sue Jan 2009 A1
20090031368 Ling Jan 2009 A1
20090031376 Riley et al. Jan 2009 A1
20090043900 Barber Feb 2009 A1
20090049098 Pickelsimer et al. Feb 2009 A1
20090063038 Shrivathsan et al. Mar 2009 A1
20090063704 Taylor et al. Mar 2009 A1
20090070533 Elazary et al. Mar 2009 A1
20090083228 Shatz et al. Mar 2009 A1
20090083279 Hasek Mar 2009 A1
20090086728 Gulati et al. Apr 2009 A1
20090086741 Zhang Apr 2009 A1
20090089869 Varghese Apr 2009 A1
20090094252 Wong et al. Apr 2009 A1
20090103707 McGary et al. Apr 2009 A1
20090106202 Mizrahi Apr 2009 A1
20090106381 Kasriel et al. Apr 2009 A1
20090112703 Brown Apr 2009 A1
20090125393 Hwang et al. May 2009 A1
20090125934 Jones et al. May 2009 A1
20090132368 Cotter et al. May 2009 A1
20090132640 Verma et al. May 2009 A1
20090132648 Swildens et al. May 2009 A1
20090138533 Iwasaki et al. May 2009 A1
20090144411 Winkler et al. Jun 2009 A1
20090144412 Ferguson et al. Jun 2009 A1
20090150926 Schlack Jun 2009 A1
20090157504 Braemer et al. Jun 2009 A1
20090157850 Gagliardi et al. Jun 2009 A1
20090158163 Stephens et al. Jun 2009 A1
20090164331 Bishop et al. Jun 2009 A1
20090164614 Christian et al. Jun 2009 A1
20090177667 Ramos et al. Jul 2009 A1
20090182815 Czechowski et al. Jul 2009 A1
20090182837 Rogers Jul 2009 A1
20090182945 Aviles et al. Jul 2009 A1
20090187575 DaCosta Jul 2009 A1
20090198817 Sundaram et al. Aug 2009 A1
20090204682 Jeyaseelan et al. Aug 2009 A1
20090210549 Hudson et al. Aug 2009 A1
20090228708 Trostle Sep 2009 A1
20090233623 Johnson Sep 2009 A1
20090241167 Moore Sep 2009 A1
20090248697 Richardson et al. Oct 2009 A1
20090248786 Richardson Oct 2009 A1
20090248787 Sivasubramanian et al. Oct 2009 A1
20090248852 Fuhrmann et al. Oct 2009 A1
20090248858 Sivasubramanian et al. Oct 2009 A1
20090248893 Richardson et al. Oct 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090253435 Olofsson Oct 2009 A1
20090254661 Fullagar et al. Oct 2009 A1
20090259588 Lindsay Oct 2009 A1
20090259971 Rankine et al. Oct 2009 A1
20090262741 Jungck et al. Oct 2009 A1
20090271498 Cable Oct 2009 A1
20090271577 Campana et al. Oct 2009 A1
20090271730 Rose et al. Oct 2009 A1
20090276771 Nickolov et al. Nov 2009 A1
20090279444 Ravindran et al. Nov 2009 A1
20090282038 Subotin et al. Nov 2009 A1
20090287750 Banavar et al. Nov 2009 A1
20090307307 Igarashi Dec 2009 A1
20090327489 Swildens et al. Dec 2009 A1
20090327517 Sivasubramanian et al. Dec 2009 A1
20090327914 Adar et al. Dec 2009 A1
20100005175 Swildens et al. Jan 2010 A1
20100011061 Hudson et al. Jan 2010 A1
20100011126 Hsu et al. Jan 2010 A1
20100020699 On Jan 2010 A1
20100023601 Lewin et al. Jan 2010 A1
20100023621 Ezolt et al. Jan 2010 A1
20100030662 Klein Feb 2010 A1
20100030914 Sparks et al. Feb 2010 A1
20100034470 Valencia-Campo et al. Feb 2010 A1
20100036944 Douglis et al. Feb 2010 A1
20100042725 Jeon et al. Feb 2010 A1
20100049862 Dixon Feb 2010 A1
20100057894 Glasser Mar 2010 A1
20100070603 Moss et al. Mar 2010 A1
20100070700 Borst et al. Mar 2010 A1
20100082320 Wood et al. Apr 2010 A1
20100082787 Kommula et al. Apr 2010 A1
20100088367 Brown et al. Apr 2010 A1
20100088405 Huang et al. Apr 2010 A1
20100095008 Joshi Apr 2010 A1
20100100629 Raciborski et al. Apr 2010 A1
20100103837 Jungck Apr 2010 A1
20100111059 Bappu et al. May 2010 A1
20100115133 Joshi May 2010 A1
20100115342 Shigeta et al. May 2010 A1
20100121953 Friedman et al. May 2010 A1
20100121981 Drako May 2010 A1
20100122069 Gonion May 2010 A1
20100125626 Lucas et al. May 2010 A1
20100125673 Richardson et al. May 2010 A1
20100125675 Richardson et al. May 2010 A1
20100131646 Drako May 2010 A1
20100138559 Sullivan et al. Jun 2010 A1
20100150155 Napierala Jun 2010 A1
20100161799 Maloo Jun 2010 A1
20100169392 Lev Ran et al. Jul 2010 A1
20100169452 Atluri et al. Jul 2010 A1
20100174811 Musiri et al. Jul 2010 A1
20100192225 Ma et al. Jul 2010 A1
20100217801 Leighton et al. Aug 2010 A1
20100217856 Falkena Aug 2010 A1
20100223364 Wei Sep 2010 A1
20100226372 Watanabe Sep 2010 A1
20100228819 Wei Sep 2010 A1
20100257024 Holmes et al. Oct 2010 A1
20100257266 Holmes et al. Oct 2010 A1
20100257566 Matila Oct 2010 A1
20100268789 Yoo et al. Oct 2010 A1
20100268814 Cross et al. Oct 2010 A1
20100274765 Murphy et al. Oct 2010 A1
20100281482 Pike et al. Nov 2010 A1
20100293296 Hsu et al. Nov 2010 A1
20100293479 Rousso et al. Nov 2010 A1
20100299427 Joshi Nov 2010 A1
20100299438 Zimmerman et al. Nov 2010 A1
20100299439 McCarthy et al. Nov 2010 A1
20100312861 Kolhi et al. Dec 2010 A1
20100318508 Brawer et al. Dec 2010 A1
20100322255 Hao et al. Dec 2010 A1
20100325365 Colglazier et al. Dec 2010 A1
20100332595 Fullagar et al. Dec 2010 A1
20110010244 Hatridge Jan 2011 A1
20110029598 Arnold et al. Feb 2011 A1
20110040893 Karaoguz et al. Feb 2011 A1
20110051738 Xu Mar 2011 A1
20110055386 Middleton et al. Mar 2011 A1
20110055714 Vemulapalli et al. Mar 2011 A1
20110055921 Narayanaswamy et al. Mar 2011 A1
20110057790 Martin et al. Mar 2011 A1
20110058675 Brueck et al. Mar 2011 A1
20110072138 Canturk et al. Mar 2011 A1
20110072366 Spencer Mar 2011 A1
20110078000 Ma et al. Mar 2011 A1
20110078230 Sepulveda Mar 2011 A1
20110085654 Jana et al. Apr 2011 A1
20110087769 Holmes et al. Apr 2011 A1
20110096987 Morales et al. Apr 2011 A1
20110113467 Agarwal et al. May 2011 A1
20110153938 Verzunov et al. Jun 2011 A1
20110153941 Spatscheck et al. Jun 2011 A1
20110154318 Oshins et al. Jun 2011 A1
20110161461 Niven-Jenkins Jun 2011 A1
20110166935 Armentrout et al. Jul 2011 A1
20110182290 Perkins Jul 2011 A1
20110191445 Dazzi Aug 2011 A1
20110191447 Dazzi et al. Aug 2011 A1
20110191449 Swildens et al. Aug 2011 A1
20110191459 Joshi Aug 2011 A1
20110196892 Xia Aug 2011 A1
20110208876 Richardson et al. Aug 2011 A1
20110208958 Stuedi et al. Aug 2011 A1
20110209064 Jorgensen et al. Aug 2011 A1
20110219120 Farber et al. Sep 2011 A1
20110219372 Agarwal et al. Sep 2011 A1
20110238501 Almeida Sep 2011 A1
20110238793 Bedare et al. Sep 2011 A1
20110239215 Sugai Sep 2011 A1
20110252142 Richardson et al. Oct 2011 A1
20110252143 Baumback et al. Oct 2011 A1
20110258049 Ramer et al. Oct 2011 A1
20110258614 Tamm Oct 2011 A1
20110270964 Huang et al. Nov 2011 A1
20110276623 Girbal Nov 2011 A1
20110296053 Medved et al. Dec 2011 A1
20110302304 Baumback et al. Dec 2011 A1
20110307533 Saeki Dec 2011 A1
20110320522 Endres et al. Dec 2011 A1
20110320559 Foti Dec 2011 A1
20120011190 Driesen et al. Jan 2012 A1
20120023090 Holloway et al. Jan 2012 A1
20120023226 Petersen et al. Jan 2012 A1
20120036238 Sundaram et al. Feb 2012 A1
20120041970 Ghosh Feb 2012 A1
20120066360 Ghosh Mar 2012 A1
20120072600 Richardson et al. Mar 2012 A1
20120078998 Son et al. Mar 2012 A1
20120079096 Cowan et al. Mar 2012 A1
20120079115 Richardson et al. Mar 2012 A1
20120089700 Safruti Apr 2012 A1
20120089972 Scheidel et al. Apr 2012 A1
20120096065 Suit et al. Apr 2012 A1
20120110515 Abramoff et al. May 2012 A1
20120124184 Sakata et al. May 2012 A1
20120131177 Brandt et al. May 2012 A1
20120136697 Peles et al. May 2012 A1
20120143688 Alexander Jun 2012 A1
20120159476 Ramteke et al. Jun 2012 A1
20120166516 Simmons et al. Jun 2012 A1
20120169646 Berkes et al. Jul 2012 A1
20120173677 Richardson et al. Jul 2012 A1
20120173760 Jog et al. Jul 2012 A1
20120179796 Nagaraj Jul 2012 A1
20120179817 Bade et al. Jul 2012 A1
20120179839 Raciborski et al. Jul 2012 A1
20120198043 Hesketh et al. Aug 2012 A1
20120198071 Black et al. Aug 2012 A1
20120209942 Zehavi Aug 2012 A1
20120224516 Stojanovski et al. Sep 2012 A1
20120226649 Kovacs et al. Sep 2012 A1
20120233329 Dickinson et al. Sep 2012 A1
20120233522 Barton et al. Sep 2012 A1
20120233668 Leafe et al. Sep 2012 A1
20120239725 Hartrick et al. Sep 2012 A1
20120246129 Rothschild et al. Sep 2012 A1
20120246257 Brown Sep 2012 A1
20120254961 Kim et al. Oct 2012 A1
20120257628 Bu et al. Oct 2012 A1
20120259954 McCarthy et al. Oct 2012 A1
20120278229 Vishwanathan et al. Nov 2012 A1
20120278831 van Coppenolle et al. Nov 2012 A1
20120303785 Sivasubramanian et al. Nov 2012 A1
20120303804 Sundaram et al. Nov 2012 A1
20120311648 Swildens et al. Dec 2012 A1
20120324089 Joshi Dec 2012 A1
20130003735 Chao et al. Jan 2013 A1
20130007100 Trahan et al. Jan 2013 A1
20130007101 Trahan et al. Jan 2013 A1
20130007102 Trahan et al. Jan 2013 A1
20130007241 Trahan et al. Jan 2013 A1
20130007273 Baumback et al. Jan 2013 A1
20130019311 Swildens et al. Jan 2013 A1
20130034099 Hikichi et al. Feb 2013 A1
20130041872 Aizman et al. Feb 2013 A1
20130046869 Jenkins et al. Feb 2013 A1
20130046883 Lientz Feb 2013 A1
20130054675 Jenkins et al. Feb 2013 A1
20130055374 Kustarz et al. Feb 2013 A1
20130067530 Spektor et al. Mar 2013 A1
20130073808 Puthalath Mar 2013 A1
20130080420 Taylor et al. Mar 2013 A1
20130080421 Taylor et al. Mar 2013 A1
20130080576 Taylor et al. Mar 2013 A1
20130080577 Taylor et al. Mar 2013 A1
20130080623 Thireault Mar 2013 A1
20130080627 Kukreja et al. Mar 2013 A1
20130080636 Friedman et al. Mar 2013 A1
20130086001 Bhogal et al. Apr 2013 A1
20130117282 Mugali, Jr. et al. May 2013 A1
20130117849 Golshan et al. May 2013 A1
20130130221 Kortemeyer et al. May 2013 A1
20130133057 Yoon et al. May 2013 A1
20130151646 Chidambaram et al. Jun 2013 A1
20130191499 Ludin et al. Jul 2013 A1
20130198341 Kim Aug 2013 A1
20130212300 Eggleston et al. Aug 2013 A1
20130219020 McCarthy et al. Aug 2013 A1
20130227165 Liu Aug 2013 A1
20130246567 Green et al. Sep 2013 A1
20130254269 Sivasubramanian et al. Sep 2013 A1
20130254879 Chesla et al. Sep 2013 A1
20130263256 Dickinson et al. Oct 2013 A1
20130268616 Sakata et al. Oct 2013 A1
20130275549 Field et al. Oct 2013 A1
20130279335 Ahmadi Oct 2013 A1
20130305046 Mankovski et al. Nov 2013 A1
20130311583 Humphreys et al. Nov 2013 A1
20130311605 Richardson et al. Nov 2013 A1
20130311989 Ota et al. Nov 2013 A1
20130318153 Sivasubramanian et al. Nov 2013 A1
20130339429 Richardson et al. Dec 2013 A1
20130346567 Richardson et al. Dec 2013 A1
20140006577 Joe et al. Jan 2014 A1
20140007239 Sharpe et al. Jan 2014 A1
20140019605 Boberg Jan 2014 A1
20140022951 Lemieux Jan 2014 A1
20140036675 Wang et al. Feb 2014 A1
20140040478 Hsu et al. Feb 2014 A1
20140047104 Rodriguez Feb 2014 A1
20140053022 Forgette et al. Feb 2014 A1
20140059120 Richardson et al. Feb 2014 A1
20140059198 Richardson et al. Feb 2014 A1
20140059379 Ren et al. Feb 2014 A1
20140075109 Richardson et al. Mar 2014 A1
20140082165 Marr et al. Mar 2014 A1
20140082614 Klein et al. Mar 2014 A1
20140089917 Attalla et al. Mar 2014 A1
20140108672 Ou et al. Apr 2014 A1
20140122698 Batrouni et al. May 2014 A1
20140122725 Batrouni et al. May 2014 A1
20140137111 Dees et al. May 2014 A1
20140143320 Sivasubramanian et al. May 2014 A1
20140149601 Carney May 2014 A1
20140164817 Bartholomy et al. Jun 2014 A1
20140165061 Greene et al. Jun 2014 A1
20140195686 Yeager Jul 2014 A1
20140215019 Ahrens Jul 2014 A1
20140244937 Bloomstein et al. Aug 2014 A1
20140257891 Richardson et al. Sep 2014 A1
20140269371 Badea et al. Sep 2014 A1
20140280606 Long Sep 2014 A1
20140280679 Dey et al. Sep 2014 A1
20140297870 Eggleston et al. Oct 2014 A1
20140310402 Giaretta et al. Oct 2014 A1
20140310811 Hentunen Oct 2014 A1
20140325155 Marshall et al. Oct 2014 A1
20140331328 Wang et al. Nov 2014 A1
20140337472 Newton et al. Nov 2014 A1
20140351871 Bomfim et al. Nov 2014 A1
20140365666 Richardson et al. Dec 2014 A1
20150006615 Wainner et al. Jan 2015 A1
20150019686 Backholm Jan 2015 A1
20150026407 Mclellan et al. Jan 2015 A1
20150067171 Yum Mar 2015 A1
20150074228 Drake Mar 2015 A1
20150081842 Richardson et al. Mar 2015 A1
20150088964 Shiell Mar 2015 A1
20150088972 Brand Mar 2015 A1
20150089621 Khalid Mar 2015 A1
20150106864 Li et al. Apr 2015 A1
20150154051 Kruglick Jun 2015 A1
20150156279 Vaswani et al. Jun 2015 A1
20150172379 Richardson et al. Jun 2015 A1
20150172407 MacCarthaigh et al. Jun 2015 A1
20150172414 Richardson et al. Jun 2015 A1
20150172415 Richardson et al. Jun 2015 A1
20150180988 Sivasubramanian et al. Jun 2015 A1
20150188734 Petrov Jul 2015 A1
20150188994 Marshall et al. Jul 2015 A1
20150189042 Sun et al. Jul 2015 A1
20150195244 Richardson et al. Jul 2015 A1
20150200991 Kwon Jul 2015 A1
20150207733 Richardson et al. Jul 2015 A1
20150215270 Sivasubramanian et al. Jul 2015 A1
20150215656 Pulung et al. Jul 2015 A1
20150229710 Sivasubramanian et al. Aug 2015 A1
20150244580 Saavedra Aug 2015 A1
20150249579 Ellsworth et al. Sep 2015 A1
20150256647 Richardson et al. Sep 2015 A1
20150288647 Chhabra et al. Oct 2015 A1
20150319194 Richardson et al. Nov 2015 A1
20150319260 Watson Nov 2015 A1
20150334082 Richardson et al. Nov 2015 A1
20160006672 Saavedra Jan 2016 A1
20160021197 Pogrebinsky et al. Jan 2016 A1
20160026568 Marshall et al. Jan 2016 A1
20160028598 Khakpour Jan 2016 A1
20160028644 Richardson et al. Jan 2016 A1
20160028755 Vasseur et al. Jan 2016 A1
20160036857 Foxhoven et al. Feb 2016 A1
20160041910 Richardson et al. Feb 2016 A1
20160065665 Richardson et al. Mar 2016 A1
20160072669 Saavedra Mar 2016 A1
20160072720 Richardson et al. Mar 2016 A1
20160132600 Woodhead et al. May 2016 A1
20160134492 Ellsworth et al. May 2016 A1
20160142251 Contreras et al. May 2016 A1
20160142367 Richardson et al. May 2016 A1
20160182454 Phonsa et al. Jun 2016 A1
20160182542 Staniford Jun 2016 A1
20160205062 Mosert Jul 2016 A1
20160241637 Marr et al. Aug 2016 A1
20160241639 Brookins et al. Aug 2016 A1
20160241651 Sivasubramanian et al. Aug 2016 A1
20160253262 Nadgowda Sep 2016 A1
20160274929 King Sep 2016 A1
20160294678 Khakpour Oct 2016 A1
20160308959 Richardson et al. Oct 2016 A1
20160366202 Phillips et al. Dec 2016 A1
20170041428 Katsev Feb 2017 A1
20170085495 Richardson et al. Mar 2017 A1
20170109316 Hack et al. Apr 2017 A1
20170126557 Richardson et al. May 2017 A1
20170126796 Hollis et al. May 2017 A1
20170142062 Richardson et al. May 2017 A1
20170153980 Araújo et al. Jun 2017 A1
20170155678 Araújo et al. Jun 2017 A1
20170155732 Araújo et al. Jun 2017 A1
20170171146 Sharma et al. Jun 2017 A1
20170180217 Puchala et al. Jun 2017 A1
20170180267 Puchala et al. Jun 2017 A1
20170214755 Sivasubramanian et al. Jul 2017 A1
20170214761 Hsu et al. Jul 2017 A1
20170250821 Richardson et al. Aug 2017 A1
20170257340 Richardson et al. Sep 2017 A1
20170353395 Richardson et al. Dec 2017 A1
20180063027 Rafferty Mar 2018 A1
20180097631 Uppal et al. Apr 2018 A1
20180097634 Uppal et al. Apr 2018 A1
20180097831 Uppal et al. Apr 2018 A1
20180109553 Radlein et al. Apr 2018 A1
20180159757 Uppal et al. Jun 2018 A1
20180159769 Richardson et al. Jun 2018 A1
20180167444 Sivasubramanian et al. Jun 2018 A1
20180167469 Sivasubramanian et al. Jun 2018 A1
20180183689 Ellsworth et al. Jun 2018 A1
20180191817 Richardson et al. Jul 2018 A1
20180212880 Mostert Jul 2018 A1
20180213052 Maccarthaigh et al. Jul 2018 A1
20180278717 Richardson et al. Sep 2018 A1
20180287916 Mizik et al. Oct 2018 A1
20180302322 Richardson et al. Oct 2018 A1
Foreign Referenced Citations (41)
Number Date Country
2741 895 May 2010 CA
1422468 Jun 2003 CN
1511399 Jul 2004 CN
1605182 Apr 2005 CN
101189598 May 2008 CN
101460907 Jun 2009 CN
103731481 Apr 2014 CN
1603307 Dec 2005 EP
1351141 Oct 2007 EP
2008167 Dec 2008 EP
3156911 Apr 2017 EP
07-141305 Jun 1995 JP
2001-0506093 May 2001 JP
2001-249907 Sep 2001 JP
2002-024192 Jan 2002 JP
2002-044137 Feb 2002 JP
2002-323986 Nov 2002 JP
2003-167810 Jun 2003 JP
2003-167813 Jun 2003 JP
2003-522358 Jul 2003 JP
2003188901 Jul 2003 JP
2004-070935 Mar 2004 JP
2004-532471 Oct 2004 JP
2004-533738 Nov 2004 JP
2005-537687 Dec 2005 JP
2007-133896 May 2007 JP
2007-207225 Aug 2007 JP
2008-515106 May 2008 JP
2009-071538 Apr 2009 JP
2012-509623 Apr 2012 JP
2012-209623 Oct 2012 JP
WO 2002069608 Sep 2002 WO
WO 2005071560 Aug 2005 WO
WO 2007007960 Jan 2007 WO
WO 2007126837 Nov 2007 WO
WO 2009124006 Oct 2009 WO
WO 2010002603 Jan 2010 WO
WO 2012044587 Apr 2012 WO
WO 2012065641 May 2012 WO
WO 2014047073 Mar 2014 WO
WO 2017106455 Jun 2017 WO
Non-Patent Literature Citations (164)
Entry
“Non-Final Office Action dated Jan. 3, 2012,” U.S. Appl. No. 12/652,541; Jan. 3, 2012; 35 pages.
“Final Office Action dated Sep. 5, 2012,” U.S. Appl. No. 12/652,541; Sep. 5, 2012; 40 pages.
“Notice of Allowance dated Jan. 4, 2013,” U.S. Appl. No. 12/652,541; Jan. 4, 2013; 11 pages.
“Non-Final Office Action dated Apr. 30, 2014,” U.S. Appl. No. 13/842,970; 20 pages.
“Final Office Action dated Aug. 19, 2014,” U.S. Appl. No. 13/842,970; 13 pages.
“Notice of Allowance dated Dec. 5, 2014,” U.S. Appl. No. 13/842,970; 6 pages.
Canonical Name (CNAME) DNS Records, domainavenue.com, Feb. 1, 2001, XP055153783, Retrieved from the Internet: URL:http://www.domainavenue.com/cname.htm [retrieved on Nov. 18, 2013].
“Content delivery network”, Wikipedia, the free encyclopedia, Retrieved from the Internet: URL:http://en.wikipedia.org/w/index.php?title=Contentdelivery network&oldid=601009970, XP055153445, Mar. 24, 2008.
“Global Server Load Balancing with ServerIron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages.
“Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages.
“Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/bin/view/Sungrid/OtherGridOfferings, 8 pages.
“Recent Advances Boost System Virtualization,” eWeek.com, retrieved from May 3, 2006, http://www.eWeek.com/article2/0,1895,1772626,00.asp, 5 pages.
“Scaleable Trust of Next Generation Management (STRONGMAN),” retrieved May 17, 2006, from http://www.cis.upenn.edu/˜dsl/Strongman/, 4 pages.
“Sun EDA Compute Ranch,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://sun.com/processors/ranch/brochure.pdf, 2 pages.
“Sun Microsystems Accelerates UltraSP ARC Processor Design Program With New Burlington, Mass. Compute Ranch,” Nov. 6, 2002, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2002-11/sunflash.20021106.3 .xml, 2 pages.
“Sun N1 Grid Engine 6,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/gridware/index.xml, 3 pages.
“Sun Opens New Processor Design Compute Ranch,” Nov. 30, 2001, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2001-11/sunflash.20011130.1.xml, 3 pages.
“The Softricity Desktop,” Softricity, Inc., retrieved May 3, 2006, from http://www.softricity.com/products/, 3 pages.
“Xen—The Xen virtual Machine Monitor,” University of Cambridge Computer Laboratory, retrieved Nov. 8, 2005, from http://www.cl.cam.ac.uk/Research/SRG/netos/xen/, 2 pages.
“XenFaq,” retrieved Nov. 8, 2005, from http://wiki.xensource.com/xenwiki/XenFaq?action=print, 9 pages.
Abi, Issam, et al., “A Business Driven Management Framework for Utility Computing Environments,” Oct. 12, 2004, HP Laboratories Bristol, HPL-2004-171, retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2004/HPL-2004-171.pdf, 14 pages.
American Bar Association; Digital Signature Guidelines Tutorial [online]; Feb. 10, 2002 [retrieved on Mar. 2, 2010]; American Bar Association Section of Science and Technology Information Security Committee; Retrieved from the internet: (URL: http://web.archive.org/web/20020210124615/www.abanet.org/scitech/ec/isc/dsg-tutorial.html; pp. 1-8.
Armour et al.: “A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities”; Management Science, vol. 9, No. 2 (Jan. 1963); pp. 294-309.
Baglioni et al., “Preprocessing and Mining Web Log Data for Web Personalization”, LNAI 2829, 2003, pp. 237-249.
Barbir, A., et al., “Known Content Network (CN) Request-Routing Mechanisms”, Request for Comments 3568, [online], IETF, Jul. 2003, [retrieved on Feb. 26, 2013], Retrieved from the Internet: (URL: http://tools.ietf.org/rfc/rfc3568.txt).
Bellovin, S., “Distributed Firewalls,” ;login;:37-39, Nov. 1999, http://www.cs.columbia.edu/-smb/papers/distfw. html, 10 pages, retrieved Nov. 11, 2005.
Blaze, M., “Using the KeyNote Trust Management System,” Mar. 1, 2001, from http://www.crypto.com/trustmgt/kn.html, 4 pages, retrieved May 17, 2006.
Brenton, C., “What is Egress Filtering and How Can I Implement It?—Egress Filtering v 0.2,” Feb. 29, 2000, SANS Institute, http://www.sans.org/infosecFAQ/firewall/egress.htm, 6 pages.
Byun et al., “A Dynamic Grid Services Deployment Mechanism for On-Demand Resource Provisioning”, IEEE International Symposium on Cluster Computing and the Grid:863-870, 2005.
Chipara et al, “Realtime Power-Aware Routing in Sensor Network”, IEEE, 2006, 10 pages.
Clark, C., “Live Migration of Virtual Machines,” May 2005, NSDI '05: 2nd Symposium on Networked Systems Design and Implementation, Boston, MA, May 2-4, 2005, retrieved from http://www.usenix.org/events/nsdi05/tech/full_papers/clark/clark.pdf, 14 pages.
Coulson, D., “Network Security Iptables,” Apr. 2003, Linuxpro, Part 2, retrieved from http://davidcoulson.net/writing/Ixf/38/iptables.pdf, 4 pages.
Coulson, D., “Network Security Iptables,” Mar. 2003, Linuxpro, Part 1, retrieved from http://davidcoulson.net/writing/Ixf/39/iptables.pdf, 4 pages.
Deleuze, C., et al., A DNS Based Mapping Peering System for Peering CDNs, draft-deleuze-cdnp-dnsmap-peer-00.txt, Nov. 20, 2000, 20 pages.
Demers, A., “Epidemic Algorithms for Replicated Database Maintenance,” 1987, Proceedings of the sixth annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, Aug. 10-12, 1987, 12 pages.
Gruener, J., “A Vision of Togetherness,” May 24, 2004, NetworkWorld, retrieved May 3, 2006, from, http://www.networkworld.com/supp/2004/ndc3/0524virt.html, 9 pages.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”,May 2005, In Proc. of Networking 2005, all pages.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”, Dec. 18, 2004, Technical University Berlin, all pages.
Hartung et al.; Digital rights management and watermarking of multimedia content for m-commerce applications; Published in: Communications Magazine, IEEE (vol. 38, Issue: 11 ); Date of Publication: Nov. 2000; pp. 78-84; IEEE Xplore.
Horvath et al., “Enhancing Energy Efficiency in Multi-tier Web Server Clusters via Prioritization,” In Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International , vol. No., pp. 1-6, Mar. 26-30, 2007.
Ioannidis, S., et al., “Implementing a Distributed Firewall,” Nov. 2000, (ACM) Proceedings of the ACM Computer and Communications Security (CCS) 2000, Athens, Greece, pp. 190-199, retrieved from http://www.cis.upenn.edu/˜dls/STRONGMAN/Papers/df.pdf, 10 pages.
Joseph, Joshy, et al., “Introduction to Grid Computing,” Apr. 16, 2004, retrieved Aug. 30, 2007, from http://www.informit.com/articles/printerfriendly.aspx?p=169508, 19 pages.
Kalafut et al., Understanding Implications of DNS Zone Provisioning., Proceeding IMC '08 Proceedings of the 8th AMC SIGCOMM conference on Internet measurement., pp. 211-216., ACM New York, NY, USA., 2008.
Kato, Yoshinobu , Server load balancer—Difference in distribution technique and supported protocol—Focus on function to meet the needs, Nikkei Communications, Japan, Nikkei Business Publications, Inc., Mar. 20, 2000, vol. 314, pp. 114 to 123.
Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables _ Basics.html, 4 pages.
Liu et al., “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering 61 (2007) pp. 304-330.
Maesono, et al., “A Local Scheduling Method considering Data Transfer in Data Grid,” Technical Report of IEICE, vol. 104, No. 692, pp. 435-440, The Institute of Electronics, Information and Communication Engineers, Japan, Feb. 2005.
Meng et al., “Improving the Scalability of Data Center Networks with Traffic-Aware Virtual Machine Placement”; Proceedings of the 29th Conference on Information Communications, INFOCOM'10, pp. 1154-1162. Piscataway, NJ. IEEE Press, 2010.
Mulligan et al.; How DRM-based content delivery systems disrupt expectations of “personal use”; Published in: Proceeding DRM '03 Proceedings of the 3rd ACM workshop on Digital rights management; 2003; pp. 77-89; ACM Digital Library.
Shankland, S., “Sun to buy start-up to bolster N1 ,” Jul. 30, 2003, CNet News.com, retrieved May 3, 2006, http://news.zdnet.com/2100-3513_22-5057752.html, 8 pages.
Strand, L., “Adaptive distributed firewall using intrusion detection,” Nov. 1, 2004, University of Oslo Department of Informatics, retrieved Mar. 8, 2006, from http://gnist.org/˜lars/studies/master/StrandLars-master.pdf, 158 pages.
Takizawa, et al., “Scalable MultiReplication Framework on The Grid,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2004, No. 81, pp. 247-252, Japan, Aug. 1, 2004.
Tan et al., “Classification: Basic Concepts, Decision Tree, and Model Evaluation”, Introduction in Data Mining; http://www-users.cs.umn.edu/˜kumar/dmbook/ch4.pdf, 2005, pp. 245-205.
Van Renesse, R., “Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining,” May 2003, ACM Transactions on Computer Systems (TOCS), 21 (2): 164-206, 43 pages.
Vijayan, J., “Terraspring Gives Sun's N1 a Boost,” Nov. 25, 2002, Computerworld, retrieved May 3, 2006, from http://www.computerworld.com/printthis/2002/0,4814, 76159,00.html, 3 pages.
Virtual Iron Software Home, Virtual Iron, retrieved May 3, 2006, from http://www.virtualiron.com/, 1 page.
Waldspurger, CA., “Spawn: A Distributed Computational Economy,” Feb. 1992, IEEE Transactions on Software Engineering, 18(2): 103-117, 15 pages.
Watanabe, et al., “Remote Program Shipping System for GridRPC Systems,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2003, No. 102, pp. 73-78, Japan, Oct. 16, 2003.
Xu et al., “Decision tree regression for soft classification of remote sensing data”, Remote Sensing of Environment 97 (2005) pp. 322-336.
Yamagata, et al., “A virtual-machine based fast deployment tool for Grid execution environment,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2006, No. 20, pp. 127-132, Japan, Feb. 28, 2006.
Zhu, Xiaoyun, et al., “Utility-Driven Workload Management Using Nested Control Design,” Mar. 29, 2006, HP Laboratories Palo Alto, HPL-2005-193(R.1), retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2005/HPL-2005-193R1.pdf, 9 pages.
Supplementary European Search Report in Application No. 09729072.0 2266064 dated Dec. 10, 2014.
First Singapore Written Opinion in Application No. 201006836-9, dated Oct. 12, 2011 in 12 pages.
Singapore Written Opinion in Application No. 201006836-9, dated Apr. 30, 2012 in 10 pages.
First Office Action in Chinese Application No. 200980111422.3 dated Apr. 13, 2012.
First Office Action in Japanese Application No. 2011-502138 dated Feb. 1, 2013.
Singapore Written Opinion in Application No. 201006837-7, dated Oct. 12, 2011 in 11 pages.
Supplementary European Search Report in Application No. 09727694.3 dated Jan. 30, 2012 in 6 pages.
Singapore Examination Report in Application No. 201006837-7 dated Mar. 16, 2012.
First Office Action in Chinese Application No. 200980111426.1 dated Feb. 16, 2013.
Second Office Action in Chinese Application No. 200980111426.1 dated Dec. 25, 2013.
Third Office Action in Chinese Application No. 200980111426.1 dated Jul. 7, 2014.
Fourth Office Action in Chinese Application No. 200980111426.1 dated Jan. 15, 2015.
Fifth Office Action in Chinese Application No. 200980111426.1 dated Aug. 14, 2015.
First Office Action in Japanese Application No. 2011-502139 dated Nov. 5, 2013.
Decision of Rejection in Application No. 2011-502139 dated Jun. 30, 2014.
Singapore Written Opinion in Application No. 201006874-0, dated Oct. 12, 2011 in 10 pages.
First Office Action in Japanese Application No. 2011-502140 dated Dec. 7, 2012.
First Office Action in Chinese Application No. 200980119995.0 dated Jul. 6, 2012.
Second Office Action in Chinese Application No. 200980119995.0 dated Apr. 15, 2013.
Examination Report in Singapore Application No. 201006874-0 dated May 16, 2012.
Search Report for European Application No. 09839809.2 dated May 11, 2015.
Supplementary European Search Report in Application No. 09728756.9 dated Jan. 8, 2013.
First Office Action in Chinese Application No. 200980119993.1 dated Jul. 4, 2012.
Second Office Action in Chinese Application No. 200980119993.1 dated Mar. 12, 2013.
Third Office Action in Chinese Application No. 200980119993.1 dated Oct. 21, 2013.
First Office Action in Japanese Application No. 2011-503091 dated Nov. 18, 2013.
Office Action in Japanese Application No. 2014-225580 dated Oct. 26, 2015.
Search Report and Written Opinion issued in Singapore Application No. 201006873-2 dated Oct. 12, 2011.
First Office Action is Chinese Application No. 200980125551.8 dated Jul. 4, 2012.
First Office Action in Japanese Application No. 2011-516466 dated Mar. 6, 2013.
Second Office Action in Japanese Application No. 2011-516466 dated Mar. 17, 2014.
Decision of Refusal in Japanese Application No. 2011-516466 dated Jan. 16, 2015.
Office Action in Canadian Application No. 2726915 dated May 13, 2013.
First Office Action in Korean Application No. 10-2011-7002461 dated May 29, 2013.
First Office Action in Chinese Application No. 200980145872.4 dated Nov. 29, 2012.
First Office Action in Canadian Application No. 2741895 dated Feb. 25, 2013.
Second Office Action in Canadian Application No. 2741895 dated Oct. 21, 2013.
Search Report and Written Opinion in Singapore Application No. 201103333-9 dated Nov. 19, 2012.
Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013.
International Search Report and Written Opinion in PCT/US2011/053302 dated Nov. 28, 2011 in 11 pages.
International Preliminary Report on Patentability in PCT/US2011/053302 dated Apr. 2, 2013.
First Office Action in Japanese Application No. 2013-529454 dated Feb. 3, 2014 in 6 pages.
Office Action in Japanese Application No. 2013-529454 dated Mar. 9, 2015 in 8 pages.
First Office Action issued in Australian Application No. 2011307319 dated Mar. 6, 2014 in 5 pages.
Search Report and Written Opinion in Singapore Application No. 201301573-0 dated Jul. 1, 2014.
First Office Action in Chinese Application No. 201180046104.0 dated Nov. 3, 2014.
Second Office Action in Chinese Application No. 201180046104.0 dated Sep. 29, 2015.
Examination Report in Singapore Application No. 201301573-0 dated Dec. 22, 2014.
International Preliminary Report on Patentability in PCT/US2011/061486 dated May 22, 2013.
International Search Report and Written Opinion in PCT/US2011/061486 dated Mar. 30, 2012 in 11 pages.
Office Action in Canadian Application No. 2816612 dated Nov. 3, 2015.
First Office Action in Chinese Application No. 201180053405.6 dated May 3, 2015.
Office Action in Japanese Application No. 2013-540982 dated Jun. 2, 2014.
Written Opinion in Singapore Application No. 201303521-7 dated May 20, 2014.
International Search Report and Written Opinion in PCT/US07/07601 dated Jul. 18, 2008 in 11 pages.
International Preliminary Report on Patentability in PCT/US2007/007601 dated Sep. 30, 2008 in 8 pages.
Supplementary European Search Report in Application No. 07754164.7 dated Dec. 20, 2010 in 7 pages.
Office Action in Chinese Application No. 200780020255.2 dated Mar. 4, 2013.
Office Action in Indian Application No. 3742/KOLNP/2008 dated Nov. 22, 2013.
Office Action in Japanese Application No. 2012-052264 dated Dec. 11, 2012 in 26 pages.
Office Action in Japanese Application No. 2013-123086 dated Apr. 15, 2014 in 3 pages.
Office Action in Japanese Application No. 2013-123086 dated Dec. 2, 2014 in 2 pages.
Office Action in Japanese Application No. 2011-502139 dated Aug. 17, 2015.
Third Office Action in Chinese Application No. 201180046104.0 dated Apr. 14, 2016.
Office Action in Japanese Application No. 2015-533132 dated Apr. 25, 2016.
Office Action in Canadian Application No. 2884796 dated Apr. 28, 2016.
Office Action in Japanese Application No. 2015-075644 dated Apr. 5, 2016 in 15 pages.
Office Action in Japanese Application No. 2011-516466 dated May 30, 2016.
Office Action in Russian Application No. 2015114568 dated May 16, 2016.
Office Action in Chinese Application No. 201310537815.9 dated Jul. 5, 2016.
Office Action in Chinese Application No. 201310717573.1 dated Jul. 29, 2016.
Office Action in Japanese Application No. 2014-225580 dated Oct. 3, 2016.
Partial Supplementary Search Report in European Application No. 09826977.2 dated Oct. 4, 2016.
Decision of Rejection in Chinese Application No. 201180046104.0 dated Oct. 17, 2016.
Office Action in Canadian Application No. 2816612 dated Oct. 7, 2016.
Office Action in European Application No. 09839809.2 dated Dec. 8, 2016.
Guo, F., Understanding Memory Resource Management in Vmware vSphere 5.0, Vmware, 2011, pp. 1-29.
Hameed, CC, “Disk Fragmentation and System Performance”, Mar. 14, 2008, 3 pages.
Liu, “The Ultimate Guide to Preventing DNS-based DDoS Attacks”, Retrieved from http://www.infoworld.com/article/2612835/security/the-ultimate-guide-to-preventing-dns-based-ddos-attacks.html, Published Oct. 30, 2013.
Ragan, “Three Types of DNS Attacks and How to Deal with Them”, Retrieved from http://www.csoonline.com/article/2133916/malware-cybercrime/three-types-of-dns-attacks-and-how-to-deal-with-them.html, Published Aug. 28, 2013.
Office Action in European Application No. 11767118.0 dated Feb. 3, 2017.
International Search Report and Written Opinion in PCT/US/2016/ 066848 dated May 1, 2017.
Supplementary Examination Report in Singapore Application No. 11201501987U dated May 17, 2017.
Office Action in Chinese Application No. 201310537815.9 dated Jun. 2, 2017.
Sharif et al, “Secure In-VM Monitoring Using Hardware Virtualization”, Microsoft, Oct. 2009 http://research.microsoft.com/pubs/153179/sim-ccs09.pdf; 11 pages.
Second Office Action in Chinese Application No. 201180053405.6 dated Dec. 4, 2015.
Office Action in European Application No. 07754164.7 dated Dec. 14, 2015.
Office Action in Canadian Application No. 2816612 dated Aug. 8, 2017.
Cohen et al., “Proactive Caching of DNS Records: Addressing a Performance Bottleneck”, Proceedings of Saint 2001 Symposium on Applications and the Internet; 8-12, Jan. 8, 2001, IEEE Computer Society, pp. 85-94.
JH Software, Moving a DNS Server to a New IP Address, last updated Jan. 26, 2006, 1 page.
Extended Search Report in European Application No. 18156163 dated Sep. 3, 2018.
Krsul et al., “VMPlants: Providing and Managing Virtual Machine Execution Environments for Grid Computing”, Nov. 6, 2004 (Nov. 6, 2004), Supercomputing, 2004. Proceedings of the ACM/IEEE SC2004 Conference Pittsburgh, PA, USA Nov. 6-12, 2004, Piscataway, NJ, USA, IEEE, 1730 Massachusetts Ave., NW Washington, DC 20036-1992 USA, 12 pages.
Zhao et al., “Distributed file system support for virtual machines in grid computing”, Jun. 4, 2004 (Jun. 4, 2004), High Performance Distributed Computing, 2004. Proceedings. 13th IEEE International Symposium on Honolulu, HI, USA Jun. 4-6, 2004, Piscataway, NJ, USA, IEEE, p. 202-211.
Office Action in Application No. 09729072.0 dated May 14, 2018.
Office Action in Indian Application No. 5937/CHENP/2010 dated Jan. 19, 2018.
Office Action in Indian Application No. 6210/CHENP/2010 dated Mar. 27, 2018.
Examination Report in Indian Application No. 6213/CHENP/2010 dated May 23, 2018.
Office Action in European Application No. 11767118.0 dated Jul. 25, 2018.
Office Action in Chinese Application No. 2013800492635 dated Aug. 30, 2017.
Office Action in Chinese Application No. 201310537815.9 dated Feb. 1, 2018.
Office Action in European Application No. 07754164.7 dated Jan. 25, 2018.
International Preliminary Report on Patentability in PCT/US/2016/ 066848 dated Jun. 19, 2018.
International Search Report and Written Opinion in PCT/US2017/055156 dated Dec. 13, 2017.