Cost-Aware WWW Proxy Caching Algorithms
暂无分享,去创建一个
Sandy Irani | Pei Cao | P. Cao | S. Irani
[1] Laszlo A. Belady,et al. A Study of Replacement Algorithms for Virtual-Storage Computer , 1966, IBM Syst. J..
[2] Robert E. Tarjan,et al. Amortized efficiency of list update and paging rules , 1985, CACM.
[3] Edward R. Tufte,et al. The Visual Display of Quantitative Information , 1986 .
[4] Marek Chrobak,et al. New results on server problems , 1991, SODA '90.
[5] Neal Young,et al. The K-Server Dual and Loose Competitiveness for Paging , 1991, On-Line Algorithms.
[6] Neal E. Young,et al. On-line caching as cache size varies , 1991, SODA '91.
[7] Edward A. Fox,et al. Caching Proxies: Limitations and Potentials , 1995, WWW.
[8] Edward A. Fox,et al. Removal policies in network caches for World-Wide Web documents , 1996, SIGCOMM '96.
[9] Edward A. Fox,et al. Removal Policies in Network Caches for World-Wide Web Documents , 1996, SIGCOMM.
[10] Sandy Irani,et al. Page replacement with multi-size pages and applications to Web caching , 1997, STOC '97.
[11] Chengjie Liu,et al. Maintaining strong cache consistency in the World-Wide Web , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.
[12] Marc Abrams,et al. Proxy Caching That Estimates Page Load Delays , 1997, Comput. Networks.
[13] Chengjie Liu,et al. Maintaining Strong Cache Consistency in the World Wide Web , 1998, IEEE Trans. Computers.
[14] Neal E. Young,et al. On-Line File Caching , 2002, SODA '98.