A new optimal replica placement strategy in Content Distribution Networks

The replica placement problems (RPPs) in the Content Distribution Networks have been widely studied. In this paper, the Multiple Minimum Cost Flow Model (MMCFM) with server storage constraints is proposed for the RPPs for the first time. Since traditional minimum cost flow algorithm can not be applied to solve our model, MMCFM is converted to an equivalent Mixed Integer Programming (MIP) and furthermore an Integer Linear Programming (ILP). Branch and Bound Algorithm is used to obtain the optimal solution of ILP. In the simulation part, the performance of our algorithms is shown.