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  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.
|Title of host publication||Proceedings - IEEE International Conference on Cluster Computing, ICCC|
|Publication status||Published - 2005|
|Event||2005 IEEE International Conference on Cluster Computing, CLUSTER - Burlington, MA|
Duration: 2005 Sep 27 → 2005 Sep 30
|Other||2005 IEEE International Conference on Cluster Computing, CLUSTER|
|Period||05/9/27 → 05/9/30|
ASJC Scopus subject areas