A Hybrid Approach for Content Replication Improvement in Content Delivery Networks

Abstract In this paper by combining caching and replication techniques proposed a hybrid heuristic method based on the greedy algorithm to use the benefit of each other techniques. The algorithm in each interaction compares all the contents and one that made the best benefit value is selected for replication. The hybrid approach tested in a simulation environment and the results show that hybrid algorithm again stand-alone replication, reduced the average response time by 42% and compared to the pure caching, saving up 23% user requests time.