Optimal data placement on networks with a constant number of clients

Abstract : We introduce optimal algorithms for the problems of data placement (DP) and page placement (PP) in networks with a constant number of clients each of which has limited storage availability and issues requests for data objects. The objective for both problems is to efficiently utilize each client's storage (deciding where to place replicas of objects) so that the total incurred access and installation cost over all clients are minimized. In the PP problem an extra constraint on the maximum number of clients served by a single client must be satisfied. Our algorithms solve both problems optimally when all objects have uniform lengths. When object lengths are non-uniform we also find the optimal solution, albeit a small, asymptotically tight violation of each client's storage size by ε lm a x where lm a x is the maximum length of the objects and ε some arbitrarily small positive constant. We make no assumption on the underlying topology of the network (metric, ultrametric, etc.), thus obtaining the first non-trivial results for non-metric data placement problems.
Document type :
Journal articles
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-00819087
Contributor : Frédéric Davesne <>
Submitted on : Tuesday, April 30, 2013 - 9:50:23 AM
Last modification on : Tuesday, January 14, 2020 - 1:36:09 PM

Links full text

Identifiers

Citation

Eric Angel, Evripidis Bampis, Gerasimos G. Pollatos, Vassilis Zissimopoulos. Optimal data placement on networks with a constant number of clients. Theoretical Computer Science, Elsevier, 2014, 540-541, pp.82--88. ⟨10.1016/j.tcs.2013.03.025⟩. ⟨hal-00819087⟩

Share

Metrics

Record views

232