A new optimal replica placement strategy in Content Distribution Networks

Author

Sun, Jing ; Jiang, Zhipeng ; Gao, Suixiang ; Yang, Wenguo

Author_Institution

Grad. Univ. of Chinese Acad. of Sci., Beijing, China

fYear

2010

fDate

22-24 Oct. 2010

Firstpage

351

Lastpage

354

Abstract

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.

Keywords

client-server systems; distributed processing; integer programming; linear programming; tree searching; MMCFM; branch bound algorithm; content distribution network; integer linear programming; mixed integer programming; multiple minimum cost flow model; optimal replica placement strategy; server storage constraint; Content Distribution Networks; Multiple Minimum Cost Flow Model; Replica Placement Algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Intelligent Computing and Integrated Systems (ICISS), 2010 International Conference on

Conference_Location

Guilin

Print_ISBN

978-1-4244-6834-8

Type

conf

DOI

10.1109/ICISS.2010.5656943

Filename

5656943