Choosing Replica Placement Heuristics for Wide-Area Systems (2004)
Cached
Download Links
- [www.hpl.hp.com]
- [www.hpl.hp.com]
- [www.hpl.hp.com]
- [www.hpl.hp.com]
- [www.hpl.hp.com]
- [www.hpl.hp.com]
- DBLP
Other Repositories/Bibliography
| Venue: | In ICDCS ’04: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS’04 |
| Citations: | 36 - 0 self |
BibTeX
@INPROCEEDINGS{Karlsson04choosingreplica,
author = {Magnus Karlsson and Christos Karamanolis},
title = {Choosing Replica Placement Heuristics for Wide-Area Systems},
booktitle = {In ICDCS ’04: Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS’04},
year = {2004},
pages = {350--359},
publisher = {IEEE Computer Society}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Data replication is used extensively in wide-area distributed systems to achieve low data-access latency. A large number of heuristics have been proposed to perform replica placement. Practical experience indicates that the choice of heuristic makes a big difference in terms of the cost of required infrastructure (e.g., storage capacity and network bandwidth), depending on system topology, workload and performance goals.
