Using current web page structure to improve prefetching performance

被引:16
|
作者
Domenech, Josep [1 ]
Gil, Jose A. [1 ]
Sahuquillo, Julio [1 ]
Pont, Ana [1 ]
机构
[1] Univ Politecn Valencia, Dept Comp Engn DISCA, Valencia 46022, Spain
关键词
Web prefetching; Web performance;
D O I
10.1016/j.comnet.2009.11.016
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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, DOG reduces the perceived latency, on average, 40% more than the existing algorithms. Moreover, DDG distributes latency reductions more homogeneously among users. (C) 2009 Elsevier B.V. All rights reserved.
引用
收藏
页码:1404 / 1417
页数:14
相关论文
共 50 条
  • [1] Efficient Web Browsing with Perfect Anonymity Using Page Prefetching
    Yu, Shui
    Thapngam, Theerasak
    Wei, Su
    Zhou, Wanlei
    [J]. ALGORITHMS AND ARCHITECTURES FOR PARALLEL PROCESSING, PT 1, PROCEEDINGS, 2010, 6081 : 1 - 12
  • [2] Optimizing Web Servers Using Page Rank Prefetching for Clustered Accesses
    Safronov V.
    Parashar M.
    [J]. World Wide Web, 2002, 5 (1) : 25 - 40
  • [3] Optimizing Web servers using Page rank prefetching for clustered accesses
    Safronov, V
    Parashar, M
    [J]. INFORMATION SCIENCES, 2003, 150 (3-4) : 165 - 176
  • [4] A note on the paper: Optimizing web servers using page rank prefetching for clustered accesses
    Ching, WK
    [J]. INFORMATION SCIENCES, 2005, 169 (3-4) : 245 - 247
  • [5] A Prefetching Scheme for Improving the Web Page Loading Time with NVRAM
    Hong, Seungkyu
    Kim, Kyusik
    Kim, Taeseok
    [J]. JOURNAL OF SEMICONDUCTOR TECHNOLOGY AND SCIENCE, 2018, 18 (01) : 20 - 28
  • [6] Improve the Performance of LRU Page Replacement Algorithm using Augmentation of Data Structure
    Kavar, C. C.
    Parmar, S. S.
    [J]. 2013 FOURTH INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS AND NETWORKING TECHNOLOGIES (ICCCNT), 2013,
  • [7] OPTIMIZING UNDER ABSTRACTION: USING PREFETCHING TO IMPROVE FPGA PERFORMANCE
    Yang, Hsin-Jung
    Fleming, Kermin
    Adler, Michael
    Emer, Joel
    [J]. 2013 23RD INTERNATIONAL CONFERENCE ON FIELD PROGRAMMABLE LOGIC AND APPLICATIONS (FPL 2013) PROCEEDINGS, 2013,
  • [8] Web prefetching performance metrics:: A survey
    Domenech, Josep
    Gil, Jose A.
    Sahuquillo, Julio
    Pont, Ana
    [J]. PERFORMANCE EVALUATION, 2006, 63 (9-10) : 988 - 1004
  • [9] User behavior modeling and content based speculative web page prefetching
    Georgakis, A.
    Li, H.
    [J]. DATA & KNOWLEDGE ENGINEERING, 2006, 59 (03) : 770 - 788
  • [10] A COMPARISON OF PREDICTION ALGORITHMS FOR PREFETCHING IN THE CURRENT WEB
    Domenech, Josep
    Sahuquillo, Julio
    Gil, Jose A.
    Pont, Ana
    [J]. JOURNAL OF WEB ENGINEERING, 2012, 11 (01): : 64 - 78