Web prefetching between low-bandwidth clients and proxies

FanLi,; CaoPei,; LinWei,; JacobsonQuinn,

doi:10.1145/301464.301557

Cited by 83 publications

(106 citation statements)

References 12 publications

Supporting

Mentioning

103

Contrasting

Order By: Relevance

“…In the literature, there are mainly three types of prefetching: server based hints prefetching [AEFP98, AZN99, Mog96], local prefetching [WLZC12] and proxy based prefetching [FCLJ99]. In local prefetching, the client has no aid Inria from the server when deciding which documents to prefetch.…”

Section: Related Workmentioning

confidence: 99%

Connected Surveillance Game

Giroire

Mazauric

Nisse

et al. 2013

Structural Information and Communication Complexity

View full text Add to dashboard Cite

Abstract:The surveillance game [Fomin et al., 2012] models the problem of web-page prefetching as a pursuit evasion game played on a graph. This two-player game is played turn-by-turn. The first player, called the observer, can mark a fixed amount of vertices at each turn. The second one controls a surfer that stands at vertices of the graph and can slide along edges. The surfer starts at some initially marked vertex of the graph, her objective is to reach an unmarked node before all nodes of the graph are marked. The surveillance number sn(G) of a graph G is the minimum amount of nodes that the observer has to mark at each turn ensuring it wins against any surfer in G. Fomin et al. also defined the connected surveillance game where the observer must ensure that marked nodes always induce a connected subgraph. They ask what is the cost of connectivity, i.e., is there a constant c > 0 such that the ratio between the connected surveillance number csn(G) and sn(G) is at most c for any graph G. It is straightforward to show that csn(G) ≤ ∆ sn(G) for any graph G with maximum degree ∆. Moreover, it has been shown that there are graphs G for which csn(G) = sn(G)+1. In this paper, we investigate the question of the cost of the connectivity. We first provide new non-trivial upper and lower bounds for the cost of connectivity in the surveillance game. More precisely, we present a family of graphs G such that csn(G) > sn(G) + 1. Moreover, we prove that csn(G) ≤ sn(G) √ n for any n-node graph G. While the gap between these bounds remains huge, it seems difficult to reduce it. We then define the online surveillance game where the observer has no a priori knowledge of the graph topology and discovers it little-by-little. This variant, which fits better the prefetching motivation, is a restriction of the connected variant. Unfortunately, we show that no algorithm for solving the online surveillance game has competitive ratio better than Ω(∆). That is, while interesting by itself, this variant does not help to obtain better upper bounds for the connected variant.

show abstract

Section: Related Workmentioning

confidence: 99%

Connected Surveillance Game

Giroire

Mazauric

Nisse

et al. 2013

Structural Information and Communication Complexity

View full text Add to dashboard Cite

show abstract

“…Web caching has been recognized as an effective solution to minimize user access latency A method of called prefetching was introduced in which clients in collaboration with servers prefetch web page that the user is likely to access soon, while he/she is viewing the currently displayed pagel [8]. The benefit of prefetching is to provide low retrieval latency for users, which can be explained as high hit ratio Investigate an approach to reduce web latency by prefetching between caching, proxies, and browsers.…”

Section: Reviewmentioning

confidence: 99%

Web Server Performance Optimization using Prediction Prefetching Engine

Makker¹,

Rathy²

2011

IJCA

View full text Add to dashboard Cite

The long-term success of the World Wide Web depends on fast response time. People use the Web to access information from remote sites, but do not like to wait long for their results. The rapid growth in the amount of information and the number of users has lead to difficulty in providing effective response time for the web users and this increased web latency; resulting in decreased web performance. Although several proposals have been made for reducing this latency, like it can be improved by caching, the benefit of using it is rather limited owing to filling the cache with documents without any prior knowledge.Predictive caching becomes an attractive solution wherein the forthcoming page likely to be requested soon are predicted based on user access logs information and pre-fetched ,while the user is browsing the current display pages. As web page prediction gained its importance, This paper proposes a bracing approach for increasing web server performance by analyzing user behavior, in this pre-fetching and prediction is done by pre-processing the user access log and integrating the three techniques i.e. Clustering, Markov model and association rules which achieves better web page access prediction accuracy;This work also overcomes the limitation of path completion i.e. by extracting web site structure paths are completed,which helps in better prediction, decreasing access time of user and improving web performance.

show abstract

“…Several studies have demonstrated the effectiveness of prefetching in addressing the limitations of passive caching (e.g., [14], [17], [22], [23], [27], [31], [32], [35], [42], [46], [49]). Prefetched documents may include hyperlinked documents that have not been requested yet as well as dynamic objects [37], [42].…”

Section: A Motivation and Related Workmentioning

confidence: 99%

“…Several schemes for Web traffic prediction have been proposed in the literature (e.g., [14], [23], [24], [32], [35], [42], [49]). Any of these schemes can be integrated into our prefetching protocol.…”

Section: B Forecasting Demand-requestsmentioning

confidence: 99%

Performance analysis of a client-side caching/prefetching system for Web traffic

2007

View full text Add to dashboard Cite

Network congestion remains one of the main barriers to the continuing success of the Internet. For Web users, congestion manifests itself in unacceptably long response times. One possible remedy to the latency problem is to use caching at the client, at the proxy server, or within the Internet. However, Web documents are becoming increasingly dynamic (i.e., have short lifetimes), which limits the potential benefit of caching. The performance of a Web caching system can be dramatically increased by integrating document prefetching (a.k.a. "proactive caching") into its design. Although prefetching reduces the response time of a requested document, it also increases the network load, as some documents will be unnecessarily prefetched (due to the imprecision in the prediction algorithm). In this study, we analyze the confluence of the two effects through a tractable mathematical model that enables us to establish the conditions under which prefetching reduces the average response time of a requested document. The model accommodates both passive client and proxy caching along with prefetching. Our analysis is used to dynamically compute the "optimal" number of documents to prefetch in the subsequent client's idle (think) period. In general, this optimal number is determined through a simple numerical procedure. Closed-form expressions for this optimal number are obtained for special yet important cases. We discuss how our analytical results can be used to optimally adapt the parameters of an actual prefetching system. Simulations are used to validate our analysis and study the interactions among various system parameters.

show abstract

Web prefetching between low-bandwidth clients and proxies

Cited by 83 publications

References 12 publications

Connected Surveillance Game

Connected Surveillance Game

Web Server Performance Optimization using Prediction Prefetching Engine

Performance analysis of a client-side caching/prefetching system for Web traffic

Contact Info

Product

Resources

About