## Approximation Algorithms for Data Placement in Arbitrary Networks (2001)

### Cached

### Download Links

- [www.math.uwaterloo.ca]
- [www.math.uwaterloo.ca]
- [www.ccs.neu.edu]
- DBLP

### Other Repositories/Bibliography

Venue: | in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms |

Citations: | 58 - 2 self |

### BibTeX

@INPROCEEDINGS{Baev01approximationalgorithms,

author = {Ivan Baev and Rajmohan Rajaraman and Chaitanya Swamy},

title = {Approximation Algorithms for Data Placement in Arbitrary Networks},

booktitle = {in Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms},

year = {2001},

pages = {661--670}

}

### Years of Citing Articles

### OpenURL

### Abstract

Abstract We develop approximation algorithms for the problem of placing replicated data in arbitrary net-works, where the nodes may both issue requests for data objects and have capacity for storing data objects, so as to minimize the average data-access cost. We introduce the data placement problem tomodel this problem. We have a set of caches F, a set of clients D, and a set of data objects O. Each cache i can store at most ui data objects. Each client j 2 D has demand dj for a specific data object o(j) 2 O and has to be assigned to a cache that stores that object. Storing an object o in cache i incurs astorage cost of f oi, and assigning client j to cache i incurs an access cost of djcij. The goal is to find aplacement of the data objects to caches respecting the capacity constraints, and an assignment of clients