Placement of Web-server proxies with consideration of read and update operations on the Internet

Computer Journal

Volumn 46, Issue 4, 2003, Pages 378-390

  Jia, Xiaohua ^a   Li, Deying ^b   Hu, Xiaodong ^b   Wu, Weili ^b   Du, Dingzhu ^b  

^a WUHAN UNIVERSITY   (China)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER SIMULATION; DATA REDUCTION; DYNAMIC PROGRAMMING; OPTIMAL SYSTEMS; WEBSITES;

INTERNET ROUTING METHODS;

SERVERS;

EID: 0038681263     PISSN: 00104620     EISSN: None     Source Type: Journal    
DOI: 10.1093/comjnl/46.4.378     Document Type: Article

References (32)

1. Bestavros, A. (1997) WWW traffic reduction and load balancing through server-based caching. IEEE Concurrency, 5(1), 56-67.
2. Jamin, S., Jin, C., Kurc, A. R., Raz, D. and Shavitt, Y. (2001) Constrained mirror placement on the Internet. In Proc. IEEE InfoCom'01, Anchorage, Alaska, April 22-26, pp. 31-40.
3. Chatel, M. (1996) Classical Versus Transparent IP Proxies. RFC 1919, March.
4. Krishnan, P., Raz, D. and Shavitt, Y. (2000) The cache location problem. IEEE/ACM Trans. Networking, 8, 568-582.
5. Tang, X. and Chanson, S. (2002) Coordinated en-route Web caching. IEEE Trans. Computers, 51, 595-607.
6. Davison, B. D. Proxy cache comparison, http://www.web-caching.com/proxy-comparison.html.
7. Arlitt, M. F. and Williamson, C. L. (1997) Internet Web servers: workload characterization and performance implications. IEEE Trans. Networking, 5, 631-645.
8. Braun, H. W. and Claffy, K. C. (1995) Web traffic characterization: an assessment of the impact of caching documents from NCSA's Web server. Comput. Networks ISDN Syst., 28, 37-51.
9. Cao, P. and Irani, S. (1997) Cost-aware WWW proxy caching algorithms. In Proc. of Usenix Symp. Internet Technologies and Systems, California, December, pp. 193-206.
10. Dilley, J. and Arlitt, M. (1999) Improving proxy cache performance: analysis of three replacement policies. IEEE Internet Comput., 3, 44-50.
11. Rizzo, L. and Vicisano, L. (2000) Replacement policies for a proxy cache. IEEE/ACM Trans. Networking, 8, 158-170.
12. Abrams, M. et al (1995) Caching proxies: limitations and potentials. In Proc. 4th Int. Conf. WWW, Boston, USA, December, pp. 312-319.
13. Bolot, J. and Hoschka, P. (1996) Performance engineering of the World Wide Web: application to dimensioning and cache design. In Proc. 5th Int. Conf. WWW, Paris, France, May, pp. 6-10.
14. Glassman, S. (1994) A caching relay for the World Wide Web. In Proc. of 1st Int. Conf. on WWW, Amsterdam, pp. 69-76.
15. Wang, B., Sen, S., Adler, M. and Towsley, D. (2002) Optimal proxy cache allocation for efficient streaming media distribution. In IEEE Infocom'02, New York, June 23-27, pp. 1726-1735.
16. Xu, J., Li, B. and Lee, D. (2002) Placement problems for transparent data replication proxy services. IEEE J. Selected Areas Commun., 20, 1399-1413.
17. Li, B., Golin, M. J., Italiano, G. F. and Deng, X. (1999) On the optimal placement of Web proxies in the Internet. In Proc. IEEE InfoCom'99, New York, USA, March 21-25, pp. 1282-1290.
18. Chen, F. and Li, B. (1999) Replicated servers allocation for multiple information sources in a distributed environment. In Proc. 8th IEEE Int. Conf. Computer Communications and Networks (IC3N'99), USA, October, pp. 168-173.
19. Qiu, L., Padmanabhan, V. and Voelker, G. (2001) On the placement of Web server replicas. IEEE InfoCom'01, Anchorage, Alaska, April 22-26, pp. 1587-1596.
20. Kariv, O. and Hakimi, S. L. (1979) An algorithmic approach to network location problems. II: The p-medians. SIAM J.Appl. Math., 37, 539-560.
21. Sayal, M., Breitbart, Y., Scheuermann, P. and Vingralek, R. (1998) Selection algorithms for replicated web servers. In Proc. of Internet Server Performance Workshop (in conjunction with ACM SIGmetrics'98), June, pp. 44-50.
22. Akamai Technologies, http://www.akamai.com.
23. Mirror Image, http://www.mirror-image.com.
24. Ceri, S., Martella, G. and Pelagatti, G. (1982) Optimal file allocation in a computer network: a solution method based on the knapsack problem. Computer Networks, 6, 345-357.
25. Dowdy, L. W. and Foster, D. V. (1982) Comparative models of the file assignment problem. ACM Comput. Survey, 14, 287-313.
26. Irani, K. B. and Khabbaz, N. G. (1982) A methodology for the design of communication networks and the distribution of data in distributed supercomputer systems. IEEE Trans. Computer, 31, 419-434.
27. Wolfson, O. and Milo, A. (1991) The multicast policy and its relationship to replicated data placement. ACM Trans. Database Syst., 16, 181-205.
28. Murthy, K., Kam, J. and Krishnamoorthy, M. S. (1983) An approximation algorithm to the file allocation problem in computer networks. In Proc. of 2nd ACM Symposium on Principles of Database Systems, pp. 258-266.
29. Stephens, A. B., Yesha, Y. and Humenik, K. (1995) Optimal allocation for partially replicated database systems on tree networks. Appl. Math. Lett., 8, 71-76.
30. Faloutsos, M., Faloutsos, P. and Faloutsos, C. (1999) On power-law relationships of the Internet topology. In Proc. ACM SIGCOMM, August, pp. 251-260.
31. Labovitz, C., Malan, G. R. and Jahania, F. (1997) Internet routing instability. In ACM SIGCOMM'97, August, pp. 115-126.
32. Paxson, V. (1997) End-to-end routing behavior in the Internet. IEEE/ACM Trans. Networking, 5, 601-615.