The what, The from, and The to: The Migration Games in Deduplicated Systems

被引:0
|
作者
Kisous, Roei [1 ]
Kolikant, Ariel [1 ]
Duggal, Abhinav [2 ]
Sheinvald, Sarai [3 ]
Yadgar, Gala [1 ]
机构
[1] Technion, Comp Sci Dept, Haifa, Israel
[2] DELL EMC, Round Rock, TX USA
[3] ORT Braude Coll Engn, Karmiel, Israel
基金
以色列科学基金会;
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Deduplication reduces the size of the data stored in large-scale storage systems by replacing duplicate data blocks with references to their unique copies. This creates dependencies between files that contain similar content, and complicates the management of data in the system. In this paper, we address the problem of data migration, where files are remapped between different volumes as a result of system expansion or maintenance. The challenge of determining which files and blocks to migrate has been studied extensively for systems without deduplication. In the context of deduplicated storage, however, only simplified migration scenarios were considered. In this paper, we formulate the general migration problem for deduplicated systems as an optimization problem whose objective is to minimize the system's size while ensuring that the storage load is evenly distributed between the system's volumes, and that the network traffic required for the migration does not exceed its allocation. We then present three algorithms for generating effective migration plans, each based on a different approach and representing a different tradeoff between computation time and migration efficiency. Our greedy algorithm provides modest space savings, but is appealing thanks to its exceptionally short runtime. Its results can be improved by using larger system representations. Our theoretically optimal algorithm formulates the migration problem as an ILP (integer linear programming) instance. Its migration plans consistently result in smaller and more balanced systems than those of the greedy approach, although its runtime is long and, as a result, the theoretical optimum is not always found. Our clustering algorithm enjoys the best of both worlds: its migration plans are comparable to those generated by the ILP-based algorithm, but its runtime is shorter, sometimes by an order of magnitude. It can be further accelerated at a modest cost in the quality of its results.
引用
收藏
页码:265 / 280
页数:16
相关论文
共 50 条
  • [1] The what, The from, and The to: The Migration Games in Deduplicated Systems
    Kisous, Roei
    Kolikant, Ariel
    Duggal, Abhinav
    Sheinvald, Sarai
    Yadgar, Gala
    ACM TRANSACTIONS ON STORAGE, 2022, 18 (04)
  • [2] Jingwei: An Efficient and Adaptable Data Migration Strategy for Deduplicated Storage Systems
    Cheng, Geyao
    Guo, Deke
    Luo, Lailong
    Xia, Junxu
    Sun, Yuchen
    IEEE CONFERENCE ON COMPUTER COMMUNICATIONS (IEEE INFOCOM 2022), 2022, : 1659 - 1668
  • [3] On Information Leakage in Deduplicated Storage Systems
    Ritzdorf, Hubert
    Karame, Ghassan O.
    Soriente, Claudio
    Capkun, Srdjan
    CCSW'16: PROCEEDINGS OF THE 2016 ACM CLOUD COMPUTING SECURITY WORKSHOP, 2016, : 61 - 72
  • [4] Forensic analysis of deduplicated file systems
    Lanterna, Dario
    Barili, Antonio
    DIGITAL INVESTIGATION, 2017, 20 : S99 - S106
  • [5] Towards an accurate evaluation of deduplicated storage systems
    Paulo, Joao
    Reis, Pedro
    Pereira, Jose
    Sousa, Antonio
    COMPUTER SYSTEMS SCIENCE AND ENGINEERING, 2013, 28 (06): : 427 - 437
  • [6] Load Rebalancing Games in Dynamic Systems with Migration Costs
    Belikovetsky, Sofia
    Tamir, Tami
    ALGORITHMIC GAME THEORY, SAGT 2013, 2013, 8146 : 74 - 85
  • [7] Load rebalancing games in dynamic systems with migration costs
    Belikovetsky, Sofia
    Tamir, Tami
    THEORETICAL COMPUTER SCIENCE, 2016, 622 : 16 - 33
  • [8] A Framework for Efficient Evaluation of the Fault Tolerance of Deduplicated Storage Systems
    Rozier, Eric William Davis
    Sanders, William H.
    2012 42ND ANNUAL IEEE/IFIP INTERNATIONAL CONFERENCE ON DEPENDABLE SYSTEMS AND NETWORKS (DSN), 2012,
  • [9] What Is Social Inclusion? Insights From Interventions With Youth Across Migration Systems
    Daiute, Colette
    Sullu, Bengi
    Kovacs-Cerovic, Tunde
    POLICY INSIGHTS FROM THE BEHAVIORAL AND BRAIN SCIENCES, 2021, 8 (02) : 143 - 151
  • [10] Secure and efficient ownership verification for deduplicated cloud computing systems
    Jay Dave
    Kamalesh Ram R.
    Pratik Patil
    Himanshu Patil
    Sarvesh Borole
    Subhrakanta Panda
    Journal of Cloud Computing, 14 (1)