A new consistency algorithm for dynamic documents in content distribution networks ?
One of the important problems in content distribution networks is how to maintain the consistency of content at replicas with the origin server, especially for those documents changing dynamically. In this paper, we propose a new hybrid consistency algorithm that will generate less traffic than the traditional propagation approach, and the invalidation approach. The basic scheme is extended to the case in which requests are not evenly distributed over all replicas. We propose a hierarchical framework which allows replicas at different levels to make a decision based on the statistics collected. Extensive simulations are performed to examine how the traffic generated and the freshness ratio at replicas are affected by various parameters. We experiment with a wide range of request rates, update frequencies, and numbers of replicas. The results show that our approach can take advantage of content distribution networks and significantly reduce the traffic generated.
propagation invalidation web caching data replication