DDG: An Efficient Prefetching Algorithm for Current Web Generation
Josep Domenech,José A. Gil,Julio Sahuquillo,Ana Pont +3 more
- 01 Nov 2006
- pp 1-12
TL;DR: The DDG algorithm that distinguishes between container objects (HTML) and embedded objects is presented to create a new prediction model according to the structure of the current Web to reduce the user's perceived latency.
read more
Abstract: Web prefetching is one of the techniques proposed to reduce user's perceived latencies in the World Wide Web The spatial locality shown by user's accesses makes it possible to predict future accesses based on the previous ones A prefetching engine uses these predictions to prefetch the web objects before the user demands them The existing prediction algorithms achieved an acceptable performance when they were proposed but the high increase in the amount of embedded objects per page has reduced their effectiveness in the current web In this paper we show that most of the predictions made by the existing algorithms are useless to reduce the user's perceived latency because these algorithms do not take into account how current web pages are structured, ie, an HTML object with several embedded objects Thus, they predict the accesses to the embedded objects in an HTML after reading the HTML itself For this reason, the prediction advance is not enough to prefetch the objects and therefore there is no latency reduction As a result of a wide analysis of the behaviour of the most commonly used algorithms, in this paper we present the DDG algorithm that distinguishes between container objects (HTML) and embedded objects to create a new prediction model according to the structure of the current web Results show that, for the same amount of extra requests to the server, DDG always outperforms the existing algorithms by reducing the perceived latency between 15% and 150% more without increasing the computing complexity
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Figures
Fig. 14. Deciding whether to predict HTML files in the DDG algorithm under the workload A 
Fig. 7. Algorithm for making the prediction model in DDG 
Fig. 19. Relative performance comparison of DDG vs PPM algorithms under the workload B. Positive values mean that DDG outperforms PPM, while negative ones mean that PPM outperforms DDG in the selected metrics. 
Fig. 17. Relative performance comparison of DDG vs DG algorithms under the workload A. Positive values mean that DDG outperforms DG, while negative ones would mean that DG outperforms DDG in the selected metrics. 
Fig. 18. Algorithms comparison under the workload B 
Fig. 1. Architecture of the simulation environment
Citations
Dissecting Web Latency in Ghana
Yasir Zaki,Jay Chen,Thomas Pötsch,Talal Ahmad,Lakshminarayanan Subramanian +4 more
- 05 Nov 2014
TL;DR: A range of well-known end-to-end latency optimizations are experiment with and it is found that simple DNS caching, redirection caching, and the use of SPDY can all yield substantial improvements to user-perceived latency.
The Impact of the Web Prefetching Architecture on the Limits of Reducing User's Perceived Latency
Josep Domenech,Julio Sahuquillo,José A. Gil,Ana Pont +3 more
- 18 Dec 2006
TL;DR: Experimental results show that the best element of the Web architecture to locate a single prediction engine is the proxy, whose implementation could reduce the perceived latency up to 67% and schemes for collaborative predictors located at diverse elements of theWeb architecture are analyzed.
Using current web page structure to improve prefetching performance
TL;DR: This paper presents the double dependency graph (DDG) algorithm that distinguishes between container objects (HTML) and embedded objects to create a new prediction model according to the structure of the current web, which reduces the perceived latency by 40% more than the existing algorithms.
32
A web caching and prefetching simulator
J. Marquez,Josep Domenech,José A. Gil,Ana Pont +3 more
- 07 Nov 2008
TL;DR: This work proposes a novel global framework for performance evaluation in scenarios where different parts of the Web architecture interact that allows to represent faithfully the behaviour of each element of the architecture in order to study, reproduce, evaluate and design Web strategies to decrease the user's perceived latency when surfing the Web.
References
•Proceedings Article
Hypertext Transfer Protocol -- HTTP/1.1
Roy T. Fielding,James Gettys,Jeffrey C. Mogul,H. Frystyk,Larry Masinter,Paul J. Leach,Tim Berners-Lee +6 more
- 01 Jan 1997
TL;DR: The Hypertext Transfer Protocol is an application-level protocol for distributed, collaborative, hypermedia information systems, which can be used for many tasks beyond its use for hypertext through extension of its request methods, error codes and headers.
4.4K
A data mining algorithm for generalized Web prefetching
TL;DR: A new algorithm is proposed, called WM, which is based on data mining and is proven to be a generalization of existing ones and was designed to address their specific limitations and its characteristics include all the above factors.
182
•Dissertation
Web prefetching using partial match prediction
Themistoklis Palpanas
- 01 Jan 1998
TL;DR: This study investigates the use of partial match prediction, a technique taken from the compression literature, for prefetching in the Web, and simulation results suggest that a high fraction of the predictions are accurate, so additional network traffic is kept low and the simulations show thatPrefetching can substantially increase cache rates.
167
A popularity-based prediction model for Web prefetching
Xin Chen,Xiaodong Zhang +1 more
TL;DR: A variation of the prediction by partial match model, for example, makes prefetching decisions by reviewing URLs clients have accessed on a particular server, then structuring them in a Markov predictor tree is proposed that builds common surfing patterns and regularities into the tree.
145
A new Markov model for Web access prediction
Xing Dongshan,Shen Jun-yi +1 more
- 01 Nov 2002
TL;DR: In this paper, a hybrid-order treelike Markov model is proposed to predict Web access precisely while providing high coverage and scalability, which is crucial in the rapidly growing World Wide Web.
89