Data Replication in Large Scale Content Delivery Networks: A Genetic Algorithm Approach

被引:4
作者
Fatin, Hadi Zare [1 ]
Jamali, Shahram [1 ]
Fatin, Gholamreza Zare [2 ]
机构
[1] Univ Mohaghegh Ardabili, Dept Elect & Comp Engn, Network Lab, Ardebil 5619911367, Iran
[2] Univ Mohaghegh Ardabili, Dept Elect & Comp Engn, Ardebil 5619911367, Iran
关键词
Content delivery network; content distribution network; mixed integer program; meta heuristic; genetic algorithm; OPTIMAL PLACEMENT; WEB PROXIES; LOCATION; ALLOCATION;
D O I
10.1142/S021812661850189X
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Content delivery networks (CDN) bring the content close to the users employing the replicated servers. In this context, main issue is allocation of the content replicas to these geographically distributed replica servers. The allocation goal is to minimize the storage and the delivery costs and at the same time to satisfy service-level agreements. In this paper, a mixed integer programming (MIP) formulation for the problem of the allocation has been proposed and then by utilization of the genetic algorithm (GA) its optimum solutions were extracted. Numerical evaluation results show that the proposed algorithm outperforms others in terms of the storage cost, delivery cost and computation complexity.
引用
收藏
页数:25
相关论文
共 39 条
  • [1] Aioffi WM, 2004, LECT NOTES COMPUT SC, V3293, P19
  • [2] [Anonymous], P INT S PERF EV COMP
  • [3] [Anonymous], STEINER PROBLEM GRAP
  • [4] [Anonymous], IEEE 35 INT C DISTR
  • [5] [Anonymous], TECHNICAL REPORT
  • [6] [Anonymous], 4 INT C ADV DAT KNOW
  • [7] Baentsch M., 1997, IEEE Internet Computing, V1, P18, DOI 10.1109/4236.601083
  • [8] Bartolini N, 2003, ICON 2003: 11TH IEEE INTERNATIONAL CONFERENCE ON NETWORKS, P125
  • [9] Chen Y, 2002, LECT NOTES COMPUT SC, V2429, P306
  • [10] OPTIMAL FILE ALLOCATION IN A MULTIPLE COMPUTER SYSTEM
    CHU, WW
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 1969, C 18 (10) : 885 - &