Web prefetching between low-bandwidth clients and proxies: potential and performance
SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
IEEE Internet Computing
A Performance Model of Speculative Prefetching in Distributed Information Systems
IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
The Potential Costs and Benefits of Long-term Prefetching for ContentDistribution
The Potential Costs and Benefits of Long-term Prefetching for ContentDistribution
Exploring the bounds of web latency reduction from caching and prefetching
USITS'97 Proceedings of the USENIX Symposium on Internet Technologies and Systems on USENIX Symposium on Internet Technologies and Systems
Multiuser prefetching with queuing prioritization in heterogeneous wireless systems
QShine '06 Proceedings of the 3rd international conference on Quality of service in heterogeneous wired/wireless networks
Modeling RPS and evaluating video repair with VQM
IEEE Transactions on Multimedia
A comparison of prediction algorithms for prefetching in the current web
Journal of Web Engineering
| Hi-index | 0.00 |
Prefetching is a potential method to reduce waiting time for retrieving data over wireless network connections that commonly occur in mobile scenarios. These connections typically exhibit low bandwidth as well as high latency. This article analyzes fundamental principles in speculative prefetching. Based on a simplified system model, the influence of parameters and strategies on prefetching performance is investigated, both analytically and in simulation. The reduction of the mean waiting time is used as performance metric. An example is given that makes use of the Zipf distribution to demonstrate the influence of the documents' probability distribution and its parameters. A low-complexity algorithm that performs optimally under the given assumptions is presented.