Resource-aware speculative prefetching in wireless networks

被引:17
作者
Tuah, NJ
Kumar, M
Venkatesh, S
机构
[1] Univ Texas, Dept Comp Sci & Engn, Arlington, TX 76019 USA
[2] Univ Brunei Darussalam, Fac Sci, Gadong BE1410, Brunei
[3] Curtin Univ Technol, Sch Comp, Perth, WA 6845, Australia
关键词
speculative prefetching; caching; compound request; network load; bandwidth;
D O I
10.1023/A:1020829124143
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Mobile users connected to wireless networks expect performance comparable to those on wired networks for interactive multimedia applications. Satisfying Quality of Service (QoS) requirements for such applications in wireless networks is a challenging problem due to limitations of low bandwidth, high error rate and frequent disconnections of wireless channels. In addition, wireless networks suffer from varying bandwidth. In this paper we investigate object prefetching during times of connectedness and bandwidth availability to enhance user perceived connectedness. This paper presents an access model that is suitable for multimedia access in wireless networks. Access modelling for the purpose of predicting future accesses in the context of speculative prefetching has received much attention in the literature. The model recognizes that a web page, instead of just a single file, is typically a compound of several files. 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. This paper takes a different approach. Specifically, it models the performance of the prefetcher, taking into account access predictions and resource parameters, and develops a prefetch policy based on a theoretical analysis of the model. Since the analysis considers cache as one of the resource parameters, the resulting policy integrates prefetch and cache replacement decisions. The paper investigates the effect of prefetching on network load. In order to make effective use of available resources and maximize access improvement, it is beneficial to prefetch all items with access probabilities exceeding certain threshold.
引用
收藏
页码:61 / 72
页数:12
相关论文
共 22 条
[11]  
LEI H, 1997, P USENIX ANN TECHN C
[12]  
MARKATOS EP, 1996, 173 ICS FORTH
[13]  
Martello S., 1990, KNAPSACK PROBLEMS AL
[14]  
NELSON MN, 1988, ACM T COMPUTER SYSTE, V6
[15]  
SANDBERG R, 1985, P SUMM 1985 USENIX C, P119
[16]   A case for delay-conscious caching of Web documents [J].
Scheuermann, P ;
Shim, JH ;
Vingralek, R .
COMPUTER NETWORKS AND ISDN SYSTEMS, 1997, 29 (8-13) :997-1005
[17]  
TAIT CD, 1993, THESIS COLUMBIA U
[18]   A performance model of speculative prefetching in distributed information systems [J].
Tuah, NJ ;
Kumar, M ;
Venkatesh, S .
IPPS/SPDP 1999: 13TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & 10TH SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, PROCEEDINGS, 1999, :75-80
[19]  
TUAH NJ, 1998, 1 ACM INT WORKSH WIR, P38
[20]  
TUAH NJ, 2000, P 3 ACM INT WORKSH W, P83