A Decision-theoretic approach for pre-sending information on the WWW

{d~a, amm, ingrid}~csse, monash, edu. au Abstract. We present a decision-theoretic model which determines whether to pre-send web documents a user is likely to request. Our model balances the cost of transmitting information with the inconvenience or cost to a user caused by having to wait for information. It uses a Markov model built from web-access data to predict which documents are likely to be requested next. A comparative evaluation of our presending scheme identifies circumstances in which our scheme is beneficial for users.

A Decision-theoretic Approach for Pre-sending Information on the WWW

We present a decision-theoretic model which determines whether to pre-send web documents a user is likely to request. Our model balances the cost of transmitting information with the inconvenience or cost to a user caused by having to wait for required information. It uses a Markov model built from web-access data to predict which documents are likely to be requested next. A comparative evaluation of our pre-sending scheme identifies circumstances in which our scheme is beneficial for users. Keywords: Decision theory, Markov Model, WWW. 1 Introduction Users typically have to wait for information they require from the World Wide Web (WWW). If the waiting time is excessive, this results in increased costs and user dissatisfaction, and, for work-related tasks, loss of productivity. The aim of this research is to develop a system that reduces a user's expected waiting time by pre-sending information s/he is likely to request. However, there is an obvious trade-off between the cost of po..

Evaluation, Analysis and adaptation of web prefetching techniques in current web

Abstract This dissertation is focused on the study of the prefetching technique applied to the World Wide Web. This technique lies in processing (e.g., downloading) a Web request before the user actually makes it. By doing so, the waiting time perceived by the user can be reduced, which is the main goal of the Web prefetching techniques. The study of the state of the art about Web prefetching showed the heterogeneity that exists in its performance evaluation. This heterogeneity is mainly focused on four issues: i) there was no open framework to simulate and evaluate the already proposed prefetching techniques; ii) no uniform selection of the performance indexes to be maximized, or even their definition; iii) no comparative studies of prediction algorithms taking into account the costs and benefits of web prefetching at the same time; and iv) the evaluation of techniques under very different or few significant workloads. During the research work, we have contributed to homogenizing the evaluation of prefetching performance by developing an open simulation framework that reproduces in detail all the aspects that impact on prefetching performance. In addition, prefetching performance metrics have been analyzed in order to clarify their definition and detect the most meaningful from the user's point of view. We also proposed an evaluation methodology to consider the cost and the benefit of prefetching at the same time. Finally, the importance of using current workloads to evaluate prefetching techniques has been highlighted; otherwise wrong conclusions could be achieved. The potential benefits of each web prefetching architecture were analyzed, finding that collaborative predictors could reduce almost all the latency perceived by users. The first step to develop a collaborative predictor is to make predictions at the server, so this thesis is focused on an architecture with a server-located predictor. The environment conditions that can be found in the web are alsDoménech I De Soria, J. (2007). Evaluation, Analysis and adaptation of web prefetching techniques in current web [Tesis doctoral no publicada]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/1841Palanci

Prefetchingverfahren für verteilte hypermediale Lernanwendungen

Verteilte hypermediale Lernanwendungen sind Echtzeitanwendungen. Im Anwendungsablauf, insbesondere während der Navigation, sind nachladebedingte zeitliche Verzögerungen zu vermeiden. Prefetching stellt eine Möglichkeit der Reduktion zeitlicher Verzögerungen dar. Die vorgelegte Arbeit entwickelt ein speziell auf verteilte hypermediale Lernanwendungen zugeschnittenes Prefetchingkonzept. Es werden kombinatorische Optimierungsprobleme dargestellt sowie deren algorithmische Lösbarkeit untersucht. Die Probleme werden komplexitätstheoretisch eingeordnet, effiziente Lösungsverfahren dargestellt sowie die Integration der Optimierungsergebnisse in Entwurf und Betrieb einer Lernanwendung aufgezeigt