A new replica placement strategy based on multi-objective optimisation for HDFS

被引:13
|
作者
Li, Yangyang [1 ]
Tian, Mengzhuo [1 ]
Wang, Yang [1 ]
Zhang, Qingfu [2 ]
Saxena, Dhish Kumar [3 ]
Jiao, Licheng [1 ]
机构
[1] Xidian Univ, Minist Educ, Key Lab Intelligent Percept & Image Understanding, Xian, Peoples R China
[2] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
[3] Indian Inst Technol Roorkee, Dept Mech & Ind Engn, Roorkee, Uttar Pradesh, India
基金
中国国家自然科学基金;
关键词
Hadoop; Hadoop distributed file system; HDFS; replica placement; multi-objective optimisation; memetic algorithm; BIG DATA; EVOLUTIONARY; ALGORITHM; SYSTEM; DECOMPOSITION; HADOOP; MOEA/D;
D O I
10.1504/IJBIC.2020.108994
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Distributed storage systems like the Hadoop distributed file system (HDFS) constitute the core infrastructure of cloud platforms which are well poised to deal with big-data. An optimised HDFS is critical for effective data management in terms of reduced file service time and access latency, improved file availability and system load balancing. Recognising that the file-replication strategy is key to an optimised HDFS, this paper focuses on the file-replica placement strategy while simultaneously considering storage and network load. Firstly, the conflicting relationship between storage and network load is analysed and a bi-objective optimisation model is built, following which a multi-objective optimisation memetic algorithm based on decomposition (MOMAD) and its improved version are used. Compared to the default strategy in HDFS, the file-replica placement strategies based on multi-objective optimisation provide more diverse solutions. And competitive performance could be obtained by the proposed algorithm.
引用
收藏
页码:13 / 22
页数:10
相关论文
共 50 条
  • [1] StorNIR, a Multi-Objective Replica Placement Strategy for Cloud Federations
    Chikhaoui, Amina
    Lemarchand, Laurent
    Boukhalfa, Kamel
    Boukhobza, Jalil
    [J]. 36TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2021, 2021, : 50 - 59
  • [2] Replica placement in Data Grid: A multi-objective approach
    Rahman, RM
    Barker, K
    Alhajj, R
    [J]. GRID AND COOPERATIVE COMPUTING - GCC 2005, PROCEEDINGS, 2005, 3795 : 645 - 656
  • [3] Prototype selection based on multi-objective optimisation and partition strategy
    Li, Juan
    Wang, Yuping
    [J]. INTERNATIONAL JOURNAL OF SENSOR NETWORKS, 2015, 17 (03) : 163 - 176
  • [4] Virtual Machine Placement Strategy Based on Multi-objective Optimization
    Liu, Jun
    Dai, Fu-Cheng
    Xin, Ning
    [J]. Dongbei Daxue Xuebao/Journal of Northeastern University, 2022, 43 (05): : 609 - 617
  • [5] A Multi-objective Optimisation Approach to IDS Sensor Placement
    Chen, Hao
    Clark, John A.
    Tapiador, Juan E.
    Shaikh, Siraj A.
    Chivers, Howard
    Nobles, Philip
    [J]. COMPUTATIONAL INTELLIGENCE IN SECURITY FOR INFORMATION SYSTEMS, 2009, 63 : 101 - +
  • [6] Fast and Effective Multi-Objective Optimisation of Wind Turbine Placement
    Tran, Raymond
    Wu, Junhua
    Denison, Christopher
    Ackling, Thomas
    Wagner, Markus
    Neumann, Frank
    [J]. GECCO'13: PROCEEDINGS OF THE 2013 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2013, : 1381 - 1388
  • [7] An evolution strategy with probabilistic mutation for multi-objective optimisation
    Huband, S
    Hingston, P
    While, L
    Barone, L
    [J]. CEC: 2003 CONGRESS ON EVOLUTIONARY COMPUTATION, VOLS 1-4, PROCEEDINGS, 2003, : 2284 - 2291
  • [8] Multi-objective optimisation
    Bortfeld, T.
    [J]. RADIOTHERAPY AND ONCOLOGY, 2007, 84 : S72 - S73
  • [9] A New Multi-objective Model for Constrained Optimisation
    Xu, Tao
    He, Jun
    Shang, Changjing
    Ying, Weiqin
    [J]. ADVANCES IN COMPUTATIONAL INTELLIGENCE SYSTEMS, 2017, 513 : 71 - 85
  • [10] Multi-Objective Optimization for Virtual Machine Allocation and Replica Placement in Virtualized Hadoop
    Guerrero, Carlos
    Lera, Isaac
    Bermejo, Belen
    Juiz, Carlos
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2018, 29 (11) : 2568 - 2581