Minimal cost reconfiguration of data placement in a storage area network
type: Item
instance of: scholarly article
title: Minimal cost reconfiguration of data placement in a storage area network
zbMATH Open document ID: 1253.68115
author: Hadas Shachnai
author: Gal Tamir
author: Tami Tamir
published in: Theoretical Computer Science
publication date: 2012-11-27T00:00:00Z
Mathematics Subject Classification ID: 68P20
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 68M11
zbMATH DE Number: 6110699
zbMATH Keywords: data placement
zbMATH Keywords: reconfiguration
zbMATH Keywords: video-on-demand
zbMATH Keywords: approximation algorithms
describes a project that uses: Knapsack
MaRDI profile type: Publication
full work available at URL: j.tcs.2012.06.018
OpenAlex ID: W2165459538
cites work: Approximation algorithms for knapsack problems with cardinality constraints
cites work: Improved results for data migration and open shop scheduling
cites work: Q4952620
cites work: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
cites work: Q4471279
cites work: Threshold-based dynamic replication in large-scale video-on-demand systems
cites work: Matching theory
cites work: On two class-constrained versions of the multiple knapsack problem
cites work: Polynomial time approximation schemes for class-constrained packing problems
cites work: Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
cites work: Q3140449
DOI: 10.1016/J.TCS.2012.06.018
Recommended article: Minimal Cost Reconfiguration of Data Placement in Storage Area Network
Recommended article: Storage Placement in Path Networks
Recommended article: Cost-Oblivious Storage Reallocation
Recommended article: A Min Cost Flow Solution for Dynamic Assignment Problems in Networks with Storage Devices
Recommended article: Reconfigurable distributed storage for dynamic networks
Recommended article: Database placement in communication networks for minimizing the overall transmission cost
Recommended article: Optimal Storage Placement for Tree-Structured Networks with Heterogeneous Channel Costs
description: scientific article; zbMATH DE number 6110699