Web-application centric object prefetching
TL;DR: This work proposes a Web-application centric object prefetcher that augments the customary demand-fetching mechanism founded in most Web browsers utilized for object caching, which is complimentary to the operations of Web browser and proxy server caching.
About: This article is published in Journal of Systems and Software.The article was published on 2003-09-15. It has received 11 citations till now. The article focuses on the topics: Web page & Static web page.
Citations
More filters
TL;DR: The results presented in this paper show that this proposed method can be effective in improving a web browser's cache-hit percentage, while significantly lowering web page rendering latency.
Abstract: To date the most common means of gaining access to the Internet continues to be via dial-up modem connections. These slow communication channels significantly affect the rendering of the majority of web pages. Higher speed communications channels can alleviate rendering latency but based on the web page's content, delays still are incurred. The technique of web object prefetching can expedite the presentation of web pages by utilizing the current web page's view time to acquire the web objects of future web pages. The proposed Semantic Link Prefetcher utilizes information associated with the current web page's hyperlink set to predict which web objects to prefetch during the limited view time interval of the current web page. The results presented in this paper show that this proposed method can be effective in improving a web browser's cache-hit percentage, while significantly lowering web page rendering latency.
34 citations
TL;DR: The proposed Markov-Knapsack method uses an approach that combines a Multi-Markov Web-application centric prefetch model with a Knapsack Web object selector to enhance Web page rendering performance and can be effective in improving a Web browser cache-hit percentage while significantly lowering Webpage rendering latency.
15 citations
Cites methods from "Web-application centric object pref..."
...In Pons (2002), we introduced a Multi-Markov Web application centric prefetching approach....
[...]
Journal Article•
TL;DR: A speculative processing approach for the server-based model that increases the Quality-of-Service of Internet applications that utilize this architecture and finds a 23% increase in the quality of service associated with ASP web-application clients.
Abstract: The evolution and increased use of business on the Internet has become a driving force in the deployment and management of Internet business applications. Consequently, many Application Service Pro...
8 citations
Cites background from "Web-application centric object pref..."
...Pons (16) has proposed a web-application centric approach to prefetching that combines client-side predicting with domain limiting hyperlinks and personalization to achieve an effective model for object retrieval....
[...]
26 Jul 2007
TL;DR: The text put forward conceive of build e-commerce platform based on NLB (network load balancing), which will provide standard procedures, a group of instant use, perfect function and secure e-commercial services, which makes full use of the resources.
Abstract: With the rapid development of Internet, as a new type of commercial model, e-commerce develops rapidly all over the world. However, seen from the whole e-commerce's field some small e-commerce business remains stagnant for a long time capital; but they do not lack of cheap hardware. Based on this, we assume that if we can combine all kinds of resources such as storage, PC servers, telecommunications and software in the Internet, we can connect them on the united platform, provide standard procedures, a group of instant use, perfect function and secure e-commercial services, which makes full use of the resources makes the departments share information and business procedures be with each other, and as a result, IT systems in e-commerce fields can combined efficiently. So this text put forward conceive of build e-commerce platform based on NLB (network load balancing).
2 citations
Cites background from "Web-application centric object pref..."
...The cookie is sent to the client and it contains information that identifies the user[8]....
[...]
TL;DR: A web application prefetcher based on a Markov model predictor that uses a Knapsack method to conduct object bundling, which increases the rendering speed of future web pages.
Abstract: Prefetching is a technique that has the potential to reduce waiting time for retrieving data over slow communications channels, such as wireless mobile networks and dial-up modem Internet connections. Prefetching performance is measured by the accuracy employed in determining what to prefetch within the limited time associated with the currently rendered web page. This article proposes a web application prefetcher based on a Markov model predictor that uses a Knapsack method to conduct object bundling, which increases the rendering speed of future web pages. Through web simulation from actual website traces, the proposed technique reduces the rendering delay of most future web page compared to demand requests.
1 citations
Cites methods from "Web-application centric object pref..."
...In [13, 14], a multi-Markov web-applicationcentric prefetching approach is presented that maintains a Markov model for each server-supported web application that is sent to the client and subsequently personalized to conduct object prefetching using different object selection criteria....
[...]
References
More filters
01 Jul 1996
TL;DR: This work investigates a scheme for reducing the latency perceived by users by predicting and prefetching files that are likely to be requested soon, while the user is browsing through the currently displayed page.
Abstract: The long-term success of the World Wide Web depends on fast response time. People use the Web to access information from remote sites, but do not like to wait long for their results. The latency of retrieving a Web document depends on several factors such as the network bandwidth, propagation time and the speed of the server and client computers. Although several proposals have been made for reducing this latency, it is difficult to push it to the point where it becomes insignificant.This motivates our work, where we investigate a scheme for reducing the latency perceived by users by predicting and prefetching files that are likely to be requested soon, while the user is browsing through the currently displayed page. In our scheme the server, which gets to see requests from several clients, makes predictions while individual clients initiate prefetching. We evaluate our scheme based on trace-driven simulations of prefetching over both high-bandwidth and low-bandwidth links. Our results indicate that prefetching is quite beneficial in both cases, resulting in a significant reduction in the average access time at the cost of an increase in network traffic by a similar fraction. We expect prefetching to be particularly profitable over non-shared (dialup) links and high-bandwidth, high-latency (satellite) links.
835 citations
"Web-application centric object pref..." refers methods in this paper
...The method proposed by Padmanabhan and Mogul (1996) introduced a server-initiated prefetching approach where the web server maintains a per-client usage statistics and determines a page request interdependency graph-based Markov model....
[...]
01 Oct 1997
TL;DR: It is shown that delta encoding can provide remarkable improvements in response size and response delay for an important subset of HTTP content types, and that the combination of delta encoding and data compression yields the best results.
Abstract: Caching in the World Wide Web currently follows a naive model, which assumes that resources are referenced many times between changes. The model also provides no way to update a cache entry if a resource does change, except by transferring the resource's entire new value. Several previous papers have proposed updating cache entries by transferring only the differences, or "delta," between the cached entry and the current value.In this paper, we make use of dynamic traces of the full contents of HTTP messages to quantify the potential benefits of delta-encoded responses. We show that delta encoding can provide remarkable improvements in response size and response delay for an important subset of HTTP content types. We also show the added benefit of data compression, and that the combination of delta encoding and data compression yields the best results.We propose specific extensions to the HTTP protocol for delta encoding and data compression. These extensions are compatible with existing implementations and specifications, yet allow efficient use of a variety of encoding techniques.
357 citations
01 Jan 1997
346 citations
01 May 1999
TL;DR: Results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23.4% using the Prediction-by-Partial-Matching (PPM) algorithm, and which generates 1% to 15% extra trafhc on the modem links.
Abstract: The majority of the Internet population access the World Wide Web via dial-up modem connections. Studies have shown that the limited modem bandwidth is the main contributor to latency perceived by users. In this paper, we investigate one approach to reduce latency: prefetching between caching proxies and browsers. The approach relies on the proxy to predict which cached documents a user might reference next, and takes advantage of the idle time between user requests to push or pull the documents to the user. Using traces of modem Web accesses, we evaluate the potential of the technique at reducing client latency, examine the design of prediction algorithms, an’d investigate their performance varying the parameters and implementation concerns. Our results show that prefetching combined with large browser cache and delta-compression can reduce client latency up to 23.4%. The reduction is achieved using the Prediction-by-Partial-Matching (PPM) algorithm, whose accuracy ranges from 40% to 73% depending on its parameters, and which generates 1% to 15% extra trafhc on the modem links. A perfect predictor can increase the latency reduction to 28.50/o, whereas without prefetching, large browser cache and delta-compression can only reduce latency by 14.4%. Depending on the desired properties of the algorithm, several configurations for PPM can be best choices. Among several attractive simplifications of the scheme, some do more harm than others; in particular, it is important for the predictor to observe all accesses made by users, including browser cache hits.
290 citations
01 Sep 1991
TL;DR: It is shown for powerful models and mth order Markov sources that the page fault rates incurred by the prefetching algorithms presented are optimal in the limit for almost all sequences of page accesses.
Abstract: A form of the competitive philosophy is applied to the problem of prefetching to develop an optimal universal prefetcher in terms of fault ratio, with particular applications to large-scale databases and hypertext systems. The algorithms are novel in that they are based on data compression techniques that are both theoretically optimal and good in practice. Intuitively, in order to compress data effectively, one has to be able to predict feature data well, and thus good data compressors should be able to predict well for purposes of prefetching. It is shown for powerful models such as Markov sources and mth order Markov sources that the page fault rates incurred by the prefetching algorithms presented are optimal in the limit for almost all sequences of page accesses. >
208 citations
"Web-application centric object pref..." refers methods in this paper
...Fan et al. (1999) proposed a prediction algorithm based on the Prediction by Partial Matching (PPM) studied by Vitter and Krishnan (1996) that demonstrated a relationship between data compression (Mogul et al., 1997) and prediction....
[...]