Optimal data placement on networks with a constant number of clients

DOI10.1016/J.TCS.2013.03.025MaRDI QIDQ2453166zbMATH OpenOpenAlexFDO

Authors Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, V. Zissimopoulos

Publication date 6 June 2014

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

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

zbMATH Keywords

dynamic programmingcapacity constraintsdata placementpage-placement

Mathematics Subject Classification ID

Dynamic programming (90C39) Network design and communication in computer systems (68M10)

Recommendations

• Approximation algorithms for data placement in arbitrary networks
• Placement algorithms for hierarchical cooperative caching
• Approximation Algorithms for Data Placement Problems
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Algorithms for non-uniform size data placement on parallel disks

Cites work

• scientific article; zbMATH DE number 3427118 (Why is no real title available?)
• scientific article; zbMATH DE number 148331 (Why is no real title available?)
• scientific article; zbMATH DE number 2079405 (Why is no real title available?)
• scientific article; zbMATH DE number 2119650 (Why is no real title available?)
• Approximation Algorithms for Data Placement Problems
• Approximation algorithms for data placement in arbitrary networks
• Database Programming Languages
• Placement algorithms for hierarchical cooperative caching
• Primal-dual algorithms for connected facility location problems
• The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
• Web caching using access statistics

Cited in

(7)

• scientific article; zbMATH DE number 2114004 (Why is no real title available?)
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• Placement of data replicas for optimal data availability in ring networks
• Approximation algorithms for data placement in arbitrary networks
• Cache me if you can: capacitated selfish replication games in networks
• Online social network data placement over clouds
• Algorithms for non-uniform size data placement on parallel disks

This page was built for publication: Optimal data placement on networks with a constant number of clients

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