Minimal cost reconfiguration of data placement in a storage area network

DOI10.1016/J.TCS.2012.06.018MaRDI QIDQ690477zbMATHOpenAlexFDO

Authors Hadas Shachnai, Gal Tamir, Tami Tamir

Publication date 27 November 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2012.06.018

zbMATH Keywords

approximation algorithmsvideo-on-demandreconfigurationdata placement

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Approximation algorithms (68W25) Internet topics (68M11)

Recommendations

• Minimal cost reconfiguration of data placement in storage area network
• Storage Placement in Path Networks
• Cost-oblivious storage reallocation
• A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
• Reconfigurable distributed storage for dynamic networks
• Database placement in communication networks for minimizing the overall transmission cost
• Optimal Storage Placement for Tree-Structured Networks with Heterogeneous Channel Costs

Cites work

• scientific article; zbMATH DE number 437570 (Why is no real title available?)
• scientific article; zbMATH DE number 2079326 (Why is no real title available?)
• scientific article; zbMATH DE number 1445307 (Why is no real title available?)
• Approximation algorithms for knapsack problems with cardinality constraints
• Approximation schemes for generalized \(2\)-dimensional vector packing with application to data placement
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Improved results for data migration and open shop scheduling
• Matching theory
• On two class-constrained versions of the multiple knapsack problem
• Polynomial time approximation schemes for class-constrained packing problems
• Threshold-based dynamic replication in large-scale video-on-demand systems

Cited in

(3)

• Incremental list coloring of graphs, parameterized by conservation
• Analysis and experimental study of heuristics for job scheduling reoptimization problems
• Minimal cost reconfiguration of data placement in storage area network

Describes a project that uses

Uses Software

• Knapsack

This page was built for publication: Minimal cost reconfiguration of data placement in a storage area network

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q690477)