# Patent

## Title
Web page load time prediction and simulation

## Abstract

Web page load time prediction is achieved by simulating and adjusting the load times of web objects in a webpage to determined adjustments that optimize an overall page load time (PLT) of the webpage. The webpage load time prediction includes extracting a parental dependency graph (PDG) for the webpage. The PDG encapsulates one or more dependency relationships for each web object in the webpage. The prediction further includes determining an original PLT and original timing information of a webpage. The prediction also includes simulating a page loading of the webpage based on adjusted timing information of each web object and the PDG to estimate a new PLT of the webpage. The prediction additionally includes comparing the original PLT of the webpage to the new PLT of the webpage to determine whether the adjusted timing information increased or decreased the new PLT of the webpage.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This patent application is a divisional application of, and claims priority to, co-pending, commonly-owned U.S. patent application Ser. No. 12/547,704, entitled “WEB PAGE LOAD TIME PREDICTION AND SIMULATION”, filed on Aug. 26, 2009, which application is incorporated herein in its entirety by reference.


BACKGROUND
“Cloud computing” refers to the access of computing resources and data via a network infrastructure, such as the Internet. Online service providers may offer a wide range of services that may be hosted in the cloud; and such services may include search, maps, email, and outsourced enterprise applications. Further, online service providers may strive to achieve high levels of end-to-end cloud service performance to sustain and grow their user base. The performance of cloud services has direct impact on user satisfaction. For example, poor end-to-end response times, e.g., long page load times (PLTs), may result in low service usage, which in turn may undermine service income.
In order to achieve high levels of end-to-end performance, online service providers may implement performance boosting changes. For example, performance boosting changes may include improvements to the client-side rendering capability of web browsers, improved backend server-side processing capabilities, and the reduction in the domain name system (DNS) resolution time and/or network round-trip time (RTT). However, cloud computing service implementations are often complex, spanning components on end-system clients, back-end servers, as well as network paths. Thus, performance boosting changes may vary greatly in feasibility, cost and profit generation.
SUMMARY
Described herein are performance prediction techniques for automatically predicting the impact of various optimizations on the performance of cloud services, and systems for implementing such techniques.
The cloud services may include, but are not limited to, web searches, social networking, web-based email, online retailing, online maps, personal health information portals, hosted enterprise applications, and the like. The cloud services are often rich in features and functionally complex. For instance, a sample “driving directions” webpage provided by Yahoo! Maps was examined and found to comprise approximately 100 web objects and several hundred KB of JavaScript code. The web objects may be retrieved from multiple data centers (DCs) and content distribution networks (CDNs). These dispersed web objects may meet only at a client device, where they may be assembled by a browser to form a complete webpage. Moreover, the web objects may have a plethora of dependencies, which means that many web objects cannot be downloaded until some other web objects are available. For instance, an image download may have to wait for a JavaScript® to execute in an instance where the image download is requested by the download JavaScript. Accordingly, optimizations of the cloud services may include, but are not limited to, modifications of content distribution networks, improvements to client-side rendering capability of web browsers, improved backend server-side processing capabilities, and reductions in DNS resolution time and/or network round-trip time (RTT).
Thus, because of the complexity of the cloud services, variability of the interdependencies between web objects, as well as the different combinations of potential optimizations, it is often difficult to understand and predict the impact of various optimizations on the performance of cloud services. However, techniques described herein, and the implementing systems, may enable performance predictions via one or more inferences of dependencies between web objects, and the simulated download of web objects in a web page via a web browser. The simulation may further include the simulated modification of parameters that affect cloud service performance. Such parameters may include, but are not limited to, round-trip time (RTT), network processing time (e.g., DNS lookup time, TCP handshake time, or data transfer time), client execution time, and server processing time. In this way, the techniques, and the implementing systems, described herein may enable the assessment of cloud service performance under a wide range of hypothetical scenarios. Thus, the techniques and systems described herein may enable the prediction of parameter settings that provide optimal cloud service performance, i.e., shortest page load time (PLT).
In at least one embodiment, the automated cloud service performance prediction includes extracting a parental dependency graph (PDG) for a webpage. The PDG encapsulates one or more dependency relationships for each web object in the webpage. The prediction further includes determining an original page load time (PLT) and original timing information of a webpage. The prediction also includes simulating a page loading of the webpage based on adjusted timing information of each web object and the PDG to estimate a new PLT of the webpage. The prediction additionally includes comparing the original PLT of the webpage to the new PLT of the webpage to determine whether the adjusted timing information increased or decreased the new PLT of the webpage. Other embodiments will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings.
This Summary is provided to introduce a selection of concepts in a simplified form that is further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.



BRIEF DESCRIPTION OF THE DRAWINGS
The detailed description is described with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference number in different figures indicates similar or identical items.
FIG. 1 is a block diagram that illustrates an example architecture that implements automated performance prediction for cloud services, in accordance with various embodiments.
FIG. 2 is a block diagram that illustrates selected components for automatically predicting the performance of cloud services, in accordance with various embodiments.
FIG. 3 is a block diagram that illustrates the extractions of stream parents and their dependency offsets for web objects, in accordance with various embodiments.
FIG. 4 shows block diagrams that illustrate four scenarios of object timing relationship for a single HTTP object, in accordance with various embodiments.
FIG. 5 is a flow diagram that illustrates an example process to extract a parental dependency graph (PDG) for a webpage, in accordance with various embodiments.
FIG. 6 is a flow diagram that illustrates an example process to derive and compare a new page load time (PLT) of a webpage with an original PLT of the web page, in accordance with various embodiments.
FIG. 7 is a block diagram that illustrates a representative computing device that may implement automated performance prediction for cloud services.



DETAILED DESCRIPTION
This disclosure is directed to the implementation of automated performance prediction for cloud services. Cloud service implementations are often complex, spanning components on end system clients, backend servers, as well as a variety of network paths. In various instances, the performance of the cloud services may be improved, i.e., page load time (PLT) minimized, via the modification of parameters that affect cloud service performance. Such parameters may include, but are not limited to, round-trip time (RTT), network processing time (e.g., DNS lookup time, TCP handshake time, or data transfer time), client execution time, and server processing time. However, it is often difficult to understand and predict the true effect of parameter modifications on the performance of clouds. This difficulty may be attributed to the complexity of the cloud service implementations, variability of the interdependencies between web objects that access the cloud services, as well as the different options for optimizing access to cloud services. In fact, manual efforts to assess the impact of parameter modifications on the performance of cloud service can, in practice, be overly burdensome and error prone.
In various embodiments, the automated performance prediction for cloud services may enable the simulated modification of parameters that affect cloud service performance. Thus, the techniques, and the implementing systems, described herein may enable the prediction of parameter settings that provide optimal cloud service performance, i.e., shortest PLT. Therefore, the use of automated performance prediction for cloud services may improve PLTs of cloud services without the error prone and/or time consuming manual trial-and-error parameter modifications and performance assessments.
Further, the data generated by the automated performance predictions may be used by online service providers to implement parameter changes that improve the performance of cloud services without the addition of data centers, servers, switches, and/or other hardware infrastructure. Thus, user satisfaction with the performance of the cloud services may be maximized at a minimal cost. Various examples for implementing automated performance prediction for cloud services in accordance with the embodiments are described below with reference to FIGS. 1-7.
Example Architecture
FIG. 1 is a block diagram that illustrates an example architecture 100 that implements automated performance prediction for cloud services. In particular, this architecture 100 implements automated performance prediction to help improve the end-to-end response times of the cloud services.
The example architecture 100 may be implemented on a “computing cloud”, which may include a plurality of data centers, such as the data centers 102(1)-102(n). As shown in FIG. 1, the data center 102(1) may include one or more servers 104(1), the data center 102(2) may include one or more servers 104(2), the data center 102(3) may include one or more servers 104(3), and the data center 102(n) may include one or more servers 104(n).
The data centers 102(1)-102(n) may provide computing resource and data storage/retrieval capabilities. As used herein, computing resources may refer to any hardware and/or software that are used to process input data to generate output data, such as by the execution of algorithms, programs, and/or applications. Each of the respective data centers may be further connected to other data centers via the network infrastructure 106, such as the Internet. Moreover, the data centers 102(1)-102(n) may be further connected to one or more clients, such as a client 108, via the network infrastructure 106.
The data center 102(1)-102(n) may use their computing resources and data storage/retrieval capabilities to provide cloud services. These cloud services may include, but are not limited to, web searches, social networking, web-based email, online retailing, online maps, and the like. Cloud services may be delivered to users in form of web pages that can be rendered by browsers. Sophisticated web pages may contain numerous static and dynamic web objects arranged hierarchically. To load a typical webpage, a browser may first download a main HTML object that defines the structure of the webpage. The browser may then download a Cascading Style Sheets (CSS) object that describes the presentation of the webpage. The main HTML object may be embedded with many JavaScript objects that are executed locally to interact with a user. As the webpage is being rendered, an HTML or a JavaScript object of the webpage may request additional objects, such as images and additional JavaScript objects. This process may continue recursively until all relevant objects are downloaded.
A cloud service analyzer 110 may be implemented on a client device 108. The client device 108 may be a computing device that is capable of receiving, processing, and output data. For example, but not as a limitation, the client device 108 may be a desktop computer, a portable computer, a game console, a smart phone, or the like. The cloud service analyzer 110 may predict the impact of various optimizations on user-perceived performance of cloud services.
In operation, the cloud service analyzer 110 may derive a parental dependency graph (PDG) 112 for a particular webpage. As further described below, the PDG 112 may represent the various web object dependencies that may be present in a webpage. The dependencies between web objects may be caused by a number of reasons. The common ones may include, but is not limited to: (1) the embedded web objects in an HTML page depend on the HTML page; (2) since at least some web objects are dynamically requested during JavaScript execution, these web objects may depend on the corresponding JavaScript; (3) the download of an external CSS or JavaScript object may block the download of other types of web objects in the same HTML page; and (4) web object downloads may depend on certain events in a JavaScript or the browser.
The cloud service analyzer 110 may further obtain a total page load time (PLT) 114 of the webpage 116 by performing a page load in a baseline scenario. During the page load, the cloud service analyzer 110 may also obtain parameters, i.e., timing information 118, related to the download of each web object in the webpage 116. The timing information 118 may include client delay, network delay, and server delay that occur during the page load of the webpage. For example, the client delay may be due to various browser activities such as page rendering and JavaScript execution. The network delay may be due to DNS lookup time, transmission control protocol (TCP) handshake time, and data transfer time. Both TCP handshake time and data transfer time may be influenced by network path conditions such as RTT and packet loss. Moreover, the server delay may be incurred by various server processing tasks such as retrieving static content and generating dynamic content.
Having obtained the timing information 118 for each web object in the webpage 116 for the baseline scenario, the cloud service analyzer 110 may add additional client delay 120 for each web object to the timing information 118. In at least one embodiment, the cloud service analyzer 110 may infer the additional client delay by combining the timing information 118 with the PDG 112 of the webpage 116.
Subsequently, the cloud service analyzer 110 may receive a new scenario that includes modified parameters, i.e., modified timing information 122. For example, but not as a limitation, the cloud service analyzer 110 may receive modifications to RTT, modifications to network processing time, modifications to client execution time, modifications to server processing time, and/or the like. The cloud service analyzer 110 may simulate the page loading of all web objects of the webpage 116 based on the modified time information 122 and the PDG 112 to estimate the second PLT 124 of the webpage. Subsequently, the cloud service analyzer 110 may compare the second PLT 124 of the webpage to the first PLT 114 of the webpage to determine whether the load time has been improved via the parameters modifications (e.g., whether a shorter load time is achieved). Thus, by repeating the modifications of the parameters and the comparisons, the cloud service analyzer 110 may test a plurality of new scenarios to derive improved parameter settings that minimize PLT.
Example Components
FIG. 2 is a block diagram that illustrates selected components for performing automated performance prediction for cloud services. The selected components may be implemented on a client device 108 (FIG. 1). The client device 108 may include one or more processors 202 and memory 204.
The memory 204 may include volatile and/or nonvolatile memory, removable and/or non-removable media implemented in any method or technology for storage of information, such as computer-readable instructions, data structures, program modules or other data. Such memory may include, but is not limited to, random accessory memory (RAM), read-only memory (ROM), electrically erasable programmable read-only memory (EEPROM), flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, RAID storage systems, or any other medium which can be used to store the desired information and is accessible by a computer system. Further, the components may be in the form of routines, programs, objects, and data structures that cause the performance of particular tasks or implement particular abstract data types.
The memory 204 may store components. The components, or modules, may include routines, programs instructions, objects, and/or data structures that perform particular tasks or implement particular abstract data types. The selected components may include a measurement engine 206, a dependency extractor 222, and a performance predictor 228, a comparison engine 212, a data storage module 238, a comparison engine 240, and a user interface module 242. The various components may be part of the cloud server analyzer 110 (FIG. 1).
Measurement Engine
The measurement engine 206 may collect packet traces 216 that enable the cloud service analyzer 102 to determine the page load times (PLTs) of web pages, as well as determine DNS, TCP handshake, and HTTP object information. The measurement engine 206 may include a set of measurement agents 208 located at different network nodes and a central controller 210. The controller 210 may use an application updater 212 to upgrade the script snippets that simulate user interaction with particular websites and workload (e.g., the input to cloud services). Moreover, the controller 210 may store packet traces 216 collected from the different agents 208 by a data collector 214.
The measurement engine 206 may run an automated web robot 218 that drives a full-featured web browser. The web robot 218 may be used to simulate user inputs and to request web pages. Further, the web robot 218 may call a trace logger 220 to log the packet traces 216 multiple times so that the measurement engine 206 may recover the distributional properties of a particular page loading process. In various embodiments, the web robot 218 may also take control of a web browser via a browser plug-in. The web robot 218 may include a script library that enables the web robot to control browser related functions. These functions may include cache control, browser parameter adjustment, as well as user input simulation.
Dependency Extractor
The dependency extractor 222 may include an algorithm to infer dependencies between web objects by perturbing the download times of individual web objects. The algorithm may leverage the fact that the delay of an individual web object will be propagated to all other dependent web objects. Accordingly, this time perturbation may be systematically applied to discover web object dependencies.
Modern web pages may contain many types of web objects such as HTML, JavaScript, CSS, and images. These embedded web objects may be downloaded recursively instead of all at once. For instance, the main HTML may contain a JavaScript whose execution will lead to additional downloads of HTML and image objects. Thus, a web object may be classified as being dependent on another if the former cannot be downloaded until the latter is available. The dependencies between web objects can be caused by a number of reasons. The common reasons may include, but are not limited to: (1) the embedded web objects in an HTML page may depend on the HTML page; (2) since web objects are dynamically requested during JavaScript execution, these web objects may depend on the corresponding JavaScript; (3) the download of an external CSS or JavaScript object may block the download of other types of objects in the same HTML page; and (4) web object downloads may depend on certain events in a JavaScript or the browser. For instance, a JavaScript may download image B only after image A is loaded. In other words, given an image A, the dependent web objects of image A usually cannot be requested before image A is completely downloaded.
However, there are exceptions to the common dependencies between objects, and therefore the following may provide context for the functionality of the dependency extractor 222. In some instances, a browser may render an HTML page in a streamlined fashion, in which the HTML page may be partially displayed before the downloading finishes. For instance, if an HTML page has an embedded image with tag <img>, the image may be downloaded and displayed in parallel with the downloading of the HTML page. In fact, the image download may start once the tag <img> (identified by a byte offset in the HTML page) has been parsed. Thus, web objects that can be processed in a streamlined fashion may be defined as stream objects, and all HTML objects may be stream objects. For instance, given a stream object A, the notation dependent offsetA(img) may be used to denote the byte offset of <img> in the stream object A. In one example, browsers that exhibit streamlined processing behavior may include the Internet Explorer® browser produced by the Microsoft® Corporation of Redmond, Wash.
Thus, in order to distinguish stream objects from non-stream objects, a different kind of notation may be used to denote dependencies between non-stream objects. In various embodiments, given a non-stream object X the notation descendant (X) may be used to denote the set of objects that depend on the non-stream object X. Conversely, the notation ancestor (X) may be used to denote the set of web objects that the non-stream object X depends on. Thus, by definition, the non-stream object X cannot be requested until all the objects in ancestor (X) are available.
Among the objects in ancestor (X), the object whose loading immediately precedes the loading of the non-stream object X may be denoted as the last parent of the non-stream object X Thus, if such a preceding web object is designated as object Y, the available-time of the object Ymay be expressed as when the dependency offsetY (X) has been loaded. In embodiments where object Y is a non-stream object, the available-time of the object Y may be when the object Y is completed loaded. As further described below, the available-time of the object Y may be used to estimate the start time of the non-stream object X's download and predict the page load time (PLT) of a webpage. Further, while the non-stream object X has only one last parent, the last parent of the non-stream object X may change across different page loads due to variations in the available-time of its ancestors. Accordingly, parent (X) may be used denote the object in ancestor (X) that may be the last parent of the non-stream object X.
Therefore, as further described below, given a webpage, a parental dependency graph (PDG) 112 (FIG. 1) may be used to encapsulate the parental relationships between web objects in the webpage. For example, a PDG=(V,E) may be a directed acyclic graph (DAG) that includes a set of nodes and directed links, where each node is a web object. Moreover, each link Y→X means Y is a parent of X. Thus, the work performed by the dependency extractor 222 may be explained based on the above described notations and relationships.
The dependency extractor 222 may extract the dependencies of a webpage by perturbing the download of individual web objects. The dependency extractor 222 may leverage the fact that the delay of an individual web object may be propagated to all other dependent web objects. Accordingly, the dependency extractor 222 may extract the stream parent of a web object and the corresponding dependent offset. For example, suppose a web object X has a stream parent Y, to discover this parental relationship, the available time of OffsetY(X) should be earlier than all of the other parents of the web object X in a particular page load. Thus, the dependency extractor 222 may control the download of not only each non-stream parent of the web object X as a whole, but also each partial download of each stream parent of the web object X.
In order to extract dependencies of the web objects of a web page, the dependency extractor 222 may discover ancestors and descendants for the web objects. In various embodiments, the dependency extractor 222 may use a web proxy 224 to delay web object downloads of a webpage and extract the list of web objects in the webpage by obtaining their corresponding Universal Resource Identifiers (URIs). Further, the dependency extractor 222 may discover the descendants of each web object using an iterative process. In various embodiments, the dependency extractor 222 may reload the page and delay the download of a web object, such as web object X, for τ seconds in each round of the iterative process. In each round, the web object X may be a web object that has not been processed, and τ may be greater than the normal loading time of the web object X. The descendants of the web object X may be web objects whose download is delayed together with the web object X The iterative process may be repeated until the descendants of all the web objects are discovered. During the iterative process, the dependency extractor 222 may use a browser robot 226 to reload pages. In such embodiments, the operation of the dependency extractor may be based on two assumptions: (1) the dependencies of a webpage do not change during the discovery process; and (2) introduced delays will not change the dependencies in the webpage.
The dependency extractor 222 may also extract non-stream parents of each web object during the process of extracting dependencies of the web objects. In various embodiments, given a non-stream web object X and its web object Z, non-stream web object X may be the parent of descendant web object Z if and only if there does not exist a web object Y that is also the descendant of web object X and the ancestor of descendant web object Z. On the other hand, if such web object Y exists, the available-time of the web object Y may be later than that of the non-stream web object X. This is because the web object Y cannot be downloaded until the non-stream web object X is available, which implies the web object X cannot be the parent of the web object Z. However, if the web object Y does not exist, there may be scenarios in which the non-stream web object X is delayed until all of the other ancestors of the web object Z are available. This may be possible because none of the other ancestors of the web object Z depend on the web object X, which may imply that the non-stream web object X may indeed be the parent of the descendant web object Z. Based on these observations, the dependency extractor 222 may use the following algorithm (shown in pseudo code) to take a set of web objects and the set of descendants of each web object as input and compute the parent set of each web object:















ExtractNonStreamParent(Object, Descendant)



For X in Object



  For Z in Descendant (X)



  IsParent = True



  For Y in Descendant (X)



    If (Z in Descendant (Y) )



      IsParent = False



      Break



    EndIf



  EndFor



  If (Isparent) add X to Parent (Z)



  EndFor



EndFor










Furthermore, the dependency extractor 222 may also extract stream parents and their dependency offsets. The extractions of stream parents and their dependency offsets are illustrated in FIG. 3. As shown in FIG. 3, a HTML stream object H 302 may contain a JavaScript J 304 and an image object I 306. JavaScript J 304 and image object I 306 may be embedded in the beginning and the end of stream object H 302 respectively (offsetH(J)<offsetH(I)). However, because the URL of image object I 306 is defined in JavaScript J 304, image object I 306 cannot be downloaded until JavaScript J is executed. This causes the image object I 306 to depend on both the stream object H 302 and the JavaScript J 304 while the JavaScript J 304 only depend on the stream object H 302.
In a normal scenario, the stream object H 302 cannot be the parent of the image object I 306 since the JavaScript object J 304 is the descendant of stream object H 302 and the ancestor of the image object I 306. Nonetheless, when the download of the stream object H 302 is slow, the JavaScript J 304 may be downloaded and executed before the offsetH(I) becomes available. In such a case, the stream object H 302 may become the last parent of the image object I 306.
Thus, given the stream object H 302 and its descendant image object I 306, the dependency extractor 222 may determine whether the stream object H 302 is the parent of the image object I 306. In various embodiments, the dependency extractor 222 may first load an entire web page and control the download of the stream object H 302 at an extremely low rate λ. If the stream object H 302 is the parent of the image object I 306, all of the other ancestors of the image object I 306 may be available by the time offsetH(I) is available. The dependency extractor 222 may then estimate offsetH(I) with offsetH(I)′, whereby the latter is the offset of stream object H 302 that has been downloaded when the request of the image object I starts to be sent out. In some embodiments, offsetH(I)′ may be directly inferred from network traces and is usually larger than offsetH(I). This is because it may take some extra time to request image object I after offsetH(I) is available. However, since stream object H 302 is downloaded at an extremely low rate, these two offsets should be very close.
Having inferred offsetH(I)′, the dependency extractor 222 may perform an additional parental test to determine whether stream object H 302 is the parent of image object I 306. During the testing process, the dependency extractor 222 may reload the entire webpage. However, for this reload, the dependency extractor 222 may control the download of stream object H 302 at the same low rate λ as well as delay the download of all the known non-stream parents of image object I 306 by τ. Further, assuming offsetH(I)′′ is the offset of stream object H 302 that was downloaded when the request of image object I 306 is sent out during the reload, if offsetH(I)′′−offsetH(I)′<<τ×λ is true, then the delay of I's known parents has little effect on when image object I 306 is requested. Accordingly, stream object H 302 may be designated as the last parent of image object I 306. In this way, the parental relationship between the stream objects in the webpage, as well as their dependency offsets, may be further encapsulated by the PDG 112 (FIG. 1).
The choice of λ may reflect a tradeoff between measurement accuracy and efficiency. A small λ may enable the dependency extractor 222 to estimate offsetH(I) more accurately but may also lead to a relatively long processing time, as the parameter τ may directly affect the accuracy of the parental tests. For example, if τ is too small, the results may be susceptible to noise, increasing the chance of missing the true stream parents. However, if τ is too large, the dependency extractor 222 may mistakenly infer a parent relationship because offsetH(I)′′−offsetH(I)′ is bound by sizeH−offsetH(I) where sizeH is the page size of stream object H 302. In at least one embodiment, the dependency extractor 222 may use λ=sizeH/200 bytes/sec and τ=2 seconds. This means the stream object H takes 200 seconds to transfer. However, additional embodiments may use other values for λ and τ provided they supply adequate tradeoffs between measurement accuracy and efficiency.
Performance Predictor
The performance predictor 228 may predict the performance of cloud services under hypothetical scenarios. Given the page load time (PLT) of a baseline scenario, the performance predictor 228 may predict the new PLT when there are changes to a plurality of parameters. In various embodiments, the changes to the parameters may include changes in the client delay, the server delay, the network delay (e.g., DNS lookup time, TCP handshake time, or data transfer time), and/or the RTT. Thus, the performance predictor 228 may help service providers identify performance bottlenecks and devise effective optimization strategies. In other words, the performance predictor 228 may simulate page loading processes of a browser under a wide range of hypothetical scenarios.
During the operation of the performance predictor 228, the performance predictor 228 may first infer the timing information of each web object from the network trace of a webpage load in a baseline scenario. In various embodiments, the performance predictor 228 may first obtain the timing information from the measurement engine 206. Second, based on the parental dependency graph (PDG) of the webpage, the performance predictor 228 may further annotate each web object with additional information related to client delay. Third, the performance predictor 228 may adjust the web object timing information to reflect changes from the baseline scenario to the new one. Finally, the performance predictor 228 may simulate the page load process with new web object timing information to estimate the new page load PLT. Except for the factors adjusted, the page load process of the new scenario may inherit properties from the baseline scenario, including non-deterministic factors, such as whether a domain name is cached by the browser.
Performance Predictor—Obtain Timing Information
The performance predictor 228 may infer web objects and their timing information from network traces of a page load collected at the client, such as the client 108 (FIG. 1). In various embodiments, the performance predictor 228 may include a trace analyzer 230 that recovers DNS, TCP and HTTP object information. For HTTP protocol, the performance predictor 228 may use TCP reassembly and HTTP protocol parsing to recover the HTTP object information. For DNS protocol, the trace analyzer 230 may use a DNS parser to recover the domain name related to the DNS requests and responses. In at least one embodiment, the performance predictor 228 may leverage a network intrusion detection tool component to recover the timing and semantic information from the raw packet trace.
The trace analyzer 230 may estimate the RTT of each connection by the time between SYN and SYN/ACK packets. Based on the TCP self-clocking behavior, the trace analyzer 230 may estimate the number of round trips of the HTTP transfer taken by a web object. The packets in one TCP sending window are relatively close to each other (e.g., less than one RTT), but the packets in different sending windows are about one RTT apart (approximately 1±0.25 RTT). This approach may help the trace analyzer 230 to identify the additional delay added by the web servers, which is usually quite different from one RTT.
Thus, the performance predictor 228 may be client-deployable since it does not require any application-level instrumentations. By using the trace analyzer 230, the performance predictor 228 may identify object timing information 232 for each web object. The timing information 232 may include information for three types of activity: (1) DNS lookup time: the time used for looking up a domain name; (2) TCP connection time: the time used for establishing a TCP connection; and (3) HTTP time: the time used to load a web object.
Moreover, HTTP time may be further decomposed into three parts: (i) request transfer time: the time to transfer the first byte to the last byte of the HTTP request; (ii) response time: the time from when the last byte of the HTTP request is sent to when the first byte of the HTTP reply is received, which may include one RTT plus server delay; and (iii) reply transfer time: the time to transfer the first byte to the last byte of an HTTP reply.
In addition, the performance predictor 228 may infer the RTT for each TCP connection. The RTT of a TCP connection may be quite stable since the entire page load process usually lasts for only a few seconds. The performance predictor 228 may also infer the number of round-trips involved in transferring an HTTP request or reply. Such information may enable the performance predictor 228 to predict transfer times when RTT changes.
Performance Predictor—Additional Client Delay Information
As stated above, the performance predictor 228 may further annotate each object with additional timing information related to client delay. In various embodiments, the timing information 232 may be supplemented with the additional timing information related to client delay. For example, when the last parent of a web object X becomes available, the browser may not issue a request for the web object X immediately. This is because the browser may need time to perform some additional processing, e.g., parsing HTML pages or executing JavaScripts. For the web object X, the performance predictor 228 may use client delay to denote the time from when its last parent is available to when browser starts to request the web object X.
When the browser loads a sophisticated webpage or the client machine is slow, client delay may have significant impact on PLT. Accordingly, the performance predictor 228 may infer client delay of each web object by combining the obtained object timing information of each web object with the PDG (e.g., PDG 112) of the webpage. It will be appreciated that when a browser starts to request a web object, the first activity may be DNS, TCP connection, or HTTP, depending on the current state and behavior of the browser.
Many browsers may limit the maximum number of TCP connections to a host server. For example, some browsers (e.g., Internet Explorer® 7) may limit the number of TCP connections to six by default. Such limitations may cause the request for a web object to wait for available connections even when the request is ready to be sent. Therefore, the client delay that the performance predictor 228 observes in a trace may be longer than the actual browser processing time. To overcome this problem, when collecting the packet traces in the baseline scenario for the purpose of prediction, the performance predictor 228 may set the connection limit per host of the browser to a large number, for instance, 30. This may help to reduce the effects of connection waiting time.
Performance Predictor—Adjust Object Timing Information
Further, having obtained the web object timing information 232 under the baseline scenario, the performance predictor 228 may adjust the timing information 232 for each web object according to a new scenario. In other words, the timing information 232 may be adjusted with new input parameters 122 (FIG. 1) that modify one or more of the server delay, the client delay, the network delay, the RTT time, etc. The new input parameters 122 (FIG. 1) may be inputted by a user or a testing application. The modifications may increase or decrease the value of each delay or time.
In at least one embodiment, assuming serverδ is the server delay difference between the new and the baseline scenario, the performance predictor 228 may add the input serverδ to the response time of each web object to reflect the server delay change in the new scenario. The performance predictor 228 may use similar methods to adjust DNS activity and client delay for each web object with the new scenario inputs 236.
The performance predictor 228 may also adjust for RTT changes. Assuming the HTTP request and response transfers involve m and n round-trips for the web object X, the performance predictor 228 may add (m+n+1)×rttδ to the HTTP activity of the web object X, and rttδ to the TCP connection activity if a new TCP connection is required for loading the web object X. In such embodiments, the performance predictor 228 may operate under the assumption that RTT change has little impact on the number of round-trips involved in loading a web object.
Performance Predictor—Simulating Page Load
The performance predictor 228 may further predict page load time (PLT) based on the web object timing information 232 by simulating a page load process. Since web object downloads are not independent of each other, the download of a web object may be blocked because its dependent objects are unavailable or because there are no TCP connections ready for use. Accordingly, the performance predictor 228 may account for these limitations when simulating the page load process by taking into accounts the constraints of a browser and the corresponding PDG (e.g., PDG 112) of the webpage.
For example, web browsers such as Internet Explorer® and Firefox®, as produced by the Mozilla Corporation of Mountain View, Calif., may share some common constraints and features. Presently, Internet Explorer® and Firefox® both use HTTP/1.1 with HTTP pipelining disabled by default. This may be due to the fact that HTTP pipelining may perform badly with the presence of dynamic content, e.g., one slow request may block other requests. However, without pipelining, HTTP request-reply pairs do not overlap with each other within the same TCP connection. However, in HTTP/1.1, a browser may use persistent TCP connections that can be reused for multiple HTTP requests and replies. The browser may attempt to keep the number of parallel connections small. Accordingly, the browser may open a new connection only when it needs to send a request and all existing connections are occupied by other requests or replies. The browser may be further configured with an internal parameter to limit the maximum number of parallel connections with a particular host. Such limit may be commonly applied to a host instead of to an IP address. However, if multiple hosts map to the same IP address, the number of parallel connections with that IP address may exceed the limit. Thus, during the page load simulation, the performance predictor 228 may set the number of possible parallel connections according to the connection limitations of a particular browser. However, in other embodiments, the number of possible parallel connections may be modified (e.g., increased or decreased). Thus, the new input parameters 122 (FIG. 1) of a new scenario may further include the number of possible parallel connections.
Moreover, the web browsers, such as Internet Explorer® and Firefox®, may also share some common features. For example, loading a web object in a web browser may trigger multiple activities including looking up a DNS name, establishing a new TCP connection, waiting for an existing TCP connection, and/or issuing an HTTP request. Five possible combinations of these activities are illustrated below in Table I. A “-” in Table I means that the corresponding condition does not matter for the purpose of predicting page load time (PLT). The activities involved in each case are further illustrated in FIG. 4.







TABLE I







Connection Packing Possibilities for a Given Domain Name









Case













I
II
III
IV
V
















First Web Object of a Domain
Yes
Yes
No
No
No


Cached DNS Name
No
Yes
—
—
—


Available TCP Connections
—
—
Yes
No
No


Maximum Number of Parallel
—
—
—
No
Yes


Connections


Corresponding Scenario in FIG. 4
402
404
406
404
408









FIG. 4 shows block diagrams that illustrate scenarios 402-408 of web object timing relationship for a single HTTP object, in accordance with various embodiments. For instance, in Case V, a browser may load a web object from a domain with which it already has established TCP connections. However, because all the existing TCP connections are occupied and the number of parallel connections has reached a maximum limit, the browser may have to wait for the availability of an existing connection to issue the new HTTP request. Case V is illustrated as scenario 408 of FIG. 4.
Based on the common limitations and features of web browsers, the performance predictor 228 may estimate a new PLT of a webpage by using prediction engine 234 to simulate the corresponding page load process. In various embodiments, the prediction engine 234 may use an algorithm that takes the adjusted timing information of each web object in the web page, as well as the parental dependency graph (PDG) of the web page as inputs, and simulate the page loading process for the webpage to determine a new page load time (PLT). The algorithm may be expressed in pseudo code (“PredictPLT”) as follows:















PredictPLT(ObjectTimingInfo, PDG)



Insert root objects into CandidateQ



While (CandidateQ not empty)



  1) Get earliest candidate C from CandidateQ



  2) Load C according to conditions in Table 1



  3) Find new candidates whose parents are available



  4) Adjust timings of new candidates



  5) Insert new candidates into CandidateQ



Endwhile










In other words, the PLT may be estimated by the algorithm as the time when all the web objects are loaded. For each web object X, the algorithm may keep track of four time variables: (1) Tp: when the web object X's last parent is available; (2) Tr: when the HTTP request for the web object X is ready to be sent; (3) Tf: when the first byte of the HTTP request is sent; and (4) Tl: when the last byte of the HTTP reply is received. As stated above, FIG. 4 illustrates the position of these time variables in four different scenarios. In addition, the algorithm may maintain a priority queue CandidateQ that contains the web objects that can be requested. The objects in CandidateQ may be sorted based on Tr.
Initially, the algorithm may insert the root objects of the corresponding PDG of the webpage into the queue CandidateQ with their Tr set to 0. A webpage may have one main HTML object that serves as the root of the PDG. However, in some scenarios, multiple root objects may exist due to asynchronous JavaScript and Extensible Markup Language (XML) downloading, such as via AJAX. In each Iteration, the algorithm may perform the following tasks: (1) obtain object C with smallest Tr, from CandidateQ; (2) load object C according to the conditions listed in Table 1; (2) update Tf and Tl based on whether the loading involves looking up DNS names, opening new TCP connections, waiting for existing connections, and/or issuing HTTP requests. Tf and Tl may be used to determine when a TCP connection is occupied by the object C; (3) after the object C is loaded, find all the new candidates whose last parent is the object C; (4) adjust the Tp and Tr of each new candidate X. If the object C is a non-stream object, Tp of the object X may be set to Tl of the object C. However, if object C is a stream object, Tp of the object X may be set to the available-time of offsetC(X), and Tr of the object X may be set to Tp, plus the client delay of the object X; and (5) insert new candidates into CandidateQ.
With the use of such an algorithm and the prediction engine 234, the performance predictor 228 may simulate a page load process for the webpage based on the adjusted web object timing information 232, in which the adjusted web object timing information 232 includes the new modified input parameters 122 (FIG. 1). The simulation of the page load process may generate a new predicted PLT for the webpage. In various embodiments, the performance predictor 228 may output the predicted PLT as the result 236.
The data storage module 238 may be configured to store data in a portion of memory 204 (e.g., a database). In various embodiments, the data storage module 238 may store web pages for analysis, algorithms used by the dependency extractor 222 and the prediction engine 234, the extracted PDGs, and timing information of the web objects (e.g., the client delay, the network delay, and the server delay). The data storage module 238 may further store parameter settings for different page loading scenarios, and/or results such as the PLTs of web pages under different scenarios. The data storage module 238 may also store any additional data derived during the automated performance of cloud services, such as, but not limited, trace information produced by the trace analyzer 230.
The comparison engine 240 may compare the new predicted PLT (e.g., result 236) of each webpage with the original PLT of each webpage, as measured by the measurement engine 206. Additionally, in some embodiments, the results 236 may also include one or more of the server delay, the client delay, the network delay, the RTT, etc., as obtained during the simulated page loading of the webpage by the performance predictor 228. Accordingly, the comparison engine 240 may also compare such values to one or more corresponding values obtained by the measurement engine 206 during the original page load of the webpage. Further, the comparison engine 240 may also compare a plurality of predicted PLTs of each webpage, as derived from different sets of input parameters, so that one or more improved sets of input parameters may be identified.
The user interface module 242 may interact with a user via a user interface (not shown). The user interface may include a data output device such as a display, and one or more data input devices. The data input devices may include, but are not limited to, combinations of one or more of keypads, keyboards, mouse devices, touch screens, microphones, speech recognition packages, and any other suitable devices or other electronic/software selection methods. The user interface module 242 may enable a user to input or modify parameter settings for different page loading scenarios, as well as select web pages and page loading processes for analysis. Additionally, the user interface module 242 may further cause the display to output representation of the PDGs of selected web pages, current parameter settings, timing information of the web objects, PLTs of web pages under different scenarios, and/or other pertinent data.
Example Processes
FIGS. 5-6 describe various example processes for automated cloud service performance prediction. The order in which the operations are described in each example process is not intended to be construed as a limitation, and any number of the described blocks can be combined in any order and/or in parallel to implement each process. Moreover, the blocks in the FIGS. 5-6 may be operations that can be implemented in hardware, software, and a combination thereof. In the context of software, the blocks represent computer-executable instructions that, when executed by one or more processors, cause one or more processors to perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures, and the like that cause the particular functions to be performed or particular abstract data types to be implemented.
FIG. 5 is a flow diagram that illustrates an example process 500 to extract a parental dependency graph (PDG) for a webpage, in accordance with various embodiments.
At block 502, the dependency extractor 222 of the cloud service analyzer 206 may extract a list of web objects in a webpage. In various embodiments, the dependency extractor 222 may use a web proxy 224 to delay web object downloads of a webpage and extract the list of web objects in the webpage by obtaining their corresponding Universal Resource Identifiers (URIs).
At block 504, the dependency extractor 222 may load the webpage and delay the download of a web object so that one or more descendants and/or one or more ancestors thereof may be discovered. In various embodiments, the dependency extractor 222 may use a browser robot 226 to load the webpage.
At block 506, the dependency extractor 222 may use an iterative algorithm to discover all the descendants and the ancestors of the web object. In various embodiments, the algorithm may extract one or more stream parent objects and/or one or more non-stream parent objects, one or more descendant objects, as well as the dependency relationships between the web object and the other web objects.
At block 508, the dependency extractor 222 may encapsulate the one or more dependency relationships of the web object that is currently being processed in a PDG, such as the PDG 112 (FIG. 1).
At decision block 510, the dependency extractor 222 may determine whether all the web objects of the webpage have been processed. In various embodiments, the dependency extractor 222 may make this determination based on the list of the web objects in the webpage. If the dependency extractor 222 determines that not all of the web objects in the webpage has been processed (“no” at decision block 510), the process 500 may loop back to block 504, where another web object in the list of web objects may be processed for descendants and ancestor web objects. However, if the dependency extractor 222 determines all web objects have been processed (“yes” at decision block 510), the process may terminate at block 512.
FIG. 6 is a flow diagram that illustrates an example process 600 to derive and compare a new page load time (PLT) of a webpage with an original PLT of the web page, in accordance with various embodiments.
At block 602, the performance predictor 228 of the cloud service analyzer 206 may obtain an original PLT (e.g., PLT 114) of a webpage. In various embodiments, the performance predictor 228 may obtain the PLT of the webpage from the measurement engine 206.
At block 604, the performance predictor 228 may extract timing information (e.g., timing information 232) of each web object using a network trace. The network trace may be implemented on a page load of the webpage under a first scenario. In various embodiments, the performance predictor 228 may use trace logger 220 of the measurement engine 206 to perform the network tracing. The first scenario may include a set of default parameters that represent client delay, the network delay (e.g., DNS lookup time, TCP handshake time, or data transfer time), the server delay, and/or the RTT experienced during the page load.
At block 606, the performance predictor 228 may annotate each web object with additional client delay information based on the parental dependency graph (PDG) of the webpage. In various embodiments, the additional client delay information may represent the time a browser needs to do some additional processing, e.g., parsing HTML pages or executing JavaScripts, the time expended due to browser limitation on the maximum number of simultaneous TCP connections.
At block 608, the performance predictor 228 may adjust the web object timing information of each web object to reflect a second scenario that includes one or more modified parameters (e.g., modified parameters 122). In various embodiments, the modified parameters may have been modified based on input from a user or a testing application. For example, but not as a limitation, the cloud service analyzer 110 (FIG. 1) may receive one or more modifications to RTT, modifications to network processing delay (e.g., modifications to DNS lookup time, TCP handshake time, or data transfer time), modifications to client processing delay, modifications to server processing delay, and/or the like. The modifications may increase or decrease the value of each delay or time.
At block 610, the performance predictor 228 may simulate page loading of the webpage to estimate a new PLT (e.g., PLT 124) of the webpage. In various embodiments, the performance engine may use the prediction engine 234 to simulate the page loading of each web object of the webpage based on the adjusted time information that includes the modified parameters (e.g., modified parameters 122) and the PDG (e.g., PDG 112).
At block 612, the comparison engine 240 of the cloud service analyzer 206 may compare the new PLT of the webpage to the original PLT of the webpage to determine whether the load time has been improved via the parameter modifications (e.g., whether a shorter or improved PLT is achieved, or whether the parameter modifications actually increased the PLT). In further embodiments, the comparison engine 240 may also compare a plurality of new PLTs that are derived based on different modified timing information so that improved parameters may be determined.
Example Computing Device
FIG. 7 illustrates a representative computing device 700 that may implement automated performance prediction for cloud services. For example, the computing device 700 may be a server, such as one of the servers 102(1)-102(n), as described in FIG. 1. Moreover, the computing device 700 may also act as the client device 108 described in the discussion accompanying FIG. 1. However, it will be readily appreciated that the techniques and mechanisms may be implemented in other computing devices, systems, and environments. The computing device 700 shown in FIG. 7 is only one example of a computing device and is not intended to suggest any limitation as to the scope of use or functionality of the computer and network architectures.
In at least one configuration, computing device 700 typically includes at least one processing unit 702 and system memory 704. Depending on the exact configuration and type of computing device, system memory 704 may be volatile (such as RAM), non-volatile (such as ROM, flash memory, etc.) or some combination thereof. System memory 704 may include an operating system 706, one or more program modules 708, and may include program data 710. The operating system 706 includes a component-based framework 712 that supports components (including properties and events), objects, inheritance, polymorphism, reflection, and provides an object-oriented component-based application programming interface (API), such as, but by no means limited to, that of the .NETTM Framework manufactured by the Microsoft® Corporation, Redmond, Wash. The computing device 700 is of a very basic configuration demarcated by a dashed line 714. Again, a terminal may have fewer components but may interact with a computing device that may have such a basic configuration.
Computing device 700 may have additional features or functionality. For example, computing device 700 may also include additional data storage devices (removable and/or non-removable) such as, for example, magnetic disks, optical disks, or tape. Such additional storage is illustrated in FIG. 7 by removable storage 716 and non-removable storage 718. Computer storage media may include volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information, such as computer readable instructions, data structures, program modules, or other data. System memory 704, removable storage 716 and non-removable storage 718 are all examples of computer storage media. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, digital versatile disks (DVD) or other optical storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by Computing device 700. Any such computer storage media may be part of device 700. Computing device 700 may also have input device(s) 720 such as keyboard, mouse, pen, voice input device, touch input device, etc. Output device(s) 722 such as a display, speakers, printer, etc. may also be included.
Computing device 700 may also contain communication connections 724 that allow the device to communicate with other computing devices 726, such as over a network. These networks may include wired networks as well as wireless networks. Communication connections 724 are some examples of communication media. Communication media may typically be embodied by computer readable instructions, data structures, program modules, etc.
It is appreciated that the illustrated computing device 700 is only one example of a suitable device and is not intended to suggest any limitation as to the scope of use or functionality of the various embodiments described. Other well-known computing devices, systems, environments and/or configurations that may be suitable for use with the embodiments include, but are not limited to personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-base systems, set top boxes, game consoles, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and/or the like.
The implementation of automated performance prediction for cloud services on a client device may enable the assessment of cloud service performance variation in response to a wide range of hypothetical scenarios. Thus, the techniques described herein may enable the prediction of parameter settings that provide optimal cloud service performance, i.e., shortest page load time (PLT) without error prone and/or time consuming manual trial-and-error parameter modifications and performance assessments. Moreover, the implementation of automated performance prediction for cloud services on a client device may take into account factors that are not visible to cloud service providers. These factors may include page rendering time, object dependencies, multiple data sources across data centers and data providers.
Conclusion
In closing, although the various embodiments have been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended representations is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the claimed subject matter.

## Claims

1. A computer readable memory storing computer-executable instructions that, when executed, cause one or more processors to perform acts that generate a parental dependency graph that captures relationships between web objects in a webpage, the acts comprising:
extracting a list of the web objects that are in the webpage;
determining that a first web object in the list is a descendant object of a second web object in the list at least when a delay in downloading of the second web object during a download of the webpage causes a corresponding delay in downloading of the first web object; and
generating the parental dependency graph that captures a dependency relationship indicating that the first web object is the descendant object of the second object, the parental dependency graph to enable an estimation of a page load time for the webpage based at least on adjusting load timing information of one or more web objects included in the parental dependency graph.

2. The computer readable memory of claim 1, wherein the web objects include a stream object or a non-stream object.

3. The computer readable memory of claim 1, wherein the extracting includes extracting web objects in the webpage by obtaining a corresponding Universal Resource Identifier (URI) of each web object.

4. The computer readable memory of claim 1, wherein the extracting includes extracting web objects in the webpage that accesses at least one of a plurality of data centers (DCs) or a plurality of content distribution networks (CDNs).

5. The computer readable memory of claim 1, wherein the extracting includes extracting web objects that include at least one of an Hypertext Markup Language (HTML) object, a Cascade Style Sheet (CSS) object, a JavaScript object, or an image object.

6. The computer readable memory of claim 1, wherein the downloading of the second web object is delayed using a web proxy.

7. A computer-implemented method, comprising:
extracting a list of web objects from a webpage;
determining that a first web object in the list is a descendant object of a second web object in the list at least when a delay in downloading of the second web object during a download of the webpage causes a corresponding delay in downloading of the first web object;
generating a parental dependency graph (PDG) that captures a dependency relationship indicating that the first web object is the descendant object of the second object and additional dependency relationships between other web objects;
determining an original page load time (PLT) and original timing information of the webpage;
simulating a page loading of the webpage based on adjusted timing information of at least one web object in the webpage and the PDG to estimate a new PLT of the webpage; and
comparing the original PLT of the webpage to the new PLT of the webpage to determine whether the adjusted timing information increased or decreased the new PLT of the webpage relative to the original PLT.

8. The computer-implemented method of claim 7, wherein the web objects include a stream object or a non-stream object.

9. The computer-implemented method of claim 7, wherein the extracting includes extracting web objects in the webpage by obtaining the corresponding Universal Resource Identifier (URI) of each web object.

10. The computer-implemented method of claim 7, wherein the extracting includes extracting web objects in the webpage that accesses at least one of a plurality of data centers (DCs) or a plurality of content distribution networks (CDNs).

11. The computer-implemented method of claim 7, wherein the extracting includes extracting web objects that include at least one of an Hypertext Markup Language (HTML) object, a Cascade Style Sheet (CSS) object, a JavaScript object, or an image object.

12. The computer-implemented method of claim 7, wherein the original timing information includes at least one of a client delay associated with at least one of page rendering or JavaScript execution, a server delay associated with at least one of retrieving static content or generating dynamic content, a network delay, or a round trip time (RTT).

13. The computer-implemented method of claim 12, wherein the network delay includes at least one of domain name system (DNS) lookup time, transmission control protocol (TCP) handshake time, or data transfer time.

14. The computer-implemented method of claim 7, wherein the adjusted timing information includes at least one of a modification to a client delay associated with at least one of page rendering or JavaScript execution, a modification to a server delay associated with at least one of retrieving static content or generating dynamic content, a modification to a network delay, or a modification to a round trip time (RTT).

15. The computer-implemented method of claim 14, wherein the modification to the network delay includes at least one of a DNS lookup time modification, a transmission control protocol (TCP) handshake time modification, or a data transfer time modification.

16. A computer readable memory storing computer-executable instructions that, when executed, cause one or more processors to perform acts that compare a plurality of page load times for a webpage, the acts comprising:
extracting a list of web objects from the webpage according to a corresponding Universal Resource Identifier (URI) of each web object;
determining that a first web object in the list is a descendant object of a second web object in the list at least when a delay in downloading of the second web object during a download of the webpage causes a corresponding delay in downloading of the first web object;
generating a parental dependency graph (PDG) that captures a dependency relationship indicating that the first web object is the descendant object of the second object and additional dependency relationships between other web objects;
determining an original page load time (PLT) and original timing information of the webpage;
simulating a page loading of the webpage based on adjusted timing information of at least one web object in the webpage and the PDG to estimate a new PLT of the webpage; and
comparing the original PLT of the webpage to the new PLT of the webpage to determine whether the adjusted timing information increased or decreased the new PLT of the webpage relative to the original PLT.

17. The computer readable memory of claim 16, wherein the original timing information includes at least one of a client delay associated with at least one of page rendering or JavaScript execution, a server delay associated with at least one of retrieving static content or generating dynamic content, a network delay, or a round trip time (RTT).

18. The computer readable memory of claim 17, wherein the network delay includes at least one of domain name system (DNS) lookup time, transmission control protocol (TCP) handshake time, or data transfer time.

19. The computer readable memory of claim 16, wherein the adjusted timing information includes at least one of a modification to a client delay associated with at least one of page rendering or JavaScript execution, a modification to a server delay associated with at least one of retrieving static content or generating dynamic content, a modification to a network delay, or a modification to a round trip time (RTT).

20. The computer readable memory of claim 19, wherein the modification to the network delay includes at least one of a DNS lookup time modification, a transmission control protocol (TCP) handshake time modification, or a data transfer time modification.