Date Added: Mar 2011
Content Distribution Networks have been attracted a great deal of attraction in recent years. Replica Placement Problems (RPPs) as one of the key technologies in the Content Distribution Networks have been widely studied. In this paper, the authors propose an optimization model with server storage capacity constraints for the RPPs. Furthermore, part of the objective function is represented as a Multiple Minimum Cost Flow Model for the first time. Efficient algorithms are designed to minimize the total network cost. The algorithms include three parts: replication algorithm preprocess, constraint P-median model and algorithm of solving constraint P-median models.