TY - GEN
T1 - Scalable consistency management in dynamic content distribution overlays
AU - Su, Zhou
AU - Katto, Jiro
AU - Yasuhiko, Yasuda
PY - 2005/12/1
Y1 - 2005/12/1
N2 - Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems, can manage dynamically [2] changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas, instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than, conventional methods with the reduced update overhead and network traffic.
AB - Content Distribution Overlays improves end-user performance by replicating Web contents on a group of geographically distributed sites interconnected over the Internet. However, with the development whereby overlay systems, can manage dynamically [2] changing files, an important issue to be resolved is consistency management, which means the cached replicas on different sites must be updated if the originals change. In this paper, based on the analytical formulation of object freshness time, web access distribution and network topology, we derive a novel algorithm as follows: (1) For a given content which has been changed at its original server, only a limited number of its replicas, instead of all replicas are updated. (2) After a replica has been selected for update, the latest version will be sent from an algorithm-decided site instead of from its original server. Simulation results verify that the proposed algorithm provides much better consistency management than, conventional methods with the reduced update overhead and network traffic.
UR - http://www.scopus.com/inward/record.url?scp=50149102670&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=50149102670&partnerID=8YFLogxK
U2 - 10.1109/CLUSTR.2005.347082
DO - 10.1109/CLUSTR.2005.347082
M3 - Conference contribution
AN - SCOPUS:50149102670
SN - 0780394852
SN - 9780780394858
T3 - Proceedings - IEEE International Conference on Cluster Computing, ICCC
BT - 2005 IEEE International Conference on Cluster Computing, CLUSTER
T2 - 2005 IEEE International Conference on Cluster Computing, CLUSTER
Y2 - 27 September 2005 through 30 September 2005
ER -