论文信息 - Cache as ca$h can

Cache as ca$h can

In this paper we consider the problem of placing proxy caches in a network to get a better performance of the net. We develop a heuristic method to decide in which nodes of the network proxies should be installed and what the sizes of these caches should be. The heuristic attempts to minimize a function of the waiting times in the network.

[1] Philip S. Yu,et al. Caching on the World Wide Web , 1999, IEEE Trans. Knowl. Data Eng..

[2] Craig E. Wills,et al. Towards a Better Understanding of Web Resources and Server Responses for Improved Caching , 1999, Comput. Networks.

[3] Mark C. Little,et al. Flexible Open Caching for the Web , 1997, Comput. Networks.

[4] Kimberly C. Claffy,et al. Web Traffic Characterization: An Assesment of the Impact of Caching Documents from NCSA's Web Server , 1995, Comput. Networks ISDN Syst..

[5] Carlos Maltzahn,et al. Performance issues of enterprise level web proxies , 1997, SIGMETRICS '97.

[6] Anja Feldmann,et al. Web proxy caching: the devil is in the details , 1998, PERV.

[7] Evangelos P. Markatos,et al. Main Memory Caching of Web Documents , 1996, Comput. Networks.

[8] Peter Scheuermann,et al. Proxy Cache Algorithms: Design, Implementation, and Performance , 1999, IEEE Trans. Knowl. Data Eng..

[9] W. J. Hendricks. The stationary distribution of an interesting Markov chain , 1972, Journal of Applied Probability.

[10] Peter Scheuermann,et al. Proxy Cache Design: Algorithms, Implementation and Performance , 1999 .

[11] Ari Luotonen,et al. World-Wide Web Proxies , 1994, Comput. Networks ISDN Syst..

[12] Jia Wang,et al. A survey of web caching schemes for the Internet , 1999, CCRV.