A Multi-Objective Approach for Optimizing Content Delivery Network System Configuration

被引:0
作者
Hoang-Loc La [1 ,2 ]
Thanh Le Hai Hoang [1 ,2 ]
Nam Thoai [1 ,2 ]
机构
[1] Ho Chi Minh City Univ Technol HCMUT, Fac Comp Sci & Engn, High Performance Comp Lab, Adv Inst Interdisciplinary Sci & Technol, 268 Ly Thuong Kiet St,Dist 10, Ho Chi Minh City, Vietnam
[2] Vietnam Natl Univ Ho Chi Minh City, Ho Chi Minh City, Vietnam
来源
2021 22ND ASIA-PACIFIC NETWORK OPERATIONS AND MANAGEMENT SYMPOSIUM (APNOMS) | 2021年
关键词
Content Delivery Network; Bayesian Optimization; Genetic Optimization; Multi Objective Optimization; OPTIMIZATION;
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Optimizing the Content Delivery Network system configuration has been addressed as an interesting problem for the system owners. They want to minimize the investment cost while guaranteeing their system's quality. Several works have resolved this problem as a single-objective optimization (SOO) problem with heuristic methods. These approaches usually aggregate the objectives into a scalar function and resolve the problem with SOO algorithms. A typical drawback of these approaches is that they cannot capture the trade-off between the objectives, which usually leads to a sub-optimal solution. To overcome this drawback, this paper considers the problem as a discrete multi-objective problem and resolves it with meta-heuristic techniques, namely Bayesian optimization (BO) and evolutionary methods. More importantly, we also propose an empirical method to improve the convergence speed of the standard BO methods in discrete space. Our experiments show that our proposed method can dramatically improve the rate of convergence. Moreover, we apply our method to a real CDN system and compare our solution with the system's current solution. Our experimental results show that our proposed solution can save about 39% of the current cost with the same internal traffic.
引用
收藏
页码:226 / 229
页数:4
相关论文
共 16 条
[1]  
Belakaria S, 2020, AAAI CONF ARTIF INTE, V34, P10044
[2]   Efficient multiobjective optimization employing Gaussian processes, spectral sampling and a genetic algorithm [J].
Bradford, Eric ;
Schweidtmann, Artur M. ;
Lapkin, Alexei .
JOURNAL OF GLOBAL OPTIMIZATION, 2018, 71 (02) :407-438
[3]  
Garrido-Merchan EC, 2018, ARXIV180503463
[4]  
Hoang-Loc La, 2020, 2020 International Conference on Advanced Computing and Applications (ACOMP), P71, DOI 10.1109/ACOMP50827.2020.00018
[5]   ParEGO: A hybrid algorithm with on-line landscape approximation for expensive multiobjective optimization problems [J].
Knowles, J .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2006, 10 (01) :50-66
[6]  
Konakovic-Lukovic M.., 2020, NEURIPS
[7]   In a Telco-CDN, Pushing Content Makes Sense [J].
Li, Zhe ;
Simon, Gwendal .
IEEE TRANSACTIONS ON NETWORK AND SERVICE MANAGEMENT, 2013, 10 (03) :300-311
[8]   ON THE LIMITED MEMORY BFGS METHOD FOR LARGE-SCALE OPTIMIZATION [J].
LIU, DC ;
NOCEDAL, J .
MATHEMATICAL PROGRAMMING, 1989, 45 (03) :503-528
[9]   Probabilistic history matching using discrete Latin Hypercube sampling and nonparametric density estimation [J].
Maschio, Celio ;
Schiozer, Denis Jose .
JOURNAL OF PETROLEUM SCIENCE AND ENGINEERING, 2016, 147 :98-115
[10]  
Mockus J., 1975, OPTIMIZATION TECHNIQ, P400