Replica Placement Algorithms in Content Distribution Networks

The replica placement problems (RPPs) in the Content Distribution Networks have been widely studied. In this paper, we propose an optimization model for the RPPs and design efficient algorithms to minimize the total cost of the network. The algorithms include three parts: replication algorithm preprocess, constraint p-median model and algorithm of solving constraint p-median models. In the simulation, we compare our algorithms to other heuristic methods numerically. The results show that our algorithms perform better with less cost.