Anycast-based cooperative proxy caching

Jinglun Shi*, Weiping Liu, Tsui Kc, Jiming LIU

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review


As one of the most popular applications currently running on the Internet, the World Wide Web is of an exponential growth in size, which results in the network congestion and server overloading. Web caching as an important technique aims at reducing network traffic, server load, and user-perceived retrieval delays by replicating popular contents on proxy caches. In our paper, we develop an anycast-based cooperative web proxy caching mechanism. It puts response time, hop counts, self-organized load balancing, adaption, and self-configuration as primary concerns. In our scheme, anycast is used to bring a server "nearest" to a client to improve overall performance, all proxies in a local network consists an anycast group. The object placement and replacement problems are formulated as an optimization problem and the solution is obtained by using an anycast-based cooperative proxy caching algorithm. Some simulation experiments have been conduced to evaluate the proposed scheme in terms of a wide range of performance metrics. Analytical and experimental results show that our algorithm outperforms some existing algorithms in response time, hop counts.

Original languageEnglish
Pages (from-to)771-782
Number of pages12
JournalLecture Notes in Computer Science
Publication statusPublished - 2005
Event7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005 - Shanghai, China
Duration: 29 Mar 20051 Apr 2005

Scopus Subject Areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Anycast-based cooperative proxy caching'. Together they form a unique fingerprint.

Cite this