Minimal cost reconfiguration of data placement in a storage area network
From MaRDI portal
Publication:690477
DOI10.1016/J.TCS.2012.06.018zbMATH Open1253.68115OpenAlexW2165459538MaRDI QIDQ690477FDOQ690477
Gal Tamir, Hadas Shachnai, 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
Information storage and retrieval of data (68P20) Approximation algorithms (68W25) Internet topics (68M11)
Cites Work
- Matching theory
- Approximation algorithms for knapsack problems with cardinality constraints
- Title not available (Why is that?)
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
- Polynomial time approximation schemes for class-constrained packing problems
- Threshold-based dynamic replication in large-scale video-on-demand systems
- Title not available (Why is that?)
- On two class-constrained versions of the multiple knapsack problem
- Improved results for data migration and open shop scheduling
- Title not available (Why is that?)
- FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
Cited In (2)
Uses Software
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 👍 👎
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)
