TY - GEN
T1 - Anycast-Based Cooperative Proxy Caching
AU - Shi, Jinglun
AU - Liu, Weiping
AU - Tsui, K C
AU - Liu, Jiming
N1 - Copyright:
Copyright 2020 Elsevier B.V., All rights reserved.
PY - 2005/3/22
Y1 - 2005/3/22
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=24344479672&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-31849-1_74
DO - 10.1007/978-3-540-31849-1_74
M3 - Conference proceeding
AN - SCOPUS:24344479672
SN - 9783540252078
T3 - Lecture Notes in Computer Science
SP - 771
EP - 782
BT - Web Technologies Research and Development - APWeb 2005
A2 - Zhang, Yanchun
A2 - Tanaka, Katsumi
A2 - Yu, Jeffrey Xu
A2 - Wang, Shan
A2 - Li, Minglu
PB - Springer
CY - Berlin, Heidelberg
T2 - 7th Asia-Pacific Web Conference on Web Technologies Research and Development - APWeb 2005
Y2 - 29 March 2005 through 1 April 2005
ER -