N. J. Tuah
ABSTRACT
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.
- 1.Andonov, R., V. Poirriez, and S. Rajopadhye, "Unbounded knapsack problem: Dynamic programming revisited," Technical Report PI-1152, IRISA, France, (October 1997).]]Google Scholar
- 2.Bolot, J-C., and P. Hoschka, "Performance engineering of the world wide web," WWW Journal, 1(3):185-195 (1996).]]Google Scholar
- 3.Cao, P., "Application-Controlled File Caching and Prefetching," PhD thesis, Department of Computer Science, Princeton University (January 1996).]] Google ScholarDigital Library
- 4.Cumha, C., A.Bestavros, and M.E. Crovella, "Characteristics of WWW client traces,", Technical Report TR-95-010, Boston University Department of Computer Science, (April 1995).]] Google ScholarDigital Library
- 5.Curewitz,K.M., P. Krishnan, and J.S. Vitter,"Practical prefetching via data compression," Proc. of ACM- SIGMOD International Conference on Management of Data, pages 257-266, (May 1993).]] Google ScholarDigital Library
- 6.Griffioen, J. and R. "Appleton Reducing file system latency using a predictive approach," in Proc 1994 Summer USENIX Conference, pages 197-208, (June 1994).]] Google ScholarDigital Library
- 7.Griffioen,J. and Randy Appleton, "Performance measurement of automatic prefetching,"In Proc of the ISCA International Conference on Parallel and Distributed Computing Systems, (September 1995).]]Google Scholar
- 8.Griffioen, J. and Randy Appleton,"The design, implementation and evaluation of a predictive caching file system," Technical Report CS-264-96, Department of Computer Science, University of Kentucky, (June 1996).]]Google Scholar
- 9.Jiang, Z. and L. Kleinrock, "An adaptive network prefetch scheme," IEEE Journal on Selected Areas in Communications, 16(3):358-368, (April 1998).]]Google ScholarDigital Library
- 10.Lei, H. and D. Duchamp, "An analytical approach to file prefetching," In Proc USENIX Annual Technical Conf, (January 1997).]] Google ScholarDigital Library
- 11.Markatos, E.P. and C.E. Chronaki, "A top- 10 approach to prefetching on the web," Technical Report TR 173, ICS-FORTH, Greece, (August 1996).]]Google Scholar
- 12.Martello, S. and P. Toth, "Knapsack Problems: Algorithms and Computer Implementation," Wiley, (1990).]] Google ScholarDigital Library
- 13.Padmanabhan, V.N. and J.C. Mogul, "Using predictive prefetching to improve world wide web !atency,"ACM SIGCOMM Computer Communication Review, pages 22-36, July 1996.]] Google ScholarDigital Library
- 14.Patterson, R.H., G.A. Gibson, E. Ginting, D. Stodolsky, and J. Zelenka, "Informed prefetching and caching" In Proc 15th ACM Symposium on Operating System Principles, pages 79-95, (December 1995).]] Google ScholarDigital Library
- 15.Scheuermann,P., J. Shim, and R. Vingralek, "WATCHMAN: A data warehouse intelligent cache manager. In Proc. of 22rid VLDB Conf, (1996).]] Google ScholarDigital Library
- 16.Scheuermann, P., J. Shim, and R. Vingralek, A case for delay-conscious caching of web documents," Computer Networks, 29(08-13):997-1005, (September 1997).]] Google ScholarDigital Library
- 17.Tait, C.D., "A File System for Mobile Computing," PhD thesis, Graduate School of Arts and Sciences, Columbia University, (1993).]] Google ScholarDigital Library
- 18.Tuah, N.J., M.Kumar, and S. Venkatesh, "Investigation of a prefetch model for low bandwidth networks," In Proc. 1st ACM Intl Workshop on Wireless Mobile Multimedia, pages 38-47, (October 1998).]] Google ScholarDigital Library
- 19.Tuah, N.J., M.Kumar, and S. Venkatesh, "Performance model of speculative prefetching in distributed information systems" In Proc IPPS/SPDP 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing, pages 75-80, (April 1999).]] Google ScholarDigital Library
- 20.Vitter, J.S. and P.Krishnan, "Optimal prefetching via data compression," Journal of the ACM, 43(5):771-793, (September 1996).]] Google ScholarDigital Library
- 21.Wooster, R.P. and M. Abrams, "Proxy caching that estimates page load delays," Computer Networks, 29(08-13):977-986, (September 1997).]] Google ScholarDigital Library
Index Terms
- Performance modelling of speculative prefetching for compound requests in low bandwidth networks
Recommendations
Resource-aware speculative prefetching in wireless networks
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 ...
Modeling LRU cache with invalidation
Least Recently Used (LRU) is a very popular caching replacement policy. It is very easy to implement and offers good performance, especially when data requests are temporally correlated, as in the case of web traffic.When the data content can change ...
Interactive web caching for slow or intermittent networks
ACM DEV-4 '13: Proceedings of the 4th Annual Symposium on Computing for DevelopmentWe explore the limitations of existing caching mechanisms in slow networks and propose a new model of web caching designed for developing regions called interactive caching. Unlike conventional caching, interactive caching makes interacting with the ...
Comments