Predictive content push-enabled content delivery network

Information

  • Patent Grant
  • 10592578
  • Patent Number
    10,592,578
  • Date Filed
    Wednesday, March 7, 2018
    6 years ago
  • Date Issued
    Tuesday, March 17, 2020
    4 years ago
Abstract
A content delivery network (“CDN”) is provided herein that predicts content resources (e.g., a data object, such as a video file, an audio file, a script, an image, a document, etc.) that may be requested by a user device in the future and transmits or pushes such resources to the user device prior to receiving a request. The CDN may use artificial intelligence models, such as Markov models, in order to predict which content resources to retrieve and transmit proactively to the user device. The predictive techniques implemented by the CDN may reduce a latency of delivering requested content resources and/or a latency of the user device in rendering and displaying a content page.
Description
BACKGROUND

Some content providers attempt to facilitate the delivery of requested content, such as network pages (e.g., content pages, Web pages, etc.) and/or resources identified in network pages, through the utilization of a network storage provider or a content delivery network (“CDN”) service provider. A network storage provider and a CDN service provider each typically maintain a number of computing devices in a communication network that can maintain content from various content providers. In turn, content providers can instruct, or otherwise suggest to, client computing devices to request some, or all, of the content provider's content from the network storage provider's or CDN service provider's computing devices.


As with content providers, network storage providers and CDN service providers are also generally motivated to provide requested content to client computing devices often with consideration of efficient transmission of the requested content to the client computing device and/or consideration of a cost associated with the transmission of the content. Accordingly, CDN service providers often consider factors such as latency of delivery of requested content in order to meet service level agreements or to generally improve the quality of delivery service.





BRIEF DESCRIPTION OF DRAWINGS

Throughout the drawings, reference numbers may be re-used to indicate correspondence between referenced elements. The drawings are provided to illustrate example embodiments described herein and are not intended to limit the scope of the disclosure.



FIG. 1 is a block diagram of an illustrative operating environment in which a plurality of points of presence (POPs) may each implement a predictive content push-enabled CDN service.



FIGS. 2A-2B are block diagrams of the operating environment of FIG. 1 illustrating the operations performed by the components of the operating environment to train artificial intelligence models for use in predicting data object(s) that a user device may request in the future, according to one embodiment.



FIGS. 3A-3B are block diagrams of the operating environment of FIG. 1 illustrating the operations performed by the components of the operating environment to predict data object(s) that a user device may request in the future and proactively transmit such data object(s) to the user device before receiving a request for such data object(s), according to one embodiment.



FIG. 4 is a block diagram of the operating environment of FIG. 1 illustrating the operations performed by the components of the operating environment to validate and update or re-train the artificial intelligence models, according to one embodiment.



FIG. 5 is a block diagram of an example Markov model, according to one embodiment.



FIG. 6 is a flow diagram depicting a predictive content push routine illustratively implemented by a POP, according to one embodiment.





DETAILED DESCRIPTION

Generally described, aspects of the present disclosure relate to a content delivery network (“CDN”) that predicts content or network resources (e.g., a data object, such as a video file, an audio file, a script, an image, a document, etc.) that may be requested by a user device in the future and transmits or pushes such resources to the user device prior to receiving a request. The predictive techniques implemented by the CDN may reduce a latency of delivering requested content resources and/or a latency of the user device in rendering and displaying a content page (e.g., a network page, a Web page, etc.).


For example, a user device typically requests content resources from a CDN in response to a user providing an input indicating that the user would like to view a particular content page. The CDN can then retrieve the requested content resources from a local cache and/or an origin server, and forward the retrieved content resources to the user device. This process, however, may result in a delay noticeable to the user. In particular, a few seconds may pass between when the user provides an input requesting to view a content page and when the user device has retrieved the appropriate content resources and is able to render and display the requested content page. In some cases, the delay may be long enough such that the user attempts to request another content page.


Several factors may contribute to this delay. For example, the CDN may have to retrieve the requested content resources from an origin server. The time spent by the CDN to transmit a request to the origin server, by the origin server to retrieve the requested content resources from memory, and by the origin server to transmit the content resources to the CDN can contribute to the delay. As another example, the length of the delay may depend on the conditions of the network over which the user device and CDN communicate. The delay may increase if the network is congested, the available network bandwidth is limited, etc. As another example, the user device may have relatively few computing resources (e.g., disk space, central processing power, graphical processing power, memory, network bandwidth, internal bus capacity, etc.) available to render and display the content page and/or lack certain features (e.g., multiple central processing units (CPUs), a stand-alone graphics card, high performance random access memory (RAM), a high speed network interface, etc.) that may enable faster content resource retrieval and/or content page rendering.


A CDN service provider may not have control over certain factors that contribute to the delay, such as the network conditions and the user device capabilities. However, the CDN service provider can design the CDN service in such a way that the delay is reduced. For example, typical CDNs are designed to include a cache in which frequently-retrieved content resources are stored. Thus, for frequently-requested content resources, the time spent to retrieve such resources from the origin server can be eliminated. The cache, however, has a limited capacity and thus all requested content resources cannot be stored therein. Accordingly, users of user devices that requested infrequently-requested content resources may still experience significant delay. In fact, even if requested content resources are stored in the cache, a user may still experience significant delay due to poor network conditions and/or deficiencies in the capabilities of the user device.


Some CDNs attempt to address these issues by proactively transmitting content resources to a user device before the user device sends a request. For example, when a CDN transmits a request to an origin server for a first set of content resources, the origin server can generate a link header that points to content resources predicted to be requested by a user device in the future given the request for the first set of content resources. The origin server can transmit the first set of content resources and the link header to the CDN, the CDN can transmit the first set of content resources to the user device, and the CDN can use the link header to retrieve the content resources predicted to be requested by the user device in the future. The CDN can then transmit the predicted content resources to the user device.


However, the content resources pointed to by the link header are not determined based on any dynamic or real-time information. Rather, the content resources pointed to by the link header are pre-selected by a content page owner. The origin server does not necessarily take into account any characteristics of the user that may affect which content pages the user may view in the future, such as content pages previously viewed by the user, a location of the user, etc. Thus, the link header may be inaccurate and direct the CDN to retrieve a set of content resources that ultimately will not be requested by the user device, thereby further increasing the delay. In addition, the link header does not take into account current network conditions or the capabilities of the user device. Thus, situations can occur in which the link header instructs the CDN to transmit more content resources than can be handled by the network and/or user device, thereby congesting the network and/or the user device (and possibly preventing the user device from rendering the content resources). Conversely, situations may occur in which the link header instructs the CDN to transmit fewer content resources than can be handled by the network and/or user device, resulting in an under-utilization of the available computing and/or network resources.


To address these issues, the CDN described herein is designed to transmit content resources to a user device before the content resources are requested such that the effects of the delays caused by network conditions and/or user device capabilities are minimized. In particular, a predictive content push training system in the CDN environment can train various artificial intelligence models (e.g., stochastic models, such as Markov models, neural networks, etc., and/or combinations thereof) to predict content resources that may be requested by a user device in the future in light of user attributes, previous content pages visited by the user, and/or the like. The predictive content push training system can then distribute the artificial intelligence models to various CDNs. A CDN can use one or more of the artificial intelligence models to determine what additional content resources should be obtained in response to a user device requesting a first set of content resources. The CDN can transmit the first set of content resources to the user device. The CDN can also evaluate the current network conditions, the capabilities of the user device, and/or the like to determine how much additional content to transmit to the user device.


By using artificial intelligence and evaluating network conditions and/or user device capabilities, the CDN described herein may ultimately reduce content page load times more effectively than typical CDNs. The foregoing aspects and many of the attendant advantages of this disclosure will become more readily appreciated as the same become better understood by reference to the following detailed description, when taken in conjunction with the accompanying drawings.


Example Predictive Content Push Environment



FIG. 1 is a block diagram of an illustrative operating environment 100 in which a plurality of points of presence (POPs) 120 may each implement a predictive content push-enabled CDN service 122. The operating environment 100 may further include one or more user devices 102, one or more origin servers 104, and a predictive content push training system 140. The CDN service 122 may further implement a predictive content push system 130, one or more cache servers 126, and a cache data store 128. The various user devices 102 may communicate with the POPs 120 via a network 110 to request data objects. The predictive content push training system 140 can communicate with the POPs 120 via the network 110 to provide artificial intelligence models for predicting content resources to retrieve and transmit to user devices 102.


In some instances, a CDN may operate as a distributed system in which multiple POPs implement instances of the CDN. As used herein, a POP is intended to refer to any collection of related computing devices utilized to implement functionality on behalf of one or many providers. POPs are generally associated with a specific geographic location in which the computing devices implementing the POP are located, or with a region serviced by the POP. For example, a data center or a collection of computing devices within a data center may form a POP. A CDN may utilize multiple POPs that are geographically diverse, to enable users in a variety of geographic locations to quickly transmit and receive information (e.g., requested data objects) from the CDN. In some instances, the POPs may also implement other services in addition to the CDN services, such as data storage services, data processing services, etc.


While the user devices 102 and POPs 120 are shown as grouped within FIG. 1, the user devices 102 and POPs 120 may be geographically distant, and independently owned or operated. For example, the user devices 102 could represent a multitude of users in various global, continental, or regional locations accessing the POPs 120. Further, the POPs 120 may be globally, continentally, or regionally disparate, in order to provide a wide geographical presence for the CDN services 122. Accordingly, the groupings of user devices 102 and POPs 120 within FIG. 1 is intended to represent a logical, rather than physical, grouping.


The 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 a CDN (e.g., CDN service 122) for subsequent transmission to user 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. The primary versions of content may be retrieved by the various POPs 120 for subsequent transmission to the user devices 102. In an embodiment, the POPs 120 includes a cache that stores frequently-requested content (e.g., the cache data store 128). If requested content is not present in the POP 120 cache, then the POP 120 may retrieve the content from an origin server 104. In alternate embodiments, not shown, the POP 120 may first request the content from an intermediate cache housed within a regional data center. If the requested content is also not present in the intermediate cache, then the POP 120 may retrieve the content from an origin server 104.


Users, by way of user devices 102, may interact with a CDN service 122 of a POP 120 to request content resources (e.g., one or more data objects). In an embodiment, the CDN service 122 may include a host (not shown) that selects a cache server 126 to deliver the requested data object to the user device 102. A single POP 120 may include multiple hosts such that the POP 120 can service multiple data object requests simultaneously.


The CDN service 122 may initially collect data associated with various user devices 102 and/or content resource requests for training artificial intelligence models before providing the predictive content push functionality described herein. For example, the CDN service 122 can receive a request for one or more data objects from a user device 102. Alternatively, the CDN service 122 may receive a request for a content page from a user device 102, where the content page request references one or more data objects to retrieve. In general, the CDN service 122 may store attributes of users that operate the user devices 102 (e.g., user interests, user hobbies, user age, user gender, user demographic, user location, user purchase history, user browsing history, user search history and/or current search queries, user subscriptions, actions performed by the user in prior browsing sessions, parts of a screen a user typically clicks while browsing, etc.), attributes of the user devices 102 themselves (e.g., device location, device capabilities, etc.), and/or other contextual information (e.g., times a content page request is transmitted, attributes of other users in a similar location as the user or user device 102, etc.) (collectively referred to herein as “user attributes”) locally or in a remote system (not shown). In some embodiments, different users may operate the same user device 102, and the CDN service 122 can distinguish between users (and thus store attributes for different users using the same user device 102) based on a logged-in user account, user patterns (e.g., user browsing patterns), etc. The CDN service 122 can then retrieve user attributes associated with the user device 102 that submitted the data object request and/or the user operating the user device 102, and transmit the user attributes and a request for the data object(s) to the origin server 104.


The origin server 104 can use the user attributes and/or an indication of the requested data object(s) to generate a link header. For example, the link header may include the user attributes. The link header may also point to one or more data objects predicted to be requested by the user device 102 in the future given the current data object request submitted by the user device 102. The origin server 104 can retrieve the requested data object(s) and transmit the requested data object(s) and the link header to the CDN service 122.


The CDN service 122 can use the received information to transmit data to the user device 102. For example, the CDN service 122 can forward the received data object(s) to the user device 102. Before, during, or after transmitting the received data object(s) to the user device 102, the CDN service 122 can also retrieve the data object(s) referenced in the link header (e.g., from the cache data store 128 and/or an origin server 104) and transmit some or all of these data object(s) to the user device 102 as well.


The predictive content push system 130 of the CDN service 122 may include a user group identifier 132, a content identifier 134, a training and validation manager 136, an access logs data store 138, and a model data store 139. The access logs data store 138 may store, in entries associated with specific users and/or user devices 102, logs indicating previous content pages requested by the user and/or user device 102, content pages visited by the user and/or user device 102 after requesting data object(s) for a specific content page, data object(s) pushed to user devices 102 prior to receiving a request for such data object(s) (e.g., as indicated by link headers), attributes of the user, and/or the like. After the CDN service 122 transmits data object(s) to the user device 102, the CDN service 122 can store the link header in the access logs data store 138 in an entry associated with the user device 102 that submitted the data object or content page request and/or the user operating the user device 102.


The CDN service 122 may repeat the above-described process for a plurality of data object or content page requests received from the various user devices 102. Thus, over time, the access logs data store 138 may store browsing history, link headers, user attributes, etc. for a wide variety of users and/or user devices 102.


After a threshold time period passes and/or after the amount of data stored in the access logs data store 138 reaches a certain amount, the training and validation manager 136 can retrieve the access logs from the access logs data store 138. The training and validation manager 136 can then forward the access logs to the predictive content push training system 140 via the network 110. Alternatively, the predictive content push training system 140 can request the access logs from the training and validation manager 136, and the training and validation manager 136 can then forward the access logs to the predictive content push training system 140.


The predictive content push training system 140 may be configured to train one or more artificial intelligence models for use by the CDN service 122. For example, the predictive content push training system 140 may include a user group training system 142, a model training system 144, and a model data store 146. The user group training system 142 may use the received access logs to group users and/or user devices 102 into one or more groups. In particular, the user group training system 142 may use unsupervised learning to identify one or more groups of users and/or user devices 102. For example, the user group training system 142 may analyze the access logs to identify behaviors exhibited by users and/or user devices 102. The user group training system 142 can use the analysis to identify a set of user attributes that are common to users and/or user devices 102 that exhibit similar behavior. The set of user attributes that are common to users and/or user devices 102 that exhibit similar behavior may then define a group of users and/or user devices 102. As an illustrative example, the user group training system 142 can analyze the access logs, which may indicate that users and/or user devices 102 from a first geographic region generally visit content page B after visiting content page A, whereas users and/or user devices 102 from a second geographic region generally visit content page C after visiting content page A. Thus, the user group training system 142 may define one group as those users and/or user devices 102 from the first geographic region and may define another group as those users and/or user devices 102 from the second geographic region.


Alternatively, the user group training system 142 does not group a plurality of users and/or user device 102 into one or more groups using the operations described above. Rather, the user group training system 142 simply associates each user and/or user device 102 with a separate group. Thus, the user group training system 142 may define a number of groups that equals a number of users and/or user devices 102 in communication with the CDN service 122.


In other embodiments, the group defined by the user group training system 142 does not necessarily correspond to user attributes of users and/or user devices 102 that exhibit similar behaviors (e.g., browsing history, browsing speed, etc.). Rather, the group may be defined based on user and/or user device 102 geographic location, user device 102 types and/or model types, individual content pages and/or domains, individual content page transitions, and/or the like.


The user group training system 142 can define one or more groups. The model training system 144 can then train one or more artificial intelligence models for each group. In particular, the model training system 144 may use supervised learning to train the models. The artificial intelligence models can be stochastic models (e.g., Markov models), neural networks, and/or the like, and/or combinations thereof. For example, the access logs associated with a user device 102 may indicate a browsing history of the user of the user device 102. The browsing history can include content pages requested by the user device 102, times that content pages were requested, and/or the order in which content pages were requested. As an illustrative example, the access logs associated with a user device 102 may indicate that the user device 102 requested content page A at time 1, then requested content page B after content page A at time 2, then requested content page C after content page B at time 3, and so on. Thus, the model training system 144 can, for a particular group, identify the access logs corresponding to user devices 102 that fall within the group and train one or more models using the identified access logs.


In an embodiment in which the trained models are Markov models (or other similar artificial intelligence models), the model training system 144 may train a model that includes one or more Markov chains comprised of various nodes (e.g., states) and directional arcs. Each node may represent a content page (or the data object(s) associated with a particular content page). Alternatively or in addition, a node may represent a plurality of content pages (or the data object(s) associated with the plurality of content pages). For example, a node may represent a plurality of content pages if the model training system 144 determines that user devices 102 exhibit similar behavior when transitioning from content pages in the plurality to other content pages (e.g., if the plurality of content pages includes content page A and content page B, a node may represent both content pages if the model training system 144 determines that user devices 102 transition from either content page A or content page B to content page C a high number of times and transition from either content page A or content page B to content page D a low number of times). The directional arcs may each be coupled between a first node and a second node and indicate a probability that a user device 102 may request a content page represented by the second node after requesting a content page represented by the first node (e.g., where the user device 102 requests a content page represented by the second node after requesting a content page represented by the first node when the user device 102 does not request another content page after requesting the content page represented by the first node and before requesting the content page represented by the second node).


The model training system 144 may determine the probabilities associated with the arcs based on the historical behavior of user devices 102 associated with the group for which the model is being trained as indicated by the access logs (e.g., based on, for one or more user devices 102, a content page that the respective user device 102 requested and/or N preceding content pages requested by the same respective user device 102). For example, the model training system 144 can construct a matrix of transition probabilities, where each probability corresponds to a transition from one content page to another content page. The model training system 144 can then iterate through the training data (e.g., the access logs) and, when a transition from one content page to another content page is identified, update the corresponding transition probability. As an illustrative example, if, in the aggregate, user devices 102 request content page B 40% of the time after requesting content page A and request content page C 60% of the time after requesting content page A, then the directional arc connecting the content page A node to the content page B node may be associated with a probability of 0.4 and the directional arc connecting the content page A node to the content page C node may be associated with a probability of 0.6.


For each group, the model training system 144 may train Markov models corresponding to particular content pages. For example, the content page to which a Markov model corresponds may be represented by a first node in the Markov model. Other nodes in the Markov model may represent other content pages that a user device 102 may request after requesting the content page represented by the first node. As described in greater detail below, the predictive content push system 130 may retrieve and apply the Markov model corresponding to a particular content page when a current content page of the user device 102 (e.g., the content page requested by a user device 102 in a current request and before the user device 102 submits a new content page or data object request) is the content page to which the Markov model corresponds. Thus, the model training system 144 may train a first Markov model in which the first node represents a first content page, a second Markov model in which the first node represents a second content page, and so on.


In further embodiments, the model training system 144 trains Markov models corresponding to a sequence of content pages. For example, the N content pages in the sequence to which a Markov model corresponds may be represented by the first N nodes in the Markov model (where N can be any integer, such as 1, 2, 3, 4, 5, etc.). Other nodes in the Markov model may represent other content pages that a user device 102 may request after requesting the N content pages in the sequence represented by the first N nodes. As described in greater detail below, the predictive content push system 130 may retrieve and apply the Markov model corresponding to a particular sequence of content pages when the previous N content pages requested by the user device 102 (e.g., the previous content pages requested by a user device 102 before the user device 102 submits a new content page or data object request) are the content pages in the sequence to which the Markov model corresponds. Thus, the model training system 144 may train a first Markov model in which the first N nodes represent a first set of N content pages, a second Markov model in which the first N nodes represent a second set of N content pages, and so on. In addition, for a particular group, the model training system 144 can train Markov models of different sizes. Thus, the model training system 144 may train a first Markov model in which the first N nodes represent a first set of N content pages, a second Markov model in which the first X nodes represent a set of X content pages, a third Markov model in which the first Y nodes represent a set of Y content pages, a fourth Markov model in which the first N nodes represent a second set of N content pages, and so on.


Additional details regarding trained Markov models are described below with respect to FIG. 5.


In embodiments in which the trained models are neural networks (or other similar artificial intelligence models), the model training system 144 may train a single neural network for each group using access logs associated with the respective group or a single neural network for all groups using all access logs. The neural network may include various layers of nodes, with weights and/or thresholds assigned to the various nodes. As described in greater detail below, the predictive content push system 130 may retrieve and apply the neural network corresponding to the group of the user device 102 requesting a new content page, with the neural network producing an output indicating data object(s) to retrieve given the previous N content pages requested by the user device 102 (e.g., where N can be any integer, such as 1, 2, 3, 4, 5, etc.).


The model training system 144 can store trained models in the model data store 146. The models may be stored in an entry associated with a particular group. As described below, the model training system 144 can later retrieve the models stored in the model data store 146 to update the models.


Thus, the user group training system 142 can define one or more groups. For each group, the model training system 144 can then train one or more artificial intelligence models, such as separate artificial intelligence models for individual content pages that a user device 102 may request and/or separate artificial intelligence models for sequences of content pages that a user device 102 may request. Accordingly, the predictive content push training system 140 can generate a plurality of artificial intelligence models that are associated with various groups. The predictive content push training system 140 can transmit the artificial intelligence models and/or an indication of the various groups to the predictive content push system 130 (independently, such as when the training is complete, or at the request of the predictive content push system 130), and the predictive content push system 130 can use the artificial intelligence models and/or an indication of the various groups to retrieve and transmit content to the user devices 102.


For example, the predictive content push system 130 can store the received artificial intelligence models in the model data store 139 in entries associated with different groups. In response to the CDN service 122 (e.g., a cache server 126) receiving, from a user device 102, a request for a content page or data object(s) associated with a content page, the CDN service 122 (e.g., the cache server 126) can transmit to the origin server 104 a request for data object(s) associated with the content page, providing user attributes associated with the user device 102 and/or the user operating the user device 102 along with the request.


The origin server 104 can use the user attributes and/or an indication of the requested data object(s) to generate a link header. For example, the link header may include the user attributes. The link header may also point to one or more data objects predicted to be requested by the user device 102 in the future given the current data object request submitted by the user device 102. The origin server 104 can retrieve the requested data object(s) and transmit the requested data object(s) and the link header to the CDN service 122 (e.g., the cache server 126). The CDN service 122 (e.g., the cache server 126) can then transmit the requested data object(s) to the user device 102 and forward the link header to the user group identifier 132. Alternatively, the origin server 104 can transmit the requested data object(s) to the CDN service 122, the CDN service 122 can transmit the requested data object(s) to the user device 102, and then the origin server 104 can generate and/or transmit the link header to the CDN service 122.


Alternatively, the CDN service 122 does not transmit a request for data object(s) to the origin server 104 to obtain a link header. For example, the requested data object(s) may already be stored in the cache data store 128. As another example, the CDN service 122 may determine which data object(s) to proactively retrieve and transmit to the user device 102 without using link headers (e.g., the artificial intelligence models may replace the functionality provided by the link headers).


The user group identifier 132 can then identify the group to which the user of the user device 102 or the user device 102 itself corresponds using the user attributes. In general, the user group identifier 132 can identify the group based on the request context (e.g., contextual information associated with the content page request received from the user device 102, which can include the user attributes). The user group identifier 132 can identify the user attributes by processing the link header or, if the link header is not provided, by retrieving the user attributes from a local or external data store (not shown). The user group identifier 132 can compare the identified user attributes to the user attributes that define the various groups (or compare other information, such as user or user device 102 location, requested content page, a transition from a previous content page to a current content page, etc., that may define the various groups), identifying the group to which the content page request is associated (e.g., the group to which the user of the user device 102 or the user device 102 itself corresponds) as the group defined by user attributes that match or at least partially match the identified user attributes.


Once the group is identified, the content identifier 134 can determine the quantity of data objects to proactively transmit to the user device 102 and the specific data objects to transmit. For example, when the user device 102 requests data object(s) or a content page from the CDN service 122, a transmission control protocol (TCP) connection may be established between the user device 102 and the CDN service 122 via the network 110. The CDN service 122 can then transmit test packets to identify the current or real-time conditions of the network 110 in which the user device 102 and the CDN service 122 are communicating. In addition, the CDN service 122 can receive information indicating the capabilities of the user device 102 (e.g., by requesting such information from the user device 102 or by receiving such information from the user device 102 without submitting a request). The capabilities of the user device 102 can include an amount of available and/or total disk space, a number of CPUs, the processing capabilities of the CPU(s), a number of graphical processing units (GPUs), the processing capabilities of the GPU(s), an amount of available and/or total RAM, a type of network interface and/or transmission capabilities of the network interface, a current processing load of the user device 102, a screen resolution of a user interface, an internal bus capacity, etc.


Using the current conditions of the network 110 and/or the user device 102 capabilities, the content identifier 134 determines the quantity of data objects to proactively transmit to the user device. For example, the content identifier 134 may determine the number and/or size of data objects that can be transmitted to the user device 102 without exceeding the maximum available bandwidth (e.g., maximum available data transfer rate, maximum available data throughput, etc.) of the network 110 (or without causing the available bandwidth of the network 110 as a percentage of the total bandwidth of the network 110 to drop below a threshold value, such as 10%, 20%, etc.) and/or without causing the user device 102 to be congested and possibly inoperable (e.g., the content identifier 134 can determine a maximum number and/or size of data objects that user device 102 can process during a threshold period of time given the user device 102 capabilities). The determined number and/or size of data objects that can be transmitted to the user device 102 may also be referred to herein as the “data object quantity limit.” Optionally, the content identifier 134 further determines the speed at which to transmit the data objects. For example, the content identifier 134 can use the current network 110 conditions and/or the user device 102 capabilities to identify the maximum data transfer speed that the network 110 can handle and the maximum amount of data that the user device 102 can process at any one time. The content identifier 134 can then set the data object transfer speed as the minimum of the maximum data transfer speed that the network 110 can handle and the maximum amount of data that the user device 102 can process per time unit (e.g., millisecond, second, minute, etc.).


Before or after determining the quantity of data objects to transmit to the user device 102, the content identifier 134 can identify the specific data objects to transmit to the user device 102. For example, the content identifier 134 can retrieve the artificial intelligence model(s) stored in the model data store 139 that are associated with the group to which the user device 102 corresponds. The content identifier 134 can then identify one or more of the retrieved artificial intelligence models that is associated with a current content page (e.g., the content page requested by the user device 102), N previous content pages (e.g., content pages requested by the user device 102 prior to the current content page), and/or data objects associated with the current and/or previous content pages. Once identified, the content identifier 134 can apply the corresponding artificial intelligence model(s) to determine what data object(s) to transmit to the user device 102.


For example, in embodiments in which the artificial intelligence models are Markov models (or other similar artificial intelligence models), each model may indicate the probabilities associated with the various directional arcs extending from the node representing the current content page. The content identifier 134 can identify data object(s) associated with the content page represented by the node that has the highest probability directional arc extending from the current content page node, and retrieve such data object(s) (e.g., from the cache data store 128 and/or the origin server 104). The content identifier 134 can then determine whether the quantity (e.g., number and/or size) of these data object(s) exceeds the data object quantity limit. If the quantity of these data object(s) does not exceed the data object quantity limit, then the content identifier 134 can transmit these data object(s) to the user device 102, identify data object(s) associated with the content page represented by the node that has the next highest probability directional arc extending from the current content page node, retrieve these data object(s), and determine whether the quantity of these data object(s) and the data object(s) already transmitted to the user device 102 exceed the data object quantity limit. If the quantity of these data object(s) and the data object(s) already transmitted to the user device 102 do not exceed the data object quantity limit, then the content identifier 134 can repeat this process for the content page represented by the node that has the third highest probability directional arc extending from the current content page node, and so on. However, if at any point the quantity of data object(s) (either transferred or retrieved and not yet transferred) exceeds the data object quantity limit, then the content identifier 134 may transmit a portion of the retrieved data object(s) such that the data object quantity limit is not exceeded (if applicable) and cease transmission of any further data object(s) to the user device 102. In this way, the content identifier 134 can maximize or nearly maximize the bandwidth of the network 110 and/or the capabilities of the user device 102 without congesting either the network 110 or the user device 102.


As another example, in embodiments in which the artificial intelligence models are neural networks (or other similar artificial intelligence models), each model may output an ordered list of content pages that the user device 102 may request in the future given the current request, where the list is ordered from the content page most likely to be requested to the content page least likely to be requested. The content identifier 134 can identify data object(s) associated with the content page most likely to be requested, and retrieve such data object(s) (e.g., from the cache data store 128 and/or the origin server 104). The content identifier 134 can then determine whether the quantity (e.g., number and/or size) of these data object(s) exceeds the data object quantity limit. If the quantity of these data object(s) does not exceed the data object quantity limit, then the content identifier 134 can transmit these data object(s) to the user device 102, identify data object(s) associated with the content page second most likely to be requested, retrieve these data object(s), and determine whether the quantity of these data object(s) and the data object(s) already transmitted to the user device 102 exceed the data object quantity limit. If the quantity of these data object(s) and the data object(s) already transmitted to the user device 102 do not exceed the data object quantity limit, then the content identifier 134 can repeat this process for the content page third most likely to be requested, and so on. However, if at any point the quantity of data object(s) (either transferred or retrieved and not yet transferred) exceeds the data object quantity limit, then the content identifier 134 may transmit a portion of the retrieved data object(s) such that the data object quantity limit is not exceeded (if applicable) and cease transmission of any further data object(s) to the user device 102. As described above, in this way, the content identifier 134 can maximize or nearly maximize the bandwidth of the network 110 and/or the capabilities of the user device 102 without congesting either the network 110 or the user device 102


In some embodiments, the content identifier 134 considers the quantity of data object(s) corresponding to the request received from the user device 102 in determining whether the data object quantity limit is exceeded. For example, the content identifier 134 (or another component of the CDN service 122) can retrieve and transmit to the user device 102 data object(s) corresponding to the request received from the user device 102. The requested data object(s) may be transmitted to the user device 102 prior to the content identifier 134 using artificial intelligence model(s) and/or a link header to identify and transmit data object(s) corresponding to content pages that the user device 102 may request in the future. Transmission, by the content identifier 134, and reception, by the user device 102, of the requested data object(s), however, may affect the available bandwidth of the network 110 and/or the amount of additional data that the user device 102 can process. The requested data object(s) may take priority over data object(s) the content identifier 134 predicts the user device 102 may request in the future, and therefore the content identifier 134 may transmit the requested data object(s) first, optionally without determining the network 110 conditions and/or the user device 102 capabilities. The content identifier 134 may then determine the data object quantity limit taking into account that the quantity of the requested data object(s) have been transmitted to the user device 102. If, after transmitting the requested data object(s), the data object quantity limit is not exceeded, then the content identifier 134 may proceed to retrieve and transmit to the user device 102 additional data object(s) that the content identifier 134 predicts the user device 102 may request in the future in accordance with the operations described above. In other embodiments, the content identifier 134 does not consider the quantity of data object(s) corresponding to the request received from the user device 102 in determining whether the data object quantity limit is exceeded (e.g., the content identifier 134 does not take into account the quantity of the requested data object(s) transmitted to the user device 102 in determining the data object quantity limit). For example, the content identifier 134 may initially transmit the requested data object(s) to the user device 102 and then, after a threshold time period passes, transmit additional data object(s) to the user device 102 that the content identifier 134 predicts the user device 102 may request in the future. Because there may be a delay between transmission of the requested data object(s) and transmission of not yet-requested data object(s), congestion of the network 110 and/or the user device 102 may be less of a concern.


In addition to facilitating the training of artificial intelligence models by the predictive content push training system 140, the training and validation manager 136 can validate results produced by one or more of the artificial intelligence models and provide feedback to the predictive content push training system 140 such that the predictive content push training system 140 can improve the predictive abilities of some or all of the artificial intelligence models. For example, after the content identifier 134 predicts which data object(s) the user device 102 may request in the future given a first content page (or data object) request, the CDN service 122 may receive a second content page request from the user device 102. The training and validation manager 136 can then compare the data object(s) predicted to be requested by the user device 102 with the data object(s) corresponding to the content page requested in the second content page request. The training and validation manager 136 can store information identifying a difference between the predicted and actual requested data object(s) and/or information identifying that there is no difference between the predicted and actual requested data object(s) in the access logs data store 138. As another example, after the content identifier 134 predicts data object(s) to retrieve in response to the content page request transmitted by the user device 102, the training and validation manager 136 can compare the data object(s) predicted to be requested by the user device 102 with data object(s) referenced by the link header received from the origin server 104 in response to the content page transmitted by the user device 102. Any differences (or lack of differences) between the artificial intelligence model-predicted data object(s) and the data object(s) referenced in the link header can be stored by the training and validation manager 136 in the access logs data store 138.


Periodically and/or in response to a request by the predictive content push training system 140, the training and validation manager 136 can retrieve access logs from the access logs data store 138 (e.g., the N most recent access logs, the access logs stored within the last X minutes, etc.) and transmit the access logs to the predictive content push training system 140. The user group training system 142 can then use the access logs to update the group definitions (e.g., where an update may occur if there is a difference between predicted data object(s) and actual requested data object(s) and/or between predicted data object(s) and link header-referenced data object(s)) and/or the model training system 144 can use the access logs to update or re-train one or more of the artificial intelligence models stored in the model data store 146 (e.g., where an update may occur if there is a difference between predicted data object(s) and actual requested data object(s) and/or between predicted data object(s) and link header-referenced data object(s)). For example, the model training system 144 can retrieve artificial intelligence models from the model data store 146 that correspond with the access logs received from the training and validation manager 136 (e.g., an artificial intelligence model corresponds with an access log if the access log indicates differences (or lack of differences) between actual or link header-referenced data object(s) and data object(s) predicted using the artificial intelligence model). The model training system 144 can then optionally update or re-train the retrieved artificial intelligence models using the received access logs as training data. Once updated or re-trained, the model training system 144 can store the updated or re-trained artificial intelligence models in the model data store 146. The predictive content push training system 140 can also transmit the updated groups and/or the updated or re-trained artificial intelligence models to the various POPs 120 (e.g., the various CDN services 122) for use in processing future content page (or data object) requests. In this way, the predictive content push training system 140 can improve the predictive abilities of the CDN service 122 (e.g., the content identifier 134) for future requests, which may result in a more efficient use of the available network 110 bandwidth and/or the user device 102 capabilities, a reduction in the likelihood that the network 110 and/or the user device 102 becomes congested, and/or a reduction in the user device 102 retrieval and rendering latency.


As described herein, each POP 120 is a collection of related computing devices utilized to implement CDN functionality on behalf of one or many providers. For example, the predictive content push systems 130, the one or more cache servers 126, and/or the cache data store 128 may each be implemented by one or more related computing devices (e.g., devices that include one or more processors, memory, input/output interfaces, networking interfaces, etc. to implement the functionality described herein). Each POP 120 may be generally associated with a specific geographic location in which the computing devices implementing the respective POP 120 are located, or with a region serviced by the respective POP 120. For example, a data center or a collection of computing devices within a data center may form a POP 120. A CDN may utilize multiple POPs 120 that are geographically diverse, to enable users in a variety of geographic locations to quickly transmit and receive information (e.g., requested data objects) from the CDN. In some instances, the POPs 120 may also implement other services in addition to the CDN services 122, such as data storage services, data processing services, etc.


The CDN services 122 may operate in a distributed computing environment including several computer systems that are interconnected using one or more computer networks (not shown in FIG. 1). The CDN services 122 could also operate within a computing environment having a fewer or greater number of devices than are illustrated in FIG. 1. For example, the CDN services 122 are depicted as including one or more cache servers 126 and a cache data store 128, but the one or more cache servers 126 and/or the cache data store 128 may be implemented by computing devices located external to the POPs 120. Thus, the depiction of the CDN services 122 in FIG. 1 should be taken as illustrative and not limiting to the present disclosure. For example, the CDN services 122 or various constituents thereof could implement various Web services components, hosted or “cloud” computing environments, and/or peer to peer network configurations to implement at least a portion of the processes described herein. Further, the CDN services 122 may be implemented directly in hardware or software executed by hardware devices and may, for instance, include one or more physical or virtual servers implemented on physical computer hardware configured to execute computer executable instructions for performing various features that are described herein.


While the access logs data store 138 and the model data store 139 are depicted as being internal to the predictive content push system 130, this is not meant to be limiting. For example, the access logs data store 138 and/or the model data store 139 can be located external to the predictive content push system 130 (e.g., within the CDN service 122, within the POP 120, external to the POP 120, etc.).


The predictive content push training system 140 may be a single computing device, or may include multiple distinct computing devices, such as computer servers, logically or physically grouped together to collectively operate as a server system. The components of the action delivery system 120 and/or the model updater 130 can each be implemented in application-specific hardware (e.g., a server computing device with one or more ASICs) such that no software is necessary, or as a combination of hardware and software. In addition, the modules and components of the predictive content push training system 140 can be combined on one server computing device or separated individually or into groups on several server computing devices. In some embodiments, the predictive content push training system 140 may include additional or fewer components than illustrated in FIG. 1.


The predictive content push training system 140 may be located external to the POPs 120 such that a single predictive content push training system 140 can perform model training and push new models and/or updated or re-trained models to the various POPs 120. However, in other embodiments, not shown, the predictive content push training system 140 may be internal to a POP 120.


While the model data store 146 is depicted as being internal to the predictive content push training system 140, this is not meant to be limiting. For example, the model data store 146 can be located external to the predictive content push training system 140.


Various example user devices 102 are shown in FIG. 1, including a desktop computer, laptop, and a mobile phone, each provided by way of illustration. In general, the user devices 102 can be any computing device such as a desktop, 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, voice command device, camera, digital media player, and the like. A user device 102 may execute an application (e.g., a browser) that submits requests for content pages or data objects to the POPs 120 when, for example, a user attempts to view a content page (e.g., a network page, a Web page, etc.).


The network 110 may include any wired network, wireless network, or combination thereof. For example, the network 110 may be a personal area network, local area network, wide area network, over-the-air broadcast network (e.g., for radio or television), cable network, satellite network, cellular telephone network, or combination thereof. As a further example, the network 110 may be a publicly accessible network of linked networks, possibly operated by various distinct parties, such as the Internet. In some embodiments, the network 110 may be a private or semi-private network, such as a corporate or university intranet. The network 110 may include one or more wireless networks, such as a Global System for Mobile Communications (GSM) network, a Code Division Multiple Access (CDMA) network, a Long Term Evolution (LTE) network, or any other type of wireless network. The network 110 can use protocols and components for communicating via the Internet or any of the other aforementioned types of networks. For example, the protocols used by the network 110 may include Hypertext Transfer Protocol (HTTP), HTTP Secure (HTTPS), Message Queue Telemetry Transport (MQTT), Constrained Application Protocol (CoAP), and the like. Protocols and components for communicating via the Internet or any of the other aforementioned types of communication networks are well known to those skilled in the art and, thus, are not described in more detail herein.


Example Block Diagrams for Training Artificial Intelligence Models



FIGS. 2A-2B are block diagrams of the operating environment 100 of FIG. 1 illustrating the operations performed by the components of the operating environment 100 to train artificial intelligence models for use in predicting data object(s) that a user device 102 may request in the future, according to one embodiment. As illustrated in FIG. 2A, the user device 102 transmits a content page request to the cache server 126 at (1). The content page request may include a request for one or more data objects.


The cache server 126 can transmit a request for data object(s) and user attributes to the origin server 104 at (2). For example, the requested data object(s) may be those data object(s) referenced or requested in the content page request received from the user device 102. The user attributes may be associated with the user device 102 that transmitted the content page request and/or the user operating the user device 102 and may be retrieved from a data store local or external to the POP 120 (not shown).


The origin server 104 can then generate a link header at (3) using an identification of the data object(s) requested and/or the user attributes. The link header may include user attributes and/or a reference to additional data object(s) for the cache server 126 to retrieve. The origin server 104 can then transmit the requested data object(s) and the link header to the cache server 126 at (4).


The cache server 126 can transmit the requested data object(s) to the user device 102 to satisfy the content page request. In addition, the cache server 126 can store the link header in the access logs data store 138 at (5).


At a later time, the training and validation manager 136 can retrieve access logs from the access logs data store 138 at (6). The access logs may include link headers stored by one or more cache servers 126, including the link header stored at (5). For example, an access log may include a link header (and therefore user attributes), a user device 102 that submitted a request causing the link header to be generated, data object(s) requested by the user device 102 that caused the link header to be generated, an identification of a content page requested by the user device 102, etc. The access logs, in the aggregate, may content pages requested by various user devices 102 and/or the order in which such content pages were requested. The training and validation manager 136 can then transmit the access logs to the predictive content push training system 140 at (7).


As illustrated in FIG. 2B, the user group training system 142 of the predictive content push training system 140 generates a set of groups (e.g., user groups) based on the access logs at (8). For example, the user group training system 142 can analyze the access logs to identify a set of user attributes that are common to users and/or user devices 102 that exhibit similar behavior. The set of user attributes that are common to users and/or user devices 102 that exhibit similar behavior may then define a group of users and/or user devices 102. The user group training system 142 can then transmit an identification of the user groups (e.g., definitions of the user groups) to the model training system 144 at (9).


The model training system 144 can generate one or more models (e.g., Markov models, neural networks, etc.) for each user group based on the access logs at (10). For example, the access logs may be training data, and the model training system 144 can train the models using the access logs. Once trained, the model training system 144 can optionally store the models in the model data store 146 at (11). In addition, the model training system 144 can transmit the user group identifications (e.g., the user group definitions) and the trained models to the training and validation manager 136 at (12). The training and validation manager 136 can then store the user group definitions and/or the models in the model data store 139 at (13) for later use.


While FIGS. 2A-2B depict operations performed by the components of the operating environment 100 in a specific order, this is merely exemplary and not meant to be limiting. Any one of the depicted operations can be performed in a different order. For example, in other embodiments not shown, operation (11) can be performed after operation (12). In addition, some or all of the operations depicted in FIGS. 2A-2B can be optional. For example, the model training system 144 may not store the models in the model data store 146 at (11). As another example, the training and validation manager 136 may not store the models in the model data store 139 at (13). Rather, the training and validation manager 136 could later retrieve models directly from the predictive content push training system 140.


Example Block Diagrams for Predicting Content to Push Proactively to a User Device



FIGS. 3A-3B are block diagrams of the operating environment 100 of FIG. 1 illustrating the operations performed by the components of the operating environment 100 to predict data object(s) that a user device 102 may request in the future and proactively transmit such data object(s) to the user device 102 before receiving a request for such data object(s), according to one embodiment. As illustrated in FIG. 3A, the user device 102 transmits a content page request to the cache server 126 at (1). The content page request may include a request for one or more data objects.


The cache server 126 can transmit a request for data object(s) and user attributes to the origin server 104 at (2). For example, the requested data object(s) may be those data object(s) referenced or requested in the content page request received from the user device 102. The user attributes may be associated with the user device 102 that transmitted the content page request and/or the user operating the user device 102 and may be retrieved from a data store local or external to the POP 120 (not shown).


The origin server 104 can then generate a link header at (3) using an identification of the data object(s) requested and/or the user attributes. The link header may include user attributes and/or a reference to additional data object(s) for the cache server 126 to retrieve. The origin server 104 can then transmit the requested data object(s) and the link header to the cache server 126 at (4).


The cache server 126 can transmit the requested data object(s) to the user device 102 to satisfy the content page request. In addition, the cache server 126 can transmit the link header to the user group identifier 132 at (5).


In some embodiments, any of operations (2) through (5) are optional. For example, the cache data store 128 may store data object(s) requested by the user device 102. As another example, use of the artificial intelligence models to predict data object(s) to retrieve and transmit to the user device 102 may render the generation and use of link headers unnecessary.


The user group identifier 132 can identify the user group to which the user device 102 and/or the user of the user device 102 belongs at (6). For example, the user group identifier 132 can compare the user attributes included in the link header to the various user group definitions to identify the user group to which the user device 102 and/or the user of the user device 102 belongs. Once identified, the user group identifier 132 can transmit an indication of the identified user group to the content identifier 134 at (7).


The content identifier 134 can retrieve one or more models corresponding to the identified user group from the model data store 139 at (8). In addition, the content identifier 134 can retrieve access logs corresponding to the user device 102 from the access logs data store 138 at (9). The access logs may indicate a current content page requested by the user device 102 and/or previous content pages requested by the user device 102 (and/or the order in which the content pages were requested). The content identifier 134 can use the content page request history to identify which of the retrieved model(s) to apply. For example, the content identifier 134 may apply those models that either correspond to a current content page (e.g., the content page requested by the user device 102 at operation (1)) or a sequence of content pages that matches a sequence of content pages requested by the user device 102. As an illustrative example, if the user device 102 requested content page A at operation (1), requested content page B prior to requesting content page A, and requested content page C prior to requesting content page B, then the content identifier 134 may apply models that either correspond to content page A or that correspond to the sequence of content pages C, B, and A (in that order).


The content identifier 134 can determine a quantity and/or format of data object(s) to retrieve based on the user device 102 capabilities and/or network conditions at (10). For example, the content identifier 134 can identify the user device 102 capabilities and/or the network conditions via a connection established between the POP 120 and the user device 102. The user device 102 capabilities and/or the network conditions may determine a data object quantity limit. In addition, the user device 102 capabilities and/or the network conditions may determine in which format the data object(s) should be transmitted. For example, the origin server 104 and/or the cache data store 128 may store multiple versions of the same data object, where each version has a different file size, image resolution, etc. Thus, high quality, medium quality, low quality, etc. versions of the same data object may be stored and/or retrieved. If the network conditions are poor and/or the user device 102 lacks certain features (e.g., multiple central processing units (CPUs), a stand-alone graphics card, high performance random access memory (RAM), a high speed network interface, etc.), then the content identifier 134 may determine that low quality versions of data object(s) should be retrieved and transmitted to the user device 102. Conversely, if the network conditions are strong and/or the user device 102 includes certain features (e.g., multiple central processing units (CPUs), a stand-alone graphics card, high performance random access memory (RAM), a high speed network interface, etc.), then the content identifier 134 may determine that high quality versions of data object(s) should be retrieved and transmitted to the user device 102.


The content identifier 134 can also apply some or all of the retrieved models (e.g., where the applied models are selected in a manner as described above) to identify data object(s) to retrieve at (11). While operation (11) is depicted after operation (10), this is not meant to be limiting. For example, not shown, the content identifier 134 can perform operation (11) before operation (10).


As illustrated in FIG. 3B, the content identifier 134 then transmits to the cache server 126 an indication of data object(s) to retrieve at (12) based on the performed operations (10) and (11). The cache server 126 then requested the indicated data object(s) from the origin server 104 at (13), and the origin server 104 transmits the requested data object(s) to the cache server 126 at (14). Alternatively, not shown, the requested data object(s) are stored in the cache data store 128 and thus the cache server 126 instead requests and receives the requested data object(s) from the cache data store 128. The cache server 126 then transmits the requested data object(s) to the user device 102 at (15) such that the user device 102 receives data object(s) proactively without requesting such data object(s). The user device 102 can then render and display the received data object(s) when a user provides an input to view a corresponding content page without having to first retrieve such data object(s) from an external system (e.g., the CDN service 122).


While FIGS. 3A-3B depict operations performed by the components of the operating environment 100 in a specific order, this is merely exemplary and not meant to be limiting. Any one of the depicted operations can be performed in a different order. For example, in other embodiments not shown, operation (10) can be performed after operation (11). In addition, some or all of the operations depicted in FIGS. 3A-3B can be optional. For example, the cache server 126 may not transmit a link header to the user group identifier 132 at (5).


Example Block Diagram for Validating the Artificial Intelligence Models



FIG. 4 is a block diagram of the operating environment 100 of FIG. 1 illustrating the operations performed by the components of the operating environment 100 to validate and update or re-train the artificial intelligence models, according to one embodiment. As illustrated in FIG. 4, the content identifier 134 transmits to the training and validation manager 136 an indication of data object(s) to retrieve at (1). The content identifier 134 may transmit this indication after the operations described with respect to FIG. 3A are performed.


The training and validation manager 136 can compare the indicated data object(s) as received from the content identifier 134 with data object(s) to retrieve as indicated by a link header at (2). For example, the link header generated by the origin server 104 may indicate data object(s) predicted to be requested by the user device 102 in the future. Thus, the training and validation manager 136 can compare the indication received from the content identifier 134 with the contents of the link header to determine whether the models predicted the same data object(s) to retrieve as the link header. Optionally, if there is a difference between the indicated data object(s) to retrieve (as received from the content identifier 134) and the data object(s) to retrieve as indicated by the link header, then the training and validation manager 136 stores the difference or an indication of the difference in the access logs data store 138 at (3). Alternatively or in addition, not shown, the training and validation manager 136 stores the difference, an indication of a difference, and/or an indication of a lack of a difference in the access logs data store 138. In other embodiments, not shown, the training and validation manager 136 transmits the difference (or an indication of a difference or a lack of a difference) directly to the predictive content push training system 140.


At a later time, the training and validation manager 136 can retrieve access logs from the access logs data store 138 at (4). The access logs may include any differences between indicated data object(s) as received from the content identifier 134 and data object(s) to retrieve as indicated by the link header. The training and validation manager 136 then transmits the access logs to the predictive content push training system 140 at (5).


The predictive content push training system 140 can then update or re-train one or more models using the access logs at (6). Optionally, the predictive content push training system 140 also updates the definitions of one or more user groups using the access logs.


Example Markov Model for Predicting Data Object(s) to Transmit Proactively



FIG. 5 is a block diagram of an example Markov model 500, according to one embodiment. As illustrated in FIG. 5, the Markov model 500 includes node N, node A, node B, and node C. The Markov model 500 further includes one or more nodes preceding node N in a Markov chain, such as node N−1, node N−2, etc.


The node N represents a current requested content page. For example, if the content identifier 134 is applying Markov model 500, node N would represent the most recent content page requested by the user device 102 (e.g., the content page that was requested that resulted in the content identifier 134 applying the Markov model 500). Node N−1 therefore represents a content page requested by the user device 102 immediately before the content page represented by node N. Similarly, node N−2 represents a content page requested by the user device 102 immediately before the content page represented by node N−1. Thus, the content identifier 134 may apply the Markov model 500 if a user device 102 submits a request for the content page represented by node N and previously submitted requests for the content pages represented by nodes N−1 and N−2 in the order depicted in FIG. 5 (e.g., node N−2 content page, then node N−1 content page, and then node N content page).


Nodes A, B, and C represent content pages that the user device 102 may request in the future. Node N is coupled to each of nodes A, B, and C via directional arcs that are each associated with a probability or transition probability. For example, the directional arc coupling node N to node A is associated with the probability PA, the directional arc coupling node N to node B is associated with the probability PB, and the directional arc coupling node N to node C is associated with the probability PC. As an illustrative example, PA may be 0.35, PB may be 0.4, and PC may be 0.25. According to these probabilities, the predictive content push training system 140 trained the Markov model 500 such that the Markov model 500 predicts the next content page requested by the user device 102 is more likely to be node B than node A or node C. Accordingly, as described above, application of the Markov model 500 causes the content identifier 134 to retrieve some or all data objects associated with node B. If the data object quantity limit has not been exceeded, then the content identifier 134 can retrieve some or all data objects associated with node A (e.g., the node corresponding to the second highest probability). Again, if the data object quantity limit has not been exceeded, then the content identifier 134 can retrieve some or all data objects associated with node C (e.g., the node corresponding to the third highest probability). Otherwise, if the data object quantity limit is exceeded at any point, then the content identifier 134 can cease retrieving any further data objects.


The Markov model 500 can include any number of nodes (e.g., 0, 1, 2, 3, 4, 5, etc.) preceding the node N. Similarly, while not shown, the Markov model 500 may include any number of nodes following node N and/or any number of nodes following node A, node B, and/or node C. For example, a directional arc may extend from node A to a node D, with the arc being associated with a probability PD. The content identifier 134 can use such Markov chains extending from node N in determining the quantity of data object(s) to retrieve and transmit to a user device 102. As an illustrative example, if a directional arc extends from node A to a node D, then the content identifier 134 can follow the following order of data object retrieval: (1) node B, node A, node C, node D; (2) node B, node A, node D (and any further nodes after node A or node D), node C; and/or the like.


The Markov model 500 may be associated with a single user or user device 102, a group of users or user devices 102, or all users and user devices 102. Furthermore, each node can represent a single content page or a plurality of content pages, as described above.


Example Predictive Content Push Routine



FIG. 6 is a flow diagram depicting a predictive content push routine 600 illustratively implemented by a POP, according to one embodiment. As an example, the POP 120 (e.g., the CDN service 122) of FIG. 1 can be configured to execute the predictive content push routine 600. The predictive content push routine 600 begins at block 602.


At block 604, a group is identified based on a request context. For example, the group can be identified based on user attributes of the user device and/or the user operating the user device and/or other contextual information, a requested content page, a transition from a previous content page to a current content page, etc.


At block 606, one or more models corresponding to the identified group are obtained. For example, the model(s) may correspond to a content page or a sequence of content pages.


At block 608, user device capabilities and/or network conditions are detected. For example, the user device capabilities and/or the network conditions can be detected via test messages transmitted over the connection between the user device and the POP.


At block 610, the quantity and/or format of content to obtain is identified. For example, the quantity and/or format may be identified based on the user device capabilities and/or the network conditions. As an illustrative example, content formatted to a resolution of 720p may be obtained if the user device has a display with a maximum resolution of 720p.


At block 612, a determination is made as to whether additional content should be transmitted to the user device. The determination may be made based on whether the data object quantity limit has been reached. For example, the data object quantity limit may not have been reached if no additional content has yet been transmitted to the user device. If the limit has been reached, then transmitting further content to the user device may congest the network and/or the user device. Thus, the predictive content push routine 600 proceeds to block 616 and ends. Otherwise, if the limit has not been reached, then transmitting further content to the user device may not congest the network and/or user device and may take advantage of the computing resources available (either in the user device or network). Thus, the predictive content push routine 600 proceeds to block 614.


At block 614, content is obtained and caused to be transmitted to the user device based on an application of one or more of the obtained models. For example, the obtained content may correspond to a content page represented by a node in a model that follows a node representing a current content page of the user device. The initial content obtained and caused to be transmitted may correspond to a node associated with a directional arc extending from the current content page node having the highest probability. If the predictive content push routine 600 repeats block 614 (after proceeding to block 614 from block 612 a second time), then the content obtained and caused to be transmitted may correspond to a node associated with a directional arc extending from the current content page node having the second highest probability. This pattern may continue until the predictive content push routine 600 no longer repeats block 614. The model that is applied may be a model that corresponds with a current content page of the user device or that corresponds with a sequence of content pages requested by the user device (where the sequence of content pages identified in the model are in the same order as the order in which the content pages are requested by the user device).


Terminology

All of the methods and tasks described herein may be performed and fully automated by a computer system. The computer system may, in some cases, include multiple distinct computers or computing devices (e.g., physical servers, workstations, storage arrays, cloud computing resources, etc.) that communicate and interoperate over a network to perform the described functions. Each such computing device typically includes a processor (or multiple processors) that executes program instructions or modules stored in a memory or other non-transitory computer-readable storage medium or device (e.g., solid state storage devices, disk drives, etc.). The various functions disclosed herein may be embodied in such program instructions, or may be implemented in application-specific circuitry (e.g., ASICs or FPGAs) of the computer system. Where the computer system includes multiple computing devices, these devices may, but need not, be co-located. The results of the disclosed methods and tasks may be persistently stored by transforming physical storage devices, such as solid state memory chips or magnetic disks, into a different state. In some embodiments, the computer system may be a cloud-based computing system whose processing resources are shared by multiple distinct business entities or other users.


Depending on the embodiment, certain acts, events, or functions of any of the processes or algorithms described herein can be performed in a different sequence, can be added, merged, or left out altogether (e.g., not all described operations or events are necessary for the practice of the algorithm). Moreover, in certain embodiments, operations or events can be performed concurrently, e.g., through multi-threaded processing, interrupt processing, or multiple processors or processor cores or on other parallel architectures, rather than sequentially.


The various illustrative logical blocks, modules, routines, and algorithm steps described in connection with the embodiments disclosed herein can be implemented as electronic hardware (e.g., ASICs or FPGA devices), computer software that runs on computer hardware, or combinations of both. Moreover, the various illustrative logical blocks and modules described in connection with the embodiments disclosed herein can be implemented or performed by a machine, such as a processor device, a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components, or any combination thereof designed to perform the functions described herein. A processor device can be a microprocessor, but in the alternative, the processor device can be a controller, microcontroller, or state machine, combinations of the same, or the like. A processor device can include electrical circuitry configured to process computer-executable instructions. In another embodiment, a processor device includes an FPGA or other programmable device that performs logic operations without processing computer-executable instructions. A processor device can also be implemented as a combination of computing devices, e.g., a combination of a DSP and a microprocessor, a plurality of microprocessors, one or more microprocessors in conjunction with a DSP core, or any other such configuration. Although described herein primarily with respect to digital technology, a processor device may also include primarily analog components. For example, some or all of the rendering techniques described herein may be implemented in analog circuitry or mixed analog and digital circuitry. A computing environment can include any type of computer system, including, but not limited to, a computer system based on a microprocessor, a mainframe computer, a digital signal processor, a portable computing device, a device controller, or a computational engine within an appliance, to name a few.


The elements of a method, process, routine, or algorithm described in connection with the embodiments disclosed herein can be embodied directly in hardware, in a software module executed by a processor device, or in a combination of the two. A software module can reside in RAM memory, flash memory, ROM memory, EPROM memory, EEPROM memory, registers, hard disk, a removable disk, a CD-ROM, or any other form of a non-transitory computer-readable storage medium. An exemplary storage medium can be coupled to the processor device such that the processor device can read information from, and write information to, the storage medium. In the alternative, the storage medium can be integral to the processor device. The processor device and the storage medium can reside in an ASIC. The ASIC can reside in a user terminal. In the alternative, the processor device and the storage medium can reside as discrete components in a user terminal.


Conditional language used herein, such as, among others, “can,” “could,” “might,” “may,” “e.g.,” and the like, unless specifically stated otherwise, or otherwise understood within the context as used, is generally intended to convey that certain embodiments include, while other embodiments do not include, certain features, elements or steps. Thus, such conditional language is not generally intended to imply that features, elements 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 other input or prompting, whether these features, elements or steps are included or are to be performed in any particular embodiment. The terms “comprising,” “including,” “having,” and the like are synonymous and are used inclusively, in an open-ended fashion, and do not exclude additional elements, features, acts, operations, and so forth. Also, the term “or” is used in its inclusive sense (and not in its exclusive sense) so that when used, for example, to connect a list of elements, the term “or” means one, some, or all of the elements in the list.


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


While the above detailed description has shown, described, and pointed out novel features as applied to various embodiments, it can be understood that various omissions, substitutions, and changes in the form and details of the devices or algorithms illustrated can be made without departing from the spirit of the disclosure. As can be recognized, certain embodiments described herein can be embodied within a form that does not provide all of the features and benefits set forth herein, as some features can be used or practiced separately from others. The scope of certain embodiments disclosed herein is indicated by the appended claims rather than by the foregoing description. All changes which come within the meaning and range of equivalency of the claims are to be embraced within their scope.

Claims
  • 1. A computer-implemented method of proactively transmitting content, the method comprising: as implemented by one or more computing devices configured with specific computer-executable instructions, obtaining, from a user device via a network, a request for a content page on a content delivery network (CDN) service, wherein the content page is associated with a first set of data objects, and wherein the CDN service is present on the one or more computing devices at a point of presence (POP);obtaining the first set of data objects;transmitting the first set of data objects to the user device;determining that a first group in a plurality of groups is associated with the request for the content page;detecting capabilities of the user device and conditions of the network;determining that the user device can process a first quantity of data objects and the network can transmit the first quantity of data objects using the capabilities of the user device and the conditions of the network;obtaining one or more Markov models corresponding to the first group;applying a first Markov model in the one or more Markov models, wherein the first Markov model corresponds to the requested content page;identifying a second set of data objects to obtain based on the application of the first Markov model, wherein the second set of data objects are associated with a second content page different than the requested content page, and wherein the user device has not yet requested the second content page after requesting the requested content page;determining that a quantity of the first set of data objects and the second set of data objects is less than the first quantity of data objects;obtaining the second set of data objects; andtransmitting the second set of data objects to the user device.
  • 2. The computer-implemented method of claim 1, wherein the first Markov model comprises at least a first node representing the requested content page, a second node coupled to the first node via a first arc that represents the second content page, and a third node coupled to the first node via a second arc that represents a third content page, and wherein a probability associated with the first arc is greater than a probability associated with the second arc.
  • 3. The computer-implemented method of claim 2, further comprising: identifying a third set of data objects to obtain based on the application of the first Markov model, wherein the third set of data objects are associated with the third content page, and wherein the user device has not yet requested the third content page after requesting the requested content page;determining that a quantity of the first set of data objects, the second set of data objects, and the third set of data objects is less than the first quantity of data objects;obtaining the third set of data objects; andtransmitting the third set of data objects to the user device.
  • 4. The computer-implemented method of claim 2, wherein the first Markov model further comprises at least a fourth node preceding the first node that represents a fourth content page, and wherein the user device requested the fourth content page prior to requesting the requested content page.
  • 5. The computer-implemented method of claim 1, wherein a second computing device external to the one or more computing devices trained the first Markov model using access logs collected by the CDN service corresponding to the user device and other user devices associated with the first group.
  • 6. A system comprising: a first computing device comprising a first processor configured with first computer-executable instructions that, when executed by the first processor, cause the first computing device to train a first stochastic model; anda second computing device comprising a second processor in communication with the first computing device and configured with second computer-executable instructions that, when executed by the second processor, cause the second computing device to: obtain, from a user device via a network, a request for a content page, wherein the content page is associated with a first set of data objects;obtain the first set of data objects;cause transmission of the first set of data objects to the user device;determine that a first group in a plurality of groups is associated with the request for the content page;determine that the user device can process a first quantity of data objects based on detected capabilities of the user device;obtain the first stochastic model from the first computing device, wherein the first stochastic model corresponds to the first group;identify a second set of data objects to obtain using the first stochastic model, wherein the second set of data objects are associated with a second content page different than the requested content page, and wherein the user device has not yet requested the second content page after requesting the requested content page;determine that a quantity of the first set of data objects and the second set of data objects is less than the first quantity of data objects;obtain the second set of data objects; andcause transmission of the second set of data objects to the user device.
  • 7. The system of claim 6, wherein the first stochastic model comprises a first Markov model, wherein the first Markov model comprises at least a first node representing the requested content page, a second node coupled to the first node via a first arc that represents the second content page, and a third node coupled to the first node via a second arc that represents a third content page, and wherein a probability associated with the first arc is greater than a probability associated with the second arc.
  • 8. The system of claim 7, wherein the second computer-executable instructions further cause the second computing device to: identify a third set of data objects to obtain using the first Markov model, wherein the third set of data objects are associated with the third content page, and wherein the user device has not yet requested the third content page after requesting the requested content page;determine that a quantity of the first set of data objects, the second set of data objects, and the third set of data objects is less than the first quantity of data objects;obtain the third set of data objects; andcause transmission of the third set of data objects to the user device.
  • 9. The system of claim 7, wherein the second computer-executable instructions further cause the second computing device to: identify a third set of data objects to obtain using the first Markov model, wherein the third set of data objects are associated with the third content page, and wherein the user device has not yet requested the third content page after requesting the requested content page;determine that a quantity of the first set of data objects, the second set of data objects, and the third set of data objects exceeds the first quantity of data objects; anddetermine not to obtain and cause transmission of the third set of data objects to the user device, thereby reducing a likelihood that at least one of the user device or the network becomes congested.
  • 10. The system of claim 7, wherein the first Markov model further comprises at least a fourth node preceding the first node that represents a fourth content page, and wherein the user device requested the fourth content page prior to requesting the requested content page.
  • 11. The system of claim 6, wherein the first computer-executable instructions further cause the first computing device to define the first group using access logs corresponding to the user device and other user devices that exhibited browsing behavior common with the user device.
  • 12. The system of claim 6, wherein the second computer-executable instructions further cause the second computing device to: obtain a link header in response to transmission of a request for the first set of data objects, wherein the link header comprises a reference to a third set of data objects to obtain;compare the second set of data objects and the third set of data objects; andstore any differences between the second set of data objects and the third set of data objects in access logs.
  • 13. The system of claim 12, wherein the first computer-executable instructions further cause the first computing device to: re-train or update the first stochastic model using at least the differences; andcause transmission of the re-trained or updated first stochastic model to the second computing device for use when future content page requests are obtained.
  • 14. The system of claim 6, wherein the second computer-executable instructions further cause the second computing device to: determine a first format of data objects to transmit to the user device using the capabilities of the user device;obtain a version of the first set of data objects in the first format and a version of the second set of data objects in the first format; andcause transmission of the version of the first set of data objects in the first format and the version of the second set of data objects in the first format to the user device.
  • 15. Non-transitory, computer-readable storage media comprising computer-executable instructions, wherein the computer-executable instructions, when executed by a computer system, cause the computer system to: obtain, from a user device via a network, a request for a content page, wherein the content page is associated with a first set of data objects;obtain the first set of data objects;cause transmission of the first set of data objects to the user device;determine that a first group in a plurality of groups is associated with the request for the content page;obtain a first artificial intelligence model, wherein the first artificial intelligence model corresponds to the first group;identify a second set of data objects to obtain using the first artificial intelligence model, wherein the second set of data objects are associated with a second content page different than the requested content page, and wherein the user device has not yet requested the second content page after requesting the requested content page;obtain the second set of data objects; andcause transmission of the second set of data objects to the user device in response to a determination that a quantity of the first set of data objects and the second set of data objects can be processed by the user device.
  • 16. The non-transitory, computer-readable storage media of claim 15, wherein the first artificial intelligence model comprises at least one of a first Markov model or a neural network.
  • 17. The non-transitory, computer-readable storage media of claim 15, wherein the first Markov model comprises at least a first node representing the requested content page, a second node coupled to the first node via a first arc that represents the second content page, and a third node coupled to the first node via a second arc that represents a third content page, and wherein a probability associated with the first arc is greater than a probability associated with the second arc.
  • 18. The non-transitory, computer-readable storage media of claim 15, wherein the computer-executable instructions further cause the computer system to: identify a third set of data objects to obtain using the first Markov model, wherein the third set of data objects are associated with a third content page, and wherein the user device has not yet requested the third content page after requesting the requested content page;determine that transmission of the first set of data objects, the second set of data objects, and the third set of data objects to the user device will not cause an available bandwidth of the network as a percentage of a total bandwidth of the network to drop below a threshold value;obtain the third set of data objects; andcause transmission of the third set of data objects to the user device.
  • 19. The non-transitory, computer-readable storage media of claim 15, wherein the first Markov model further comprises at least a fourth node preceding the first node that represents a fourth content page, and wherein the user device requested the fourth content page prior to requesting the requested content page.
  • 20. The non-transitory, computer-readable storage media of claim 15, wherein the computer-executable instructions further cause the computer system to: obtain a link header in response to transmission of a request for the first set of data objects, wherein the link header comprises a reference to a third set of data objects to obtain;compare the second set of data objects and the third set of data objects; andstore any differences between the second set of data objects and the third set of data objects in access logs such that the first artificial intelligence model can be re-trained or updated using at least the differences to improve predictions when future content page requests are obtained.
US Referenced Citations (1525)
Number Name Date Kind
5063500 Shorter Nov 1991 A
5341477 Pitkin et al. Aug 1994 A
5459837 Caccavale Oct 1995 A
5611049 Pitts Mar 1997 A
5627889 Eslambolchi 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
6006264 Colby 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
6513112 Craig et al. Jan 2003 B1
6523036 Hickman et al. Feb 2003 B1
6529910 Fleskes Mar 2003 B1
6529953 Van Renesse Mar 2003 B1
6553413 Leighton et al. Apr 2003 B1
6560610 Eatherton et al. May 2003 B1
6611873 Kanehara Aug 2003 B1
6622168 Datta Sep 2003 B1
6643357 Lumsden Nov 2003 B2
6643707 Booth Nov 2003 B1
6654807 Farber et al. Nov 2003 B2
6658462 Dutta Dec 2003 B1
6665706 Kenner et al. Dec 2003 B2
6678717 Schneider Jan 2004 B1
6678791 Jacobs et al. Jan 2004 B1
6681282 Golden et al. Jan 2004 B1
6687846 Adrangi et al. Feb 2004 B1
6694358 Swildens 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
6950848 Yousefi'zadeh et al. Sep 2005 B1
6961783 Cook et al. Sep 2005 B1
6963850 Bezos et al. Nov 2005 B1
6976090 Ben-Shaul et al. Dec 2005 B2
6981017 Kasriel et al. Dec 2005 B1
6985945 Farhat et al. Jan 2006 B2
6986018 O'Rourke et al. Jan 2006 B2
6990526 Zhu Jan 2006 B1
6996616 Leighton et al. Feb 2006 B1
7003555 Jungck Feb 2006 B1
7006099 Gut et al. Feb 2006 B2
7007089 Freedman Feb 2006 B2
7010578 Lewin et al. Mar 2006 B1
7010598 Sitaraman et al. Mar 2006 B2
7024466 Outten et al. Apr 2006 B2
7027582 Khello et al. Apr 2006 B2
7031445 Lumsden Apr 2006 B2
7032010 Swildens et al. Apr 2006 B1
7058633 Gnagy et al. Jun 2006 B1
7058706 Iyer et al. Jun 2006 B1
7058953 Willard et al. Jun 2006 B2
7065587 Huitema et al. Jun 2006 B2
7072982 Teodosiu et al. Jul 2006 B2
7076633 Tormasov et al. Jul 2006 B2
7082476 Cohen et al. Jul 2006 B1
7086061 Joshi et al. Aug 2006 B1
7092505 Allison et al. Aug 2006 B2
7092997 Kasriel et al. Aug 2006 B1
7096266 Lewin et al. Aug 2006 B2
7099936 Chase et al. Aug 2006 B2
7103645 Leighton et al. Sep 2006 B2
7114160 Suryanarayana et al. Sep 2006 B2
7117262 Bai et al. Oct 2006 B2
7133905 Dilley et al. Nov 2006 B2
7136922 Sundaram et al. Nov 2006 B2
7139808 Anderson et al. Nov 2006 B2
7139821 Shah et al. Nov 2006 B1
7143169 Champagne et al. Nov 2006 B1
7143170 Swildens et al. Nov 2006 B2
7146560 Dang et al. Dec 2006 B2
7149809 Barde et al. Dec 2006 B2
7152118 Anderson, IV et al. Dec 2006 B2
7162539 Garcie-Luna-Aceves Jan 2007 B2
7174382 Ramanathan et al. Feb 2007 B2
7185046 Ferstl et al. Feb 2007 B2
7185063 Kasriel et al. Feb 2007 B1
7185084 Sirivara et al. Feb 2007 B2
7188214 Kasriel et al. Mar 2007 B1
7194522 Swildens et al. Mar 2007 B1
7194552 Schneider Mar 2007 B1
7200667 Teodosiu et al. Apr 2007 B2
7216170 Ludvig et al. May 2007 B2
7225254 Swildens et al. May 2007 B1
7228350 Hong et al. Jun 2007 B2
7228359 Monteiro Jun 2007 B1
7233978 Overton et al. Jun 2007 B2
7240100 Wein et al. Jul 2007 B1
7249196 Peiffer et al. Jul 2007 B1
7251675 Kamakura et al. Jul 2007 B1
7254626 Kommula et al. Aug 2007 B1
7254636 O'Toole, Jr. et al. Aug 2007 B1
7257581 Steele et al. Aug 2007 B1
7260598 Liskov et al. Aug 2007 B1
7260639 Afergan et al. Aug 2007 B2
7269784 Kasriel et al. Sep 2007 B1
7272227 Beran Sep 2007 B1
7274658 Bornstein et al. Sep 2007 B2
7284056 Ramig Oct 2007 B2
7289519 Liskov Oct 2007 B1
7293093 Leighton Nov 2007 B2
7308499 Chavez Dec 2007 B2
7310686 Uysal Dec 2007 B2
7316648 Kelly et al. Jan 2008 B2
7318074 Iyengar et al. Jan 2008 B2
7320131 O'Toole, Jr. Jan 2008 B1
7321918 Burd et al. Jan 2008 B2
7337968 Wilz, Sr. et al. Mar 2008 B2
7339937 Mitra et al. Mar 2008 B2
7340505 Lisiecki et al. Mar 2008 B2
7343397 Kochanski Mar 2008 B2
7350075 Eastham et al. Mar 2008 B1
7362703 Taft et al. Mar 2008 B1
7363291 Page Apr 2008 B1
7363626 Koutharapu et al. Apr 2008 B2
7370089 Boyd et al. May 2008 B2
7372809 Chen May 2008 B2
7373416 Kagan et al. May 2008 B2
7376716 Dilley et al. May 2008 B2
7376736 Sundaram et al. May 2008 B2
7380078 Ikegaya et al. May 2008 B2
7389354 Sitaraman et al. Jun 2008 B1
7392236 Rusch et al. Jun 2008 B2
7398301 Hennessey et al. Jul 2008 B2
7406512 Swildens et al. Jul 2008 B2
7406522 Riddle Jul 2008 B2
7409712 Brooks et al. Aug 2008 B1
7430610 Pace et al. Sep 2008 B2
7437438 Mogul Oct 2008 B2
7441045 Skene et al. Oct 2008 B2
7441261 Slater et al. Oct 2008 B2
7451230 Corrado et al. Oct 2008 B2
7454457 Lowery et al. Nov 2008 B1
7454500 Hsu et al. Nov 2008 B1
7461170 Taylor et al. Dec 2008 B1
7464142 Flurry et al. Dec 2008 B2
7478148 Neerdaels Jan 2009 B2
7492720 Pruthi et al. Feb 2009 B2
7496651 Joshi Feb 2009 B1
7499998 Toebes et al. Mar 2009 B2
7502836 Menditto et al. Mar 2009 B1
7505464 Okmianski et al. Mar 2009 B2
7506034 Coates et al. Mar 2009 B2
7519705 Papagiannaki et al. Mar 2009 B1
7519720 Fishman et al. Apr 2009 B2
7519726 Palliyil et al. Apr 2009 B2
7523181 Swildens et al. Apr 2009 B2
7543024 Holstege 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
7603439 Dilley et al. Oct 2009 B2
7613815 Prakash et al. Oct 2009 B1
7617222 Coulthard et al. Nov 2009 B2
7623460 Miyazaki Nov 2009 B2
7624169 Lisiecki et al. Nov 2009 B2
7624264 Aura et al. Nov 2009 B2
7631101 Sullivan et al. Dec 2009 B2
7640296 Fuchs et al. Dec 2009 B2
7650376 Blumenau Jan 2010 B1
7653700 Bahl et al. Jan 2010 B1
7653725 Yahiro et al. Jan 2010 B2
7657613 Hanson et al. Feb 2010 B1
7657622 Douglis et al. Feb 2010 B1
7661027 Langen et al. Feb 2010 B2
7664831 Cartmell et al. Feb 2010 B2
7664879 Chan et al. Feb 2010 B2
7676570 Levy et al. Mar 2010 B2
7680897 Carter et al. Mar 2010 B1
7684394 Cutbill et al. Mar 2010 B1
7685109 Ransil et al. Mar 2010 B1
7685251 Houlihan et al. Mar 2010 B2
7693813 Cao et al. Apr 2010 B1
7693959 Leighton et al. Apr 2010 B2
7702724 Brydon et al. Apr 2010 B1
7706740 Collins et al. Apr 2010 B2
7707314 McCarthy et al. Apr 2010 B2
7711647 Gunaseelan et al. May 2010 B2
7711788 Lev Ran et al. May 2010 B2
7716367 Leighton et al. May 2010 B1
7725602 Liu et al. May 2010 B2
7730187 Raciborski et al. Jun 2010 B2
7739400 Lindbo et al. Jun 2010 B2
7747720 Toebes et al. Jun 2010 B2
7756017 Goyal et al. Jul 2010 B2
7756913 Day Jul 2010 B1
7756965 Joshi Jul 2010 B2
7757202 Dahlsted et al. Jul 2010 B2
7761572 Auerbach Jul 2010 B1
7765304 Davis et al. Jul 2010 B2
7769823 Jenny et al. Aug 2010 B2
7773596 Marques Aug 2010 B1
7774342 Virdy Aug 2010 B1
7783727 Foley et al. Aug 2010 B1
7787380 Aggarwal et al. Aug 2010 B1
7792989 Toebes et al. Sep 2010 B2
7805516 Kettler et al. Sep 2010 B2
7809597 Das et al. Oct 2010 B2
7813308 Reddy et al. Oct 2010 B2
7814229 Cabrera et al. Oct 2010 B1
7818454 Kim et al. Oct 2010 B2
7827256 Phillips et al. Nov 2010 B2
7836177 Kasriel et al. Nov 2010 B2
7853719 Cao et al. Dec 2010 B1
7865594 Baumback et al. Jan 2011 B1
7865953 Hsieh et al. Jan 2011 B1
7873065 Mukerji et al. Jan 2011 B1
7890612 Todd et al. Feb 2011 B2
7890989 Hofrichter et al. Feb 2011 B1
7899899 Joshi Mar 2011 B2
7904875 Hegyi Mar 2011 B2
7912921 O'Rourke et al. Mar 2011 B2
7925713 Day et al. Apr 2011 B1
7925782 Sivasubramanian et al. Apr 2011 B2
7930393 Baumback et al. Apr 2011 B1
7930402 Swildens et al. Apr 2011 B2
7930427 Josefsberg et al. Apr 2011 B2
7933988 Nasuto et al. Apr 2011 B2
7937477 Day et al. May 2011 B1
7945693 Farber et al. May 2011 B2
7949779 Farber et al. May 2011 B2
7958222 Pruitt et al. Jun 2011 B1
7958258 Yeung et al. Jun 2011 B2
7962597 Richardson et al. Jun 2011 B2
7966404 Hedin et al. Jun 2011 B2
7970816 Chess et al. Jun 2011 B2
7970940 van de Ven et al. Jun 2011 B1
7979509 Malmskog et al. Jul 2011 B1
7991910 Richardson et al. Aug 2011 B2
7996533 Leighton et al. Aug 2011 B2
7996535 Auerbach Aug 2011 B2
8000724 Rayburn et al. Aug 2011 B1
8001187 Stochosky Aug 2011 B2
8010707 Elzur et al. Aug 2011 B2
8019869 Kriegsman Sep 2011 B2
8024441 Kommula et al. Sep 2011 B2
8028090 Richardson et al. Sep 2011 B2
8041773 Abu-Ghazaleh et al. Oct 2011 B2
8041809 Sundaram et al. Oct 2011 B2
8041818 Gupta et al. Oct 2011 B2
8042054 White et al. Oct 2011 B2
8065275 Eriksen et al. Nov 2011 B2
8069231 Schran et al. Nov 2011 B2
8073940 Richardson et al. Dec 2011 B1
8082348 Averbuj et al. Dec 2011 B1
8108623 Krishnaprasad et al. Jan 2012 B2
8117306 Baumback et al. Feb 2012 B1
8122098 Richardson et al. Feb 2012 B1
8122124 Baumback et al. Feb 2012 B1
8132242 Wu Mar 2012 B1
8135820 Richardson et al. Mar 2012 B2
8155126 Mao et al. Mar 2012 B1
8156199 Hoche-Mong et al. Apr 2012 B1
8156243 Richardson et al. Apr 2012 B2
8161184 Sekar et al. Apr 2012 B2
8175863 Ostermeyer et al. May 2012 B1
8190682 Paterson-Jones et al. May 2012 B2
8195605 Chellappa et al. Jun 2012 B2
8195837 McCarthy et al. Jun 2012 B2
8209695 Pruyne et al. Jun 2012 B1
8224971 Miller et al. Jul 2012 B1
8224986 Liskov et al. Jul 2012 B1
8224994 Schneider Jul 2012 B1
8234403 Richardson et al. Jul 2012 B2
8239530 Sundaram et al. Aug 2012 B2
8250135 Driesen et al. Aug 2012 B2
8250211 Swildens et al. Aug 2012 B2
8250219 Raciborski et al. Aug 2012 B2
8260914 Ranjan Aug 2012 B1
8261062 Aura et al. Sep 2012 B2
8266288 Banerjee et al. Sep 2012 B2
8266327 Kumar et al. Sep 2012 B2
8271471 Kamvar et al. Sep 2012 B1
8280998 Joshi 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
8296786 Faust et al. Oct 2012 B2
8301600 Helmick et al. Oct 2012 B1
8301645 Crook Oct 2012 B1
8321568 Sivasubramanian et al. Nov 2012 B2
8321588 Richardson et al. Nov 2012 B2
8356074 Ehrlich et al. Jan 2013 B1
8380831 Barber Feb 2013 B2
8380851 McCarthy et al. Feb 2013 B2
8392928 Forys et al. Mar 2013 B1
8396908 Moore et al. Mar 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
8443167 Fallone et al. May 2013 B1
8447831 Sivasubramanian et al. May 2013 B1
8447876 Verma et al. May 2013 B2
8452745 Ramakrishna May 2013 B2
8452874 MacCarthaigh et al. May 2013 B2
8463877 Richardson Jun 2013 B1
8468222 Sakata et al. Jun 2013 B2
8468245 Farber et al. Jun 2013 B2
8473613 Farber et al. Jun 2013 B2
8478903 Farber et al. Jul 2013 B2
8504721 Hsu et al. Aug 2013 B2
8510428 Joshi Aug 2013 B2
8510807 Elazary et al. Aug 2013 B1
8521851 Richardson et al. Aug 2013 B1
8521876 Goodman et al. Aug 2013 B2
8521880 Richardson et al. Aug 2013 B1
8521885 Richardson et al. Aug 2013 B1
8521908 Holmes et al. Aug 2013 B2
8526405 Curtis et al. Sep 2013 B2
8527639 Liskov et al. Sep 2013 B1
8527645 Proffit et al. Sep 2013 B1
8527658 Holmes et al. Sep 2013 B2
8549646 Stavrou et al. Oct 2013 B2
8572208 Farber et al. Oct 2013 B2
8572210 Farber et al. Oct 2013 B2
8577992 Richardson 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
8645700 Smith et al. Feb 2014 B2
8676918 Richardson et al. Mar 2014 B2
8683023 Brandwine et al. Mar 2014 B1
8683076 Farber et al. Mar 2014 B2
8688837 Richardson et al. Apr 2014 B1
8712950 Smith et al. Apr 2014 B2
8732309 Richardson et al. May 2014 B1
8745177 Kazerani et al. Jun 2014 B1
8756322 Lynch Jun 2014 B1
8756325 Sivasubramanian et al. Jun 2014 B2
8756341 Richardson et al. Jun 2014 B1
8775553 Cansino et al. Jun 2014 B2
8782207 Qiu et al. Jul 2014 B2
8782236 Marshall et al. Jul 2014 B1
8782279 Eggleston et al. Jul 2014 B2
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
8914626 Adogla et al. Dec 2014 B1
8914797 Osogami et al. Dec 2014 B2
8924528 Richardson et al. Dec 2014 B1
8930513 Richardson et al. Jan 2015 B1
8930544 Richardson et al. Jan 2015 B2
8935744 Osterweil et al. Jan 2015 B2
8938526 Richardson et al. Jan 2015 B1
8949161 Borst et al. Feb 2015 B2
8949459 Scholl Feb 2015 B1
8966318 Shah Feb 2015 B1
8972580 Fleischman et al. Mar 2015 B2
8976711 Li 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
9118680 Dunlap et al. Aug 2015 B1
9130756 Richardson et al. Sep 2015 B2
9130977 Zisapel et al. Sep 2015 B2
9137210 Joglekar et al. Sep 2015 B1
9137301 Dunlap et al. Sep 2015 B1
9137302 Makhijani et al. Sep 2015 B1
9154551 Watson Oct 2015 B1
9160703 Richardson et al. Oct 2015 B2
9172674 Patel et al. Oct 2015 B1
9176894 Marshall et al. Nov 2015 B2
9185012 Richardson et al. Nov 2015 B2
9191338 Richardson et al. Nov 2015 B2
9191458 Richardson et al. Nov 2015 B2
9195996 Walsh et al. Nov 2015 B1
9208097 Richardson et al. Dec 2015 B2
9210235 Sivasubramanian et al. Dec 2015 B2
9219686 Hilt et al. Dec 2015 B2
9237087 Risbood et al. Jan 2016 B1
9237114 Richardson et al. Jan 2016 B2
9240954 Ellsworth et al. Jan 2016 B1
9246776 Ellsworth et al. Jan 2016 B2
9251112 Richardson et al. Feb 2016 B2
9253065 Richardson et al. Feb 2016 B2
9276812 Nagargadde et al. Mar 2016 B1
9294391 Mostert Mar 2016 B1
9323577 Marr et al. Apr 2016 B2
9332078 Sivasubramanian et al. May 2016 B2
9386038 Martini Jul 2016 B2
9391949 Richardson et al. Jul 2016 B1
9407676 Archer et al. Aug 2016 B2
9407681 Richardson et al. Aug 2016 B1
9407699 Sivasubramanian et al. Aug 2016 B2
9444718 Khakpour et al. Sep 2016 B2
9444759 Richardson et al. Sep 2016 B2
9479476 Richardson et al. Oct 2016 B2
9495338 Hollis et al. Nov 2016 B1
9497259 Richardson et al. Nov 2016 B1
9515949 Richardson et al. Dec 2016 B2
9525659 Sonkin et al. Dec 2016 B1
9544394 Richardson et al. Jan 2017 B2
9571389 Richardson et al. Feb 2017 B2
9584328 Graham-cumming Feb 2017 B1
9590946 Richardson et al. Mar 2017 B2
9608957 Sivasubramanian et al. Mar 2017 B2
9621660 Sivasubramanian et al. Apr 2017 B2
9628509 Holloway et al. Apr 2017 B2
9628554 Marshall et al. Apr 2017 B2
9645808 Turpie May 2017 B1
9703713 Nadgowda Jul 2017 B2
9705922 Foxhoven et al. Jul 2017 B2
9712325 Richardson et al. Jul 2017 B2
9712484 Richardson 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
9900402 Li et al. Feb 2018 B1
9912740 Richardson et al. Mar 2018 B2
9929959 Mostert Mar 2018 B2
9930131 MacCarthaigh et al. Mar 2018 B2
9954934 Sivasubramanian et al. Apr 2018 B2
9985927 Richardson et al. May 2018 B2
9992086 Mizik et al. Jun 2018 B1
9992303 Richardson et al. Jun 2018 B2
10015237 Richardson et al. Jul 2018 B2
10015241 Marr et al. Jul 2018 B2
10021179 Velummylum et al. Jul 2018 B1
10027582 Richardson et al. Jul 2018 B2
10033627 Howard et al. Jul 2018 B1
10033691 Mizik et al. Jul 2018 B1
10033699 Sullivan et al. Jul 2018 B2
10049051 Baldwin Aug 2018 B1
10075551 Baldwin et al. Sep 2018 B1
10079742 Richardson et al. Sep 2018 B1
10091096 Howard et al. Oct 2018 B1
10097398 Richardson et al. Oct 2018 B1
10097448 Howard et al. Oct 2018 B1
10097566 Radlein et al. Oct 2018 B1
10110694 Watson et al. Oct 2018 B1
10116584 Richardson et al. Oct 2018 B2
10135620 Richardson et al. Nov 2018 B2
10157135 Richardson et al. Dec 2018 B2
10158729 Sivasubramanian et al. Dec 2018 B2
10162753 Marshall et al. Dec 2018 B2
10180993 Raftery Jan 2019 B2
10200402 Radlein et al. Feb 2019 B2
10200492 MacCarthaigh et al. Feb 2019 B2
10205698 Petersen et al. Feb 2019 B1
10218584 Ellsworth et al. Feb 2019 B2
10225322 Richardson et al. Mar 2019 B2
10225326 Puchala et al. Mar 2019 B1
10225362 Watson Mar 2019 B2
10230819 Richardson et al. Mar 2019 B2
10257307 Baldwin Mar 2019 B1
10264062 Richardson et al. Apr 2019 B2
10270878 Uppal et al. Apr 2019 B1
10305797 Richardson et al. May 2019 B2
10348639 Puchala et al. Jul 2019 B2
10374955 Mostert Aug 2019 B2
10447648 Bliss et al. Oct 2019 B2
20010000811 May et al. May 2001 A1
20010025305 Yoshiasa et al. Sep 2001 A1
20010027479 Delaney et al. Oct 2001 A1
20010032133 Moran Oct 2001 A1
20010034704 Farhat et al. Oct 2001 A1
20010049741 Skene et al. Dec 2001 A1
20010052016 Skene et al. Dec 2001 A1
20010056416 Garcia-Luna-Aceves Dec 2001 A1
20010056500 Farber et al. Dec 2001 A1
20020002613 Freeman et al. Jan 2002 A1
20020004816 Vange et al. Jan 2002 A1
20020004846 Garcia-Luna-Aceves et al. Jan 2002 A1
20020007413 Garcia-Luna-Aceves et al. Jan 2002 A1
20020010783 Primak et al. Jan 2002 A1
20020010798 Ben-Shaul et al. Jan 2002 A1
20020035624 Kim Mar 2002 A1
20020048269 Hong et al. Apr 2002 A1
20020049608 Hartsell et al. Apr 2002 A1
20020049842 Huetsch et al. Apr 2002 A1
20020049857 Farber et al. Apr 2002 A1
20020052942 Swildens et al. May 2002 A1
20020062372 Hong et al. May 2002 A1
20020065910 Dutta May 2002 A1
20020068554 Dusse Jun 2002 A1
20020069420 Russell et al. Jun 2002 A1
20020078233 Biliris et al. Jun 2002 A1
20020082858 Heddaya et al. Jun 2002 A1
20020083118 Sim Jun 2002 A1
20020083148 Shaw et al. Jun 2002 A1
20020083178 Brothers Jun 2002 A1
20020083198 Kim et al. Jun 2002 A1
20020087374 Boubez et al. Jul 2002 A1
20020091786 Yamaguchi et al. Jul 2002 A1
20020091801 Lewin et al. Jul 2002 A1
20020092026 Janniello et al. Jul 2002 A1
20020099616 Sweldens Jul 2002 A1
20020099850 Farber et al. Jul 2002 A1
20020101836 Dorenbosch Aug 2002 A1
20020103778 Saxena Aug 2002 A1
20020103820 Cartmell et al. Aug 2002 A1
20020103972 Satran et al. Aug 2002 A1
20020107944 Bai et al. Aug 2002 A1
20020112049 Elnozahy et al. Aug 2002 A1
20020112123 Becker et al. Aug 2002 A1
20020116481 Lee Aug 2002 A1
20020116491 Boyd et al. Aug 2002 A1
20020116582 Copeland et al. Aug 2002 A1
20020120666 Landsman et al. Aug 2002 A1
20020120782 Dillon et al. Aug 2002 A1
20020124047 Gartner et al. Sep 2002 A1
20020124098 Shaw Sep 2002 A1
20020129123 Johnson et al. Sep 2002 A1
20020131428 Pecus et al. Sep 2002 A1
20020133741 Maeda et al. Sep 2002 A1
20020135611 Deosaran et al. Sep 2002 A1
20020138286 Engstrom Sep 2002 A1
20020138437 Lewin et al. Sep 2002 A1
20020138443 Schran et al. Sep 2002 A1
20020138649 Cartmell et al. Sep 2002 A1
20020143675 Orshan Oct 2002 A1
20020143798 Lisiecki et al. Oct 2002 A1
20020143989 Huitema et al. Oct 2002 A1
20020145993 Chowdhury et al. Oct 2002 A1
20020147770 Tang Oct 2002 A1
20020147774 Lisiecki et al. Oct 2002 A1
20020150094 Cheng et al. Oct 2002 A1
20020150276 Chang Oct 2002 A1
20020152326 Orshan Oct 2002 A1
20020154157 Sherr et al. Oct 2002 A1
20020156884 Bertram et al. Oct 2002 A1
20020156911 Croman et al. Oct 2002 A1
20020161745 Call Oct 2002 A1
20020161767 Shapiro et al. Oct 2002 A1
20020163882 Bornstein et al. Nov 2002 A1
20020165912 Wenocur et al. Nov 2002 A1
20020169890 Beaumont et al. Nov 2002 A1
20020184368 Wang Dec 2002 A1
20020188722 Banerjee et al. Dec 2002 A1
20020194324 Guha Dec 2002 A1
20020194382 Kausik et al. Dec 2002 A1
20020198953 O'Rourke et al. Dec 2002 A1
20030002484 Freedman Jan 2003 A1
20030004998 Datta Jan 2003 A1
20030005036 Mitzenmacher Jan 2003 A1
20030005111 Allan Jan 2003 A1
20030007482 Khello et al. Jan 2003 A1
20030009488 Hart, III Jan 2003 A1
20030009591 Hayball et al. Jan 2003 A1
20030026410 Lumsden Feb 2003 A1
20030028642 Agarwal et al. Feb 2003 A1
20030033283 Evans et al. Feb 2003 A1
20030037108 Peiffer et al. Feb 2003 A1
20030037139 Shteyn Feb 2003 A1
20030037284 Srinivasan et al. Feb 2003 A1
20030041094 Lara et al. Feb 2003 A1
20030046343 Krishnamurthy et al. Mar 2003 A1
20030065739 Shnier Apr 2003 A1
20030070096 Pazi et al. Apr 2003 A1
20030074401 Connell et al. Apr 2003 A1
20030074471 Anderson et al. Apr 2003 A1
20030074472 Lucco et al. Apr 2003 A1
20030079027 Slocombe et al. Apr 2003 A1
20030093523 Cranor et al. May 2003 A1
20030099202 Lear et al. May 2003 A1
20030099237 Mitra et al. May 2003 A1
20030101278 Garcia-Luna-Aceves et al. May 2003 A1
20030105829 Hayward Jun 2003 A1
20030105857 Kamen et al. Jun 2003 A1
20030112792 Cranor et al. Jun 2003 A1
20030120741 Wu et al. Jun 2003 A1
20030126387 Watanabe Jul 2003 A1
20030133554 Nykanen et al. Jul 2003 A1
20030135467 Okamoto Jul 2003 A1
20030135509 Davis et al. Jul 2003 A1
20030140087 Lincoln et al. Jul 2003 A1
20030145038 Bin Tariq et al. Jul 2003 A1
20030145066 Okada et al. Jul 2003 A1
20030149581 Chaudhri et al. Aug 2003 A1
20030154239 Davis et al. Aug 2003 A1
20030154284 Bernardin et al. Aug 2003 A1
20030163722 Anderson, IV Aug 2003 A1
20030172145 Nguyen Sep 2003 A1
20030172183 Anderson, IV et al. Sep 2003 A1
20030172291 Judge et al. Sep 2003 A1
20030174648 Wang et al. Sep 2003 A1
20030177321 Watanabe Sep 2003 A1
20030182305 Balva et al. Sep 2003 A1
20030182413 Allen et al. Sep 2003 A1
20030182447 Schilling Sep 2003 A1
20030187935 Agarwalla et al. Oct 2003 A1
20030187970 Chase et al. Oct 2003 A1
20030191822 Leighton et al. Oct 2003 A1
20030200394 Ashmore et al. Oct 2003 A1
20030204602 Hudson et al. Oct 2003 A1
20030206520 Wu et al. Nov 2003 A1
20030221000 Cherkasova et al. Nov 2003 A1
20030229682 Day Dec 2003 A1
20030233423 Dilley et al. Dec 2003 A1
20030233445 Levy et al. Dec 2003 A1
20030233455 Leber et al. Dec 2003 A1
20030236700 Arning et al. Dec 2003 A1
20030236779 Choi et al. Dec 2003 A1
20040003032 Ma et al. Jan 2004 A1
20040010562 Itonaga Jan 2004 A1
20040010563 Forte et al. Jan 2004 A1
20040010588 Slater et al. Jan 2004 A1
20040010601 Afergan Jan 2004 A1
20040010621 Afergan et al. Jan 2004 A1
20040010683 Huitema 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
20040098478 Koetke et al. May 2004 A1
20040105544 Haneda et al. Jun 2004 A1
20040114579 Karaoguz et al. Jun 2004 A1
20040117309 Inoue et al. Jun 2004 A1
20040117455 Kaminksy et al. Jun 2004 A1
20040128344 Trossen Jul 2004 A1
20040128346 Melamed et al. Jul 2004 A1
20040148520 Talpade et al. Jul 2004 A1
20040167981 Douglas et al. Aug 2004 A1
20040167982 Cohen et al. Aug 2004 A1
20040170379 Yao et al. Sep 2004 A1
20040172466 Douglas et al. Sep 2004 A1
20040184456 Binding et al. Sep 2004 A1
20040194085 Beaubien et al. Sep 2004 A1
20040194102 Neerdaels Sep 2004 A1
20040203630 Wang Oct 2004 A1
20040205149 Dillon et al. Oct 2004 A1
20040205162 Parikh Oct 2004 A1
20040215823 Kleinfelter et al. Oct 2004 A1
20040221019 Swildens et al. Nov 2004 A1
20040221034 Kausik et al. Nov 2004 A1
20040246948 Lee et al. Dec 2004 A1
20040249939 Amini et al. Dec 2004 A1
20040249971 Klinker Dec 2004 A1
20040249975 Tuck et al. Dec 2004 A1
20040250119 Shelest et al. Dec 2004 A1
20040254921 Cohen et al. Dec 2004 A1
20040267906 Truty Dec 2004 A1
20040267907 Gustafsson Dec 2004 A1
20050010653 McCanne Jan 2005 A1
20050015471 Zhang et al. Jan 2005 A1
20050021706 Maggi et al. Jan 2005 A1
20050021862 Schroeder et al. Jan 2005 A1
20050027882 Sullivan et al. Feb 2005 A1
20050038967 Umbehocker et al. Feb 2005 A1
20050039019 Delany Feb 2005 A1
20050044270 Grove et al. Feb 2005 A1
20050102683 Branson et al. May 2005 A1
20050108169 Balasubramanian et al. May 2005 A1
20050108262 Fawcett May 2005 A1
20050108529 Juneau May 2005 A1
20050114296 Farber et al. May 2005 A1
20050117717 Lumsden Jun 2005 A1
20050132083 Raciborski et al. Jun 2005 A1
20050147088 Bao et al. Jul 2005 A1
20050149529 Gutmans Jul 2005 A1
20050157712 Rangarajan et al. Jul 2005 A1
20050160133 Greenlee et al. Jul 2005 A1
20050163168 Sheth et al. Jul 2005 A1
20050168782 Kobashi et al. Aug 2005 A1
20050171959 Deforche et al. Aug 2005 A1
20050172080 Miyauchi Aug 2005 A1
20050174989 Chen et al. Aug 2005 A1
20050181769 Kogawa Aug 2005 A1
20050188073 Nakamichi et al. Aug 2005 A1
20050192008 Desai et al. Sep 2005 A1
20050192814 Challener et al. Sep 2005 A1
20050198170 LeMay et al. Sep 2005 A1
20050198200 Subramanian et al. Sep 2005 A1
20050198303 Knauerhase et al. Sep 2005 A1
20050198334 Farber et al. Sep 2005 A1
20050198453 Osaki Sep 2005 A1
20050198571 Kramer et al. Sep 2005 A1
20050201302 Gaddis 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
20050267928 Anderson et al. Dec 2005 A1
20050267937 Daniels et al. Dec 2005 A1
20050267991 Huitema et al. Dec 2005 A1
20050267992 Huitema et al. Dec 2005 A1
20050267993 Huitema et al. Dec 2005 A1
20050278259 Gunaseelan et al. Dec 2005 A1
20050283759 Peteanu et al. Dec 2005 A1
20050283784 Suzuki Dec 2005 A1
20050286564 Hatley et al. Dec 2005 A1
20060005014 Aura et al. Jan 2006 A1
20060013158 Ahuja et al. Jan 2006 A1
20060020596 Liu et al. Jan 2006 A1
20060020684 Mukherjee et al. Jan 2006 A1
20060020714 Girouard et al. Jan 2006 A1
20060020715 Jungck Jan 2006 A1
20060021001 Giles et al. Jan 2006 A1
20060026067 Nicholas et al. Feb 2006 A1
20060026154 Altinel et al. Feb 2006 A1
20060031239 Koenig Feb 2006 A1
20060031319 Nelson et al. Feb 2006 A1
20060031503 Gilbert Feb 2006 A1
20060034494 Holloran Feb 2006 A1
20060036720 Faulk, Jr. Feb 2006 A1
20060036966 Yevdayev Feb 2006 A1
20060037037 Miranz Feb 2006 A1
20060039352 Karstens Feb 2006 A1
20060041614 Oe Feb 2006 A1
20060045005 Blackmore et al. Mar 2006 A1
20060047787 Aggarwal et al. Mar 2006 A1
20060047813 Aggarwal et al. Mar 2006 A1
20060059246 Grove Mar 2006 A1
20060063534 Kokkonen et al. Mar 2006 A1
20060064476 Decasper et al. Mar 2006 A1
20060064500 Roth et al. Mar 2006 A1
20060070060 Tantawi et al. Mar 2006 A1
20060074750 Clark et al. Apr 2006 A1
20060075084 Lyon Apr 2006 A1
20060075139 Jungck Apr 2006 A1
20060083165 McLane et al. Apr 2006 A1
20060085536 Meyer et al. Apr 2006 A1
20060088026 Mazur et al. Apr 2006 A1
20060106938 Dini et al. May 2006 A1
20060107036 Randle et al. May 2006 A1
20060112066 Hamzy May 2006 A1
20060112176 Liu 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
20060143442 Smith Jun 2006 A1
20060146820 Friedman et al. Jul 2006 A1
20060149529 Nguyen et al. Jul 2006 A1
20060155823 Tran et al. Jul 2006 A1
20060155862 Kathi et al. Jul 2006 A1
20060161541 Cencini Jul 2006 A1
20060165051 Banerjee et al. Jul 2006 A1
20060168088 Leighton et al. Jul 2006 A1
20060173957 Robinson Aug 2006 A1
20060179080 Meek et al. Aug 2006 A1
20060184936 Abels et al. Aug 2006 A1
20060188097 Taniguchi et al. Aug 2006 A1
20060190605 Franz et al. Aug 2006 A1
20060193247 Naseh et al. Aug 2006 A1
20060195866 Thukral Aug 2006 A1
20060206568 Verma et al. Sep 2006 A1
20060206586 Ling et al. Sep 2006 A1
20060218265 Farber et al. Sep 2006 A1
20060218304 Mukherjee et al. Sep 2006 A1
20060221971 Andrieux et al. Sep 2006 A1
20060224752 Parekh et al. Oct 2006 A1
20060227740 McLaughlin et al. Oct 2006 A1
20060227758 Rana et al. Oct 2006 A1
20060230137 Gare et al. Oct 2006 A1
20060230265 Krishna Oct 2006 A1
20060233155 Srivastava Oct 2006 A1
20060242227 Rao Oct 2006 A1
20060253546 Chang et al. Nov 2006 A1
20060253609 Andreev et al. Nov 2006 A1
20060259581 Piersol Nov 2006 A1
20060259690 Vittal et al. Nov 2006 A1
20060259984 Juneau Nov 2006 A1
20060265497 Ohata et al. Nov 2006 A1
20060265508 Angel et al. Nov 2006 A1
20060265516 Schilling Nov 2006 A1
20060265720 Cai et al. Nov 2006 A1
20060271641 Stavrakos et al. Nov 2006 A1
20060282522 Lewin et al. Dec 2006 A1
20060288119 Kim et al. Dec 2006 A1
20060288424 Saito Dec 2006 A1
20070005689 Leighton et al. Jan 2007 A1
20070005801 Kumar et al. Jan 2007 A1
20070005892 Mullender et al. Jan 2007 A1
20070011267 Overton et al. Jan 2007 A1
20070014241 Banerjee et al. Jan 2007 A1
20070021998 Laithwaite et al. Jan 2007 A1
20070028001 Phillips et al. Feb 2007 A1
20070038729 Sullivan et al. Feb 2007 A1
20070038994 Davis et al. Feb 2007 A1
20070041393 Westhead et al. Feb 2007 A1
20070043667 Qawami et al. Feb 2007 A1
20070043859 Ruul Feb 2007 A1
20070050522 Grove et al. Mar 2007 A1
20070050703 Lebel Mar 2007 A1
20070055764 Dilley et al. Mar 2007 A1
20070055765 Lisiecki et al. Mar 2007 A1
20070061440 Sundaram et al. Mar 2007 A1
20070064610 Khandani Mar 2007 A1
20070076872 Juneau Apr 2007 A1
20070086429 Lawrence et al. Apr 2007 A1
20070094361 Hoynowski et al. Apr 2007 A1
20070101061 Baskaran et al. May 2007 A1
20070101377 Six et al. May 2007 A1
20070118667 McCarthy 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
20070233896 Hilt et al. Oct 2007 A1
20070243860 Aiello et al. Oct 2007 A1
20070244964 Challenger et al. Oct 2007 A1
20070245022 Olliphant et al. Oct 2007 A1
20070250467 Mesnik et al. Oct 2007 A1
20070250468 Pieper Oct 2007 A1
20070250560 Wein et al. Oct 2007 A1
20070250601 Amlekar et al. Oct 2007 A1
20070250611 Bhogal et al. Oct 2007 A1
20070253377 Janneteau et al. Nov 2007 A1
20070255843 Zubev Nov 2007 A1
20070263604 Tal Nov 2007 A1
20070266113 Koopmans et al. Nov 2007 A1
20070266311 Westphal Nov 2007 A1
20070266333 Cossey et al. Nov 2007 A1
20070270165 Poosala Nov 2007 A1
20070271375 Hwang Nov 2007 A1
20070271385 Davis et al. Nov 2007 A1
20070271560 Wahlert et al. Nov 2007 A1
20070271608 Shimizu et al. Nov 2007 A1
20070280197 Pearlman et al. Nov 2007 A1
20070280229 Kenney Dec 2007 A1
20070288588 Wein et al. Dec 2007 A1
20070291739 Sullivan et al. Dec 2007 A1
20070294419 Ulevitch Dec 2007 A1
20080005057 Ozzie et al. Jan 2008 A1
20080008089 Bornstein et al. Jan 2008 A1
20080016233 Schneider Jan 2008 A1
20080025304 Venkataswami et al. Jan 2008 A1
20080037536 Padmanabhan et al. Feb 2008 A1
20080046550 Mazur et al. Feb 2008 A1
20080046596 Afergan et al. Feb 2008 A1
20080049615 Bugenhagen Feb 2008 A1
20080056207 Eriksson et al. Mar 2008 A1
20080065724 Seed et al. Mar 2008 A1
20080065745 Leighton et al. Mar 2008 A1
20080066072 Yurekli et al. Mar 2008 A1
20080071859 Seed et al. Mar 2008 A1
20080071987 Karn et al. Mar 2008 A1
20080072264 Crayford Mar 2008 A1
20080082551 Farber et al. Apr 2008 A1
20080082662 Dandliker et al. Apr 2008 A1
20080086434 Chesla Apr 2008 A1
20080086559 Davis et al. Apr 2008 A1
20080086574 Raciborski et al. Apr 2008 A1
20080092242 Rowley Apr 2008 A1
20080101358 Van Ewijk et al. May 2008 A1
20080103805 Shear et al. May 2008 A1
20080104268 Farber et al. May 2008 A1
20080109679 Wright et al. May 2008 A1
20080114829 Button et al. May 2008 A1
20080125077 Velazquez et al. May 2008 A1
20080126706 Newport et al. May 2008 A1
20080134043 Georgis et al. Jun 2008 A1
20080140800 Farber et al. Jun 2008 A1
20080147866 Stolorz et al. Jun 2008 A1
20080147873 Matsumoto Jun 2008 A1
20080155059 Hardin et al. Jun 2008 A1
20080155061 Afergan et al. Jun 2008 A1
20080155613 Benya et al. Jun 2008 A1
20080155614 Cooper et al. Jun 2008 A1
20080162667 Verma et al. Jul 2008 A1
20080162821 Duran et al. Jul 2008 A1
20080162843 Davis et al. Jul 2008 A1
20080172488 Jawahar et al. Jul 2008 A1
20080189437 Halley Aug 2008 A1
20080201332 Souders et al. Aug 2008 A1
20080215718 Stolorz et al. Sep 2008 A1
20080215730 Sundaram et al. Sep 2008 A1
20080215735 Farber et al. Sep 2008 A1
20080215747 Menon et al. Sep 2008 A1
20080215750 Farber et al. Sep 2008 A1
20080215755 Farber et al. Sep 2008 A1
20080222281 Dilley et al. Sep 2008 A1
20080222291 Weller et al. Sep 2008 A1
20080222295 Robinson et al. Sep 2008 A1
20080222647 Taylor et al. Sep 2008 A1
20080228574 Stewart et al. Sep 2008 A1
20080228920 Souders et al. Sep 2008 A1
20080235383 Schneider Sep 2008 A1
20080235400 Slocombe et al. Sep 2008 A1
20080256087 Piironen et al. Oct 2008 A1
20080256175 Lee et al. Oct 2008 A1
20080263135 Olliphant Oct 2008 A1
20080270882 Rollins et al. Oct 2008 A1
20080275772 Suryanarayana et al. Nov 2008 A1
20080281946 Swildens et al. Nov 2008 A1
20080281950 Wald et al. Nov 2008 A1
20080288722 Lecoq et al. Nov 2008 A1
20080301670 Gouge et al. Dec 2008 A1
20080312766 Couckuyt Dec 2008 A1
20080319862 Golan et al. Dec 2008 A1
20080320123 Houlihan et al. Dec 2008 A1
20080320269 Houlihan et al. Dec 2008 A1
20090013063 Soman Jan 2009 A1
20090016236 Alcala et al. Jan 2009 A1
20090029644 Sue et al. Jan 2009 A1
20090031367 Sue Jan 2009 A1
20090031368 Ling Jan 2009 A1
20090031376 Riley et al. Jan 2009 A1
20090043900 Barber Feb 2009 A1
20090049098 Pickelsimer et al. Feb 2009 A1
20090063038 Shrivathsan et al. Mar 2009 A1
20090063704 Taylor et al. Mar 2009 A1
20090070533 Elazary et al. Mar 2009 A1
20090083228 Shatz et al. Mar 2009 A1
20090083279 Hasek Mar 2009 A1
20090086728 Gulati et al. Apr 2009 A1
20090086741 Zhang Apr 2009 A1
20090089869 Varghese Apr 2009 A1
20090094252 Wong et al. Apr 2009 A1
20090103707 McGary et al. Apr 2009 A1
20090106202 Mizrahi Apr 2009 A1
20090106381 Kasriel et al. Apr 2009 A1
20090112703 Brown Apr 2009 A1
20090125393 Hwang et al. May 2009 A1
20090125934 Jones et al. May 2009 A1
20090132368 Cotter et al. May 2009 A1
20090132640 Verma et al. May 2009 A1
20090132648 Swildens et al. May 2009 A1
20090138533 Iwasaki et al. May 2009 A1
20090138582 Turk May 2009 A1
20090144411 Winkler et al. Jun 2009 A1
20090144412 Ferguson et al. Jun 2009 A1
20090150926 Schlack Jun 2009 A1
20090157504 Braemer et al. Jun 2009 A1
20090157850 Gagliardi et al. Jun 2009 A1
20090158163 Stephens et al. Jun 2009 A1
20090164331 Bishop et al. Jun 2009 A1
20090164614 Christian et al. Jun 2009 A1
20090177667 Ramos et al. Jul 2009 A1
20090182815 Czechowski et al. Jul 2009 A1
20090182837 Rogers Jul 2009 A1
20090182945 Aviles et al. Jul 2009 A1
20090187575 DaCosta Jul 2009 A1
20090198817 Sundaram et al. Aug 2009 A1
20090204682 Jeyaseelan et al. Aug 2009 A1
20090210549 Hudson et al. Aug 2009 A1
20090228708 Trostle Sep 2009 A1
20090233623 Johnson Sep 2009 A1
20090241167 Moore Sep 2009 A1
20090248697 Richardson et al. Oct 2009 A1
20090248786 Richardson et al. Oct 2009 A1
20090248787 Sivasubramanian et al. Oct 2009 A1
20090248852 Fuhrmann et al. Oct 2009 A1
20090248858 Sivasubramanian et al. Oct 2009 A1
20090248893 Richardson et al. Oct 2009 A1
20090249222 Schmidt et al. Oct 2009 A1
20090253435 Olofsson Oct 2009 A1
20090254661 Fullagar et al. Oct 2009 A1
20090259588 Lindsay Oct 2009 A1
20090259971 Rankine et al. Oct 2009 A1
20090262741 Jungck et al. Oct 2009 A1
20090271498 Cable Oct 2009 A1
20090271577 Campana et al. Oct 2009 A1
20090271730 Rose et al. Oct 2009 A1
20090276771 Nickolov et al. Nov 2009 A1
20090279444 Ravindran et al. Nov 2009 A1
20090282038 Subotin et al. Nov 2009 A1
20090287750 Banavar et al. Nov 2009 A1
20090307307 Igarashi Dec 2009 A1
20090327489 Swildens et al. Dec 2009 A1
20090327517 Sivasubramanian et al. Dec 2009 A1
20090327914 Adar et al. Dec 2009 A1
20100005175 Swildens et al. Jan 2010 A1
20100011061 Hudson et al. Jan 2010 A1
20100011126 Hsu et al. Jan 2010 A1
20100020699 On Jan 2010 A1
20100023601 Lewin et al. Jan 2010 A1
20100023621 Ezolt et al. Jan 2010 A1
20100030662 Klein Feb 2010 A1
20100030914 Sparks et al. Feb 2010 A1
20100034470 Valencia-Campo et al. Feb 2010 A1
20100036944 Douglis et al. Feb 2010 A1
20100042725 Jeon et al. Feb 2010 A1
20100049862 Dixon Feb 2010 A1
20100057894 Glasser Mar 2010 A1
20100070603 Moss et al. Mar 2010 A1
20100070700 Borst et al. Mar 2010 A1
20100074268 Raza Mar 2010 A1
20100082320 Wood et al. Apr 2010 A1
20100082787 Kommula et al. Apr 2010 A1
20100088367 Brown et al. Apr 2010 A1
20100088369 Sebastian Apr 2010 A1
20100088405 Huang et al. Apr 2010 A1
20100095008 Joshi Apr 2010 A1
20100100629 Raciborski et al. Apr 2010 A1
20100103837 Jungck et al. Apr 2010 A1
20100106934 Calder et al. Apr 2010 A1
20100111059 Bappu et al. May 2010 A1
20100115133 Joshi May 2010 A1
20100115342 Shigeta et al. May 2010 A1
20100121953 Friedman et al. May 2010 A1
20100121981 Drako May 2010 A1
20100122069 Gonion May 2010 A1
20100125626 Lucas et al. May 2010 A1
20100125673 Richardson 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
20100161564 Lee et al. Jun 2010 A1
20100161565 Lee et al. Jun 2010 A1
20100161799 Maloo Jun 2010 A1
20100169392 Lev Ran et al. Jul 2010 A1
20100169452 Atluri et al. Jul 2010 A1
20100174811 Musiri et al. Jul 2010 A1
20100191854 Isci et al. Jul 2010 A1
20100192225 Ma et al. Jul 2010 A1
20100217801 Leighton et al. Aug 2010 A1
20100217856 Falkena Aug 2010 A1
20100223364 Wei Sep 2010 A1
20100226372 Watanabe Sep 2010 A1
20100228819 Wei Sep 2010 A1
20100257024 Holmes et al. Oct 2010 A1
20100257266 Holmes et al. Oct 2010 A1
20100257566 Matila Oct 2010 A1
20100268789 Yoo et al. Oct 2010 A1
20100268814 Cross et al. Oct 2010 A1
20100274765 Murphy et al. Oct 2010 A1
20100281482 Pike et al. Nov 2010 A1
20100293296 Hsu et al. Nov 2010 A1
20100293479 Rousso et al. Nov 2010 A1
20100299427 Joshi Nov 2010 A1
20100299438 Zimmerman et al. Nov 2010 A1
20100299439 McCarthy et al. Nov 2010 A1
20100306382 Cardosa et al. 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
20110016214 Jackson Jan 2011 A1
20110029598 Arnold et al. Feb 2011 A1
20110035469 Smith 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
20110093584 Qiu et al. Apr 2011 A1
20110096987 Morales et al. Apr 2011 A1
20110106949 Patel et al. May 2011 A1
20110113467 Agarwal et al. May 2011 A1
20110125894 Anderson et al. May 2011 A1
20110153938 Verzunov et al. Jun 2011 A1
20110153941 Spatscheck et al. Jun 2011 A1
20110154318 Oshins et al. Jun 2011 A1
20110154350 Doyle et al. Jun 2011 A1
20110161461 Niven-Jenkins Jun 2011 A1
20110166935 Armentrout et al. Jul 2011 A1
20110182290 Perkins Jul 2011 A1
20110191445 Dazzi Aug 2011 A1
20110191446 Dazzi et al. Aug 2011 A1
20110191447 Dazzi et al. Aug 2011 A1
20110191449 Swildens et al. Aug 2011 A1
20110191459 Joshi Aug 2011 A1
20110196892 Xia Aug 2011 A1
20110208876 Richardson et al. Aug 2011 A1
20110208958 Stuedi et al. Aug 2011 A1
20110209064 Jorgensen et al. Aug 2011 A1
20110219120 Farber et al. Sep 2011 A1
20110219372 Agarwal et al. Sep 2011 A1
20110238501 Almeida Sep 2011 A1
20110238793 Bedare et al. Sep 2011 A1
20110239215 Sugai Sep 2011 A1
20110252142 Richardson et al. Oct 2011 A1
20110252143 Baumback et al. Oct 2011 A1
20110255445 Johnson 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
20110296370 Ferris et al. Dec 2011 A1
20110296473 Babic Dec 2011 A1
20110302304 Baumback et al. Dec 2011 A1
20110307533 Saeki Dec 2011 A1
20110320522 Endres et al. Dec 2011 A1
20110320559 Foti Dec 2011 A1
20120011190 Driesen et al. Jan 2012 A1
20120014249 Mao et al. Jan 2012 A1
20120023090 Holloway et al. Jan 2012 A1
20120023226 Petersen et al. Jan 2012 A1
20120036238 Sundaram et al. Feb 2012 A1
20120041899 Greene et al. Feb 2012 A1
20120041970 Ghosh et al. Feb 2012 A1
20120054860 Wyschogrod et al. Feb 2012 A1
20120066360 Ghosh Mar 2012 A1
20120072600 Richardson et al. Mar 2012 A1
20120072608 Peters et al. Mar 2012 A1
20120078998 Son et al. Mar 2012 A1
20120079096 Cowan et al. Mar 2012 A1
20120079115 Richardson et al. Mar 2012 A1
20120089700 Safruti et al. Apr 2012 A1
20120089972 Scheidel et al. Apr 2012 A1
20120096065 Suit et al. Apr 2012 A1
20120096166 Devarapalli et al. Apr 2012 A1
20120110515 Abramoff et al. May 2012 A1
20120117621 Kondamuru et al. May 2012 A1
20120124184 Sakata et al. May 2012 A1
20120131177 Brandt et al. May 2012 A1
20120136697 Peles et al. May 2012 A1
20120142310 Pugh et al. Jun 2012 A1
20120143688 Alexander Jun 2012 A1
20120159476 Ramteke et al. Jun 2012 A1
20120166516 Simmons et al. Jun 2012 A1
20120169646 Berkes et al. Jul 2012 A1
20120173760 Jog et al. Jul 2012 A1
20120179796 Nagaraj et al. Jul 2012 A1
20120179817 Bade et al. Jul 2012 A1
20120179839 Raciborski et al. Jul 2012 A1
20120198043 Hesketh et al. Aug 2012 A1
20120198071 Black et al. Aug 2012 A1
20120209942 Zehavi et al. Aug 2012 A1
20120224516 Stojanovski et al. Sep 2012 A1
20120226649 Kovacs et al. Sep 2012 A1
20120233329 Dickinson et al. Sep 2012 A1
20120233522 Barton et al. Sep 2012 A1
20120233668 Leafe et al. Sep 2012 A1
20120239725 Hartrick et al. Sep 2012 A1
20120246129 Rothschild et al. Sep 2012 A1
20120246257 Brown Sep 2012 A1
20120254961 Kim et al. Oct 2012 A1
20120257628 Bu et al. Oct 2012 A1
20120259954 McCarthy et al. Oct 2012 A1
20120272224 Brackman Oct 2012 A1
20120278229 Vishwanathan et al. Nov 2012 A1
20120278831 van Coppenolle et al. Nov 2012 A1
20120297009 Amir et al. Nov 2012 A1
20120303785 Sivasubramanian et al. Nov 2012 A1
20120303804 Sundaram et al. Nov 2012 A1
20120311648 Swildens et al. Dec 2012 A1
20120317573 Osogami et al. Dec 2012 A1
20120324089 Joshi Dec 2012 A1
20130003547 Motwani et al. Jan 2013 A1
20130003735 Chao et al. Jan 2013 A1
20130007100 Trahan et al. Jan 2013 A1
20130007101 Trahan et al. Jan 2013 A1
20130007102 Trahan et al. Jan 2013 A1
20130007241 Trahan et al. Jan 2013 A1
20130007273 Baumback et al. Jan 2013 A1
20130018945 Vendrow et al. Jan 2013 A1
20130019311 Swildens et al. Jan 2013 A1
20130034099 Hikichi et al. Feb 2013 A1
20130036307 Gagliano et al. Feb 2013 A1
20130041872 Aizman et al. Feb 2013 A1
20130046869 Jenkins et al. Feb 2013 A1
20130046883 Lientz et al. Feb 2013 A1
20130054675 Jenkins et al. Feb 2013 A1
20130055374 Kustarz et al. Feb 2013 A1
20130061306 Sinn Mar 2013 A1
20130067530 Spektor et al. Mar 2013 A1
20130073808 Puthalath et al. Mar 2013 A1
20130080420 Taylor et al. Mar 2013 A1
20130080421 Taylor et al. Mar 2013 A1
20130080576 Taylor et al. Mar 2013 A1
20130080577 Taylor et al. Mar 2013 A1
20130080623 Thireault Mar 2013 A1
20130080627 Kukreja et al. Mar 2013 A1
20130080636 Friedman et al. Mar 2013 A1
20130086001 Bhogal et al. Apr 2013 A1
20130089005 Li et al. Apr 2013 A1
20130111035 Alapati et al. May 2013 A1
20130117282 Mugali, Jr. et al. May 2013 A1
20130117849 Golshan et al. May 2013 A1
20130130221 Kortemeyer et al. May 2013 A1
20130133057 Yoon et al. May 2013 A1
20130151646 Chidambaram et al. Jun 2013 A1
20130191499 Ludin et al. Jul 2013 A1
20130198341 Kim Aug 2013 A1
20130212300 Eggleston et al. Aug 2013 A1
20130219020 McCarthy et al. Aug 2013 A1
20130227165 Liu Aug 2013 A1
20130246567 Green et al. Sep 2013 A1
20130254269 Sivasubramanian et al. Sep 2013 A1
20130254879 Chesla et al. Sep 2013 A1
20130263256 Dickinson et al. Oct 2013 A1
20130268616 Sakata et al. Oct 2013 A1
20130275549 Field et al. Oct 2013 A1
20130279335 Ahmadi Oct 2013 A1
20130283266 Baset et al. Oct 2013 A1
20130305046 Mankovski et al. Nov 2013 A1
20130305083 Machida Nov 2013 A1
20130311583 Humphreys et al. Nov 2013 A1
20130311605 Richardson et al. Nov 2013 A1
20130311989 Ota et al. Nov 2013 A1
20130339429 Richardson et al. Dec 2013 A1
20130346465 Maltz et al. Dec 2013 A1
20130346470 Obstfeld et al. Dec 2013 A1
20130346567 Richardson et al. Dec 2013 A1
20130346614 Baughman et al. Dec 2013 A1
20140006577 Joe et al. Jan 2014 A1
20140007239 Sharpe et al. Jan 2014 A1
20140013403 Shuster Jan 2014 A1
20140019605 Boberg Jan 2014 A1
20140022951 Lemieux Jan 2014 A1
20140036675 Wang et al. Feb 2014 A1
20140040478 Hsu et al. Feb 2014 A1
20140047104 Rodriguez Feb 2014 A1
20140053022 Forgette et al. Feb 2014 A1
20140059198 Richardson et al. Feb 2014 A1
20140059379 Ren et al. Feb 2014 A1
20140082165 Marr et al. Mar 2014 A1
20140082614 Klein et al. Mar 2014 A1
20140089917 Attalla et al. Mar 2014 A1
20140108474 David et al. Apr 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
20140143305 Choi et al. May 2014 A1
20140149601 Carney et al. May 2014 A1
20140164817 Bartholomy et al. Jun 2014 A1
20140165061 Greene et al. Jun 2014 A1
20140195686 Yeager et al. Jul 2014 A1
20140200036 Egner et al. Jul 2014 A1
20140215019 Ahrens Jul 2014 A1
20140244937 Bloomstein et al. Aug 2014 A1
20140269371 Badea et al. Sep 2014 A1
20140280606 Long Sep 2014 A1
20140280679 Dey et al. Sep 2014 A1
20140297866 Ennaji et al. Oct 2014 A1
20140297870 Eggleston et al. Oct 2014 A1
20140298021 Kwon et al. Oct 2014 A1
20140310402 Giaretta et al. Oct 2014 A1
20140310811 Hentunen Oct 2014 A1
20140325155 Marshall et al. Oct 2014 A1
20140331328 Wang et al. Nov 2014 A1
20140337472 Newton et al. Nov 2014 A1
20140351413 Smith et al. Nov 2014 A1
20140351871 Bomfim et al. Nov 2014 A1
20150006615 Wainner et al. Jan 2015 A1
20150019686 Backholm Jan 2015 A1
20150026407 Mclellan et al. Jan 2015 A1
20150067171 Yum Mar 2015 A1
20150074228 Drake Mar 2015 A1
20150081877 Sethi et al. Mar 2015 A1
20150088964 Shiell et al. Mar 2015 A1
20150088972 Brand et al. Mar 2015 A1
20150089621 Khalid Mar 2015 A1
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
20150172414 Richardson et al. Jun 2015 A1
20150172415 Richardson et al. Jun 2015 A1
20150188734 Petrov Jul 2015 A1
20150189042 Sun et al. Jul 2015 A1
20150195244 Richardson et al. Jul 2015 A1
20150200991 Kwon Jul 2015 A1
20150207733 Richardson et al. Jul 2015 A1
20150215656 Pulung et al. Jul 2015 A1
20150229710 Sivasubramanian et al. Aug 2015 A1
20150244580 Saavedra Aug 2015 A1
20150256647 Richardson et al. Sep 2015 A1
20150271031 Beevers Sep 2015 A1
20150288647 Chhabra et al. Oct 2015 A1
20150317118 Orikasa et al. Nov 2015 A1
20150319260 Watson Nov 2015 A1
20150339136 Suryanarayanan et al. Nov 2015 A1
20150341431 Hartrick et al. Nov 2015 A1
20150095516 Bergman Dec 2015 A1
20150358276 Liu et al. Dec 2015 A1
20150358436 Kim et al. Dec 2015 A1
20150363113 Rahman et al. Dec 2015 A1
20150363282 Rangasamy Dec 2015 A1
20160006672 Saavedra Jan 2016 A1
20160021197 Pogrebinsky et al. Jan 2016 A1
20160026568 Marshall et al. Jan 2016 A1
20160028598 Khakpour et al. Jan 2016 A1
20160028755 Vasseur et al. Jan 2016 A1
20160036857 Foxhoven et al. Feb 2016 A1
20160041910 Richardson et al. Feb 2016 A1
20160065475 Hilt et al. Mar 2016 A1
20160065665 Richardson et al. Mar 2016 A1
20160072669 Saavedra Mar 2016 A1
20160072720 Richardson et al. Mar 2016 A1
20160104346 Ovalle et al. Apr 2016 A1
20160132600 Woodhead et al. May 2016 A1
20160142251 Contreras et al. May 2016 A1
20160182454 Phonsa et al. Jun 2016 A1
20160182542 Staniford Jun 2016 A1
20160241637 Marr et al. Aug 2016 A1
20160241639 Brookins et al. Aug 2016 A1
20160253262 Nadgowda Sep 2016 A1
20160255042 Newton Sep 2016 A1
20160269927 Kim et al. Sep 2016 A1
20160274929 King Sep 2016 A1
20160294678 Khakpour et al. Oct 2016 A1
20160337426 Shribman et al. Nov 2016 A1
20160366202 Phillips et al. Dec 2016 A1
20170041428 Katsev Feb 2017 A1
20170099254 Leach et al. Apr 2017 A1
20170099345 Leach Apr 2017 A1
20170109316 Hack et al. Apr 2017 A1
20170126796 Hollis et al. May 2017 A1
20170142062 Richardson et al. May 2017 A1
20170153980 Araújo et al. Jun 2017 A1
20170155678 Araújo et al. Jun 2017 A1
20170155732 Araújo et al. Jun 2017 A1
20170163425 Kaliski, Jr. Jun 2017 A1
20170170973 Gill 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
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
20180063193 Chandrashekhar et al. Mar 2018 A1
20180077109 Hoeme et al. Mar 2018 A1
20180077110 Huston, III et al. Mar 2018 A1
20180097631 Uppal et al. Apr 2018 A1
20180097634 Uppal et al. Apr 2018 A1
20180097831 Uppal et al. Apr 2018 A1
20180109553 Radlein et al. Apr 2018 A1
20180159757 Uppal et al. Jun 2018 A1
20180159769 Richardson et al. Jun 2018 A1
20180167444 Sivasubramanian et al. Jun 2018 A1
20180167469 Sivasubramanian et al. Jun 2018 A1
20180173526 Prinsloo et al. Jun 2018 A1
20180183689 Ellsworth et al. Jun 2018 A1
20180191817 Richardson et al. Jul 2018 A1
20180212880 Mostert Jul 2018 A1
20180213052 Maccarthaigh et al. Jul 2018 A1
20180246982 Lepeska Aug 2018 A1
20180278717 Richardson et al. Sep 2018 A1
20180287916 Mizik et al. Oct 2018 A1
20180302322 Richardson et al. Oct 2018 A1
20180332107 Marr et al. Nov 2018 A1
20180351904 Mizik et al. Dec 2018 A1
20180367498 Bliss et al. Dec 2018 A1
20190007515 Baldwin et al. Jan 2019 A1
20190020562 Richardson et al. Jan 2019 A1
20190028562 Watson et al. Jan 2019 A1
20190044787 Richardson et al. Feb 2019 A1
20190044846 Howard et al. Feb 2019 A1
20190073303 Marshall et al. Mar 2019 A1
20190089542 Richardson et al. Mar 2019 A1
20190098109 Watson Mar 2019 A1
20190121739 Richardson et al. Apr 2019 A1
20190129908 Kumarasamy Apr 2019 A1
20190140922 Ellsworth et al. May 2019 A1
20190173941 Puchala et al. May 2019 A1
20190173972 MacCarthaigh et al. Jun 2019 A1
20190190998 Sivasubramanian et al. Jun 2019 A1
20190222666 Uppal et al. Jun 2019 A1
20190268265 Richardson et al. Jul 2019 A1
20190297137 Richardson et al. Sep 2019 A1
Foreign Referenced Citations (42)
Number Date Country
2741 895 May 2010 CA
2765397 Feb 2011 CA
1422468 Jun 2003 CN
1511399 Jul 2004 CN
1605182 Apr 2005 CN
101189598 May 2008 CN
101460907 Jun 2009 CN
103731481 Apr 2014 CN
1603307 Dec 2005 EP
1351141 Oct 2007 EP
2008167 Dec 2008 EP
3156911 Apr 2017 EP
07-141305 Jun 1995 JP
2001-0506093 May 2001 JP
2001-249907 Sep 2001 JP
2002-024192 Jan 2002 JP
2002-044137 Feb 2002 JP
2002-323986 Nov 2002 JP
2003-167810 Jun 2003 JP
2003-167813 Jun 2003 JP
2003-188901 Jul 2003 JP
2003-522358 Jul 2003 JP
2004-070935 Mar 2004 JP
2004-532471 Oct 2004 JP
2004-533738 Nov 2004 JP
2005-537687 Dec 2005 JP
2007-133896 May 2007 JP
2007-207225 Aug 2007 JP
2008-515106 May 2008 JP
2009-071538 Apr 2009 JP
2012-509623 Apr 2012 JP
2012-209623 Oct 2012 JP
WO 2002069608 Sep 2002 WO
WO 2005071560 Aug 2005 WO
WO 2007007960 Jan 2007 WO
WO 2007126837 Nov 2007 WO
WO 2009124006 Oct 2009 WO
WO 2010002603 Jan 2010 WO
WO 2012044587 Apr 2012 WO
WO 2012065641 May 2012 WO
WO 2014047073 Mar 2014 WO
WO 2017106455 Jun 2017 WO
Non-Patent Literature Citations (185)
Entry
B. T. H. Kumar, L. Vibha and K. R. Venugopal, “Web page access prediction using hierarchical clustering based on modified levenshtein distance and higher order Markov model,” 2016 IEEE Region 10 Symposium (TENSYMP), Bali, 2016, pp. 1-6. (Year: 2016).
N. R. Mabroukeh and C. I. Ezeife, “Semantic-Rich Markov Models for Web Prefetching,” 2009 IEEE International Conference on Data Mining Workshops, Miami, FL, 2009, pp. 465-470. (Year: 2009).
T.P. Tran et al. “An Efficient Web-Page Recommender System using Frequent Pattern Discovery and Dynamic Markov Models”. International Journal of Web Application vol. 3 No. 1 Mar. 2011. pp. 1-11. (Year: 2011).
N. J. Tuah, M. Kumar, and S. Venkatesh. 2003. Resource-aware speculative prefetching in wireless networks. Wirel. Netw. 9, 1 (Jan. 2003), pp. 61-72. (Year: 2003).
X. Gu and Z. Li, “Application of the Data Mining in the Personalized Information Service,” 2011 International Conference on Management and Service Science, Wuhan, 2011, pp. 1-4. (Year: 2011).
Z. Jiang and L. Kleinrock, “An adaptive network prefetch scheme,” in IEEE Journal on Selected Areas in Communications, vol. 16, No. 3, pp. 358-368, Apr. 1998. (Year: 1998).
Office Action in Application No. 09729072.0 dated May 14, 2018.
Examination Report in Indian Application No. 6213/CHENP/2010 dated May 23, 2018.
International Preliminary Report on Patentability in PCT/US/2016/066848 dated Jun. 19, 2018.
“Non-Final Office Action dated Jan. 3, 2012,” U.S. Appl. No. 12/652,541, filed Jan. 3, 2012; 35 pages.
“Final Office Action dated Sep. 5, 2012,” U.S. Appl. No. 12/652,541, filed Sep. 5, 2012; 40 pages.
“Notice of Allowance dated Jan. 4, 2013,” U.S. Appl. No. 12/652,541, filed Jan. 4, 2013; 11 pages.
“Non-Final Office Action dated Apr. 30, 2014,” U.S. Appl. No. 13/842,970; 20 pages.
“Final Office Action dated Aug. 19, 2014,” U.S. Appl. No. 13/842,970; 13 pages.
“Notice of Allowance dated Dec. 5, 2014,” U.S. Appl. No. 13/842,970; 6 pages.
Canonical Name (CNAME) DNS Records, domainavenue.com, Feb. 1, 2001, XP055153783, Retrieved from the Internet: URL:http://www.domainavenue.com/cname.htm [retrieved on Nov. 18, 2014].
“Content delivery network”, Wikipedia, the free encyclopedia, Retrieved from the Internet: URL:http://en.wikipedia.org/w/index.php?title=Contentdelivery network&oldid=6010099 70, XP055153445, Mar. 24, 2008.
“Global Server Load Balancing with ServerIron,” Foundry Networks, retrieved Aug. 30, 2007, from http://www.foundrynet.com/pdf/an-global-server-load-bal.pdf, 7 pages.
“Grid Computing Solutions,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/grid, 3 pages.
“Grid Offerings,” Java.net, retrieved May 3, 2006, from http://wiki.java.net/bin/view/Sungrid/OtherGridOfferings, 8 pages.
“Recent Advances Boost System Virtualization,” eWeek.com, retrieved from May 3, 2006, http://www.eWeek.com/article2/0,1895,1772626,00.asp, 5 pages.
“Scaleable Trust of Next Generation Management (STRONGMAN),” retrieved May 17, 2006, from http://www.cis.upenn.edu/˜dsl/STRONGMAN/, 4 pages.
“Sun EDA Compute Ranch,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://sun.com/processors/ranch/brochure.pdf, 2 pages.
“Sun Microsystems Accelerates UltraSP ARC Processor Design Program With New Burlington, Mass. Compute Ranch,” Nov. 6, 2002, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2002-11/sunflash.20021106.3 .xml, 2 pages.
“Sun N1 Grid Engine 6,” Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/software/gridware/index.xml, 3 pages.
“Sun Opens New Processor Design Compute Ranch,” Nov. 30, 2001, Sun Microsystems, Inc., retrieved May 3, 2006, from http://www.sun.com/smi/Press/sunflash/2001-11/sunflash.20011130.1.xml, 3 pages.
“The Softricity Desktop,” Softricity, Inc., retrieved May 3, 2006, from http://www.softricity.com/products/, 3 pages.
“Xen—The Xen virtual Machine Monitor,” University of Cambridge Computer Laboratory, retrieved Nov. 8, 2005, from http://www.cl.cam.ac.uk/Research/SRG/netos/xen/, 2 pages.
“XenFaq,” retrieved Nov. 8, 2005, from http://wiki.xensource.com/xenwiki/XenFaq?action=print, 9 pages.
Abi, Issam, et al., “A Business Driven Management Framework for Utility Computing Environments,” Oct. 12, 2004, HP Laboratories Bristol, HPL-2004-171, retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2004/HPL-2004-171.pdf, 14 pages.
American Bar Association; Digital Signature Guidelines Tutorial [online]; Feb. 10, 2002 [retrieved on Mar. 2, 2010]; American Bar Association Section of Science and Technology Information Security Committee; Retrieved from the internet: (URL: http://web.archive.org/web/20020210124615/www.abanet.org/scitech/ec/isc/dsg-tutorial.html; pp. 1-8.
Armour et al.: “A Heuristic Algorithm and Simulation Approach to Relative Location of Facilities”; Management Science, vol. 9, No. 2 (Jan. 1963); pp. 294-309.
Baglioni et al., “Preprocessing and Mining Web Log Data for Web Personalization”, LNAI 2829, 2003, pp. 237-249.
Barbir, A., et al., “Known Content Network (CN) Request-Routing Mechanisms”, Request for Comments 3568, [online], IETF, Jul. 2003, [retrieved on Feb. 26, 2013], Retrieved from the Internet: (URL: http://tools.ietf.org/rfc/rfc3568.txt).
Bellovin, S., “Distributed Firewalls,”;login;:37-39, Nov. 1999, http://www.cs.columbia.edu/-smb/papers/distfw. html, 10 pages, retrieved Nov. 11, 2005.
Blaze, M., “Using the KeyNote Trust Management System,” Mar. 1, 2001, from http://www.crypto.com/trustmgt/kn.html, 4 pages, retrieved May 17, 2006.
Brenton, C., “What is Egress Filtering and How Can I Implement It?—Egress Filtering v 0.2,” Feb. 29, 2000, SANS Institute, http://www.sans.org/infosecFAQ/firewall/egress.htm, 6 pages.
Byun et al., “A Dynamic Grid Services Deployment Mechanism for On-Demand Resource Provisioning”, IEEE International Symposium on Cluster Computing and the Grid:863-870, 2005.
Chipara et al, “Realtime Power-Aware Routing in Sensor Network”, IEEE, 2006, 10 pages.
Clark, C., “Live Migration of Virtual Machines,” May 2005, NSDI '05: 2nd Symposium on Networked Systems Design and Implementation, Boston, MA, May 2-4, 2005, retrieved from http://www.usenix.org/events/nsdi05/tech/full_papers/clark/clark.pdf, 14 pages.
Coulson, D., “Network Security Iptables,” Apr. 2003, Linuxpro, Part 2, retrieved from http://davidcoulson.net/writing/lxf/38/iptables.pdf, 4 pages.
Coulson, D., “Network Security Iptables,” Mar. 2003, Linuxpro, Part 1, retrieved from http://davidcoulson.net/writing/lxf/39/iptables.pdf, 4 pages.
Deleuze, C., et al., A DNS Based Mapping Peering System for Peering CDNs, draft-deleuze-cdnp-dnsmap-peer-00.txt, Nov. 20, 2000, 20 pages.
Demers, A., “Epidemic Algorithms for Replicated Database Maintenance,” 1987, Proceedings of the sixth annual ACM Symposium on Principles of Distributed Computing, Vancouver, British Columbia, Canada, Aug. 10-12, 1987, 12 pages.
Gruener, J., “A Vision of Togetherness,” May 24, 2004, NetworkWorld, retrieved May 3, 2006, from, http://www.networkworld.com/supp/2004/ndc3/0524virt.html, 9 pages.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”,May 2005, In Proc. Of Networking 2005, all pages.
Gunther et al, “Measuring Round Trip Times to determine the Distance between WLAN Nodes”, Dec. 18, 2004, Technical University Berlin, all pages.
Guo, F., Understanding Memory Resource Management in Vmware vSphere 5.0, Vmware, 2011, pp. 1-29.
Hameed, CC, “Disk Fragmentation and System Performance”, Mar. 14, 2008, 3 pages.
Hartung et al.; Digital rights management and watermarking of multimedia content for m-commerce applications; Published in: Communications Magazine, IEEE (vol. 38, Issue: 11 ); Date of Publication: Nov. 2000; pp. 78-84; IEEE Xplore.
Horvath et al., “Enhancing Energy Efficiency in Multi-tier Web Server Clusters via Prioritization,” in Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International , vol., No., pp. 1-6, Mar. 26-30, 2007.
Ioannidis, S., et al., “Implementing a Distributed Firewall,” Nov. 2000, (ACM) Proceedings of the ACM Computer and Communications Security (CCS) 2000, Athens, Greece, pp. 190-199, retrieved from http://www.cis.upenn.edu/˜dls/STRONGMAN/Papers/df.pdf, 10 pages.
Joseph, Joshy, et al., “Introduction to Grid Computing,” Apr. 16, 2004, retrieved Aug. 30, 2007, from http://www.informit.com/articles/printerfriendly.aspx?p=169508, 19 pages.
Kalafut et al., Understanding Implications of DNS Zone Provisioning., Proceeding IMC '08 Proceedings of the 8th AMC SIGCOMM conference on Internet measurement., pp. 211-216., ACM New York, NY, USA., 2008.
Kato, Yoshinobu , Server load balancer—Difference in distribution technique and supported protocol—Focus on function to meet the needs, Nikkei Communications, Japan, Nikkei Business Publications, Inc., Mar. 20, 2000, vol. 314, pp. 114 to 123.
Kenshi, P., “Help File Library: Iptables Basics,” Justlinux, retrieved Dec. 1, 2005, from http://www.justlinux.com/nhf/Security/Iptables _ Basics.html, 4 pages.
Krsul et al., “VMPlants: Providing and Managing Virtual Machine Execution Environments for Grid Computing”, Nov. 6, 2004 (Nov. 6, 2004), Supercomputing, 2004. Proceedings of the ACM/IEEE SC2004 Conference Pittsburgh, PA, USA Nov. 6-12, 2004, Piscataway, NJ, USA, IEEE, 1730 Massachusetts Ave., NW Washington, DC 20036-1992 USA, 12 pages.
Liu, “The Ultimate Guide to Preventing DNS-based DDoS Attacks”, Retrieved from http://www.infoworld.com/article/2612835/security/the-ultimate-guide-to-preventing-dns-based-ddos-attacks.html, Published Oct. 30, 2013.
Liu et al., “Combined mining of Web server logs and web contents for classifying user navigation patterns and predicting users' future requests,” Data & Knowledge Engineering 61 (2007) pp. 304-330.
Maesono, et al., “A Local Scheduling Method considering Data Transfer in Data Grid,” Technical Report of IEICE, vol. 104, No. 692, pp. 435-440, The Institute of Electronics, Information and Communication Engineers, Japan, Feb. 2005.
Meng et al., “Improving the Scalability of Data Center Networks with Traffic-Aware Virtual Machine Placement”; Proceedings of the 29th Conference on Information Communications, INFOCOM'10, pp. 1154-1162. Piscataway, NJ. IEEE Press, 2010.
Mulligan et al.; How DRM-based content delivery systems disrupt expectations of “personal use”; Published in: Proceeding DRM '03 Proceedings of the 3rd ACM workshop on Digital rights management; 2003; pp. 77-89; ACM Digital Library.
Ragan, “Three Types of DNS Attacks and How to Deal with Them”, Retrieved from http://www.csoonline.com/article/2133916/malware-cybercrime/three-types-of-dns-attacks-and-how-to-deal-with-them.html, Published Aug. 28, 2013.
Shankland, S., “Sun to buy start-up to bolster N1,” Jul. 30, 2003, CNet News.com, retrieved May 3, 2006, http://news.zdnet.com/2100-3513_22-5057752.html, 8 pages.
Sharif et al, “Secure In-VM Monitoring Using Hardware Virtualization”, Microsoft, Oct. 2009 http://research.microsoft.com/pubs/153179/sim-ccs09.pdf; 11 pages.
Strand, L., “Adaptive distributed firewall using intrusion detection,” Nov. 1, 2004, University of Oslo Department of Informatics, retrieved Mar. 8, 2006, from http://gnist.org/˜lars/studies/master/StrandLars-master.pdf, 158 pages.
Takizawa, et al., “Scalable MultiReplication Framework on the Grid,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2004, No. 81, pp. 247-252, Japan, Aug. 1, 2004.
Tan et al., “Classification: Basic Concepts, Decision Tree, and Model Evaluation”, Introduction in Data Mining; http://www-users.cs.umn.edu/˜kumar/dmbook/ch4.pdf, 2005, pp. 245-205.
Van Renesse, R., “Astrolabe: A Robust and Scalable Technology for Distributed System Monitoring, Management, and Data Mining,” May 2003, ACM Transactions on Computer Systems (TOCS), 21 (2): 164-206, 43 pages.
Vijayan, J., “Terraspring Gives Sun's N1 a Boost,” Nov. 25, 2002, Computerworld, retrieved May 3, 2006, from http://www.computerworld.com/printthis/2002/0,4814, 76159,00.html, 3 pages.
Virtual Iron Software Home, Virtual Iron, retrieved May 3, 2006, from http://www.virtualiron.com/, 1 page.
Waldspurger, CA., “Spawn: A Distributed Computational Economy,” Feb. 1992, IEEE Transactions on Software Engineering, 18(2): 103-117, 15 pages.
Watanabe, et al., “Remote Program Shipping System for GridRPC Systems,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2003, No. 102, pp. 73-78, Japan, Oct. 16, 2003.
Xu et al., “Decision tree regression for soft classification of remote sensing data”, Remote Sensing of Environment 97 (2005) pp. 322-336.
Yamagata, et al., “A virtual-machine based fast deployment tool for Grid execution environment,” Report of Study of Information Processing Society of Japan, Information Processing Society, vol. 2006, No. 20, pp. 127-132, Japan, Feb. 28, 2006.
Zhao et al., “Distributed file system support for virtual machines in grid computing”, Jun. 4, 2004 (Jun. 4, 2004), High Performance Distributed Computing, 2004. Proceedings. 13th IEEE International Symposium on Honolulu, HI, USA Jun. 4-6, 2004, Piscataway, NJ, USA, IEEE, pp. 202-211.
Zhu, Xiaoyun, et al., “Utility-Driven Workload Management Using Nested Control Design,” Mar. 29, 2006, HP Laboratories Palo Alto, HPL-2005-193(R.1), retrieved Aug. 30, 2007, from http://www.hpl.hp.com/techreports/2005/HPL-2005-193R1.pdf, 9 pages.
Supplementary European Search Report in Application No. 09729072.0 2266064 dated Dec. 10, 2014.
First Singapore Written Opinion in Application No. 201006836-9, dated Oct. 12, 2011 in 12 pages.
Singapore Written Opinion in Application No. 201006836-9, dated Apr. 30, 2012 in 10 pages.
First Office Action in Chinese Application No. 200980111422.3 dated Apr. 13, 2012.
First Office Action in Japanese Application No. 2011-502138 dated Feb. 1, 2013.
Singapore Written Opinion in Application No. 201006837-7, dated Oct. 12, 2011 in 11 pages.
Supplementary European Search Report in Application No. 09727694.3 dated Jan. 30, 2012 in 6 pages.
Singapore Examination Report in Application No. 201006837-7 dated Mar. 16, 2012.
First Office Action in Chinese Application No. 200980111426.1 dated Feb. 16, 2013.
Second Office Action in Chinese Application No. 200980111426.1 dated Dec. 25, 2013.
Third Office Action in Chinese Application No. 200980111426.1 dated Jul. 7, 2014.
Fourth Office Action in Chinese Application No. 200980111426.1 dated Jan. 15, 2015.
Fifth Office Action in Chinese Application No. 200980111426.1 dated Aug. 14, 2015.
First Office Action in Japanese Application No. 2011-502139 dated Nov. 5, 2013.
Decision of Rejection in Application No. 2011-502139 dated Jun. 30, 2014.
Office Action in Japanese Application No. 2011-502139 dated Aug. 17, 2015.
Office Action in Indian Application No. 5937/CHENP/2010 dated Jan. 19, 2018.
Singapore Written Opinion in Application No. 201006874-0, dated Oct. 12, 2011 in 10 pages.
First Office Action in Japanese Application No. 2011-502140 dated Dec. 7, 2012.
First Office Action in Chinese Application No. 200980119995.0 dated Jul. 6, 2012.
Second Office Action in Chinese Application No. 200980119995.0 dated Apr. 15, 2013.
Examination Report in Singapore Application No. 201006874-0 dated May 16, 2012.
Search Report in European Application No. 09839809.2 dated May 11, 2015.
Office Action in European Application No. 09839809.2 dated Dec. 8, 2016.
Office Action in Indian Application No. 6210/CHENP/2010 dated Mar. 27, 2018.
Supplementary European Search Report in Application No. 09728756.9 dated Jan. 8, 2013.
First Office Action in Chinese Application No. 200980119993.1 dated Jul. 4, 2012.
Second Office Action in Chinese Application No. 200980119993.1 dated Mar. 12, 2013.
Third Office Action in Chinese Application No. 200980119993.1 dated Oct. 21, 2013.
First Office Action in Japanese Application No. 2011-503091 dated Nov. 18, 2013.
Office Action in Japanese Application No. 2014-225580 dated Oct. 26, 2015.
Office Action in Japanese Application No. 2014-225580 dated Oct. 3, 2016.
Search Report and Written Opinion issued in Singapore Application No. 201006873-2 dated Oct. 12, 2011.
First Office Action is Chinese Application No. 200980125551.8 dated Jul. 4, 2012.
First Office Action in Japanese Application No. 2011-516466 dated Mar. 6, 2013.
Second Office Action in Japanese Application No. 2011-516466 dated Mar. 17, 2014.
Decision of Refusal in Japanese Application No. 2011-516466 dated Jan. 16, 2015.
Office Action in Japanese Application No. 2011-516466 dated May 30, 2016.
Office Action in Canadian Application No. 2726915 dated May 13, 2013.
First Office Action in Korean Application No. 10-2011-7002461 dated May 29, 2013.
First Office Action in Chinese Application No. 200980145872.4 dated Nov. 29, 2012.
First Office Action in Canadian Application No. 2741895 dated Feb. 25, 2013.
Second Office Action in Canadian Application No. 2741895 dated Oct. 21, 2013.
Partial Supplementary Search Report in European Application No. 09826977.2 dated Oct. 4, 2016.
Search Report and Written Opinion in Singapore Application No. 201103333-9 dated Nov. 19, 2012.
Examination Report in Singapore Application No. 201103333-9 dated Aug. 13, 2013.
Office Action in Chinese Application No. 201310717573.1 dated Jul. 29, 2016.
Office Action in European Application No. 11767118.0 dated Feb. 3, 2017.
International Search Report and Written Opinion in PCT/US2011/053302 dated Nov. 28, 2011 in 11 pages.
International Preliminary Report on Patentability in PCT/US2011/053302 dated Apr. 2, 2013.
First Office Action in Japanese Application No. 2013-529454 dated Feb. 3, 2014 in 6 pages.
Office Action in Japanese Application No. 2013-529454 dated Mar. 9, 2015 in 8 pages.
First Office Action issued in Australian Application No. 2011307319 dated Mar. 6, 2014 in 5 pages.
Search Report and Written Opinion in Singapore Application No. 201301573-0 dated Jul. 1, 2014.
First Office Action in Chinese Application No. 201180046104.0 dated Nov. 3, 2014.
Second Office Action in Chinese Application No. 201180046104.0 dated Sep. 29, 2015.
Third Office Action in Chinese Application No. 201180046104.0 dated Apr. 14, 2016.
Decision of Rejection in Chinese Application No. 201180046104.0 dated Oct. 17, 2016.
Examination Report in Singapore Application No. 201301573-0 dated Dec. 22, 2014.
International Preliminary Report on Patentability in PCT/US2011/061486 dated May 22, 2013.
International Search Report and Written Opinion in PCT/US2011/061486 dated Mar. 30, 2012 in 11 pages.
Office Action in Canadian Application No. 2816612 dated Nov. 3, 2015.
Office Action in Canadian Application No. 2816612 dated Oct. 7, 2016.
Office Action in Canadian Application No. 2816612 dated Aug. 8, 2017.
First Office Action in Chinese Application No. 201180053405.6 dated Feb. 10, 2015.
Second Office Action in Chinese Application No. 201180053405.6 dated Dec. 4, 2015.
Office Action in Japanese Application No. 2013-540982 dated Jun. 2, 2014.
Written Opinion in Singapore Application No. 201303521-7 dated May 20, 2014.
Office Action in Japanese Application No. 2015-533132 dated Apr. 25, 2016.
Office Action in Canadian Application No. 2884796 dated Apr. 28, 2016.
Office Action in Russian Application No. 2015114568 dated May 16, 2016.
Supplementary Examination Report in Singapore Application No. 11201501987U dated May 17, 2017.
International Search Report and Written Opinion in PCT/US07/07601 dated Jul. 18, 2008 in 11 pages.
International Preliminary Report on Patentability in PCT/US2007/007601 dated Sep. 30, 2008 in 8 pages.
Supplementary European Search Report in Application No. 07754164.7 dated Dec. 20, 2010 in 7 pages.
Office Action in Chinese Application No. 200780020255.2 dated Mar. 4, 2013.
Office Action in Chinese Application No. 201310537815.9 dated Feb. 1, 2018.
Office Action in Indian Application No. 3742/KOLNP/2008 dated Nov. 22, 2013.
Office Action in Japanese Application No. 2012-052264 dated Dec. 11, 2012 in 26 pages.
Office Action in Japanese Application No. 2013-123086 dated Apr. 15, 2014 in 3 pages.
Office Action in Japanese Application No. 2013-123086 dated Dec. 2, 2014 in 4 pages.
Office Action in Japanese Application No. 2015-075644 dated Apr. 5, 2016.
Office Action in European Application No. 07754164.7 dated Dec. 14, 2015.
Office Action in European Application No. 07754164.7 dated Jan. 25, 2018.
Office Action in Chinese Application No. 201310537815.9 dated Jul. 5, 2016.
Office Action in Chinese Application No. 201310537815.9 dated Jun. 2, 2017.
International Search Report and Written Opinion in PCT/US/2016/066848 dated May 1, 2017.
International Search Report and Written Opinion in PCT/US2017/055156 dated Dec. 13, 2017.
Arends et al., DNS Security Introduction and Requirements, RFC 4033, Mar. 2005, 21 pages.
Ariyapperuma et al., “Security Vulnerabilities in DNS and DNSSEC.” The Second International Conference on Availability, Reliability and Security, IEEE, 2007, 8 pages.
Chandramouli et al., “Challenges in Securing the Domain Name System.” IEEE Security & Privacy4.1 (2006),pp. 84-87.
Eastlake, Donald, Domain Name System Security Extensions, RFC 2535, Mar. 1999, 47 pages.
Office Action in Application No. 09729072.0 dated Dec. 7, 2018.
Examination Report in Indian Application No. 4487/DELNP/2013 dated Dec. 28, 2018.
Office Action in European Application No. 11767118.0 dated Jan. 29, 2019.
Examination Report in Indian Application No. 3105/DELNP/2013, dated Feb. 19, 2019.
Cohen et al., “Proactive Caching of DNS Records: Addressing a Performance Bottleneck”, Proceedings of Saint 2001 Symposium on Applications and the Internet; 8-12, Jan. 8, 2001, IEEE Computer Society, pp. 85-94.
JH Software, Moving a DNS Server to a New IP Address, last updated Jan. 26, 2006, 1 page.
Office Action in European Application No. 11767118.0 dated Jul. 25, 2018.
Extended Search Report in European Application No. 18156163 dated Sep. 3, 2018.
Office Action in Chinese Application No. 2013800492635 dated Aug. 30, 2017.
Frangoudis et al., “PTPv2-based network load estimation and its application to QoE monitoring for Over-the-Top services”, IEEE, The 5th International conference on Information, Intelligence, Systems and Applications, IISA 2014, XP032629858, Jul. 7, 2014, pp. 176-181.
Zaman et al., “Combinatorial Auction-Based Dynamic VM Provisioning and Allocation in Clouds”, Department of Computer Science, Wayne State University, Sep. 2011 http://www.cs.wayne.edu/-dgrosu/pub/ccgrid12-symp.pdf.
Office Action in European Application No. 13770602.4 dated Mar. 11, 2019.
Extended European Search Report in Application No. 16876655.8 dated Aug. 20, 2019.
Partial Search Report in European Application No. 16876655.8 dated May 15, 2019.
International Preliminary Report on Patentability and Written Opinion in PCT/US2017/055156 dated Apr. 9, 2019.
International Search Report and Written Opinion in PCT/US2018/036634 dated Sep. 11, 2018.