The what, The from, and The to: The Migration Games in Deduplicated Systems
Roei Kisous, Ariel Kolikant, Abhinav Duggal, Sarai Sheinvald, Gala Yadgar
Abstract
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 article, we address the problem of data migration, in which 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 have been considered. In this article, 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 trade-off 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 integer linear programming (ILP) 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 04455cc0-ec42-473e-ac81-70fb4b51596dCited by top-tier papers2
- InftyDedup: Scalable and Cost-Effective Cloud Tiering with DeduplicationIwona Kotlarska, Andrzej Jackowski, Krzysztof Lichota, Michal Welnicki et al.FAST 2023 · 23 citations
- Physical vs. Logical Indexing with IDEA: Inverted Deduplication-Aware IndexAsaf Levi, Philip Shilane, Sarai Sheinvald, Gala YadgarFAST 2024 · 7 citations
Related papers
- GoSeed: Generating an Optimal Seeding Plan for Deduplicated StorageAviv Nachman, Gala Yadgar, Sarai SheinvaldFAST 2020 · 19 citations
- Jingwei: An Efficient and Adaptable Data Migration Strategy for Deduplicated Storage SystemsGeyao Cheng, Deke Guo, Lailong Luo, Junxu Xia et al.INFOCOM 2022 · 5 citations
- PIMDup: An Optimized Deduplication Design on a Real Processing-in-Memory SystemChun-Le Yeh, Liang-Chi Chen, Chien-Chung Ho, Yu-Ming Chang et al.DAC 2025 · 3 citations
- TiDedup: A New Distributed Deduplication Architecture for CephMyoungwon Oh, Sungmin Lee, Samuel Just, Youngjin Yu et al.USENIX ATC 2023 · 23 citations
- Klotski: Efficient and Safe Network Migration of Large Production DatacentersYihao Zhao, Xiaoxiang Zhang, Hang Zhu, Ying Zhang et al.SIGCOMM 2023 · 5 citations
