Performance modelling of speculative prefetching for compound requests in low bandwidth networks

Tuah, N. J., Kumar, M. J. and Venkatesh, S. 2000, Performance modelling of speculative prefetching for compound requests in low bandwidth networks, in WOWMOM 2000 : Proceedings of the 3rd ACM International Workshop on Wireless Mobile Multimedia, ACM, New York, N. Y., pp. 83-92.

Attached Files
Name Description MIMEType Size Downloads

Title Performance modelling of speculative prefetching for compound requests in low bandwidth networks
Author(s) Tuah, N. J.
Kumar, M. J.
Venkatesh, S.
Conference name ACM International Workshop on Wireless Mobile Multimedia (3rd : 2000 : Boston, Mass.)
Conference location Boston, Mass.
Conference dates 11 Aug. 2000
Title of proceedings WOWMOM 2000 : Proceedings of the 3rd ACM International Workshop on Wireless Mobile Multimedia
Editor(s) Basu, K.
Das, S. K.
Tripathi, S. K.
Publication date 2000
Conference series ACM International Workshop on Wireless Mobile Multimedia
Start page 83
End page 92
Total pages 10
Publisher ACM
Place of publication New York, N. Y.
Keyword(s) caching
compound requests
speculative prefetching
web
Summary To improve the accuracy of access prediction, a prefetcher for web browsing should recognize the fact that a web page is a compound. By this term we mean that a user request for a single web page may require the retrieval of several multimedia items. Our prediction algorithm builds an access graph that captures the dynamics of web navigation rather than merely attaching probabilities to hypertext structure. When it comes to making prefetch decisions, most previous studies in speculative prefetching resort to simple heuristics, such as prefetching an item with access probabilities larger than a manually tuned threshold. The paper takes a different approach. Specifically, it models the performance of the prefetcher and develops a prefetch policy based on a theoretical analysis of the model. In the analysis, we derive a formula for the expected improvement in access time when prefetch is performed in anticipation for a compound request. We then develop an algorithm that integrates prefetch and cache replacement decisions so as to maximize this improvement. We present experimental results to demonstrate the effectiveness of compound-based prefetching in low bandwidth networks.
ISBN 1581133030
Language eng
Field of Research 089999 Information and Computing Sciences not elsewhere classified
Socio Economic Objective 970108 Expanding Knowledge in the Information and Computing Sciences
HERDC Research category E1.1 Full written paper - refereed
Copyright notice ©2000, ACM
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044533

Document type: Conference Paper
Collection: School of Information Technology
Connect to link resolver
 
Unless expressly stated otherwise, the copyright for items in DRO is owned by the author, with all rights reserved.

Versions
Version Filter Type
Citation counts: Scopus Citation Count Cited 5 times in Scopus
Google Scholar Search Google Scholar
Access Statistics: 25 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Fri, 20 Apr 2012, 11:30:19 EST

Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO. If you believe that your rights have been infringed by this repository, please contact drosupport@deakin.edu.au.