Near-optimal dynamic replication in unstructured peer-to-peer networks

Proceedings of the ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems

Volumn , Issue , 2008, Pages 281-290

  Sozio, Mauro ^a   Neumann, Thomas ^a   Weikum, Gerhard ^a  

^a MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

Author keywords

Algorithms; Theory

Indexed keywords

COMPUTER NETWORKS; CONVERGENCE OF NUMERICAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; PROBABILITY; RANDOM PROCESSES; TELECOMMUNICATION NETWORKS;

ACCESS PATTERNS; BOUNDED SEARCHES; CONVERGENCE RATES; DATA ITEMS; DISTRIBUTED SYSTEMS; DYNAMIC REPLICATIONS; HIGH PROBABILITIES; NON UNIFORMS; OPTIMAL DYNAMICS; OPTIMAL PLACEMENTS; OPTIMAL SOLUTIONS; PEER-TO-PEER NETWORKS; PRIOR WORKS; QUERY ROUTING; STEADY STATES; THEORY;

DATABASE SYSTEMS;

EID: 57349120039     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1376916.1376956     Document Type: Conference Paper

References (25)

1. I. D, Baev and R. Rajaraman. Approximation algorithms for data placement in arbitrary networks. In SODA, pages 661-670, 2001.
2. R. Bhagwan, K. Tati, Y.-C. Cheng, S. Savage, and G. M. Voelker. Total recall: System support for automated availability management. In NSDI, pages 337-350, 2004.
3. C. Chekuri and S. Khanna. A polynomial time approximation scheme for the multiple knapsack problem. SIAM J. Cormput., 35(3):713-728, 2005.
4. C. Chekuri and A. Kumar. Maximum coverage problem with group budget constraints and applications. In APPROX-RANDOM, pages 72-83, 2004.
5. B.-G. Chun, F. Dabek, A. Haeberlen, E. Sit, H. Weatherspoon, F. Kaashoek, J. Kubiatowicz, and R. Morris. Efficient replica maintenance for distributed storage systems. In Proceedings of the 3rd USENIX Symposium on Networked Systems Design and Implementation (NSDI '06), San Jose, CA, May 2006.
6. E. Cohen and S. Shenker. Replication strategies in unstructured peer-to-peer networks. In SIGCOMM, pages 177-190, 2002.
7. F. Dabek, J. Li, E, Sit, J. Robertson, M. F, Kaashoek, and R, Morris. Designing a dht for low latency and high throughput. In NSDI, pages 85-98, 2004.
8. P. T. Eugster, R. Guerraoui, A.-M. Kermarrec, and L. Massoulié. Epidemic information dissemination in distributed systems. IEEE Computer, 37(5):60-67, 2004.
9. M. L. Fredman, R. Sedgewick, D. D. Sleator, and R. E. Tarjan. The pairing heap: A new form of self-adjusting heap. Algorithmica, 1(1):111-129, 1986.
10. C. Gkantsidis, M. Mihail, and A. Saberi. Random walks in peer-to-peer networks: Algorithms and evaluation. Perform. Eval., 63(3):241-263, 2006.
11. S. Guha and K. Munagala. Improved algorithms for the data placement problem. In SODA, pages 106-107, 2002.
12. S. Khuller, A. Moss, and J. Naor. The budgeted maximum coverage problem. Inf. Process. Lett., 70(l):39-45, 1999.
13. E. L. Lawler. Fast approximation algorithms for knapsack problems. Math. Oper. Res., 4(4):339-356, 1979.
14. B. Leong, B. Liskov, and E. D. Demaine. Epichord: Parallelizing the chord lookup algorithm with reactive routing state management. Computer Communications, 29(9):1243-1259, 2006.
15. E. Leontiadis, V. V. Dimakopoulos, and E. Pitoura. Creating and maintaining replicas in unstructured peer-to-peer systems. In Euro-Par, pages 1015-1025, 2006.
16. Q. Lv, P. Cao, E. Cohen, K. Li, and S. Shenker. Search and replication in unstructured peer-to-peer networks. In ICS, pages 84-95, 2002.
17. R. Morselli, B. Bhattacharjee, A. Srinivasan, and M. A. Marsh. Efficient lookup on unstructured topologies. In PODC, pages 77-86, 2005.
18. R. Nelson. Probability, Stocastic Processes, and Queuing Theory - The. Mathematics of Computer Performance Modeling. Springer, 1995.
19. L. T. Nguyen, W. G. Yee, D. Jia, and O. Frieder. A tool for information retrieval research in peer-to-peer file sharing systems, http://ir.iit.edu/ w̃aigen/proj/pirs/irwire. In ICDE, pages 1525-1526, 2007.
20. V. Ramasubramanian and E. G. Sirer. Beehive: O(l) lookup performance for power-law query distributions in peer-to-peer overlays. In NSDI, pages 99-112, 2004.
21. Y. Saito and M. Shapiro. Optimistic replication. ACM Comput. Surv., 37(1):42-81, 2005.
22. D. B. Shmoys, C. Swamy, and R. Levi. Facility location with service installation costs. In SODA, pages 1088-1097, 2004.
23. D. B. Shmoys and E. Tardos. An approximation algorithm for the generalized assignment problem. Math. Program., 62:461-474, 1993.
24. R. Steinmetz and K. Wehrle, editors. Peer-to-Peer Systems and Applications, volume 3485 of Lecture Notes in Computer Science. Springer, 2005.
25. J. Winick and S. Jamin. Inet-3.0: Internet topology generator, http://topology.eecs.umich.edu/inet/. Technical Report UM-CSE-TR-456-02, EECS, University of Michigan, 2002.