Efficient and adaptive Web replication using content clustering

IEEE Journal on Selected Areas in Communications

Volumn 21, Issue 6, 2003, Pages 979-994

  Chen, Yan ^a   Qiu, Lili ^b   Chen, Weiyu ^a   Nguyen, Luan ^a   Katz, Randy H ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b MICROSOFT RESEARCH   (United States)

Author keywords

Content distribution network (CDN); Replication; Stability; Web content clustering

Indexed keywords

COMPUTER SIMULATION; SERVERS; TELECOMMUNICATION TRAFFIC;

CONTENT DISTRIBUTION NETWORK (CDN);

WORLD WIDE WEB;

EID: 0042025136     PISSN: 07338716     EISSN: None     Source Type: Journal    
DOI: 10.1109/JSAC.2003.814608     Document Type: Article

References (33)

1. S. Jamin, C. Jin, A. Kurc. D. Raz, and Y. Shavitt, "Constrained mirror placement on the Internet," Proc. IEEE INFOCOM, pp. 31-40. Apr. 2001.
2. L. Qiu, V. N. Padmanabhan, and G. M. Voelker, "On the placement of web server replica," Proc. IEEE INFOCOM, pp. 1587-1596, Apr. 2001.
3. A. Luotonen and K. Altis, "World-wide web proxies," in Proc. 1st Int. Conf. WWW, 1994, pp. 147-154.
4. A. Bestavros, "Demand-based document dissemination to reduce traffic and balance load in distributed information systems," Proc. IEEE Symp. Parallel Distr. Processing, pp. 338-345, 1995.
5. T. P. Kelly, Y.-M. Chan, S. Jamin, and J. K. MacKie-Mason. "Biased replacement policies for web caches: Differential quality-of-service and aggregate user value." in Proc. Int. Web Caching Workshop. Mar. 1999, pp. 1-10.
6. B. Li, M. J. Golin, G. F. Italiano, X. Deng, and K. Sohraby, "On the optimal placement of web proxies in the Internet," Proc. IEEE INFOCOM, pp. 1282-1290. Mar. 1999.
7. L. Kaufman and P. J. Rousseeuw, Finding Groups in Data: An Introduction to Cluster Analysis. New York: Wiley, 1990.
8. E. M. Voorhees, "Implementing agglomerative hierarchical clustering algorithms for use in document retrieval," Inform. Processing Manage., no. 22, pp. 465-476, 1986.
9. R. Ng and J. Han, "Efficient and effective clustering methods for data mining," in Proc. Int. Conf. VLDB, 1994, pp. 144-155.
10. E. Cohen, B. Krishnamurthy, and J. Rexford, "Improving end-to-end performance of the web using server volumes and proxy filters," in Proc. ACM SIGCOMM, Sept. 1998, pp. 241-253.
11. V. N. Padmanabhan and J. C. Mogul, "Using predictive prefetching to improve world wide web latency," in Proc. ACM SIGCOMM Computer Communication Review, July 1996, pp. 2-36.
12. Z. Su, Q. Yang, H. Zhang, X. Xu, and Y. Hu, "Correlation-based document clustering using web," in Proc. 34th Hawaii Int. Conf. System Sciences, Jan. 2001, www.cs.sfu.ca/̃qyang/papers/hicsscluster.pdf, pp. 626-635.
13. M. Charikar, C. Chekuri, T. Feder, and R. Motwani, "Incremental clustering and dynamic information retrieval," in Proc. STOC, May 1997, pp. 626-635.
14. T. Zhang, R. Ramakrishnan, and M. Livny, "BIRCH: An efficient data clustering method for very large databases," in Proc. SIGMOD, 1996, pp. 103-114.
15. E. Zegura, K. Calvert, and S. Bhattacharjee, "How to model an Internet-work," Proc. IEEE INFOCOM, pp. 594-602, 1996.
16. IPMA Project [Online]. Available: http://www.merit.edu/ipma
17. MSNBC [Online]. Available: http://www.msnbc.com
18. MediaMetrix [Online], Available: http://www.mediametrix.com
19. NASA Kennedy Space Center Server Traces [Online]. Available: http://ita.ee.lbl.gov/html/contrib/NASA-HTTP.html
20. M. Arlitt and T. Jin, "Workload Characterization of the 1998 World Cup Web Site," HP. Tech. Rep. HPL-1999-35(R.1).
21. B. Krishnamurthy and J. Wang, "On network-aware clustering of web clients." in Proc. ACM SIGCOMM, Aug. 2000, pp. 97-110.
22. BBNPlanet [Online], Available: telnet://ner-routes.bbnplanet.net
23. Akamai [Online], Available: http://www.akamai.com
24. L. Breslau, P. Cao, L. Fan, G. Phillips, and S. Shenker, "Web caching and zipf-like distributions: Evidence and implications," in Proc. INFO-COMM, Mar. 1999, pp. 126-134.
25. V. N. Padmanabhan and L. Qiu, "Content and access dynamics of a busy web site: Findings and implications," in Proc. ACM SIGCOMM, Aug. 2000. pp. 111-123.
26. DigitalIsland [Online]. Available: http://www.digitalIsland.com
27. A. Barbir, B. Cain, F. Douglis, M. Green, M. Hofmann, R. Nair, D. Potter, and O. Spatscheck. Known CN Request-Routing Mechanisms. [Online], Available: http://www.ietf.org/internet-drafts/draft-ietf-cdi-known-request-routing-03.txt
28. A. Venkataramani, P. Yalagandula, R. Kokku, S. Sharif, and M. Dahlin, "The potential costs and benefits of long term prefetching for content distribution," in Proc. Web Content Caching and Distribution Workshop, 2001. pp. 185-201.
29. T. F. Gonzalez, "Clustering to minimize the maximum intercluster distance," Theoretical Comput. Sci., vol. 38, pp. 293-306, 1985.
30. J. Edachery, A. Sen, and F. J. Brandenburg, "Graph clustering using distance-k cliques," in Proc. Graph Drawing, Sept. 1999, pp. 98-106.
31. A. Adya, P. Bahl, and L. Qiu, "Analyzing browse patterns of mobile clients," in Proc. SIGCOMM Internet Measurement Workshop 2001, Nov. 2001, pp. 189-194.
32. A. Wolman et al., "Organization-based analysis of web-object sharing and caching," in Proc. USENIX Symp. Internet Technologies and Systems, 1999, pp. 25-36.
33. WebReaper [Online]. Available: http://www.webreaper.net