Investigation of a prefetch model for low bandwidth networks

Tuah, N. J., Kumar, M. and Venkatesh, S. 1998, Investigation of a prefetch model for low bandwidth networks, in WOWMOM 1998 : Proceedings of the First ACM/IEEE International Conference on Wireless and Mobile Multimedia, Association for Computing Machinery, New York, N. Y., pp. 38-47.

Attached Files
Name Description MIMEType Size Downloads

Title Investigation of a prefetch model for low bandwidth networks
Author(s) Tuah, N. J.
Kumar, M.
Venkatesh, S.
Conference name International Conference on Wireless and Mobile Multimedia (1st : 1998 : Dallas, Tex.)
Conference location Dallas, Tex.
Conference dates 30 Oct. 1998
Title of proceedings WOWMOM 1998 : Proceedings of the First ACM/IEEE International Conference on Wireless and Mobile Multimedia
Editor(s) [Unknown]
Publication date 1998
Conference series International Conference on Wireless and Mobile Multimedia
Start page 38
End page 47
Total pages 10
Publisher Association for Computing Machinery
Place of publication New York, N. Y.
Keyword(s) prefetch
bandwidth
mobile computing
performance prediction
mainline prefetch
branch prefetch
Summary We investigate speculative prefetching under a model in which prefetching is neither aborted nor preempted by demand fetch but instead gets equal priority in network bandwidth utilisation. We argue that the non-abortive assumption is appropriate for wireless networks where bandwidth is low and latency is high, and the non-preemptive assumption is appropriate for Internet where prioritization is not always possible. This paper assumes the existence of an access model to provide some knowledge about future accesses and investigates analytically the performance of a prefetcher that utilises this knowledge. In mobile computing, because resources are severely constrained, performance prediction is as important as access prediction. For uniform retrieval time, we derive a theoretical limit of improvement in access time due to prefetching. This leads to the formulation of an optimal algorithrn for prefetching one access ahead. For non-uniform retrieval time, two different types of prefetching of multiple documents, namely mainline and branch prefetch, are evaluated against prefetch of single document. In mainline prefetch, the most probable sequence of future accesses is prefetched. In branch prefetch, a set of different alternatives for future accesses is prefetched. Under some conditions, mainline prefetch may give slight improvement in user-perceived access time over single prefetch with nominal extra retrieval cost, where retrieval cost is defined as the expected network time wasted in non-useful prefetch. Branch prefetch performs better than mainline prefetch but incurs more retrieval cost.
ISBN 9781581130935
1581130937
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 ©1998, ACM
Persistent URL http://hdl.handle.net/10536/DRO/DU:30044770

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
Access Statistics: 30 Abstract Views, 1 File Downloads  -  Detailed Statistics
Created: Tue, 01 May 2012, 10:57:00 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.