Choosing replica placement heuristics for wide-area systems

Proceedings - International Conference on Distributed Computing Systems

Volumn 24, Issue , 2004, Pages 350-359

  Karlsson, Magnus ^a   Karamanolis, Christos ^a  

^a HEWLETT PACKARD LABORATORIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BANDWIDTH; CONSTRAINT THEORY; HEURISTIC METHODS; INTEGER PROGRAMMING; TOPOLOGY;

DATA-ACCESS LATENCY; SYSTEM TOPOLOGY; WIDE-AREA SYSTEMS;

DATA ACQUISITION;

EID: 2442531965     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/icdcs.2004.1281600     Document Type: Conference Paper

References (20)

1. M. Arlitt and T. Jin. Workload characterization of the 1998 world cup web site. Technical Report HPL-1999-35R1, HP Laboratories, 1999.
2. ILOG CPLEX. www.ilog.com.
3. L. Dowdy and D. Foster. Comparative Models of the File Assignment Problem. ACM Computer Surveys, 14(2):287-313, 1982.
4. J. Kangasharju, J. Roberts, and K. Ross. Object Replication Strategies in Content Distribution Networks. Computer Communications, 25(4):367-383, March 2002.
5. M. Karlsson and C. Karamanolis. Bounds on the Replication Cost for QoS. Technical report, Hewlett Packard Labs, July 2003.
6. M. Karlsson and M. Mahalingam. Do We Need Replica Placement Algorithms in Content Delivery Networks? In Proceedings of the International Workshop on Web Content Caching and Distribution (WCW), pages 117-128, August 2002.
7. M. Korupolu, G. Plaxton, and R. Rajaraman. Placement Algorithms for Hierarchical Cooperative Caching. Journal of Algorithms, 38(1):260-302, January 2001.
8. J. Kubiatowicz et al. OceanStore: An Architecture for Global-Scale Persistent Storage. In Proceedings of the International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pages 190-201, November 2000.
9. S. Owen and M. Daskin. Strategic facility location: A review. European Journal of Operational Research, 111:423-447, 1998.
10. S. Owen and M. Daskin. Two new location covering problem: The partial covering P-center problem and the partial set covering problem. Geographical Analysis, 31:217-235, 1999.
11. L. Qiu, V. Padmanabhan, and G. Voelker. On the Placement of Web Server Replicas. In Proceedings of IEEE INFOCOM, pages 1587-1596, April 2001.
12. M. Rabinovich and A. Aggarwal. RaDaR: A Scalable Architecture for a Global Web Hosting Service. In Proceedings of the 8th International World Wide Web Conference, pages 1545-1561, May 1999.
13. Y. Saito, C. Karamanolis, M. Karlsson, and M. Mahalingam. Taming aggressive replication in the pangaea wide-area file system. In 5th Symposium on Operating Systems Design and Implementation (OSDI), pages 15-30, Boston, MA, USA, December 2002.
14. A. Smith. Cache Memories. Computing Surveys, 14(3):473-530, September 1982.
15. Telestra.net. http://www.telestra.net.
16. C. Toregas, C. ReVelle, and L. Bergman. The location of emergency service facilities. Operations Research, 19:1363-1373, 1971.
17. V. Vazirani. Approximation Algorithms. ISBN: 3-540-65367-8. Springer-Verlag, 2001.
18. A. Venkataramanj, P. Weidmann, and M. Dahlin. Bandwidth Constrained Placement in a WAN. In ACM Symposium on Principles of Distributed Computing (PODC), August 2001.
19. G. Voelker, E. Anderson, T. Kimbrei, M. Feeley, J. Chase, A. Karlin, and H. Levy. Implementing cooperative prefetching and caching in a globally-managed memory system. In Proceedings of the Joint International Conference on Measurement and Modeling of Computer Systems, pages 33-43, 1998.
20. H. Yu and A. Vahdat. Minimal Replication Cost for Availability. In 21st ACM Symposium on Principles of Distributed Computing (PODC), pages 98-107, June 2002.