On-Demand Prefetching Heuristic Policies: A Performance Evaluation

  • Olivia MoradEmail author
  • Alain Jean-Marie
Conference paper


Prefetching is a basic mechanism in the World Wide Web that speculates on the future behaviour of users to avoid the response delays. The relatively new requirement of the instantaneous response in some interactive services like On-Demand applications fuelled the need for ways to represent and reason about the challenging problem of prefetching control and performance evaluation. We study this challenging problem under a network protocol that adopts the simultaneous prefetching with equal-shared bandwidth, and in prefetching situations in which the controller seeks to reach a Zero-Cost system state as quickly as possible. Within this context, our first contribution is providing the backbone of a new paradigm for the performance evaluation of the On-demand prefetching policy. This backbone consists of our previously developed prefetching control model; the PREF-CT model and our previously developed optimal control algorithms; the ONE-PASS and the TREE-DEC algorithms. Our second contribution is developing the prefetching heuristic algorithm: the RBP. Compared to the optimal prefetching policies, the prefetching policies computed by our heuristic algorithm the RBP show significant performance in terms of the user’s latency and the bandwidth utilization.


Optimal Control Prefetching Performance evaluation 



This research has been funded by the French National Research Agency (ANR): project VOODDO number ANR-07-RIAM-0012.


  1. 1.
    B.D. Davison, The design and evaluation of web prefetching and caching techniques (The State University of New Jersey, Rutgers, 2002)Google Scholar
  2. 2.
    N. J. Tuah, M. Kumar, S. Venkatesh, Investigation of a prefetch model for low bandwidth networks, in Proceedings of the 1st ACM international workshop on Wireless mobile multimedia, pp. 38–47 (1998)Google Scholar
  3. 3.
    X. Dongshan, S. Junyi, A new markov model for web access prediction. Comput. Sci. Eng. 4, 34–39 (2002)CrossRefGoogle Scholar
  4. 4.
    M.A. Awad, I. Khalil, Prediction of user’s web-browsing behavior: Application of markov model. Systems, Man, and Cybernetics, Part B: Cybernetics, IEEE Trans. 42, 1131–1142 (2012)CrossRefGoogle Scholar
  5. 5.
    O. Morad, A. Jean-Marie, Prefetching control for on demand contents distribution: A Markov decision process model, IEEE 22nd International Symposium on Modelling, Analysis and Simulation of Computer and Telecommunication Systems, Paris, France, 2014, (in press)Google Scholar
  6. 6.
    F.V. Fomin, F. Giroire, A. Jean-Marie, D. Mazauric, N. Nisse, To satisfy impatient web surfers is hard. Theor. Comput. Sci. 526, 1–17 (2014)CrossRefzbMATHMathSciNetGoogle Scholar
  7. 7.
    R. Grigoras, V. Charvillat, M. Douze, Optimizing hypervideo navigation using a Markov decision process approach, in Proceedings of the Tenth ACM International Conference on Multimedia, pp. 39–48 (2002)Google Scholar
  8. 8.
    M.L. Puterman, Markov Decision Processes: Discrete Stochastic Dynamic Programming (Wiley, Hoboken, 2009)Google Scholar
  9. 9.
    E. P. Markatos, C. E. Chronaki, A top-10 approach to prefetching on the web, in Proceedings of INET, pp. 276–290 (1998)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.LIRMM : Montpellier 2 University/CNRSMontpellierFrance
  2. 2.INRIAMontpellierFrance

Personalised recommendations