Optimal methods for object management in coordinated en-route web caching for tree networks and autonomous systems

International Journal of High Performance Computing and Networking

Volumn 3, Issue 4, 2005, Pages 211-218

  Li, Keqiu ^a   Shen, Hong ^a  

^a JAPAN ADVANCED INSTITUTE OF SCIENCE AND TECHNOLOGY   (Japan)

Author keywords

autonomous system (AS); coordinated enroute web caching (CERWC); dynamic programming; object placement; tree network

Indexed keywords

EID: 33846884306     PISSN: 17400562     EISSN: 17400570     Source Type: Journal    
DOI: 10.1504/IJHPCN.2005.008563     Document Type: Article

References (22)

1. Li, K. and Shen, H. (2003) ‘Optimal methods for object placement in en-route web caching for tree networks and autonomous systems’, Proc. of the Second International Workshop on Grid and Cooperative Computing (GCC 2003), Shanghai, China, pp.263–270.
2. Li, K., Shen, H., Chin, F. and Zheng, S.Q. (2005) ‘Optimal methods for coordinated en-route web caching for tree networks’, ACM Trans. on Internet Technology, May, Vol. 5, No. 3, pp.1–28.
3. Rabinovich, M. and Spatscheck, O. (2002) Web Caching and Replication, Addison-Wesley, Boston, USA.
4. Rodriguez, P. and Sibal, S. (2000) ‘Spread: scalable platform for reliable and efficient automated distribution’, Computer Networks, Vol. 33, pp.33–49.
5. Rodriguez, P., Spanner, C. and Biersack, E.W. (2001) ‘Analysis of web caching architectures: hierarchical and distributed caching’, IEEE/ACM Transaction on Networking, Vol. 9, No. 4, pp.404–418.
6. Shim, J., Scheuermann, P. and Vingralek, R. (1999) ‘Proxy cache algorithms: design, implementation, and performance’, IEEE Trans. Knowledge and Data Eng., Vol. 11, No. 4, pp.549–562.
7. Tang, X. and Chanson, S.T. (2002) ‘Coordinated en-route web caching’, IEEE Transactions on Computers, Vol. 51, No. 6, pp.595–607.
8. Wang, J. (1999) ‘A survey of web caching schemes for the internet’, ACM SIGCOMM Computer Communication Review, Vol. 29, No. 5, pp.36–46.
9. Williams, S., Abrams, M., Standbridge, C.R., Abdulla, G. and Fox, E.A. (1996) ‘Removal policies in network caches for World Wide Web documents’, Proc. ACM SIGCOMM’96, pp.293–305.
10. Barford, P. and Crovella, M. (1998) ‘Generating representative web workloads for network and server performance evaluation’, Proc. ACM SIGMETRICS’98, pp.151–160.
11. Breslau, L., Cao, P., Fan, L., Phillips, G. and Shenker, S. (1999) ‘Web caching and zip-like distributions: evidence and implications’, Proc. IEEE INFOCOM’99, pp.126–134.
12. Calvert, K.L., Doar, M.B. and Zegura, E.W. (1997) ‘Modelling internet topology’, IEEE Comm. Magazine, Vol. 35, No. 6, pp.160–163.
13. Cao, P. and Irani, S. (1997) ‘Cost-aware WWW proxy caching algorithms’, Proc. First USENIXSymp. Internet Technologies and Systems (USITS), pp.193–206.
14. Davison, B.D. (2001) ‘A web caching primer’, IEEE Internet Computing, Vol. 5, No. 4, pp.38–45.
15. Jin, S. and Bestavros, A. (2001) ‘Greeddual* web caching algorithm exploiting the two sources of temporal locality in web request streams’, Computer Comm., Vol. 4, No. 2, pp.174–183.
16. Without loss of generality, we assume that there is only one content server at the root of a tree, at which the objects requested by users are maintained.
17. w.
18. The detailed proofMn be found in Li et al. (2005).
19. The local cost gain is the cost gain for placing only one copy of an object among the enroute caches.
20. The response ratio of a request is defined as the ratio of its access latency to the size of the target object.
21. The object hit ratio is defined as the ratio of the number of requests satisfied by the caches as a whole to the total number of requests.
22. The average server load is defined as the average number of bytes served by the server per second.