ANALYSIS OF DATA BALANCING PROBLEMS IN DISTRIBUTED DATA STORAGES

Authors

  • Bohdan Ivanishchev National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine
  • Pavlo Rehida National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine
  • Artem Kaplunov National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine
  • Oleksandr Honcharenko National Technical University of Ukraine “Igor Sikorsky Kyiv Polytechnic Institute”, Ukraine

Keywords:

distributed data storages, data balancing, facility location problem

Abstract

The article analyzes existing problems that confront data storages, data balancing problems in these storages, as well as ways to solve these problems.

References

Pessach Y. (2013). Distributed Storage: Concepts, Algorithms, and Implementations.

Conforti, Michele; Cornuéjols, Gérard; Zambelli, Giacomo (2014). Integer Programming | SpringerLink. Graduate Texts in Mathematics. 271.

Alenezy E. J. (2020) ‘Solving Capacitated Facility Location Problem Using Lagrangian Decomposition and Volume Algorithm’, Advances in Operations Research.

Luis, Martino & Ramli, Mohammad Fadzli & Lin, Abdullah. (2016). A greedy heuristic algorithm for solving the capacitated planar multi-facility location-allocation problem.

Aragón Artacho, F. J., Campoy, R., & Elser, V. (2020). An enhanced formulation for solving graph coloring problems with the Douglas–Rachford algorithm.

Fidanova, S., & Pop, P. (2016). An improved hybrid ant-local search algorithm for the partition graph coloring problem. Journal of Computational and Applied Mathematics, 293, 55-61.

Downloads

Published

2023-06-08

Issue

2020

Section

Security, Fault Tolerance