首页 | 官方网站   微博 | 高级检索  
     


Using current web page structure to improve prefetching performance
Authors:Josep Domenech  Jose A. Gil  Julio Sahuquillo  Ana Pont
Affiliation:1. Basque Center for Applied Mathematics (BCAM), Al. de Mazarredo 14, 48009 Bilbao, Basque Country, Spain;2. Imperial College London, Department of Computing, 180 Queens Gate, SW7 2AZ, London, UK;1. Soft Computing Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Hafez Ave., 424, Iran;2. Image Processing and Pattern Recognition Laboratory, Computer Engineering and Information Technology Department, Amirkabir University of Technology (Tehran Polytechnic), Tehran, Hafez Ave., 424, Iran;1. Computer Science and Engineering, MVGR College of Engineering (Affiliated to JNTU Kakinada), Vizianagaram 535005, AP, India;2. Computer Science and Systems Engineering, AU College of Engineering, Andhra University, Visakhapatnam 530003, AP, India;1. Department of Automatic Control, Lund University, Lund, Sweden;2. Umeå University, Umeå, Sweden
Abstract:Web prefetching is a technique aimed at reducing user-perceived latencies in the World Wide Web. The spatial locality shown by user accesses makes it possible to predict future accesses from the previous ones. A prefetching engine uses these predictions to prefetch 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 number 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 not useful to reduce the user-perceived latency because these algorithms do not take into account the structure of the current web pages, i.e., 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 is not made early enough to prefetch the objects and, therefore, there is no latency reduction. In this paper we present 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. Results show that, for the same number of extra requests to the server, DDG reduces the perceived latency, on average, 40% more than the existing algorithms. Moreover, DDG distributes latency reductions more homogeneously among users.
Keywords:
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司    京ICP备09084417号-23

京公网安备 11010802026262号