Edith Cohen and Haim Kaplan. Caching documents with variable sizes and fetching costs: An LP-based approach. In Proceedings of Symposium on Discrete Algorithms, 1999.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....Web caching is the temporary local storage of WWW pages by a browser for later retrieval. From the user s point of view, the primary benefit of caching is reduced latency, as the time to access locally stored objects is minimal. We adopt the following standard general model of web caching [1, 5, 8, 14]: Web Caching Problem Statement: The browser is given an online sequence S of page requests, where each page p i 2 S has a size s(i) say, in bytes) and an access time t(i) that is required if p i is not cached. If the requested page p i is not in the cache (this is called a cache miss) then the ....

....results show that for both Web Caching and Site Search, an online algorithm needs a logarithmically sized cache to be constant competitive. In section 5, we analyze the online algorithm Landlord (this algorithm is a generalization of LRU and is also called Greedy Dual Size in the literature) [3, 5, 14]. Although we will state all results in the cost model, the results hold for the general model if k is replaced by k L . We show that Landlord is O i min i k; log n k j n 1= k 1) j competitive for Web Caching on depth first tree traversal sequences. We also show that the online ....

[Article contains additional citation context not shown here]

E. Cohen, and H. Kaplan, "Caching documents with variable sizes and fetching costs: an LP based approach", ACM/SIAM Symposium on Discrete Algorithms, S879--S880, 1999.

No context found.

Edith Cohen and Haim Kaplan. Caching documents with variable sizes and fetching costs: An LP-based approach. In Proceedings of Symposium on Discrete Algorithms, 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC